Triple

T9810247
Position Surface form Disambiguated ID Type / Status
Subject Markus Wenzel E238249 entity
Predicate notableWork P4 FINISHED
Object Isabelle/ML
Isabelle/ML is the ML-based implementation and extension language used to develop and script the Isabelle interactive theorem prover.
 E822912 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: Isabelle/ML | Statement: [Markus Wenzel, notableWork, Isabelle/ML]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07 
Target entity: Isabelle/ML
Context triple: [Markus Wenzel, notableWork, Isabelle/ML]
  • A. 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.
  • 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. Boyer–Moore theorem prover
    The Boyer–Moore theorem prover is an influential automated reasoning system for first-order logic and recursive function theory, notable for pioneering techniques in mechanical proof and program verification.
  • D. Hoare logic
    Hoare logic is a formal system in computer science used to reason rigorously about the correctness of computer programs using logical assertions about program states.
  • E. 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.
  • 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: Isabelle/ML
Triple: [Markus Wenzel, notableWork, Isabelle/ML]
Generated description
Isabelle/ML is the ML-based implementation and extension language used to develop and script the Isabelle interactive theorem prover.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07 
Target entity: Isabelle/ML
Target entity description: Isabelle/ML is the ML-based implementation and extension language used to develop and script the Isabelle interactive theorem prover.
  • A. 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.
  • 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. Boyer–Moore theorem prover
    The Boyer–Moore theorem prover is an influential automated reasoning system for first-order logic and recursive function theory, notable for pioneering techniques in mechanical proof and program verification.
  • D. Hoare logic
    Hoare logic is a formal system in computer science used to reason rigorously about the correctness of computer programs using logical assertions about program states.
  • E. 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.
  • 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_69ca84defac48190abc1148804f184c1 completed March 30, 2026, 2:12 p.m.
NER Named-entity recognition batch_69cdb220310c8190a16ca0b746f0ef7a completed April 2, 2026, 12:02 a.m.
NED1 Entity disambiguation (via context triple) batch_69d1cc5b4dd8819088c86946b4eb8a39 completed April 5, 2026, 2:43 a.m.
NEDg Description generation batch_69d1cd7f41448190b387109235dbc7f5 completed April 5, 2026, 2:48 a.m.
NED2 Entity disambiguation (via description) batch_69d1cdefca5c8190a673caca42aaa7d0 completed April 5, 2026, 2:50 a.m.
Created at: March 30, 2026, 8:30 p.m.