Description
Solves Boolean satisfiability problems, where the question is whether a set of logical conditions can all be true at the same time. Researchers and engineers use SAT solvers in verification, planning, optimization, and automated reasoning.
This is a command-line scientific tool. It is useful when another program produces SAT input files or when a user is directly studying logic and constraint solving.