Triple
T2169668
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Nikolaj Bjørner |
E46992
|
entity |
| Predicate | coDeveloped |
P6901
|
FINISHED |
| Object | Z3 SMT solver |
E239176
|
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: Z3 SMT solver | Statement: [Nikolaj Bjørner, coDeveloped, Z3 SMT solver]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Z3 SMT solver Context triple: [Nikolaj Bjørner, coDeveloped, Z3 SMT solver]
-
A.
Z3 SMT solver
chosen
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.
-
B.
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.
-
C.
Davis–Putnam algorithm
The Davis–Putnam algorithm is a pioneering procedure in automated theorem proving and propositional logic satisfiability that laid foundational groundwork for modern SAT solvers.
-
D.
SCIP
SCIP is the ICAO airport code for Mataveri International Airport, the main air gateway to Easter Island in Chile.
-
E.
Isabelle proof assistant
Isabelle proof assistant is a widely used interactive theorem prover and generic proof assistant designed for formal verification and mathematical logic, particularly known for its support of higher-order logic.
- 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_69a88a184cbc8190877791f6552c2484 |
completed | March 4, 2026, 7:38 p.m. |
| NER | Named-entity recognition | batch_69abbeaeb58881908ad34f7b253bac2a |
completed | March 7, 2026, 5:59 a.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69ae653b6ae48190ab5c7e6bf2dcfa6f |
completed | March 9, 2026, 6:14 a.m. |
Created at: March 4, 2026, 7:45 p.m.