Superposition for Lambda-Free Higher-Order Logic

We introduce refutationally complete superposition calculi for intentional and extensional \(\lambda \)-free higher-order logic, two formalisms that allow partial application and applied variables. The calculi are parameterized by a term order that need not be fully monotonic, making it possible to employ the \(\lambda \)-free higher-order lexicographic path and Knuth–Bendix orders. We implemented the calculi in the Zipperposition prover and evaluated them on TPTP benchmarks. They appear promising as a stepping stone towards complete, efficient automatic theorem provers for full higher-order logic.

[1]  Fredrik Lindblad.  A Focused Sequent Calculus for Higher-Order Logic , 2014, IJCAR.

[2]  Ahmed Bhayat,et al.  A Combinator-Based Superposition Calculus for Higher-Order Logic , 2020, IJCAR.

[3]  Stephan Schulz,et al.  System Description: E 1.8 , 2013, LPAR.

[4]  Christoph Benzmüller,et al.  The Higher-Order Prover Leo-III , 2018, IJCAR.

[5]  Daniel Leivant,et al.  Higher order logic , 1994, Handbook of Logic in Artificial Intelligence and Logic Programming.

[6]  Stephan Schulz,et al.  Implementation of Lambda-Free Higher-Order Superposition , 2018 .

[7]  Malcolm C. Harrison,et al.  Equality-based binary resolution , 1986, JACM.

[8]  C. Kirchner,et al.  Higher-order unification via explicit substitutions Extended Abstract , 1995, LICS 1995.

[9]  F. Obermeyer.  Automated equational reasoning in nondeterministic lambda-calculi modulo theories H * , 2009 .

[10]  Simon Cruanes,et al.  Extending Superposition with Integer Arithmetic, Structural Induction, and Beyond. (Extensions de la Superposition pour l'Arithmétique Linéaire Entière, l'Induction Structurelle, et bien plus encore) , 2015 .

[11]  Manfred Schmidt-Schauß.  Unification in a Combination of Arbitrary Disjoint Equational Theories , 1989, J. Symb. Comput..

[12]  Andrei Voronkov,et al.  First-Order Theorem Proving and Vampire , 2013, CAV.

[13]  Sophie Tourret,et al.  A Comprehensive Framework for Saturation Theorem Proving , 2020, Journal of Automated Reasoning.

[14]  François Bobot,et al.  Expressing Polymorphic Types in a Many-Sorted Language , 2011, FroCoS.

[15]  Josef Urban,et al.  Detecting Inconsistencies in Large First-Order Knowledge Bases , 2017, CADE.

[16]  Gerard P. Hubt.  A mechanization of type theory , 1973, IJCAI 1973.

[17]  Melvin Fitting,et al.  First-Order Logic and Automated Theorem Proving , 1990, Graduate Texts in Computer Science.

[18]  Lawrence C. Paulson,et al.  Translating Higher-Order Clauses to First-Order Clauses , 2007, Journal of Automated Reasoning.

[19]  Jouko Väänänen.  Second-order and higher-order logic , 2019 .

[20]  Myla Archer,et al.  Design and Application of Strategies/Tactics in Higher Order Logics , 2003 .

[21]  Nao Hirokawa,et al.  Uncurrying for Termination and Complexity , 2013, Journal of Automated Reasoning.

[22]  Matthias Fuchs,et al.  DISCOUNT: A SYstem for Distributed Equational Deduction , 1995, RTA.

[23]  Daniel Brand,et al.  Proving Theorems with the Modification Method , 1975, SIAM J. Comput..

[24]  Andrei Paskevich,et al.  TFF1: The TPTP Typed First-Order Form with Rank-1 Polymorphism , 2013, CADE.

[25]  Albert Rubio,et al.  Basic Superposition is Complete , 1992, ESOP.

[26]  Leon Henkin,et al.  Completeness in the theory of types , 1950, Journal of Symbolic Logic.

[27]  Albert Rubio,et al.  Paramodulation-Based Theorem Proving , 2001, Handbook of Automated Reasoning.

[28]  Gian Luigi Ferrari,et al.  Automata for Specifying and Orchestrating Service Contracts , 2016, Log. Methods Comput. Sci..

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

[30]  M. Schmidt-Schauβ.  Unification in a combination of arbitrary disjoint equational theories , 1989 .

[31]  Frank Pfenning,et al.  A Linear Spine Calculus , 2003, J. Log. Comput..

[32]  Lawrence C. Paulson,et al.  LEO-II and Satallax on the Sledgehammer test bench , 2013, J. Appl. Log..

[33]  Harald Ganzinger,et al.  Resolution Theorem Proving , 2001, Handbook of Automated Reasoning.

[34]  Daniel J. Dougherty.  Higher-Order Unification via Combinators , 1993, Theor. Comput. Sci..

[35]  Nicolas Peltier,et al.  A Variant of the Superposition Calculus , 2016, Arch. Formal Proofs.

[36]  Chad E. Brown,et al.  Satallax: An Automatic Higher-Order Prover , 2012, IJCAR.

[37]  Geoff Sutcliffe.  The CADE-26 automated theorem proving system competition - CASC-26 , 2017, AI Commun..

[38]  Simon Cruanes,et al.  Superposition for Lambda-Free Higher-Order Logic ( Technical Report ) , 2018 .

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

[40]  Stephan Schulz.  Fingerprint Indexing for Paramodulation and Rewriting , 2012, IJCAR.

[41]  Lukasz Czajka,et al.  Improving automation in interactive theorem provers by efficient encoding of lambda-abstractions , 2016, CPP.

[42]  Simon Robillard,et al.  A Comprehensive Framework for Saturation Theorem Proving (Technical Report) , 2020 .

[43]  M. Fitting.  Types, Tableaus, and Gödel's God , 2002 .

[44]  Ahmed Bhayat,et al.  Restricted Combinatory Unification , 2019, CADE.

[45]  Gérard P. Huet,et al.  A Mechanization of Type Theory , 1973, IJCAI.

[46]  Geoff Sutcliffe,et al.  Progress in the Development of Automated Theorem Proving for Higher-Order Logic , 2009, CADE.

[47]  Lawrence C. Paulson,et al.  LEO-II - A Cooperative Automatic Theorem Prover for Classical Higher-Order Logic (System Description) , 2008, IJCAR.

[48]  Uwe Waldmann,et al.  A Lambda-Free Higher-Order Recursive Path Order , 2017, FoSSaCS.

[49]  M. Gordon,et al.  Introduction to HOL: a theorem proving environment for higher order logic , 1993 .

[50]  Michael Beeson.  Lambda Logic , 2004, IJCAR.

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

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

[53]  Simon Cruanes,et al.  Extending a Brainiac Prover to Lambda-Free Higher-Order Logic , 2019, TACAS.

[54]  Geoff Sutcliffe.  The CADE-23 Automated Theorem Proving System Competition - CASC-23 , 2012, AI Commun..

[55]  Peter B. Andrews.  Resolution in type theory , 1971, Journal of Symbolic Logic.

[56]  Andrei Voronkov,et al.  Extensional Crisis and Proving Identity , 2014, ATVA.

[57]  Wayne Snyder,et al.  Goal Directed Strategies for Paramodulation , 1991, RTA.

[58]  Peter B. Andrews.  Classical Type Theory , 2001, Handbook of Automated Reasoning.

[59]  Andrei Popescu,et al.  Encoding Monomorphic and Polymorphic Types , 2013, TACAS.

[60]  J. Robinson,et al.  A Note on Mechanizing Higher Order Logic , 2013 .

[61]  Cezary Kaliszyk,et al.  Hammering towards QED , 2016, J. Formaliz. Reason..

[62]  Alexander Bentkamp,et al.  Formalization of the Embedding Path Order for Lambda-Free Higher-Order Terms , 2018, Arch. Formal Proofs.

[63]  Harald Ganzinger,et al.  Rewrite-Based Equational Theorem Proving with Selection and Simplification , 1994, J. Log. Comput..

[64]  Uwe Waldmann,et al.  Superposition with Lambdas , 2019, Journal of Automated Reasoning.

[65]  Alonzo Church,et al.  A formulation of the simple theory of types , 1940, Journal of Symbolic Logic.

[66]  Cesare Tinelli,et al.  Extending SMT Solvers to Higher-Order Logic , 2019, CADE.

[67]  Simon Cruanes,et al.  Superposition with Structural Induction , 2017, FroCoS.

[68]  Cesare Tinelli,et al.  Introducing StarExec: a Cross-Community Infrastructure for Logic Solving , 2014, COMPARE.

[69]  Albert Rubio,et al.  Paramodulation with Non-Monotonic Orderings and Simplification , 2011, Journal of Automated Reasoning.

[70]  Heiko Becker,et al.  A Transfinite Knuth-Bendix Order for Lambda-Free Higher-Order Terms , 2017, CADE.

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

[72]  Yves Bertot,et al.  Interactive Theorem Proving and Program Development: Coq'Art The Calculus of Inductive Constructions , 2010 .

[73]  Cynthia Kop.  Higher Order Termination: Automatable Techniques for Proving Termination of Higher-Order Term Rewriting Systems , 2012 .

[74]  Peter Baumgartner,et al.  The TPTP Typed First-Order Form with Arithmetic , 2012, LPAR.

[75]  Tobias Nipkow,et al.  Sledgehammer: Judgement Day , 2010, IJCAR.

[76]  Dale Miller,et al.  Automation of Higher-Order Logic , 2014, Computational Logic.

[77]  Manfred Kerber.  How to Prove Higher Order Theorems in First Order Logic , 1991, IJCAI.