CaDiCaL Simplified Satisfiability Solver

The goal of the development of CaDiCaL is to obtain a CDCL solver, which is easy to understand and change. Originally we wanted to radically simplify the design and internal data structures, but that goal was only achieved partially, for instance compared to Lingeling. However, the solver seems to be competetive to other state-of-the-art solvers now.

The sources of our SAT solver CaDiCaL as submitted to the SAT Competition 2017:

[ ]

This version sc17 is in sync to the current master branch of CaDiCaL repository on GitHub: