Skip to main content
Log in

SETHEO and E-SETHEO - The CADE-13 Systems

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

Abstract

The model elimination theorem prover SETHEO (version V3.3) and its equational extension E-SETHEO are presented. SETHEO employs sophisticated mechanisms of subgoal selection, elaborate iterative deepening techniques, and local failure caching methods. Its equational counterpart E-SETHEO transforms formulae containing equality (using a variant of Brand's modification method) and processes the output with the standard SETHEO system. This article gives an overview of the theoretical background, the system architecture, and the performance of both systems.

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Astrachan, O. L. and Stickel, M. E.: Caching and lemmaizing in model elimination theorem provers, in CADE-11, LNAI 607, Springer, 1992, pp. 224–238.

  2. Bachmair, L., Ganzinger, H., Lynch, C. and Snyder, W.: Basic paramodulation, Information and Computation 121(2) (1995), 172–192.

    Google Scholar 

  3. Bibel, W.: Automated Theorem Proving, Vieweg Verlag, Braunschweig, 1987.

    Google Scholar 

  4. Brand, D.: Proving theorems with the modification method, SIAM Journal of Computing 4(4) (1975), 412–430.

    Google Scholar 

  5. McCune, W. W. and Wos, L.: Otter: The CADE-13 competition incarnations, Journal of Automated Reasoning 18(2) (1997).

  6. Gallier, J. and Snyder, W.: Complete sets of transformations for general E-unification, Theoretical Computer Science 67 (1989), 203–260.

    Google Scholar 

  7. Goller, C., Letz, R., Mayr, K. and Schumann, J.: SETHEO V3.2: Recent developments - system abstract, in CADE-12, LNAI 814, Springer, 1994, pp. 778–782.

  8. Harrison, J.: Optimizing proof search in model elimination, CADE-13, LNAI 1104, Springer, 1996, pp. 313–327.

  9. Ibens, O. and Letz, R.: Subgoal Alternation in Model Elimination, Technical Report, Institut für Informatik, Technische Universität München, 1996.

    Google Scholar 

  10. Knuth, D. E. and Bendix, P. B.: Simple word problems in universal algebras, inConference on Computational Problems in Abstract Algebra, Pergamon Press, 1970, pp. 263–297.

  11. Letz, R., Mayr, K. and Goller, C.: Controlled integration of the cut rule into connection tableau calculi, Journal of Automated Reasoning 13 (1994), 297–337.

    Google Scholar 

  12. Letz, R., Schumann, J., Bayerl, S. and Bibel, W.: SETHEO: A high-performance theorem prover, Journal of Automated Reasoning 8 (1992), 183–212.

    Google Scholar 

  13. Loveland, D. W.: Automated Theorem Proving: A Logical Basis, North-Holland, New York, 1978.

    Google Scholar 

  14. Moser, M.: Improving transformation systems for general E-unification, in RTA-5, LNCS 690, Springer, 1993, pp. 92–105.

  15. Moser, M.: Goal-Directed Reasoning in Clausal Logic with Equality, Dissertation, Institut für Informatik, TU München, 1996.

    Google Scholar 

  16. Moser, M.: Compiling Basic Paramodulation to Logic, Technical Report, Institut für Informatik, TU München, 1996. To appear.

    Google Scholar 

  17. Moser, M., Lynch, C. and Steinbach, J.:Model Elimination with Basic Ordered Paramodulation, Technical Report AR-95-11, Institut für Informatik, Technische Universität München, 1995.

    Google Scholar 

  18. Robinson, J. A.: A machine-oriented logic based on the resolution principle, Journal of the ACM 12(1) (1965), 23–41.

    Google Scholar 

  19. Robinson, G. A. and Wos, L.: Paramodulation and theorem proving in first-order theories with equality, Machine Intelligence 4 (1969), 135–150.

    Google Scholar 

  20. Schumann, J. and Ibens, O.: SETHEO V3.3 Reference Manual, Technical Report, Institut für Informatik, TU München, 1996. To appear.

    Google Scholar 

  21. Shostak, R. E.: Refutation graphs, Artificial Intelligence 7 (1976), 51–64.

    Google Scholar 

  22. Smullyan, R. M.: First Order Logic, Springer, 1968.

  23. Stickel, M. E.: A Prolog technology theorem prover: Implementation by an extended Prolog compiler, Journal of Automated Reasoning 4 (1988), 353–380.

    Google Scholar 

  24. Sutcliffe, G. and Suttner, C. B.: The results of the CADE-13 ATP system competition, Journal of Automated Reasoning 18(2) (1997).

  25. Sutcliffe, G., Suttner, C. B. and Yemenis, T.: The TPTP problem library, in A. Bundy (ed.), Proc. of the 12th International Conference on Automated Deduction, Lecture Notes in Artificial Intelligence 814, Springer-Verlag, 1994, pp. 252–266.

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Moser, M., Ibens, O., Letz, R. et al. SETHEO and E-SETHEO - The CADE-13 Systems. Journal of Automated Reasoning 18, 237–246 (1997). https://doi.org/10.1023/A:1005808119103

Download citation

  • Issue Date:

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

Navigation