Reconstruction of SMT proofs with Lambdapi
摘要
The Alethe format has been adopted by several SMT solvers for explaining why a set of constraints is unsatisfiable. We describe how to interpret Alethe proof traces and generate corresponding proofs that are accepted by the Lambdapi proof checker, a foundational proof assistant based on dependent type theory and rewriting that is intended to serve as a pivot for exchanging proofs between interactive proof assistants. We give an overview of the encoding of SMT logic and of Alethe proof traces in Lambdapi and present results of the evaluation of the checker on benchmark examples.