Triple
T2929951
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Andrei Voronkov |
E78936
|
entity |
| Predicate | notableWork |
P4
|
FINISHED |
| Object |
Vampire automated theorem prover
Vampire automated theorem prover is a high-performance first-order logic reasoning system widely used in automated deduction and formal verification research.
|
E312855
|
NE FINISHED |
How this triple was built (4 steps)
Every LLM step that produced this triple, in pipeline order — named-entity classification, the disambiguation choices (the exact options shown, with the pick highlighted), and the generated description. The batch + timestamp of each is in the Provenance table below.
NER
Named-entity recognition
gpt-5-mini
Instruction
Given a phrase, classify it is english named entity (e.g., persons, organizations, works of art) in Latin script, or not (e.g., literals, dates, URLs, verbose phrases). For disambiguation, the statement where the phrase occurs as object is also given. Please return a JSON object with `phrase` (string, the phrase being analyzed) and `is_ne` (boolean, indicating whether the phrase is a Named Entity).
Input
Phrase: Vampire automated theorem prover | Statement: [Andrei Voronkov, notableWork, Vampire automated theorem prover]
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.
NEDg
Description generation
gpt-5.1
Instruction
Generate a one-sentence description of the target entity. You are given a context triple in the form (subject, predicate, object), where the object is the target entity. # Instructions Use the triple to infer relevant information about the entity. Describe the entity based on what is most defining, well-known. Avoid repeating the information from the triple, unless really essential. # Response Format Return only the sentence: "Description: [one-sentence description of the target entity]"
Input
Entity: Vampire automated theorem prover Triple: [Andrei Voronkov, notableWork, Vampire automated theorem prover]
Generated description
Vampire automated theorem prover is a high-performance first-order logic reasoning system widely used in automated deduction and formal verification research.
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
Provenance (5 batches)
The batch behind each pipeline step, in order, with when it ran. Timestamps are batch-level — stages were processed in waves, so the object chain (NER → NED1 → NEDg → NED2) reads in order, but predicate / elicitation batches can sit in a different wave.
| Step | Stage | Batch ID | Status | When |
|---|---|---|---|---|
| creating | Elicitation | batch_69ad8b0d40b481908bc2a5fa2e73c3fb |
completed | March 8, 2026, 2:43 p.m. |
| NER | Named-entity recognition | batch_69ad980191388190ac2455a7d9867be3 |
completed | March 8, 2026, 3:38 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69b086703868819083eacc3fe392fde1 |
completed | March 10, 2026, 9 p.m. |
| NEDg | Description generation | batch_69b0d21ad8908190bf232b48d8766f59 |
completed | March 11, 2026, 2:23 a.m. |
| NED2 | Entity disambiguation (via description) | batch_69b0d278538481909f573d77cb0338da |
completed | March 11, 2026, 2:24 a.m. |
Created at: March 8, 2026, 2:55 p.m.