Bridging the gap between easy generation and efficient verification of unsatisfiability proofs

Several proof formats have been used to verify refutations produced by satisfiability (SAT) solvers. Existing formats are either costly to check or hard to implement. This paper presents a practical approach that facilitates checking of unsatisfiability results in a time similar to proof discovery by embedding clause deletion information into clausal proofs. By exploiting this information, the proof‐checking time is reduced by an order of magnitude on medium‐to‐hard benchmarks as compared to checking proofs using similar clausal formats. Proofs in a new format can be produced by making only minor changes to existing conflict‐driven clause‐learning solvers and their preprocessors, and the runtime overhead is negligible. This approach can easily be integrated into Glucose 2.1, the SAT 2012 challenge winner, and SatELite, a popular SAT‐problem preprocessor. Copyright © 2014 John Wiley & Sons, Ltd.

[1]  Allen Van Gelder,et al.  Verifying RUP Proofs of Propositional Unsatisfiability , 2008, ISAIM.

[2]  Stéphane Lescuyer,et al.  A Reflexive Formalization of a SAT Solver in Coq , 2008 .

[3]  Albert Oliveras,et al.  Efficient Generation of Unsatisfiability Proofs and Cores in SAT , 2008, LPAR.

[4]  Panagiotis Manolios,et al.  Computer-Aided Reasoning: An Approach , 2011 .

[5]  Inês Lynce,et al.  Conflict-Driven Clause Learning SAT Solvers , 2009, Handbook of Satisfiability.

[6]  Hasan Amjad,et al.  Efficiently checking propositional refutations in HOL theorem provers , 2009, J. Appl. Log..

[7]  P. Kam,et al.  : 4 , 1898, You Can Cross the Massacre on Foot.

[8]  Eugene Goldberg,et al.  Verification of proofs of unsatisfiability for CNF formulas , 2003, 2003 Design, Automation and Test in Europe Conference and Exhibition.

[9]  Armin Biere,et al.  Effective Preprocessing in SAT Through Variable and Clause Elimination , 2005, SAT.

[10]  Sharad Malik,et al.  Chaff: engineering an efficient SAT solver , 2001, Proceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232).

[11]  Allen Van Gelder.  Producing and verifying extremely large propositional refutations Have your cake and eat it too , 2012 .

[12]  Lawrence Charles Paulson,et al.  Isabelle/HOL: A Proof Assistant for Higher-Order Logic , 2002 .

[13]  Henry A. Kautz,et al.  Towards Understanding and Harnessing the Potential of Clause Learning , 2004, J. Artif. Intell. Res..

[14]  F. Mari.  Formal verification of a modern SAT solver by shallow embedding into Isabelle/HOL , 2010 .

[15]  Sharad Malik,et al.  Validating SAT solvers using an independent resolution-based checker: practical implementations and other applications , 2003, 2003 Design, Automation and Test in Europe Conference and Exhibition.

[16]  Bernd Fischer,et al.  Industrial-Strength Certified SAT Solving through Verified SAT Proof Checking , 2010, ICTAC.

[17]  Filip Maric,et al.  Formalization and Implementation of Modern SAT Solvers , 2009, Journal of Automated Reasoning.

[18]  Marijn J. H. Heule,et al.  Trimming while checking clausal proofs , 2013, 2013 Formal Methods in Computer-Aided Design.

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

[20]  Armin Biere,et al.  Blocked Clause Elimination , 2010, TACAS.

[21]  Pierre Castéran,et al.  Interactive Theorem Proving and Program Development , 2004, Texts in Theoretical Computer Science An EATCS Series.

[22]  Jan Maluszy¿ski.  Verification, Model Checking, and Abstract Interpretation , 2009, Lecture Notes in Computer Science.

[23]  Marijn Heule,et al.  Mechanical Verification of SAT Refutations with Extended Resolution , 2013, ITP.

[24]  Laurent Théry,et al.  Verifying SAT and SMT in Coq for a fully automated decision procedure , 2011 .

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

[26]  Allen Van Gelder.  Improved Conflict-Clause Minimization Leads to Improved Propositional Proof Traces , 2009, SAT.

[27]  Armin Biere,et al.  Minimizing Learned Clauses , 2009, SAT.

[28]  Armin Biere,et al.  PicoSAT Essentials , 2008, J. Satisf. Boolean Model. Comput..

[29]  Yves Bertot,et al.  Interactive Theorem Proving and Program Development: Coq'Art The Calculus of Inductive Constructions , 2010 .

[30]  Allen Van Gelder,et al.  Producing and verifying extremely large propositional refutations , 2012, Annals of Mathematics and Artificial Intelligence.

[31]  Allen Van Gelder.  Generalized Conflict-Clause Strengthening for Satisfiability Solvers , 2011, SAT.

[32]  Nikolaj Bjørner,et al.  Proofs and Refutations, and Z3 , 2008, LPAR Workshops.

[33]  Tjark Weber.  Efficiently Checking Propositional Resolution Proofs in Isabelle / HOL , 2006 .

[34]  Natarajan Shankar,et al.  The Mechanical Verification of a DPLL-Based Satisfiability Solver , 2011, LSFA.

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

[36]  Filip Maric,et al.  Formal verification of a modern SAT solver by shallow embedding into Isabelle/HOL , 2010, Theor. Comput. Sci..