Superposition with equivalence reasoning and delayed clause normal form transformation

This paper describes a superposition calculus where quantifiers are eliminated lazily. Superposition and simplification inferences may employ equivalences that have arbitrary formulas at their smaller side. A closely related calculus is implemented in the Saturate system and has shown useful on many examples, in particular in set theory. The paper presents a completeness proof and reports on practical experience obtained with the Saturate system.

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

[2]  Albert Rubio,et al.  Theorem Proving with Ordering and Equality Constrained Clauses , 1995, J. Symb. Comput..

[3]  Geoff Sutcliffe.  The CADE-18 ATP System Competition (CASC-18) , 2002 .

[4]  Gérard P. Huet,et al.  Design Proof Assistant (Abstract) , 1996, RTA.

[5]  David A. McAllester,et al.  Automated Deduction - CADE-17 , 2000, Lecture Notes in Computer Science.

[6]  Wayne Snyder,et al.  Basic Paramodulation , 1995, Inf. Comput..

[7]  Harald Ganzinger,et al.  Non-Clausal Resolution and Superposition with Selection and Redundancy Criteria , 1992, LPAR.

[8]  Claude Kirchner,et al.  Theorem Proving Modulo , 2003, Journal of Automated Reasoning.

[9]  Zohar Manna,et al.  A Deductive Approach to Program Synthesis , 1979, TOPL.

[10]  Nachum Dershowitz,et al.  Conditional and Typed Rewriting Systems , 1994, Lecture Notes in Computer Science.

[11]  Jürgen Stuber.  Deriving Theory Superposition Calculi from Convergent Term Rewriting Systems , 2000, RTA.

[12]  Alan Robinson,et al.  Handbook of automated reasoning , 2001 .

[13]  Arnon Avron.  Gentzen-type systems, resolution and tableaux , 2004, Journal of Automated Reasoning.

[14]  Neil V. Murray.  Completely Non-Clausal Theorem Proving , 1982, Artif. Intell..

[15]  Jürgen Stuber.  A Model-Based Completeness Proof of Extended Narrowing and Resolution , 2001, IJCAR.

[16]  Harald Ganzinger,et al.  Associative-Commutative Superposition , 1994, CTRS.

[17]  Frank Pfenning,et al.  Logic Programming and Automated Reasoning , 1994, Lecture Notes in Computer Science.

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

[19]  G. S. Tseitin.  On the Complexity of Derivation in Propositional Calculus , 1983 .

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

[21]  Larry Wos,et al.  What Is Automated Reasoning? , 1987, J. Autom. Reason..

[22]  Andrei Voronkov,et al.  Stratified resolution , 2000, J. Symb. Comput..

[23]  Gérard Huet.  Design of a proof assistant , 1996 .