Efficient Certified Resolution Proof Checking [chapter]

Luís Cruz-Filipe, Joao Marques-Silva, Peter Schneider-Kamp
2017 Lecture Notes in Computer Science  
We present a novel propositional proof tracing format that eliminates complex processing, thus enabling efficient (formal) proof checking. The benefits of this format are demonstrated by implementing a proof checker in C, which outperforms a state-of-the-art checker by two orders of magnitude. We then formalize the theory underlying propositional proof checking in Coq, and extract a correct-by-construction proof checker for our format from the formalization. An empirical evaluation using 280
more » ... atisfiable instances from the 2015 and 2016 SAT competitions shows that this certified checker usually performs comparably to a state-of-the-art non-certified proof checker. Using this format, we formally verify the recent 200 TB proof of the Boolean Pythagorean Triples conjecture.
doi:10.1007/978-3-662-54577-5_7 fatcat:ip2hfwhsobcmtcj5fsza3bhwfm