Reconstructing veriT Proofs in Isabelle/HOL

Mathias Fleury
(Max Planck Institut for Informatics)
Hans-Jörg Schurr
(University of Lorraine, CNRS, Inria, and LORIA)

Automated theorem provers are now commonly used within interactive theorem provers to discharge an increasingly large number of proof obligations. To maintain the trustworthiness of a proof, the automatically found proof must be verified inside the proof assistant. We present here a reconstruction procedure in the proof assistant Isabelle/HOL for proofs generated by the satisfiability modulo theories solver veriT which is part of the smt tactic. We describe in detail the architecture of our improved reconstruction method and the challenges we faced in designing it. Our experiments show that the veriT-powered smt tactic is regularly suggested by Sledgehammer as the fastest method to automatically solve proof goals.

In Giselle Reis and Haniel Barbosa: Proceedings Sixth Workshop on Proof eXchange for Theorem Proving (PxTP 2019), Natal, Brazil, August 26, 2019, Electronic Proceedings in Theoretical Computer Science 301, pp. 36–50.
Published: 23rd August 2019.

ArXived at: bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to:
For website issues: