Description
Boolean satisfiability problems can be solved with a parallel SAT solver derived from Minisat. It is useful for research, verification, constraint solving and experiments that encode decisions as logical formulas.
Use it with SAT input files and expect technical output. It is a specialized solver for people working with formal methods, optimization or automated reasoning.