Proceedings of the CADE-23 ATP System Competition CASC-23

The CADE ATP System Competition (CASC) evaluates the performance of sound, fully automatic, classical logic, ATP systems. The evaluation is in terms of the number of problems solved, the number of acceptable proofs and models produced, and the average runtime for problems solved, in the context of a bounded number of eligible problems chosen from the TPTP problem library, and specified time limits on solution attempts. The CADE-23 ATP System Competition (CASC-23) was held on 3rd August 2011. The design of the competition and its rules, and information regarding the competing systems, are provided in this report.

[1]  W. W. Bledsoe,et al.  Splitting and Reduction Heuristics in Automatic Theorem Proving , 1971, Artif. Intell..

[2]  Donald W. Loveland,et al.  Automated theorem proving: a logical basis , 1978, Fundamental studies in computer science.

[3]  Dominique Pastre.  Automatic Theorem Proving in Set Theory , 1978, Artif. Intell..

[4]  Peter B. Andrews.  Theorem Proving via General Matings , 1981, JACM.

[5]  Christoph Walther,et al.  A Many-Sorted Calculus Based on Resolution and Paramodulation , 1982, IJCAI.

[6]  Lawrence J. Henschen,et al.  What Is Automated Theorem Proving? , 1985, J. Autom. Reason..

[7]  Dale A. Miller.  A compact representation of proofs , 1987, Stud Logica.

[8]  Jeffrey D. Uuman.  Principles of database and knowledge- base systems , 1989 .

[9]  Dominique Pastre,et al.  MUSCADET: An Automatic Theorem Proving System Using Knowledge and Metaknowledge in Mathematics , 1989, Artif. Intell..

[10]  Tobias Nipkow,et al.  Equational Reasoning in Isabelle , 1989, Sci. Comput. Program..

[11]  Sunil Issar.  Path-Focused Duplication: A Search Procedure for General Matings , 1990, AAAI.

[12]  Lawrence Charles Paulson,et al.  Isabelle: A Generic Theorem Prover , 1994 .

[13]  Peter Baumgartner,et al.  Hyper Tableaux , 1996, JELIA.

[14]  Christoph Benzmüller,et al.  System Description: LEO - A Higher-Order Theorem Prover , 1998, CADE.

[15]  Peter B. Andrews,et al.  Selectively Instantiating Definitions , 1998, CADE.

[16]  H. Ganzinger,et al.  Equational Reasoning in Saturation-Based Theorem Proving , 1998 .

[17]  Matthew Bishop,et al.  A Breadth-First Strategy for Mating Search , 1999, CADE.

[18]  Thomas Hillenbrand,et al.  System Description: Waldmeister - Improvements in Performance and Ease of Use , 1999, CADE.

[19]  Lawrence C. Paulson,et al.  A Generic Tableau Prover and its Integration with Isabelle , 1999, J. Univers. Comput. Sci..

[20]  Christoph Benzmüller,et al.  Extensional Higher-Order Paramodulation and RUE-Resolution , 1999, CADE.

[21]  Geoff Sutcliffe,et al.  Evaluating general purpose automated theorem proving systems , 2001, Artif. Intell..

[22]  Reinhold Letz,et al.  Model Elimination and Connection Tableau Procedures , 2001, Handbook of Automated Reasoning.

[23]  Lawrence Charles Paulson,et al.  Isabelle/HOL: A Proof Assistant for Higher-Order Logic , 2002 .

[24]  Chad E. Brown.  Solving for Set Variables in Higher-Order Theorem Proving , 2002, CADE.

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

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

[27]  Peter Baumgartner,et al.  The Model Evolution Calculus , 2003, CADE.

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

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

[30]  William McCune,et al.  Mace4 Reference Manual and Guide , 2003, ArXiv.

[31]  Christopher W. Brown.  QEPCAD B: a program for computing with semi-algebraic sets using CADs , 2003, SIGS.

[32]  J. Hurd.  First-Order Proof Tactics in Higher-Order Logic Theorem Provers In Proc , 2003 .

[33]  Geoff Sutcliffe,et al.  The CADE-19 ATP System Competition , 2004, AI Commun..

[34]  Christoph Wernhard,et al.  System Description : KRHyper , 2003 .

[35]  Thomas Hillenbrand.  Citius altius fortius: Lessons learned from the Theorem Prover WALDMEISTER , 2003, Electron. Notes Theor. Comput. Sci..

[36]  William McCune,et al.  OTTER 3.3 Reference Manual , 2003, ArXiv.

[37]  Wolfgang Bibel,et al.  leanCoP: lean connection-based theorem proving , 2003, J. Symb. Comput..

[38]  Thomas Hillenbrand,et al.  On using ground joinable equations in equational theorem proving , 2003, J. Symb. Comput..

[39]  The CADE-16 ATP System Competition , 2000, Journal of Automated Reasoning.

[40]  Geoff Sutcliffe,et al.  The IJCAR ATP System Competition , 2004, Journal of Automated Reasoning.

[41]  The CADE-17 ATP System Competition , 2001, Journal of Automated Reasoning.

[42]  The CADE-18 ATP System Competition , 2003, Journal of Automated Reasoning.

[43]  Geoff Sutcliffe,et al.  The CADE-15 ATP System Competition , 2004, Journal of Automated Reasoning.

[44]  Peter B. Andrews.  On connections and higher-order logic , 2004, Journal of Automated Reasoning.

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

[46]  Frank Pfenning,et al.  TPS: A theorem-proving system for classical type theory , 1996, Journal of Automated Reasoning.

[47]  Geoff Sutcliffe,et al.  The CADE-13 ATP System Competition , 2004, Journal of Automated Reasoning.

[48]  Larry Wos,et al.  Otter - The CADE-13 Competition Incarnations , 1997, Journal of Automated Reasoning.

[49]  C. Tinelli,et al.  Darwin: A Theorem Prover for the Model Evolution Calculus , 2004 .

[50]  Geoff Sutcliffe,et al.  The CADE-14 ATP System Competition , 2004, Journal of Automated Reasoning.

[51]  Geoff Sutcliffe,et al.  The Procedures of the CADE-13 ATP System Competition , 2004, Journal of Automated Reasoning.

[52]  Geoff Sutcliffe.  The IJCAR-2004 Automated Theorem Proving Competition , 2005, AI Commun..

[53]  Dominique Pastre,et al.  Automated theorem proving in mathematics , 1993, Annals of Mathematics and Artificial Intelligence.

[54]  Peter Baumgartner,et al.  The Model Evolution Calculus with Equality , 2005, CADE.

[55]  Geoff Sutcliffe,et al.  The CADE-20 Automated Theorem Proving Competition , 2006, AI Commun..

[56]  Koen Claessen,et al.  Using the TPTP Language for Writing Derivations and Finite Interpretations , 2006, IJCAR.

[57]  Bernd Löchner,et al.  Things to Know when Implementing KBO , 2006, Journal of Automated Reasoning.

[58]  Peter B. Andrews,et al.  TPS: A hybrid automatic-interactive system for developing proofs , 2006, J. Appl. Log..

[59]  Christoph Benzmüller,et al.  Term Indexing for the LEO-II Prover , 2006 .

[60]  Peter Baumgartner,et al.  Hyper Tableaux with Equality , 2007, CADE.

[61]  Björn Pelzer,et al.  System Description: E-KRHyper , 2007, CADE.

[62]  Geoff Sutcliffe.  The 3rd IJCAR Automated Theorem Proving Competition , 2007, AI Commun..

[63]  Emina Torlak,et al.  Kodkod: A Relational Model Finder , 2007, TACAS.

[64]  C. E. Brown.  Automated Reasoning in Higher-Order Logic: Set Comprehension and Extensionality in Church's Type Theory , 2007 .

[65]  D. Pastre.  Complementarity of a Natural Deduction Knowledge-Based Prover and Resolution-Based Provers in Automated Theorem Proving , 2007 .

[66]  K. Claessen,et al.  New Techniques that Improve MACE-style Finite Model Finding , 2007 .

[67]  Konstantin Korovin,et al.  iProver - An Instantiation-Based Theorem Prover for First-Order Logic (System Description) , 2008, IJCAR.

[68]  Nikolaj Bjørner,et al.  Z3: An Efficient SMT Solver , 2008, TACAS.

[69]  Geoff Sutcliffe.  The 4th IJCAR ATP System Competition , 2008 .

[70]  Geoff Sutcliffe.  The SZS Ontologies for Automated Reasoning Software , 2008, LPAR Workshops.

[71]  Volker Sorge,et al.  Combined reasoning by automated cooperation , 2008, J. Appl. Log..

[72]  Geoff Sutcliffe.  The CADE-21 automated theorem proving system competition , 2008, AI Commun..

[73]  Tjark Weber,et al.  SAT-based finite model generation for higher-order logic , 2008 .

[74]  Geoff Sutcliffe.  The TPTP Problem Library and Associated Infrastructure , 2009, Journal of Automated Reasoning.

[75]  Christoph Weidenbach,et al.  SPASS Version 3.5 , 2009, CADE.

[76]  Sofiène Tahar,et al.  Formal verification of analog designs using MetiTarski , 2009, 2009 Formal Methods in Computer-Aided Design.

[77]  Gerard de Melo,et al.  External Sources of Axioms in Automated Theorem Proving , 2009, KI.

[78]  Lawrence C. Paulson,et al.  MetiTarski: An Automatic Theorem Prover for Real-Valued Special Functions , 2010, Journal of Automated Reasoning.

[79]  Gert Smolka,et al.  Extended First-Order Logic , 2009, TPHOLs.

[80]  Sascha Böhme,et al.  Proof Reconstruction for Z3 in Isabelle/HOL , 2009 .

[81]  Geoff Sutcliffe.  The 4th IJCAR Automated Theorem Proving System Competition - CASC-J4 , 2009, AI Commun..

[82]  Gert Smolka,et al.  Terminating Tableaux for the Basic Fragment of Simple Type Theory , 2009, TABLEAUX.

[83]  Frank Pfenning,et al.  Proof Transformations in Higher-Order Logic , 2009 .

[84]  Jasmin Christian Blanchette,et al.  Three years of experience with Sledgehammer, a Practical Link Between Automatic and Interactive Theorem Provers , 2012, IWIL@LPAR.

[85]  Geoff Sutcliffe,et al.  Automated Reasoning in Higher-Order Logic using the TPTP THF Infrastructure , 2010, J. Formaliz. Reason..

[86]  G. Sutcliffe.  Proceedings of the 5th IJCAR ATP System Competition CASC-J5 , 2010 .

[87]  Geoff Sutcliffe.  The CADE-22 automated theorem proving system competition - CASC-22 , 2010, AI Commun..

[88]  Konstantin Korovin,et al.  Labelled Unit Superposition Calculi for Instantiation-Based Reasoning , 2010, LPAR.

[89]  Jens Otten.  Restricting backtracking in connection calculi , 2010, AI Commun..

[90]  Andrei Voronkov,et al.  Interpolation and Symbol Elimination in Vampire , 2010, IJCAR.

[91]  Konstantin Korovin,et al.  iProver-Eq: An Instantiation-Based Theorem Prover with Equality , 2010, IJCAR.

[92]  Gerard de Melo,et al.  Progress Towards Effective Automated Reasoning with World Knowledge , 2010, FLAIRS.

[93]  Tobias Nipkow,et al.  Nitpick: A Counterexample Generator for Higher-Order Logic Based on a Relational Model Finder , 2010, ITP.

[94]  Jasmin Christian Blanchette,et al.  Monotonicity Inference for Higher-Order Formulas , 2011, Journal of Automated Reasoning.

[95]  Chad E. Brown,et al.  Analytic Tableaux for Higher-Order Logic with Choice , 2010, Journal of Automated Reasoning.

[96]  Andrei Voronkov,et al.  Sine Qua Non for Large Theory Reasoning , 2011, CADE.

[97]  Martin Gebser,et al.  An incremental answer set programming based system for finite model computation , 2011, AI Commun..

[98]  Peter Baumgartner,et al.  Model Evolution with Equality Modulo Built-in Theories , 2011, CADE.

[99]  Geoff Sutcliffe.  The 5th IJCAR automated theorem proving system competition - CASC-J5 , 2011, AI Commun..

[100]  Geoff Sutcliffe,et al.  Using the TPTP Language for Representing Derivations in Tableau andConnection Calculi , 2012 .

[101]  Peter Baumgartner,et al.  Model Evolution with equality - Revised and implemented , 2012, J. Symb. Comput..

[102]  Chad E. Brown.  Reducing Higher-Order Theorem Proving to a Sequence of SAT Problems , 2013, Journal of Automated Reasoning.

[103]  Stephan Schulz,et al.  Simple and Efficient Clause Subsumption with Feature Vector Indexing , 2013, Automated Reasoning and Mathematics.