Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Vampire (theorem prover)
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
==Background== Vampire's [[kernel (operating system)|kernel]] implements the calculi of ordered [[binary resolution]] and [[Superposition calculus|superposition]] (for handling equality). The splitting rule and negative equality splitting can be simulated by the introduction of new [[predicate (logic)|predicate]] definitions and dynamic folding of such definitions. A [[DPLL algorithm|DPLL-style algorithm]] splitting is also supported. A number of standard redundancy criteria and simplification techniques are used for pruning the search space: [[tautology (logic)|tautology]] deletion, [[Hierarchy#Subsumptive containment hierarchy|subsumption]] resolution, rewriting by ordered unit equalities, basicness restrictions and irreducibility of [[substitution (logic)|substitution]] terms. The reduction ordering on [[term (logic)|term]]s is the standard [[Knuth–Bendix completion algorithm|Knuth–Bendix ordering]]. A number of efficient [[term indexing|indexing]] techniques are used to implement all major operations on sets of terms and [[clause (logic)|clause]]s. [[Run-time algorithm specialisation]] is used to accelerate forward matching. Although the kernel of the system works only with [[conjunctive normal form]]s, the preprocessor component accepts a problem in the full first-order logic syntax, {{not a typo|clausifies}} it and performs a number of useful transformations before passing the result to the kernel. When a theorem is proven, the system produces a verifiable proof, which validates both the {{not a typo|clausification}} phase and the refutation of the [[conjunctive normal form]]. Along with proving theorems, Vampire has other related functionalities such as generating [[Craig interpolation|interpolants]]. [[Executable]]s can be obtained from the system website.<ref>{{cite web|url=https://vprover.github.io/|title=Vampire|website=vprover.github.io|access-date=2022-11-02}}</ref> As of November 2020, Vampire is released under a modified version of the BSD 3-clause licence that explicitly permits commercial use. Previous versions were available under a proprietary non-commercial licence.
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)