Triple
T13166226
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Vampire automated theorem prover |
E312855
|
entity |
| Predicate | relatedTo |
P37
|
FINISHED |
| Object | E automated theorem prover |
E312855
|
NE FINISHED |
How this triple was built (2 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: E automated theorem prover | Statement: [Vampire automated theorem prover, relatedTo, E automated theorem prover]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: E automated theorem prover Context triple: [Vampire automated theorem prover, relatedTo, E automated theorem prover]
-
A.
Vampire automated theorem prover
chosen
Vampire automated theorem prover is a high-performance first-order logic reasoning system widely used in automated deduction and formal verification research.
-
B.
Boyer–Moore theorem prover
The Boyer–Moore theorem prover is an influential automated reasoning system for first-order logic and recursive function theory, notable for pioneering techniques in mechanical proof and program verification.
-
C.
HOL theorem prover
The HOL theorem prover is an interactive proof assistant for higher-order logic, widely used in formal verification of hardware, software, and mathematical theories.
-
D.
Handbook of Automated Reasoning
The "Handbook of Automated Reasoning" is a comprehensive reference work that surveys the theories, methods, and tools used in the field of automated theorem proving and formal reasoning in computer science and logic.
-
E.
ACL2 theorem proving system
The ACL2 theorem proving system is an automated reasoning tool and programming language based on a subset of Common Lisp, widely used for modeling and mechanically verifying hardware, software, and mathematical theorems.
- F. None of above.
- G. Unsure - the case is ambiguous/there is not enough information to decide.
Provenance (3 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_69d806ac3ee081909b2fd27d060aa974 |
completed | April 9, 2026, 8:06 p.m. |
| NER | Named-entity recognition | batch_69d98c2c317881908cc715c97d915f77 |
completed | April 10, 2026, 11:47 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69f6eaf6c9ec8190bc0097d62e57e52a |
completed | May 3, 2026, 6:28 a.m. |
Created at: April 9, 2026, 9:13 p.m.