Chapter

Interactive Theorem Proving

Volume 6172 of the series Lecture Notes in Computer Science pp 179-194

Fast LCF-Style Proof Reconstruction for Z3

  • Sascha BöhmeAffiliated withLancaster UniversityTechnische Universität München
  • , Tjark WeberAffiliated withLancaster UniversityUniversity of Cambridge

* Final gross prices may vary according to local VAT.

Get Access

Abstract

The Satisfiability Modulo Theories (SMT) solver Z3 can generate proofs of unsatisfiability. We present independent reconstruction of these proofs in the theorem provers Isabelle/HOL and HOL4 with particular focus on efficiency. Our highly optimized implementations outperform previous LCF-style proof checkers for SMT, often by orders of magnitude. Detailed performance data shows that LCF-style proof reconstruction can be faster than proof search in Z3.