Automated proofs of equality problems in Overbeek's competition

This paper reports the detailed computer proofs of nine equality problems in Overbeek's competition obtained by Herky, a completion-based theorem prover developed by the author. Advanced techniques implemented in Herky made it a high-performance theorem prover for equational reasoning. Herky is able to prove the first nine of the ten equality problems in the competition (the tenth is an open problem). These equality problems are likely to serve as good exercises for theorem provers based on different approaches, and the proofs of these problems may help people to solve them using their own theorem provers.

[1]  Larry Wos,et al.  A case study in automated theorem proving: Finding sages in combinatory logic , 1987, Journal of Automated Reasoning.

[2]  Deepak Kapur,et al.  An Overview of Rewrite Rule Laboratory (RRL) , 1989, RTA.

[3]  Nachum Dershowitz,et al.  Termination of Rewriting , 1987, J. Symb. Comput..

[4]  D. Knuth,et al.  Simple Word Problems in Universal Algebras , 1983 .

[5]  Deepak Kapur,et al.  A New Method for Proving Termination of AC-Rewrite Systems , 1990, FSTTCS.

[6]  Donald E. Knuth,et al.  Simple Word Problems in Universal Algebras††The work reported in this paper was supported in part by the U.S. Office of Naval Research. , 1970 .

[7]  Mark E. Stickel,et al.  A Case Study of Theorem Proving by the Knuth-Bendix Method: Discovering That x³=x Implies Ring Commutativity , 1984, CADE.

[8]  Deepak Kapur,et al.  Proving equivalence of different axiomatizations of free groups , 2004, Journal of Automated Reasoning.

[9]  Jim Christian,et al.  Fast Knuth-Bendix Completion: Summary , 1989, International Conference on Rewriting Techniques and Applications.

[10]  Tie-Cheng Wang.  Case studies of Z-module reasoning: Proving benchmark theorems from ring theory , 2004, Journal of Automated Reasoning.

[11]  Gerald E. Peterson,et al.  Complete Sets of Reductions with Constraints , 1990, CADE.

[12]  Jieh Hsiang,et al.  Automated proofs of the moufang identities in alternative rings , 1990, Journal of Automated Reasoning.

[13]  L. Wos,et al.  Automated generation of models and counterexamples and its application to open questions in Ternary Boolean algebra , 1978, MVL '78.

[14]  Robert L. Veroff.  Canonicalization and Demodulation , 1981 .

[15]  Rick L. Stevens,et al.  Solving open problems in right alternative rings with Z-module reasoning , 1989, Journal of Automated Reasoning.

[16]  Deepak Kapur,et al.  Consider Only General Superpositions in Completion Procedures , 1989, RTA.

[17]  Konstantin Aleksandrovich Zhevlakov,et al.  Rings that are nearly associative , 1982 .

[18]  Deepak Kapur,et al.  A Case Study of the Completion Procedure: Proving Ring Commutativity Problems , 1991, Computational Logic - Essays in Honor of Alan Robinson.

[19]  Hantao Zhang,et al.  Herky: High Performance Rewriting in RRL , 1992, CADE.

[20]  Mark E. Stickel,et al.  Complete Sets of Reductions for Some Equational Theories , 1981, JACM.

[21]  Steven K. Winker,et al.  Robbins algebra: Conditions that make a near-boolean algebra boolean , 1990, Journal of Automated Reasoning.

[22]  Larry Wos,et al.  Automated Reasoning: Introduction and Applications , 1984 .

[23]  William McCune,et al.  OTTER 1.0 Users' Guide , 1990 .

[24]  William McCune,et al.  Experiments with discrimination-tree indexing and path indexing for term retrieval , 1992, Journal of Automated Reasoning.

[25]  Larry Wos.  Searching for Fixed Point Combinators by Using Automated Theorem Proving : a Preliminary Report , 1988 .

[26]  B. H. Neumann.  Another single law for groups , 1981, Bulletin of the Australian Mathematical Society.

[27]  Hantao Zhang.  A Case Study of Completion Modulo Distributivity and Abelian Groups , 1993, RTA.

[28]  Ewing L. Lusk,et al.  Reasoning about equality , 2004, Journal of Automated Reasoning.