Importing SMT and Connection proofs as expansion trees

Giselle Reis
(INRIA-Saclay)

Different automated theorem provers reason in various deductive systems and, thus, produce proof objects which are in general not compatible. To understand and analyze these objects, one needs to study the corresponding proof theory, and then study the language used to represent proofs, on a prover by prover basis. In this work we present an implementation that takes SMT and Connection proof objects from two different provers and imports them both as expansion trees. By representing the proofs in the same framework, all the algorithms and tools available for expansion trees (compression, visualization, sequent calculus proof construction, proof checking, etc.) can be employed uniformly. The expansion proofs can also be used as a validation tool for the proof objects produced.

In Cezary Kaliszyk and Andrei Paskevich: Proceedings Fourth Workshop on Proof eXchange for Theorem Proving (PxTP 2015), Berlin, Germany, August 2-3, 2015, Electronic Proceedings in Theoretical Computer Science 186, pp. 3–10.
Published: 30th July 2015.

ArXived at: http://dx.doi.org/10.4204/EPTCS.186.3 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org