Skip to main content
SpringerLink
Log in

The CADE-15 ATP System Competition

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

Abstract

The results of the CADE-15 ATP System Competition (CASC-15) are presented.

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

Access this article

Log in via an institution

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

References

  • Bachmair, L., Dershowitz, N. and Plaisted, D. A.: Completion without failure, in H. Ait-Kaci and M. Nivat (eds.), Resolution of Equations in Algebraic Structures, Academic Press, 1989, pp. 1–30.

  • Buch, A. and Hillenbrand, T.: Waldmeister: Development of a high performance completion based theorem prover, Technical Report SEKI-Report SR-96-01, AG Effiziente Algorithmen, Universität Kaiserslautern, Kaiserslautern, Germany, 1996.

    Google Scholar 

  • Fermüller, C., Leitsch, A., Tammet, T. and Zamov, N.: Resolution Methods for the Decision Problem, Lecture Notes in Comput. Sci. 679, Springer-Verlag, 1993.

  • Ganzinger, H., Meyer, C. and Weidenbach, C.: Soft typing for ordered resolution, in W. W. McCune (ed.), Proceedings of the 14th International Conference on Automated Deduction, Lecture Notes in Artif. Intell. 1249, Springer-Verlag, 1997, pp. 321–335.

  • Greiner, M. and Schramm, M.: A probablistic stopping criterion for the evaluation of benchmarks, Technical Report I9638, Institut für Informatik, Technische Universität München, München, Germany, 1996.

    Google Scholar 

  • Hillenbrand, T., Buch, A., Vogt, R. and Löchner, B.: Waldmeister: High performance equational deduction, J. Automated Reasoning 18(2) (1997), 265–270.

    Article  Google Scholar 

  • Kaufmann, M.: ACL2 Support for Verification Projects, in C. Kirchner and H. Kirchner (eds.), Proceedings of the 15th International Conference on Automated Deduction, Lecture Notes in Artif. Intell. 142, Springer-Verlag, 1998, pp. 220–238.

  • Nonnengart, A., Rock, G. and Weidenbach, C.: On generating small clause normal forms, in C. Kirchner and H. Kirchner (eds.), Proceedings of the 15th International Conference on Automated Deduction, Lecture Notes in Artif. Intell. 1421, Springer-Verlag, 1998, pp. 397–411.

  • Slaney, J. K., Lusk, E. and McCune, W. W.: SCOTT: Semantically constrained Otter, system description, in A. Bundy (ed.), Proceedings of the 12th International Conference on Automated Deduction, Lecture Notes in Artif. Intell. 814, Springer-Verlag, 1994, pp. 764–768.

  • Suttner, C. B. and Schumann, J.: Parallel automated theorem proving, in L. Kanal, V. Kumar, H. Kitano, and C. Suttner (eds.), Parallel Processing for Artificial Intelligence 1, Elsevier Science, 1994, pp. 209–257.

  • Sutcliffe, G. and Suttner, C. B.: Special issue: The CADE-13 ATP system competition, J. Automated Reasoning 18(2) (1997).

  • Sutcliffe, G. and Suttner, C. B.: The procedures of the CADE-13 ATP system competition, J. Automated Reasoning 18(2) (1997), 163–169.

    Google Scholar 

  • Suttner, C. B. and Sutcliffe, G.: The design of the CADE-13 ATP system competition, J. Automated Reasoning 18(2) (1997), 139–162.

    Google Scholar 

  • Sutcliffe, G. and Suttner, C.: The CADE-14 ATP system competition, Technical Report 98/01, Department of Computer Science, James Cook University, Townsville, Australia, 1998.

    Google Scholar 

  • Sutcliffe, G. and Suttner, C. B.: Proceedings of the CADE-15 ATP System Competition, Lindau, Germany, 1998.

  • Sutcliffe, G. and Suttner, C. B.: The TPTP problem library: CNF release v1.2.1, J. Automated Reasoning 21(2) (1998), 177–203.

    Google Scholar 

  • Suttner, C. B. and Sutcliffe, G.: The CADE-14 ATP system competition, J. Automated Reasoning 21(1) (1998), 99–134.

    Google Scholar 

  • Tammet, T.: A resolution theorem prover for intuitionistic logic, in M. McRobbie and J. K. Slaney (eds.), Proceedings of the 13th International Conference on Automated Deduction, Lecture Notes in Artif. Intell. 1104, Springer-Verlag, 1996, pp. 2–16.

  • Tammet, T.: Gandalf, J. Automated Reasoning 18(2) (1997), 199–204.

    Google Scholar 

  • Tammet, T.: Towards efficient subsumption, in C. Kirchner and H. Kirchner (eds.), Proceedings of the 15th International Conference on Automated Deduction, Lecture Notes in Artif. Intell. 1421, Springer-Verlag, 1998, pp. 427–440.

  • Tammet, T. and Smith, J.: Optimised encodings of fragments of type theory in first order logic, in S. Berardi and M. Coppo (eds.), Types for Proofs and Programs: Proceedings of the International Workshop TYPES'95, Lecture Notes in Artif. Intell. 1158, Springer-Verlag, 1996, pp. 265–287.

  • Weidenbach, C.: Email to G. Sutcliffe, 1997.

  • Weidenbach, C.: SPASS: Version 0.49, J. Automated Reasoning 18(2) (1997), 247–252.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, James Cook University, Townsville, Australia

    G. Sutcliffe

  2. Institut für Informatik, TU München, München, Germany

    C. B. Suttner

Authors
  1. G. Sutcliffe
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. C. B. Suttner
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Sutcliffe, G., Suttner, C.B. The CADE-15 ATP System Competition. Journal of Automated Reasoning 23, 1–23 (1999). https://doi.org/10.1023/A:1006285423991

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1006285423991

Search

Navigation