Vampire automated theorem prover
E312855
Vampire automated theorem prover is a high-performance first-order logic reasoning system widely used in automated deduction and formal verification research.
All labels observed (2)
| Label | Occurrences |
|---|---|
| E automated theorem prover | 1 |
| Vampire automated theorem prover canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T2929951 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Vampire automated theorem prover Context triple: [Andrei Voronkov, notableWork, Vampire automated theorem prover]
-
A.
Journal of Automated Reasoning
The Journal of Automated Reasoning is a peer-reviewed academic journal focusing on research in automated reasoning, formal methods, and related areas of computer science and logic.
-
B.
Conference on Automated Deduction
The Conference on Automated Deduction (CADE) is a leading international research conference focused on the theory and applications of automated reasoning and formal deduction in computer science and mathematics.
-
C.
Satisfiability Modulo Theories (SMT)
Satisfiability Modulo Theories (SMT) is a framework in computer science and mathematical logic for deciding the satisfiability of logical formulas with respect to background theories such as arithmetic, bit-vectors, arrays, and data types, widely used in verification, synthesis, and automated reasoning.
-
D.
Isabelle/HOL: A Proof Assistant for Higher-Order Logic
"Isabelle/HOL: A Proof Assistant for Higher-Order Logic" is a foundational book and system documentation that presents the Isabelle/HOL interactive theorem prover, widely used for formal verification and higher-order logic reasoning in computer science and mathematics.
-
E.
LCF theorem prover
The LCF theorem prover is an early interactive proof system that pioneered the use of higher-order logic and the LCF-style architecture, forming the conceptual basis for later provers like HOL and Isabelle.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Vampire automated theorem prover Target entity description: Vampire automated theorem prover is a high-performance first-order logic reasoning system widely used in automated deduction and formal verification research.
-
A.
Journal of Automated Reasoning
The Journal of Automated Reasoning is a peer-reviewed academic journal focusing on research in automated reasoning, formal methods, and related areas of computer science and logic.
-
B.
Conference on Automated Deduction
The Conference on Automated Deduction (CADE) is a leading international research conference focused on the theory and applications of automated reasoning and formal deduction in computer science and mathematics.
-
C.
Satisfiability Modulo Theories (SMT)
Satisfiability Modulo Theories (SMT) is a framework in computer science and mathematical logic for deciding the satisfiability of logical formulas with respect to background theories such as arithmetic, bit-vectors, arrays, and data types, widely used in verification, synthesis, and automated reasoning.
-
D.
Isabelle/HOL: A Proof Assistant for Higher-Order Logic
"Isabelle/HOL: A Proof Assistant for Higher-Order Logic" is a foundational book and system documentation that presents the Isabelle/HOL interactive theorem prover, widely used for formal verification and higher-order logic reasoning in computer science and mathematics.
-
E.
LCF theorem prover
The LCF theorem prover is an early interactive proof system that pioneered the use of higher-order logic and the LCF-style architecture, forming the conceptual basis for later provers like HOL and Isabelle.
- F. None of above. chosen
Statements (62)
| Predicate | Object |
|---|---|
| instanceOf |
automated reasoning system
ⓘ
automated theorem prover ⓘ first-order logic reasoning system ⓘ |
| domain |
automated reasoning
ⓘ
formal verification ⓘ logic in computer science ⓘ |
| hasApplication |
SMT solving research
ⓘ
automated deduction research ⓘ formal verification ⓘ hardware verification ⓘ knowledge representation and reasoning ⓘ mathematical theorem proving ⓘ model checking workflows ⓘ program analysis ⓘ software verification ⓘ verification condition discharge ⓘ |
| hasFeature |
SAT-based reasoning components
ⓘ
SMT-style reasoning techniques ⓘ Skolemization ⓘ axiom selection ⓘ clausification ⓘ equality reasoning ⓘ interpolation support ⓘ model generation ⓘ portfolio modes ⓘ preprocessing ⓘ proof output ⓘ proof search heuristics ⓘ resolution-based calculus ⓘ rewriting ⓘ saturation-based reasoning ⓘ strategy scheduling ⓘ superposition calculus ⓘ symbol elimination ⓘ term indexing ⓘ |
| hasInputFormat |
CNF
ⓘ
FOF ⓘ TFF ⓘ THF (via translations) ⓘ TPTP ⓘ |
| hasOutput |
models for satisfiable problems
ⓘ
refutational proofs ⓘ satisfiability results ⓘ unsatisfiability results ⓘ |
| hasProperty |
command-line tool
ⓘ
high-performance ⓘ research-oriented ⓘ state-of-the-art ⓘ |
| relatedTo |
CVC4
ⓘ
surface form:
CVC4 SMT solver
Coq ⓘ
surface form:
Coq proof assistant
Vampire automated theorem prover self-linksurface differs ⓘ
surface form:
E automated theorem prover
Isabelle proof assistant ⓘ SPASS automated theorem prover ⓘ Z3 SMT solver ⓘ |
| supportsLogic |
first-order logic
ⓘ
first-order logic with equality ⓘ many-sorted first-order logic ⓘ |
| usedIn |
CADE ATP System Competition
ⓘ
TPTP problem library experiments ⓘ automated deduction competitions ⓘ formal methods research ⓘ industrial verification case studies ⓘ |
How these facts were elicited
The pipeline generated the facts above by prompting gpt-5.1 with this entity's name + description and the instruction below.
Instruction
You are a knowledge base construction expert. Given a subject entity and a description of it, return factual statements that you know for the subject as a JSON list of dictionaries(triples), where keys must be "subject", "predicate" and "object". The number of facts may be very high, between 25 to 50 or more, for very popular subjects. For less popular subjects, the number of facts can be very low, like 5 or 10. # Requirements - If you don't know the subject at all, return an empty list. - If the subject is not a named entity, return an empty list. - Include at least one triple where predicate is "instanceOf". - Do not get too wordy. - Separate several objects into multiple triples with one object.
Input
Subject: Vampire automated theorem prover Description of subject: Vampire automated theorem prover is a high-performance first-order logic reasoning system widely used in automated deduction and formal verification research.
Referenced by (2)
Full triples — surface form annotated when it differs from this entity's canonical label.
Vampire automated theorem prover
→
relatedTo
→
Vampire automated theorem prover
self-linksurface differs
ⓘ
this entity surface form:
E automated theorem prover