Skip to main content
Springer Nature Link
Log in

Automated proofs of equality problems in Overbeek's competition

  • Published:
Journal of Automated Reasoning Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. Anantharaman, S. and Hsiang, J., ‘Automated proofs of the Moufang identities in alternative rings’,J. Automated Reasoning 6 79–109 (1990).

    Google Scholar 

  2. Bonacina, M. P., ‘Problems in Lukasiewicz logic’,AAR Newsletter, No. 18 (1991).

  3. Christian, J., ‘Fast Knuth-Bendix completion: summary’,Proc. Third International Conference of Rewriting Techniques and Applications, Lecture Notes in Computer Science, Vol. 355, Springer-Verlag, pp. 548–610 (1989).

    Google Scholar 

  4. Dershowitz, N., ‘Termination of rewriting’,J. Symbolic Computation 3 69–116 (1987).

    Google Scholar 

  5. Dershowitz, N. and Jouannaud, J. P., ‘Rewriting systems’, in Leuven, V. (Ed.),Handbook of Theoretical Computer Science, North Holland (1990).

  6. Knuth, D. E. and Bendix, P. B., ‘Simple word problems in universal algebras’, in Leech, J. (Ed.),Computational Problems in Abstract Algebras, Pergamon Press, pp. 263–297 (1970).

  7. Kapur, D., Sivakumar, G. and Zhang, H., ‘A new method for proving termination of AC-rewrite systems’,Proc. 10th Conference on Foundations of Software Technology and Theoretical Computer Science, Bangalore, India (1990).

  8. Kapur, D. and Zhang, H., ‘An overview of RRL: Rewrite Rule Laboratory’,Proc. of the Third International Conference on Rewriting Techniques and Its Applications, Lecture Notes in Computer Science, Vol. 355, Springer-Verlag, pp. 513–529 (1989).

    Google Scholar 

  9. Kapur, D. and Zhang, H., ‘Proving equivalence of different axiomatizations of free groups’,J. Automated Reasoning 4 331–352 (1988).

    Google Scholar 

  10. Kapur, D. and Zhang, H., ‘A case study of the completion procedure: Proving ring commutativity problems’, in Lassez, J.-L. and Plotkin, G. (Eds.),Computational Logic: Essays in Honor of Alan Robinson, MIT Press, Cambridge, Mass. (1991).

    Google Scholar 

  11. Lusk, E. L. and Overbeek, R. A., ‘Reasoning about equality’,J. Automated Reasoning 1, 209–228 (1985).

    Google Scholar 

  12. Martin, U., ‘Doing algebra with REVE’,Technical Report UMCS-86-10-4, Dept. of Computer Science, University of Manchester (1986).

  13. McCune, W.,OTTER 2.0 Users' Guide.Technical Report, ANL-90/9, Argonne National Laboratory, Argonne, Illinois (1990).

    Google Scholar 

  14. McCune, W., ‘Experiments with discrimination-tree indexing and path indexing for term retrieval’,J. Automated Reasoning 9 (2), 147–168 (1992).

    Google Scholar 

  15. McCune, W. and Wos, L., ‘A case study in automated theorem proving: Finding sages in combinatory logic’,J. Automated Reasoning 3 (1), 91–108 (1987).

    Google Scholar 

  16. Neumann, B. H., ‘Another single law for groups’,Bull. Austr. Math. Soc. 23 81–102 (1981).

    Google Scholar 

  17. Peterson, G.L., ‘Complete sets of reductions with constriants’,Proc. 10th International Conference on Automated Deduction, Lecture Notes in Artificial Intelligence, Vol. 449, Springer-Verlag, Berlin, pp. 381–395 (1990).

    Google Scholar 

  18. Peterson, G. L. and Stickel, M. E., ‘Complete sets of reductions for some equational theories’,J. ACM 28 (2), 233–264 (1981).

    Article  Google Scholar 

  19. Stickel, M., ‘A case study of theorem proving by the Knuth-Bendix method: Discovering thatx 3=x implies ring commutativity’,Proc. 7th Conf. on Automated Deduction, Lecture Notes in Computer Science, Vol. 170, Springer-Verlag, pp. 248–258 (1984).

    Google Scholar 

  20. Veroff, R., ‘Canonicalization and demodulation’,Technical Report ANL-81-6, Argonne National Laboratory, Argonne, Illinois (1981).

    Google Scholar 

  21. Wang, T. C., ‘Case studies of Z-module reasoning: Proving benchmark theorems from ring theory’,J. Automated Reasoning 3 437–451 (1987).

    Google Scholar 

  22. Wang, T. C. and Stevens, R., ‘Solving open problems in right alternative rings with Z-module reasoning’,J. Automated Reasoning 5 141–165 (1989).

    Google Scholar 

  23. Winker, S., ‘Robbins algebra: Conditions that make a near-Boolean algebra Boolean’,J. Automated Reasoning 6 (4), 465–489 (1990).

    Google Scholar 

  24. Winkler, S. and Wos, L., ‘Automated generation of models and counterexamples and its application to open questions in ternary Boolean algebra’, in:Proc. Eighth International Symposium on Multiple-Valued Logic. Rosemont, Ill., pp. 251–256 (1978).

  25. Wos, L., ‘New challenge problem in sentential calculus’,AAR Newsletter, No. 16 (1990).

  26. Wos, L. and McCune, W., ‘Searching for fixed point combinators by using automated theorem proving: A preliminary report’,Technical Report ANL-88-10, Argonne National Laboratory, Argonne, Illinois (1988).

    Google Scholar 

  27. Wos, L., Overbeek, R., Lusk, E. and Boyle, J., ‘Automated reasoning: Introduction and applications’, 2nd edn., McGraw-Hill, New York (1992).

    Google Scholar 

  28. Zhang, H., ‘Criteria of critical pair criteria: A practical approach and a comparative study’,Internal Report, Dept. of Computer Science, University of Iowa (1991).

  29. Zhang, H., ‘Herky: High-performance rewriting techniques in RRL; in Kapur, D. (Ed.),Proc. 1992 International Conference of Automated Deduction, Lecture Notes in Artificial Intelligence, Springer-Verlag, pp. 696–700 (1992).

  30. Zhang, H., ‘A case study of completion modulo distributivity and Abelian groups’, in Kirchner, C. (Ed.).Proc. International Conference on Rewrite Techniques and Applications, Lecture Notes in Computer Science, Vol. 690, Springer-Verlag, pp. 32–46 (1993).

  31. Zhevlakov, K. A.et al., Rings That are Nearly Associative (Tr. by H. F. Smith from the Russian), Academic Press, New York (1982).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, The University of Iowa, 52242, Iowa City, IA, USA

    Hantao Zhang

Authors
  1. Hantao Zhang
    View author publications

    You can also search for this author inPubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zhang, H. Automated proofs of equality problems in Overbeek's competition. J Autom Reasoning 11, 333–351 (1993). https://doi.org/10.1007/BF00881872

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00881872

Key words