Triple
T9839145
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Z3 |
E239177
|
entity |
| Predicate | supportsFeature |
P203
|
FINISHED |
| Object | MaxSMT |
E537213
|
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: MaxSMT | Statement: [Z3, supportsFeature, MaxSMT]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: MaxSMT Context triple: [Z3, supportsFeature, MaxSMT]
-
A.
Max-SAT
chosen
Max-SAT is the optimization variant of the Boolean satisfiability problem in which the goal is to find an assignment that satisfies the maximum possible number of clauses, making it a central problem in approximation algorithms and complexity theory.
-
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.
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.
-
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.
TNTSAT
TNTSAT is a French free-to-air satellite television platform that broadcasts the national digital terrestrial TV channels via satellite.
- 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_69ca84e3f0c48190ada72a65ebd50efd |
completed | March 30, 2026, 2:12 p.m. |
| NER | Named-entity recognition | batch_69cdb34921b881909836ba0f5b42a27b |
completed | April 2, 2026, 12:07 a.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69d1d5d145ac8190ad10a4328216ef54 |
completed | April 5, 2026, 3:24 a.m. |
Created at: March 30, 2026, 8:33 p.m.