a89308146a
SAT solver based on Davis–Putnam–Logemann–Loveland (DPLL) based propositional satisfiability in Ada. Supported features include: * Conflict analysis and backjumping * Two-watched literals scheme * Built-in support for At-Most-One constraints * Custom theories PR: 296552