Triple
T13166229
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Vampire automated theorem prover |
E312855
|
entity |
| Predicate | relatedTo |
P37
|
FINISHED |
| Object | CVC4 SMT solver |
E904159
|
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: CVC4 SMT solver | Statement: [Vampire automated theorem prover, relatedTo, CVC4 SMT solver]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: CVC4 SMT solver Context triple: [Vampire automated theorem prover, relatedTo, CVC4 SMT solver]
-
A.
CVC4
chosen
CVC4 is an open-source automated theorem prover and SMT (Satisfiability Modulo Theories) solver used for verifying logical formulas across a variety of theories such as arithmetic, bit-vectors, arrays, and datatypes.
-
B.
CVC5
CVC5 is an open-source, state-of-the-art Satisfiability Modulo Theories (SMT) solver used for automated reasoning and formal verification tasks.
-
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.
Z3: An Efficient SMT Solver
Z3: An Efficient SMT Solver is a high-performance satisfiability modulo theories (SMT) solver widely used in program verification, formal methods, and automated reasoning.
-
E.
Z3 SMT solver
Z3 SMT solver is a high-performance Satisfiability Modulo Theories (SMT) solver developed at Microsoft Research, widely used in program verification, formal methods, and automated reasoning.
- 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.