@inproceedings{0ec6b3ac65c34ac185485fa6f89bff58,
title = "Vampire 1.1 (System Description)",
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. {\textcopyright} Springer-Verlag Berlin Heidelberg 2001.",
author = "Alexandre Riazanov and Andrei Voronkov",
year = "2001",
language = "English",
isbn = "3540422544",
volume = "2083",
series = "Lecture Notes in Computer Science",
publisher = "Springer Nature",
pages = "376--380",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|Lect. Notes Comput. Sci.",
address = "United States",
note = "1st International Joint Conference on Automated Reasoning, IJCAR 2001 ; Conference date: 01-07-2001",
}