Case Study: Verified Vampire Proofs in the LambdaPi-calculus Modulo
Anja Petković Komel, Michael Rawson, Martin Suda · arXiv (Cornell University) · 2025
The Vampire automated theorem prover is extended to output machine-checkable proofs in the Dedukti concrete syntax for the LambdaPi-calculus modulo. This significantly reduces the trusted computing base, and in principle eases proof reconstruction in other proof-checking systems. Existing theory is adapted to deal with Vampire's internal logic and inference system. Implementation experience is reported, encouraging adoption of verified proofs in other automated systems.