Triple

T2169674
Position Surface form Disambiguated ID Type / Status
Subject Nikolaj Bjørner E46992 entity
Predicate notableWork P4 FINISHED
Object 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.
 E239177 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: Z3: An Efficient SMT Solver | Statement: [Nikolaj Bjørner, notableWork, Z3: An Efficient SMT Solver]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07 
Target entity: Z3: An Efficient SMT Solver
Context triple: [Nikolaj Bjørner, notableWork, Z3: An Efficient SMT Solver]
  • A. 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.
  • B. Isabelle/HOL: A Proof Assistant for Higher-Order Logic
    "Isabelle/HOL: A Proof Assistant for Higher-Order Logic" is a foundational book and system documentation that presents the Isabelle/HOL interactive theorem prover, widely used for formal verification and higher-order logic reasoning in computer science and mathematics.
  • C. 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.
  • D. Conference on Automated Deduction
    The Conference on Automated Deduction (CADE) is a leading international research conference focused on the theory and applications of automated reasoning and formal deduction in computer science and mathematics.
  • E. Journal of Automated Reasoning
    The Journal of Automated Reasoning is a peer-reviewed academic journal focusing on research in automated reasoning, formal methods, and related areas of computer science and logic.
  • 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: Z3: An Efficient SMT Solver
Triple: [Nikolaj Bjørner, notableWork, Z3: An Efficient SMT Solver]
Generated description
Z3: An Efficient SMT Solver is a high-performance satisfiability modulo theories (SMT) solver widely used in program verification, formal methods, and automated reasoning.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07 
Target entity: Z3: An Efficient SMT Solver
Target entity description: Z3: An Efficient SMT Solver is a high-performance satisfiability modulo theories (SMT) solver widely used in program verification, formal methods, and automated reasoning.
  • A. 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.
  • B. Isabelle/HOL: A Proof Assistant for Higher-Order Logic
    "Isabelle/HOL: A Proof Assistant for Higher-Order Logic" is a foundational book and system documentation that presents the Isabelle/HOL interactive theorem prover, widely used for formal verification and higher-order logic reasoning in computer science and mathematics.
  • C. 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.
  • D. Conference on Automated Deduction
    The Conference on Automated Deduction (CADE) is a leading international research conference focused on the theory and applications of automated reasoning and formal deduction in computer science and mathematics.
  • E. Journal of Automated Reasoning
    The Journal of Automated Reasoning is a peer-reviewed academic journal focusing on research in automated reasoning, formal methods, and related areas of computer science and logic.
  • 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_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_69ae58f511a08190880fbde8900d59df completed March 9, 2026, 5:21 a.m.
NEDg Description generation batch_69ae59a9b010819081491e988184b386 completed March 9, 2026, 5:24 a.m.
NED2 Entity disambiguation (via description) batch_69ae5a12f11c81908cc345905f0a485e completed March 9, 2026, 5:26 a.m.
Created at: March 4, 2026, 7:45 p.m.