Download PDFOpen PDF in browserValidating Unsatisfiability Results of Clause Sharing Parallel SAT Solvers14 pages•Published: July 28, 2014AbstractAs satisfiability (SAT) solver performance has improved, so has their complexity, which make it more likely that SAT solvers contain bugs. One important source of increased complexity is clause sharing in parallel SAT solvers. SAT solvers can emit a proof of unsatisfiability to gain confidence that the their results are correct. Such proofs must contain deletion information in order to check them efficiently. Computing deletion information is easy and cheap for parallel solvers without clause sharing, but tricky for parallel solvers with clause sharing.We present a method to generate unsatisfiability proofs from clause sharing parallel SAT solvers. We show that the overhead of our method is small and that the produced proofs can be validated in a time similar to the solving (CPU) time. However, proofs produced by parallel solvers without clause sharing can be checked in a similar to the solving (wall-clock) time. This raises the question whether our method can be improved such that the checking time of proofs from parallel solvers without clause sharing is comparable to the time to check proofs from parallel solver with clause sharing. Keyphrases: clause sharing, parallel satisfiability solver, unsatisfiability proof In: Daniel Le Berre (editor). POS-14. Fifth Pragmatics of SAT workshop, vol 27, pages 12-25.
|
