Evgenii Kotelnikov
Andrei Voronkov
ABSTRACT
This paper presents new features recently implemented in the theorem prover Vampire, namely support for first-order logic with a first class boolean sort (FOOL) and polymorphic arrays. In addition to having a first class boolean sort, FOOL also contains if-then-else and let-in expressions. We argue that presented extensions facilitate reasoning-based program analysis, both by increasing the expressivity of first-order reasoners and by gains in efficiency.
- C. Barrett, A. Stump, and C. Tinelli. The SMT-LIB Standard: Version 2.0. Technical report, Department of Computer Science, The University of Iowa, 2010. Available at www.SMT-LIB.org.Google Scholar
- C. Barrett, C. L. Conway, M. Deters, L. Hadarean, D. Jovanovic, T. King, A. Reynolds, and C. Tinelli. CVC4. In Proc. of CAV, volume 6806 of LNCS, pages 171–177, 2011. Google ScholarDigital Library
- P. Baumgartner. SMTtoTPTP — a converter for theorem proving formats. In Proc. of CADE, volume 9195 of LNCS, pages 285–294, 2015.Google Scholar
- C. Benzmüller, L. Paulson, F. Theiss, and A. Fietzke. LEO-II — A Cooperative Automatic Theorem Prover for Higher-Order Logic. In Proc. of IJCAR, volume 5195 of LNAI, pages 162–170, 2008.Google Scholar
- J. C. Blanchette and A. Paskevich. TFF1: The TPTP Typed First-Order Form with Rank-1 Polymorphism. In Proc. of CADE, volume 7898 of LNCS, pages 414–420, 2013. Google ScholarDigital Library
- C. Brown. Satallax: An Automated Higher-Order Prover (System Description). In Proc. of IJCAR, volume 7364 of LNAI, pages 111– 117, 2012. Google ScholarDigital Library
- L. M. de Moura and N. Bjørner. Z3: an efficient SMT solver. In Proc. of TACAS, volume 4963 of LNCS, pages 337–340, 2008. Google ScholarDigital Library
- A. Gupta, L. Kovács, B. Kragl, and A. Voronkov. Extensionality Crisis and Proving Identity. In Proc. of ATVA, volume 8837 of LNCS, pages 185–200, 2014.Google Scholar
- T. Hillenbrand and C. Weidenbach. Superposition for Bounded Domains. In Automated Reasoning and Mathematics - Essays in Memory of William W. McCune, pages 68–100, 2013. Google ScholarDigital Library
- E. Kotelnikov, L. Kovács, and A. Voronkov. A First Class Boolean Sort in First-Order Theorem Proving and TPTP. In Proc. of CICM, volume 9150 of LNCS, pages 71–86, 2015.Google Scholar
- L. Kovács and A. Voronkov. Finding Loop Invariants for Programs over Arrays Using a Theorem Prover. In Proc. of FASE, volume 5503 of LNCS, pages 470–485, 2009. Google ScholarDigital Library
- L. Kovács and A. Voronkov. First-Order Theorem Proving and Vampire. In Proc. of CAV, volume 8044 of LNCS, pages 1–35, 2013. ISBN 978-3-642-39798-1. Google ScholarDigital Library
- T. Nipkow, L. Paulson, and M. Wenzel. Isabelle/HOL: A Proof Assistant for Higher-Order Logic, volume 2283 of LNCS. Springer, 2002. Google ScholarDigital Library
- A. Reynolds and J. Blanchette. A Decision Procedure for (Co)datatypes in SMT Solvers. In Proc. of CADE, volume 9195 of LNCS, pages 197–213, 2015.Google Scholar
- S. Schulz. System Description: E 1.8. In Proc. of LPAR, volume 8312 of LNCS, pages 735–743, 2013.Google Scholar
- G. Sutcliffe. The TPTP Problem Library and Associated Infrastructure. J. Autom. Reasoning, 43(4):337–362, 2009. Google ScholarDigital Library
- G. Sutcliffe. Proceedings of the CADE-25 ATP System Competition CASC-25. Technical report, University of Miami, US, 2015. http://www.cs.miami.edu/~tptp/CASC/25/Proceedings.pdf.Google Scholar
- G. Sutcliffe and C. Benzmüller. Automated reasoning in higher-order logic using the TPTP THF infrastructure. J. Formalized Reasoning, 3 (1):1–27, 2010.Google Scholar
- G. Sutcliffe, S. Schulz, K. Claessen, and P. Baumgartner. The TPTP Typed First-Order Form with Arithmetic. In Proc. of LPAR, volume 7180 of LNCS, pages 406–419, 2012. Google ScholarDigital Library
Index Terms
- The vampire and the FOOL
Recommendations
Evidence Algorithm and Inference Search in First-Order Logics
In the early 1970s, in Kiev, research on automated theorem proving started in the framework of the so-called Evidence Algorithm (EA) programme, having some general features with the Mizar project and, in particular, being oriented to the development of ...
An Isabelle/HOL Formalization of the SCL(FOL) Calculus
Automated Deduction – CADE 29AbstractWe present an Isabelle/HOL formalization of Simple Clause Learning for first-order logic without equality: SCL(FOL). The main results are formal proofs of soundness, non-redundancy of learned clauses, termination, and refutational completeness. ...
A First-order Logic with Frames
We propose a novel logic, Frame Logic (FL), that extends first-order logic and recursive definitions with a construct Sp(·) that captures the implicit supports of formulas—the precise subset of the universe upon which their meaning depends. Using such ...
Comments