Triple
T9566791
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | LCF theorem prover |
E230806
|
entity |
| Predicate | relatedTo |
P37
|
FINISHED |
| Object | Isabelle/HOL |
E238245
|
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: Isabelle/HOL | Statement: [LCF theorem prover, relatedTo, Isabelle/HOL]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Isabelle/HOL Context triple: [LCF theorem prover, relatedTo, Isabelle/HOL]
-
A.
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.
-
B.
Isabelle proof assistant
chosen
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.
-
C.
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.
-
D.
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.
-
E.
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.
- 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_69ca847f22188190a56e4a97625bef22 |
completed | March 30, 2026, 2:11 p.m. |
| NER | Named-entity recognition | batch_69cd996df4f08190b19bbaefb10a9789 |
completed | April 1, 2026, 10:17 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69d16149c7808190b476ec06e9780a03 |
completed | April 4, 2026, 7:06 p.m. |
Created at: March 30, 2026, 8:04 p.m.