System Description : iProver – An Instantiation-Based Theorem Prover for First-Order Logic

iProver is an instantiation-based theorem prover which is based on Inst-Gen calculus, complete for first-order logic. One of the distinctive features of iProver is a modular combination of instantiation and propositional reasoning. In particular, any state-of-the art SAT solver can be integrated into our framework. iProver incorporates state-of-the-art implementation techniques such as indexing, redundancy elimination, semantic selection and saturation algorithms. Redundancy elimination implemented in iProver include: dismatching constraints, blocking non-proper instantiations and propositional-based simplifications. In addition to instantiation, iProver implements ordered resolution calculus and a combination of instantiation and ordered resolution. In this paper we discuss the design of iProver and related implementation issues.

[1]  Andrei Voronkov,et al.  Splitting Without Backtracking , 2001, IJCAI.

[2]  Harald Ganzinger,et al.  Integrating Equational Reasoning into Instantiation-Based Theorem Proving , 2004, CSL.

[3]  Stephan Schulz,et al.  E - a brainiac theorem prover , 2002, AI Commun..

[4]  Niklas Sörensson,et al.  An Extensible SAT-solver , 2003, SAT.

[5]  Peter Baumgartner,et al.  Implementing the Model Evolution Calculus , 2006, Int. J. Artif. Intell. Tools.

[6]  Harald Ganzinger,et al.  Theory Instantiation , 2006, LPAR.

[7]  Andrei Voronkov,et al.  The design and implementation of VAMPIRE , 2002, AI Commun..

[8]  Harald Ganzinger,et al.  New directions in instantiation-based theorem proving , 2003, 18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings..