Triple

T9566778
Position Surface form Disambiguated ID Type / Status
Subject LCF theorem prover E230806 entity
Predicate conceptualBasisFor P64521 FINISHED
Object HOL theorem prover family E807591 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: HOL theorem prover family | Statement: [LCF theorem prover, conceptualBasisFor, HOL theorem prover family]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07 
Target entity: HOL theorem prover family
Context triple: [LCF theorem prover, conceptualBasisFor, HOL theorem prover family]
  • A. HOL theorem prover chosen
    The HOL theorem prover is an interactive proof assistant for higher-order logic, widely used in formal verification of hardware, software, and mathematical theories.
  • B. 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.
  • 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. 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. 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.
  • 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_69d18214e1cc8190a66582a1af26cac3 completed April 4, 2026, 9:26 p.m.
Created at: March 30, 2026, 8:04 p.m.