Triple
T11090188
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Satisfiability Modulo Theories |
E262229
|
entity |
| Predicate | hasSolver |
P55156
|
FINISHED |
| Object |
CVC5
CVC5 is an open-source, state-of-the-art Satisfiability Modulo Theories (SMT) solver used for automated reasoning and formal verification tasks.
|
E905300
|
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: CVC5 | Statement: [Satisfiability Modulo Theories, hasSolver, CVC5]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: CVC5 Context triple: [Satisfiability Modulo Theories, hasSolver, CVC5]
-
A.
CVC4
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.
Yices
Yices is a high-performance Satisfiability Modulo Theories (SMT) solver widely used in formal verification and automated reasoning.
-
C.
Boolector
Boolector is an efficient SMT solver specialized in bit-vectors, arrays, and uninterpreted functions, widely used in formal verification and model checking.
-
D.
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.
-
E.
SMTInterpol
SMTInterpol is an SMT solver focused on generating interpolants and solving satisfiability modulo theories problems, particularly over linear arithmetic and related theories.
- 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: CVC5 Triple: [Satisfiability Modulo Theories, hasSolver, CVC5]
Generated description
CVC5 is an open-source, state-of-the-art Satisfiability Modulo Theories (SMT) solver used for automated reasoning and formal verification tasks.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: CVC5 Target entity description: CVC5 is an open-source, state-of-the-art Satisfiability Modulo Theories (SMT) solver used for automated reasoning and formal verification tasks.
-
A.
CVC4
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.
Yices
Yices is a high-performance Satisfiability Modulo Theories (SMT) solver widely used in formal verification and automated reasoning.
-
C.
Boolector
Boolector is an efficient SMT solver specialized in bit-vectors, arrays, and uninterpreted functions, widely used in formal verification and model checking.
-
D.
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.
-
E.
SMTInterpol
SMTInterpol is an SMT solver focused on generating interpolants and solving satisfiability modulo theories problems, particularly over linear arithmetic and related theories.
- 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_69d6aa9a40d88190a373e2c7e48285db |
completed | April 8, 2026, 7:20 p.m. |
| NER | Named-entity recognition | batch_69d799e96ca08190838c8a04d1eb2a16 |
completed | April 9, 2026, 12:22 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69e42d66ded88190877a20a10f012d6b |
completed | April 19, 2026, 1:18 a.m. |
| NEDg | Description generation | batch_69e42e1daa3c8190b598adcf9bac00f3 |
completed | April 19, 2026, 1:21 a.m. |
| NED2 | Entity disambiguation (via description) | batch_69e42f415b1081909f9eedcb3640cdc3 |
completed | April 19, 2026, 1:26 a.m. |
Created at: April 8, 2026, 9:27 p.m.