A SAT solver
PicoSAT solves the SAT problem, which is the classical NP complete
problem of searching for a satisfying assignment of a propositional
formula in conjunctive normal form (CNF). PicoSAT can generate proofs
and cores in memory by compressing the proof trace. It supports the
proof format of TraceCheck.
Version: 965
General Commands | |
| picomus | Minimal Unsatisfiable Core (MUS) generator |
| picosat | Satisfiability (SAT) solver with proof and core support |
| picosat.trace | alias for picosat |