Triple

T9810119

Position	Surface form	Disambiguated ID	Type / Status
Subject	Isabelle/HOL: A Proof Assistant for Higher-Order Logic	`E238246`	entity
Predicate	describes	`P264`	FINISHED
Object	Isar proof language The Isar proof language is a human-readable, structured language for writing formal proofs within the Isabelle/HOL proof assistant.	`E822910`	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: Isar proof language | Statement: [Isabelle/HOL: A Proof Assistant for Higher-Order Logic, describes, Isar proof language]

NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07

Target entity: Isar proof language
Context triple: [Isabelle/HOL: A Proof Assistant for Higher-Order Logic, describes, Isar proof language]

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. LCF theorem prover
The LCF theorem prover is an early interactive proof system that pioneered the use of higher-order logic and the LCF-style architecture, forming the conceptual basis for later provers like HOL and Isabelle.
D. HOL theorem prover
The HOL theorem prover is an interactive proof assistant for higher-order logic, widely used in formal verification of hardware, software, and mathematical theories.
E. 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.
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: Isar proof language
Triple: [Isabelle/HOL: A Proof Assistant for Higher-Order Logic, describes, Isar proof language]

Generated description

The Isar proof language is a human-readable, structured language for writing formal proofs within the Isabelle/HOL proof assistant.

NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07

Target entity: Isar proof language
Target entity description: The Isar proof language is a human-readable, structured language for writing formal proofs within the Isabelle/HOL proof assistant.

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. LCF theorem prover
The LCF theorem prover is an early interactive proof system that pioneered the use of higher-order logic and the LCF-style architecture, forming the conceptual basis for later provers like HOL and Isabelle.
D. HOL theorem prover
The HOL theorem prover is an interactive proof assistant for higher-order logic, widely used in formal verification of hardware, software, and mathematical theories.
E. 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.
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:29 p.m.