sgen1: A generator of small but difficult satisfiability benchmarks

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.

[1]  Sean Safarpour,et al.  Efficient SAT-based Boolean matching for FPGA technology mapping , 2006, 2006 43rd ACM/IEEE Design Automation Conference.

[2]  Stephen B. Wicker,et al.  Analysis of Random Noise and Random Walk Algorithms , 2000, CP.

[3]  Chu Min Li,et al.  Diversification and Determinism in Local Search for Satisfiability , 2005, SAT.

[4]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[5]  Donald W. Loveland,et al.  A machine program for theorem-proving , 2011, CACM.

[6]  Bart Selman,et al.  From Spin Glasses to Hard Satisfiable Formulas , 2004, SAT.

[7]  James M. Crawford,et al.  The Minimal Disagreement Parity Problem as a Hard Satisfiability Problem , 1995 .

[8]  Igor L. Markov,et al.  Solving difficult instances of Boolean satisfiability in the presence of symmetry , 2003, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[9]  Lance Fortnow,et al.  The status of the P versus NP problem , 2009, CACM.

[10]  Peter L. Balise,et al.  Boolean Algebra and Its Applications , 1995 .

[11]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[12]  Sharad Malik,et al.  The Quest for Efficient Boolean Satisfiability Solvers , 2002, CAV.

[13]  Don S. Batory,et al.  Feature Models, Grammars, and Propositional Formulas , 2005, SPLC.

[14]  Niklas Sörensson,et al.  An Extensible SAT-solver , 2003, SAT.

[15]  Ilkka Niemelä,et al.  Planning as satisfiability: parallel plans and algorithms for plan search , 2006, Artif. Intell..

[16]  Ke Xu,et al.  Random constraint satisfaction: Easy generation of hard (satisfiable) instances , 2007, Artif. Intell..

[17]  Moayad Fahim Ali,et al.  Fault Diagnosis and Logic Debugging , 2005 .

[18]  Ivor T. A. Spence.  tts: A SAT-Solver for Small, Difficult Instances , 2008, J. Satisf. Boolean Model. Comput..

[19]  Abdul Sattar,et al.  Advances in Local Search for Satisfiability , 2007, Australian Conference on Artificial Intelligence.

[20]  Sharad Malik,et al.  The Quest for Efficient Boolean Satisfiability Solvers , 2002, CAV.

[21]  Moayad Fahim Ali,et al.  Fault diagnosis and logic debugging using Boolean satisfiability , 2005, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[22]  Petteri Kaski,et al.  Hard Satisfiable Clause Sets for Benchmarking Equivalence Reasoning Techniques , 2006, J. Satisf. Boolean Model. Comput..

[23]  Hilary Putnam,et al.  A Computing Procedure for Quantification Theory , 1960, JACM.