# Vampire

Automatic theorem proving has a number of important applications, such as software verification, hardware verification, hardware design, knowledge representation and reasoning, the Semantic Web, algebra, and proving theorems in mathematics. Over 50 years of research in theorem proving have resulted in one of the most advanced and elegant theories in computer science. This area is an ideal target for scientific engineering: implementation techniques have to be developed to realise an advanced theory in practically valuable tools.

Vampire is a theorem prover, that is, a system able to prove theorems. More precisely, it proves theorems in first-order logic. The development of Vampire began in 1994 and has survived a number of rewritings (see history).

Here are a few facts about Vampire:

- Vampire is very fast, as can be judged by our awards
- Vampire has a easy to use
*portfolio mode*(see Usage) that can be run in multicore mode - Vampire can "pretend to be an SMT solver" in the sense that it accepts SMT-LIB input and can effectively reason in combinations of first-order logic and theories, such as integer arithmetic, which makes it useful for reasoning with theories and quantifiers
- Vampire can produce detailed proofs and finite models
- Vampire supports algebraic data types (finite term algebras)
- Vampire can generate interpolants