This manual page documents briefly the
command. MiniSat is a minimalistic, open-source SAT solver, developed to help
researchers and developers alike to get started on SAT. Winning all the
industrial categories of the SAT 2005 competition, MiniSat is a good starting
point both for future research in SAT, and for applications using SAT.
Despite the NP completeness of the satisfiabilty problem of Boolean formulas
(SAT), SAT solvers are often able to decide this problem in a reasonable time
frame. As all other NP complete problems are reducible to SAT, the solvers
have become a general purpose tool for this class of problems.
Show summary of options.
Disable or enable preprocessing.
Enable checking for redundant clauses.
-grow <num> [ >0 ]
Number of additional clauses that may be introduced when eliminating a variable.
Defaults to 0.
Set default polarity for decisions made (true, false, or random).
-decay <num> [ 0 - 1 ]
Inverse of the variable activity decay factor (defaults to 0.95).
-rnd-freq <num> [ 0 - 1 ]
The frequency with which the decision heuristic tries to choose a random
variable (defaults to 0.02).
File containing a list of literals to be frozen at the given polarity.
Print (possibly preprocessed) input problem in DIMACS format.
Set the verbosity of informational output.
if parsing the command line options fails, usage information is requested, or
output of the input problem in dimacs format succeeds.
if interrupted by SIGINT or if an input file cannot be read,
if parsing the input fails,
if found satisfiable, and
if found unsatisfiable.
minisat2 was written by Niklas Een, Niklas Sorensson
This manual page was written by Michael Tautschnig <firstname.lastname@example.org>,
for the Debian project (but may be used by others).