Triple
T11090176
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Satisfiability Modulo Theories |
E262229
|
entity |
| Predicate | usesAlgorithm |
P89
|
FINISHED |
| Object | DPLL(T) |
E904156
|
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: DPLL(T) | Statement: [Satisfiability Modulo Theories, usesAlgorithm, DPLL(T)]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: DPLL(T) Context triple: [Satisfiability Modulo Theories, usesAlgorithm, DPLL(T)]
-
A.
DPLL(T)
chosen
DPLL(T) is a framework that extends the classic DPLL SAT-solving algorithm with theory solvers to efficiently decide satisfiability modulo background theories such as arithmetic, arrays, or bit-vectors.
-
B.
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.
-
C.
Nelson–Oppen combination method
The Nelson–Oppen combination method is a decision procedure framework that combines satisfiability solvers for different first-order theories to determine the satisfiability of formulas in their union.
-
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.
Boolector
Boolector is an efficient SMT solver specialized in bit-vectors, arrays, and uninterpreted functions, widely used in formal verification and model checking.
- 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_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. |
Created at: April 8, 2026, 9:27 p.m.