Skip to main content

The design of the CADE-13 ATP system competition

  • Session 2B
  • Conference paper
  • First Online:
Automated Deduction — Cade-13 (CADE 1996)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 1104))

Included in the following conference series:

Abstract

Running a competition for Automated Theorem Proving (ATP) systems is a difficult and arguable venture. However, the potential benefits of such an event by far outweigh the controversial aspects. The motivations for running the CADE-13 ATP system competition are to contribute to the evaluation of ATP systems, to stimulate ATP research and system development, and to expose ATP systems to interested researchers both within and outside the ATP community. This paper identifies and discusses the issues that determine the nature of the competition. Choices and motivated decisions, with respect to the issues, are given.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Astrachan O., Khera V., Kotz D. (1993), The Internet Programming Contest: A Report and Philosophy, Proceedings of the 24th SIGCSE Technical Conference, SIGCSE Bulletin, ACM Press, 48–52.

    Google Scholar 

  2. Astrachan O.L., Loveland D.W. (1994), Measuring the Performance of Automated Theorem Provers, Sutcliffe G., Suttner, C. (Eds), Proceedings of the CADE-12 Workshop 2C — Evaluation of Automated Theorem Proving Systems, 37–41.

    Google Scholar 

  3. Buro M., Kleine-Büning H. (1992), Report on a SAT Competition, Reihe Informatik, Bericht Nr. 110, FB 17-Mathematik/Informatik Universität Paderborn.

    Google Scholar 

  4. Chen E., Istrail S., Johnson D., Kececioglu J., Messing J., Nadeau J., Pevzner P., Rice P., Vingron M., Waterman M. (1994), The 4th DIMACS International Algorithm Implementation Challenge, http://dimacs.rutgers.edu/challenge.html.

    Google Scholar 

  5. Comer J., Rinewalt R., Ryan P., Poucher W.B. (1990), The ACM Scholastic Programming Contest-1977 to 1990, Proceedings of the 21st SIGCSE Technical Symposium on Computer Science Education, SIGCSE Bulletin 22(1), ACM Press, 256.

    Google Scholar 

  6. Crawford J., Selman B. (1996), International Competition and Symposium on Satisfiability Testing, http://tango.ncic.ac.cn/sat/cfp.

    Google Scholar 

  7. Dunker U. (1994), Search Space and Proof Complexity of Theorem Proving Strategies, Sutcliffe G., Suttner, C.B. (Eds), Proceedings of the CADE-12 Workshop 2C-Evaluation of Automated Theorem Proving System.

    Google Scholar 

  8. Letz R. (1993), First-Order Calculi and Proof Procedures for Automated Deduction, Doctoral Thesis, Institut für Informatik, TU München, Munich, Germany.

    Google Scholar 

  9. McCune W.W. (1994), Otter 3.0 Reference Manual and Guide, ANL-94/6, Argonne National Laboratory, Argonne, USA.

    Google Scholar 

  10. Michie D., Muggleton S., Page D., Srinivasan A. (1994), 3 Inductive Learning Competitions, ftp://ftp.comlab.ox.ac.uk/pub/Packages/ILP

    Google Scholar 

  11. Newborn M., (1994), The 24th ACM International Computer Chess Championship, Journal of the International Computer Chess Association, 17(3), 159–164.

    Google Scholar 

  12. Overbeek R. (1993), The CADE-11 Competitions: A Personal View, Journal of Automated Reasoning 11(3), 315–316.

    Article  Google Scholar 

  13. Pelletier F.J. (1991), The Philosophy of Automated Theorem Proving, Proceedings of the 12th International Joint Conference on Artificial Intelligence, 1039–1045.

    Google Scholar 

  14. Plaisted D.A. (1994), The Search Efficiency of Theorem Proving Strategies, Bundy A. (Ed), Proceedings of the 12th International Conference on Automated Deduction, LNAI 814, Springer-Verlag„ New York, USA, 57–71.

    Google Scholar 

  15. Prehofer C., Slind K. (1994), Theorem Proving in Interactive Verification Systems, Sutcliffe G., Suttner, C.B. (Eds), Proceedings of the CADE-12 Workshop 2C-Evaluation of Automated Theorem Proving Systems.

    Google Scholar 

  16. Sutcliffe G., Suttner C.B., Yemenis T. (1994), The TPTP Problem Library, Bundy A. (Ed), Proceedings of the 12th International Conference on Automated Deduction (Nancy, France, 1994), LNAI 814, Springer-Verlag„ New York, USA, 252–266.

    Google Scholar 

  17. Suttner C.B., Sutcliffe G. (1995), The TPTP Problem Library (TPTP v1.2.0), Technical Report AR-95-03, Institut für Informatik, Technische Universität München, Munich, Germany; Technical Report 95/6, Department of Computer Science, James Cook University, Townsville, Australia.

    Google Scholar 

  18. Sutcliffe G., Suttner, C.B. (1995), The Design of the CADE-13 ATP System Competition, Technical Report 95/15, Department of Computer Science, James Cook University, Townsville, Australia; Technical Report AR-95-05, Institut für Informatik, Technische Universität München, Munich, Germany.

    Google Scholar 

  19. Sutcliffe G., Suttner C.B. (1995), ATP System Results for the TPTP Problem Library (up to TPTP v1.1.3), Technical Report 95/16, Department of Computer Science, James Cook University, Townsville, Australia; Technical Report AR-95-06, Institut für Informatik, Technische Universität München, Munich, Germany.

    Google Scholar 

  20. Wadsworth H.M. (1989), Handbook of Statistical Methods for Engineers and Scientists, McGraw-Hill, USA.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

M. A. McRobbie J. K. Slaney

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Suttner, C.B., Sutcliffe, G. (1996). The design of the CADE-13 ATP system competition. In: McRobbie, M.A., Slaney, J.K. (eds) Automated Deduction — Cade-13. CADE 1996. Lecture Notes in Computer Science, vol 1104. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61511-3_76

Download citation

  • DOI: https://doi.org/10.1007/3-540-61511-3_76

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61511-8

  • Online ISBN: 978-3-540-68687-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics