Skip to main content
SpringerLink
Log in

Beagle – A Hierarchic Superposition Theorem Prover

  • Conference paper
  • First Online:
Automated Deduction - CADE-25 (CADE 2015)

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

Included in the following conference series:

Abstract

Beagle is an automated theorem prover for first-order logic modulo built-in theories. It implements a refined version of the hierarchic superposition calculus. This system description focuses on Beagle ’s proof procedure, background reasoning facilities, implementation, and experimental results.

NICTA is funded by the Australian Government through the Department of Communications and the Australian Research Council through the ICT Centre of Excellence Program.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    Due to a lack of space, we can only give a brief overview of the calculus and of the semantics of hierarchic specifications. We refer to [7] for the details.

  2. 2.

    Abstracting out a term t that occurs in a clause C[t] means replacing C[t] by \(x \not \approx t \vee C[x]\) for a new variable x.

  3. 3.

    E.g., the GEG-problems in the TPTP problem library.

  4. 4.

    http://scalacheck.org/.

  5. 5.

    For this we used the difficulty ratings given for SMT-Comp 2014.

  6. 6.

    For an explanation of how mean efficiency is computed see the CASC-J7 proceedings [18].

References

  1. Bachmair, L., Ganzinger, H.: Rewrite-based equational theorem proving with selection and simplification. J. Logic Comput. 4(3), 217–247 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  2. Bachmair, L., Ganzinger, H., Waldmann, U.: Refutational theorem proving for hierarchic first-order theories. Appl. Algebra Eng. Commun. Comput 5, 193–212 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  3. Barrett, C., Conway, C.L., Deters, M., Hadarean, L., Jovanović, D., King, T., Reynolds, A., Tinelli, C.: CVC4. In: Gopalakrishnan, G., Qadeer, S. (eds.) CAV 2011. LNCS, vol. 6806, pp. 171–177. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  4. Barrett, C., Stump, A., Tinelli, C.: The SMT-LIB Standard: Version 2.0. In: Gupta, A., Kroening, D.(eds.) SMT Workshop (2010)

    Google Scholar 

  5. Baumgartner, P.: SMTtoTPTP - A converter for theorem proving formats. In: Felty, A., Middeldorp, A. (eds.) CADE-25. LNCS(LNAI), pp. 152–169. Springer, Heidelberg (2015)

    Google Scholar 

  6. Baumgartner, P., Bax, J., Waldmann, U.: Finite quantification in hierarchic theorem proving. In: Demri, S., Kapur, D., Weidenbach, C. (eds.) IJCAR 2014. LNCS, vol. 8562, pp. 152–167. Springer, Heidelberg (2014)

    Google Scholar 

  7. Baumgartner, P., Waldmann, U.: Hierarchic superposition with weak abstraction. In: Bonacina, M.P. (ed.) CADE 2013. LNCS, vol. 7898, pp. 39–57. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  8. Cooper, D.C.: Theorem proving in arithmetic without multiplication. In: Machine Intelligence, vol. 7, pp. 91–99. American Elsevier, New York (1972)

    Google Scholar 

  9. Dutertre, B., de Moura, L.: A fast linear-arithmetic solver for DPLL(T). In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol. 4144, pp. 81–94. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  10. Harrison, J.: Handbook of Practical Logic and Automated Reasoning. Cambridge University Press, Cambridge (2009)

    Book  MATH  Google Scholar 

  11. Kruglov, E., Weidenbach, C.: Superposition decides the first-order logic fragment over ground theories. Mathematics in Computer Science, pp. 1–30 (2012)

    Google Scholar 

  12. de Moura, L., Bjørner, N.S.: Z3: an efficient SMT solver. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 337–340. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  13. Prevosto, V., Waldmann, U.: SPASS+T. In: Sutcliffe, G., Schmidt, R., Schulz, S. (eds.) ESCoR: Empirically Successful Computerized Reasoning. CEUR Workshop Proceedings, pp. 18–33. Seattle, WA, USA (2006)

    Google Scholar 

  14. Pugh, W.: The Omega test: a fast and practical integer programming algorithm for dependence analysis. In: ACM/IEEE Conference on Supercomputing, pp. 4–13. ACM (1991)

    Google Scholar 

  15. Rümmer, P.: A constraint sequent calculus for first-order logic with linear integer arithmetic. In: Cervesato, I., Veith, H., Voronkov, A. (eds.) LPAR 2008. LNCS (LNAI), vol. 5330, pp. 274–289. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  16. SMT-LIB, The Satisfiability Modulo Theories Library. http://smt-lib.org/

  17. Sutcliffe, G.: The TPTP problem library and associated infrastructure: the FOF and CNF Parts, v3.5.0. J. Autom. Reasoning 43(4), 337–362 (2009)

    Article  MATH  Google Scholar 

  18. Sutcliffe, G.: The 7th IJCAR automated theorem proving system competition - CASC-J7. AI Communications, 28 (2015). To appear

    Google Scholar 

  19. Sutcliffe, G., Schulz, S., Claessen, K., Baumgartner, P.: The TPTP typed first-order form with arithmetic. In: Bjørner, N., Voronkov, A. (eds.) LPAR-18 2012. LNCS, vol. 7180, pp. 406–419. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. NICTA and Australian National University, Canberra, Australia

    Peter Baumgartner & Joshua Bax

  2. MPI für Informatik, Saarbrücken, Germany

    Uwe Waldmann

Authors
  1. Peter Baumgartner
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Joshua Bax
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Uwe Waldmann
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Peter Baumgartner .

Editor information

Editors and Affiliations

  1. University of Ottawa, Ottawa, Canada

    Amy P. Felty

  2. University of Innsbruck, Innsbruck, Austria

    Aart Middeldorp

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Baumgartner, P., Bax, J., Waldmann, U. (2015). Beagle – A Hierarchic Superposition Theorem Prover. In: Felty, A., Middeldorp, A. (eds) Automated Deduction - CADE-25. CADE 2015. Lecture Notes in Computer Science(), vol 9195. Springer, Cham. https://doi.org/10.1007/978-3-319-21401-6_25

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-21401-6_25

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-21400-9

  • Online ISBN: 978-3-319-21401-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation