CADICAL at the SAT Race 2019

Our SAT solver CADICAL provides a clean, documented, easy to understand and modify state-of-the-art solver, based on CDCL [1] with inprocessing [2]. Earlier versions participated in the SAT competition 2017 and 2018. Here we only describe differences to these versions [3], [4]. Even though CADICAL performed well on unsatisfiable instances in the SAT Competition 2018, the performance on satisfiable instances was behind the top solvers in that competition. Thus a large part of the changes made and described in this note are motivated by trying to improve CADICAL on satisfiable instances without loosing its good performance on unsatisfiable instances.

[1]  Uwe Schöning,et al.  Choosing Probability Distributions for Stochastic Local Search and the Role of Make versus Break , 2012, SAT.

[2]  Chanseok Oh Between SAT and UNSAT: The Fundamental Difference in CDCL SAT , 2015, SAT.

[3]  Armin Biere,et al.  Collection of Combinational Arithmetic Miters Submitted to the SAT Competition 2016 , 2016 .

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

[5]  Armin Biere,et al.  Incremental Inprocessing in SAT Solving , 2019, SAT.

[6]  Armin Biere Yet another Local Search Solver and Lingeling and Friends Entering the SAT Competition 2014 , 2014 .

[7]  Adnan Darwiche,et al.  A Lightweight Component Caching Scheme for Satisfiability Solvers , 2007, SAT.

[8]  Armin Biere,et al.  Evaluating CDCL Variable Scoring Schemes , 2015, SAT.

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

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

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

[12]  Marijn Heule,et al.  Reusing the Assignment Trail in CDCL Solvers , 2011, J. Satisf. Boolean Model. Comput..

[13]  Armin Biere,et al.  Backing Backtracking , 2019, SAT.

[14]  Alexander Nadel,et al.  Chronological Backtracking , 2018, International Conference on Theory and Applications of Satisfiability Testing.

[15]  Armin Biere,et al.  Model-Based Testing for Verification Back-Ends , 2013, TAP@STAF.