The satisfiability problem is known to be NP-Complete; therefore, there should be relatively small problem instances that take a very long time to solve. However, most of the smaller benchmarks that were once thought challenging, especially the satisfiable ones, can be processed quickly by modern SAT-solvers. We describe and make available a generator that produces both unsatisfiable and, more significantly, satisfiable formulae that take longer to solve than any others known. At the two most recent international SAT Competitions, the smallest unsolved benchmarks were created by this generator. We analyze the results of all solvers in the most recent competition when applied to these benchmarks and also present our own more focused experiments.
ASJC Scopus subject areas
- Theoretical Computer Science
Spence, I. (2010). sgen1: A generator of small but difficult satisfiability benchmarks. ACM Journal of Experimental Algorithmics, 15(null), 1.2:1-1.2:15. [1.2]. https://doi.org/10.1145/1671970.1671972