Checking Unsatisfiability Proofs in Parallel

16 pages•Published: March 15, 2019

Abstract

Contemporary SAT solvers emit unsatisfiability proofs in the DRAT format to increase confidence in their answers. The state-of-the-art proof verifier drat-trim uses backward- checking and deletion information to efficiently check unsatisfiability results. Checking large proofs still takes as long as solving a formula, and therefore parallelization seems to be a promising approach. However, Heule et al. stated that parallelization of the backward- checking procedure is difficult since clausal proofs do not include dependency information. In this paper, we present a parallelization approach and a prototypical implementation that scales reasonably compared to its sequential version.

In: Daniel Le Berre and Matti Järvisalo (editors). Proceedings of Pragmatics of SAT 2015 and 2018, vol 59, pages 34-49.

Links:	https://easychair.org/publications/paper/FftK
	https://doi.org/10.29007/8w4v

BibTeX entry

@inproceedings{POS-18:Checking_Unsatisfiability_Proofs_Parallel,
  author    = {Norbert Manthey and Tobias Philipp},
  title     = {Checking Unsatisfiability Proofs in Parallel},
  booktitle = {Proceedings of Pragmatics of SAT 2015 and 2018},
  editor    = {Daniel Le Berre and Matti Järvisalo},
  series    = {EPiC Series in Computing},
  volume    = {59},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/FftK},
  doi       = {10.29007/8w4v},
  pages     = {34-49},
  year      = {2019}}

Download PDF Open PDF in browser