1. Ocaml SimplexAn ocaml implementation of variants of the simplex and branch&bound algorithms for satisfiability.
2. archsatA proof-producing SMT/McSat solver, handling polymorphic first-order logic, and using an SMT/McSat core extended using Tableaux, Superposition and Rewriting.
4. mSATA modular sat/smt solver with proof output.