DRAT-trim: Efficient Checking and Trimming Using Expressive Clausal Proofs

The DRAT-trim tool is a satisfiability proof checker based on the new DRAT proof format. Unlike its predecessor, DRUP-trim, all presently known SAT solving and preprocessing techniques can be validated using DRAT-trim. Checking time of a proof is comparable to the running time of the proof-producing solver. Memory usage is also similar to solving memory consumption, which overcomes a major hurdle of resolution-based proof checkers. The DRAT-trim tool can emit trimmed formulas, optimized proofs, and new TraceCheck + dependency graphs. We describe the output that is produced, what optimizations have been made to check RAT clauses, and potential applications of the tool.

[1]  Armin Biere,et al.  Automated Reencoding of Boolean Formulas , 2012, Haifa Verification Conference.

[2]  Frank Wolter,et al.  Monodic fragments of first-order temporal logics: 2000-2001 A.D , 2001, LPAR.

[3]  Armin Biere,et al.  Extended Resolution Proofs for Symbolic SAT Solving with Quantification , 2006, SAT.

[4]  G. S. Tseitin.  On the Complexity of Derivation in Propositional Calculus , 1983 .

[5]  Armin Biere,et al.  Theory and Applications of Satisfiability Testing - SAT 2006, 9th International Conference, Seattle, WA, USA, August 12-15, 2006, Proceedings , 2006, SAT.

[6]  Ronald L. Rivest,et al.  Partial-Match Retrieval Algorithms , 1976, SIAM J. Comput..

[7]  Leonardo Mendonça de Moura,et al.  Computation in Real Closed Infinitesimal and Transcendental Extensions of the Rationals , 2013, CADE.

[8]  Marijn J. H. Heule,et al.  Verifying Refutations with Extended Resolution , 2013, CADE.

[9]  Armin Biere,et al.  Inprocessing Rules , 2012, IJCAR.

[10]  Ofer Strichman,et al.  Theory and Applications of Satisfiability Testing – SAT 2010 , 2010, Lecture Notes in Computer Science.

[11]  Cesare Tinelli,et al.  Handbook of Satisfiability , 2021, Handbook of Satisfiability.

[12]  Armin Biere,et al.  Fuzzing and delta-debugging SMT solvers , 2009, SMT '09.

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

[14]  Gilles Audemard,et al.  A Restriction of Extended Resolution for Clause Learning SAT Solvers , 2010, AAAI.

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

[16]  Oliver Kullmann,et al.  On a Generalization of Extended Resolution , 1999, Discret. Appl. Math..

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

[18]  Armin Biere,et al.  Automated Testing and Debugging of SAT and QBF Solvers , 2010, SAT.

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

[20]  Armin Biere,et al.  Extended Resolution Proofs for Conjoining BDDs , 2006, CSR.

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

[22]  Armin Biere,et al.  Clause Elimination Procedures for CNF Formulas , 2010, LPAR.

[23]  Larry Wos,et al.  What Is Automated Reasoning? , 1987, J. Autom. Reason..

[24]  Sharad Malik,et al.  Conflict-Driven Clause Learning SAT Solvers , 2021, Handbook of Satisfiability.

[25]  Juhani Karhumäki,et al.  Computer Science - Theory and Applications , 2014, Lecture Notes in Computer Science.

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