vampire mit Homebrew, MacPorts, Nix installieren

Projektlinks

• Homepage
• Repository

Befehle und Aliase

• vampire

Projektgeschichte

The second major incarnation appeared in Uppsala and then moved to the University of Manchester, developed from 1998 by Voronkov and Alexandre Riazanov and later maintained by Voronkov. The project history says this line of Vampire began winning CASC competitions in 1999. A third reincarnation started in 2008 with Kryštof Hoder, reusing some preprocessing code but rewriting the resolution and superposition engine; the 2009 competition version combined second- and third-generation components through scripts named Dracula and Drakosha. From 2014, a broader team took over active development, with important contributions in program analysis, interpolation, and symbol elimination from Laura Kovacs and later work centered around Manchester, Vienna, and other automated-reasoning groups.

Adoptionsgeschichte

Competition history is central to Vampire's reputation. The official trophy page says Vampire has won at least one division of CASC, the world cup in theorem proving, since 1999, and as of the March 2026 update had won 78 titles, more than any other prover. In 2025 it achieved a CASC clean sweep, winning all eight theorem-proving divisions that year. That record explains why Vampire is packaged not as a general developer utility but as a specialized science/formal-methods tool: it is a benchmark-grade prover used by researchers and verification systems that need aggressive saturation-based reasoning.

Wie es verwendet wird

Vampire's niche is first-order automated theorem proving, but its feature set has expanded beyond pure theorem proving. The project site describes support for disproving non-theorems, finite model building, combinations of theories such as arithmetic, arrays, and datatypes, SMT-LIB input, portfolio and multicore modes, proof output, finite models, and increasing higher-order and inductive reasoning support. In package usage, users typically invoke the `vampire` binary on TPTP or SMT-LIB problems, tune modes such as CASC-style strategy selection, and integrate it into verification, formal methods, knowledge representation, or theorem-proving research workflows.

Quellen

• https://github.com/vprover/vampire/wiki/History
• https://github.com/vprover/vampire/wiki/Trophy-Cabinet
• https://vprover.github.io/
• https://www.tuwien.at/en/tu-wien/news/awards/news/riesenerfolg-fuer-vampire