Theorem Proving as Constraint Solving for Coherent Logic with Function Symbols

Abstract

We present an automated prover for coherent logic with function symbols which uses the power of SMT solvers through the recently proposed paradigm “theorem proving as constraint solving”. The open-source implementation of the prover supports export of proofs in natural language and to the proof assistants Coq, Isabelle, and Mizar, and has other additional features such as the support for completing premises, goals, partially given proofs, and the support for creating illustrated proofs.