Skip to main content
SpringerLink
Log in

Vampire 1.1

  • Conference paper
  • First Online:
Automated Reasoning (IJCAR 2001)

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

Included in the following conference series:

Abstract

In this abstract we describe version 1.1 of the theorem prover Vampire. We give a general description and comment on Vampire’s original features and differences with the previously described version 0.0.

From the very beginning, the main research principle of Vampire was efficiency. Vampire uses a large number of data structures for indexing terms and clauses. Efficiency is still the most distinctive feature of Vampire. Due to reimplementation of some algorithms and data structures, Vampire 1.1 is on the average considerably more efficient than Vampire 0.0.

However, the last year many efforts were invested in flexibility: several new inference and simplification rules were implemented, options for controlling the proof search process added, and new literal selection schemes designed.

For the remaining time before IJCAR 2001, we are going to concentrate on adding more flexibility to Vampire, both for experienced and inexperienced users.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. Avenhaus, J. Denzinger, and M. Fuchs. DISCOUNT: a system for distributed quational deduction. In J. Hsiang, editor, Proceedings of the 6th International Conference on Rewriting Techniques and Applications (RTA-95), volume 914 of Lecture Notes in Computer Science, pages 397–402, Kaiserslautern, 1995.

    Chapter  Google Scholar 

  2. F. Baader and T. Nipkow. Term Rewriting and and All That. Cambridge University press, Cambridge, 1998.

    Google Scholar 

  3. L. Bachmair and H. Ganzinger. Resolution theorem proving. In A. Robinson and A. Voronkov, editors, Handbook of Automated Reasoning. Elsevier Science and MIT Press, 2001. To appear.

    Google Scholar 

  4. A. Degtyarev and A. Voronkov. Stratified resolution. In D. McAllester, editor, 17th International Conference on Automated Deduction (CADE-17), volume 1831 of Lecture Notes in Artificial Intelligence, pages 365–384, Pittsburgh, 2000. Springer Verlag.

    Google Scholar 

  5. Th. Hillenbrand, A. Buch, R. Vogt, and B. Löchner. Waldmeister: High-performance equational deduction. Journal of Automated Reasoning, 18(2): 265–270, 1997.

    Article  Google Scholar 

  6. W.W. McCune. OTTER 3.0 reference manual and guide. Technical Report ANL-94/6, Argonne National Laboratory, January 1994.

    Google Scholar 

  7. W. Pugh. Skip lists: A probabilistic alternative to balanced trees. Communications of the ACM, 33(6):668–676, 1990.

    Article  MathSciNet  Google Scholar 

  8. A. Riazanov and A. Voronkov. Limited resource strategy in resolution theorem proving. Preprint CSPP-7, Department of Computer Science, University of Manchester, October 2000.

    Google Scholar 

  9. A. Riazanov and A. Voronkov. Implementing backward subsumption and search for instances with path indexing and joins. 2001. To appear.

    Google Scholar 

  10. A. Riazanov and A. Voronkov. Splitting without backtracking. Preprint CSPP-10, Department of Computer Science, University of Manchester, January 2001. Accepted to IJCAI 2001.

    Google Scholar 

  11. S. Schulz. System abstract: E 0.3. In H. Ganzinger, editor, Automated Deduction— CADE-16. 16th International Conference on Automated Deduction, Lecture Notes in Artificial Intelligence, pages 297–301, Trento, Italy, July 1999.

    Google Scholar 

  12. M. Stickel. The path indexing method for indexing terms. Technical Report 473, Artificial Intelligence Center, SRI International, Menlo Park, CA, October 1989.

    Google Scholar 

  13. C. Weidenbach, B. Afshordel, U. Brahm, C. Cohrs, T. Engel, E. Keen, C. Theobalt, and D. Topic. System description: Spass version 1.0.0. In H. Ganzinger, editor, Automated Deduction—CADE-16. 16th International Conference on Automated Deduction, volume 1632 of Lecture Notes in Artificial Intelligence, pages 378–382, Trento, Italy, July 1999.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, University of Manchester, UK

    Alexandre Riazanov & Andrei Voronkov

Authors
  1. Alexandre Riazanov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Andrei Voronkov
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Automated Reasoning Project and Department of Computer Science, Australian National University, Canberra, ACT, 0200, Australia

    Rajeev Goré

  2. AG Theoretische Informatik und Logik, Institut für Computersprachen, Technische Universität Wien, Favoritenstr. 9, E185-2, 1040, Wien, Austria

    Alexander Leitsch

  3. Institut für Informatik, Technische Universität München, 80290, München, Germany

    Tobias Nipkow

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Riazanov, A., Voronkov, A. (2001). Vampire 1.1. In: Goré, R., Leitsch, A., Nipkow, T. (eds) Automated Reasoning. IJCAR 2001. Lecture Notes in Computer Science, vol 2083. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45744-5_29

Download citation

  • DOI: https://doi.org/10.1007/3-540-45744-5_29

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42254-9

  • Online ISBN: 978-3-540-45744-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation