Minimalistic and high-performance SAT solver for boolean satisfiability
Minimalistic and high-performance SAT solver
minisat
$ minisat input.cnf output.sat
$ minisat problem.cnf
$ minisat -verb=1 formula.cnf result.sat