Triple
T9566790
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | LCF theorem prover |
E230806
|
entity |
| Predicate | relatedTo |
P37
|
FINISHED |
| Object |
HOL4
HOL4 is an interactive theorem prover for higher-order logic, widely used in formal verification and based on the LCF approach to ensuring soundness.
|
E807605
|
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: HOL4 | Statement: [LCF theorem prover, relatedTo, HOL4]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: HOL4 Context triple: [LCF theorem prover, relatedTo, HOL4]
-
A.
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.
-
B.
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.
-
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.
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.
-
E.
Twelf
Twelf is a logical framework and meta-logical tool used for specifying, implementing, and proving properties of deductive systems such as programming languages and logics.
- 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: HOL4 Triple: [LCF theorem prover, relatedTo, HOL4]
Generated description
HOL4 is an interactive theorem prover for higher-order logic, widely used in formal verification and based on the LCF approach to ensuring soundness.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: HOL4 Target entity description: HOL4 is an interactive theorem prover for higher-order logic, widely used in formal verification and based on the LCF approach to ensuring soundness.
-
A.
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.
-
B.
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.
-
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.
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.
-
E.
Twelf
Twelf is a logical framework and meta-logical tool used for specifying, implementing, and proving properties of deductive systems such as programming languages and logics.
- 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_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_69d152b09c808190aff32419f2cbb15f |
completed | April 4, 2026, 6:04 p.m. |
| NEDg | Description generation | batch_69d153d59844819086a0f50e6a7624b2 |
completed | April 4, 2026, 6:09 p.m. |
| NED2 | Entity disambiguation (via description) | batch_69d1546a503c81908edc9588adabc172 |
completed | April 4, 2026, 6:11 p.m. |
Created at: March 30, 2026, 8:04 p.m.