Triple

T3305991
Position Surface form Disambiguated ID Type / Status
Subject J Strother Moore E69450 entity
Predicate knownFor P22 FINISHED
Object 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.
 E347187 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: Boyer–Moore theorem prover | Statement: [J Strother Moore, knownFor, Boyer–Moore theorem prover]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07 
Target entity: Boyer–Moore theorem prover
Context triple: [J Strother Moore, knownFor, Boyer–Moore theorem prover]
  • 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. 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. Vampire automated theorem prover
    Vampire automated theorem prover is a high-performance first-order logic reasoning system widely used in automated deduction and formal verification research.
  • D. 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.
  • E. 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.
  • 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: Boyer–Moore theorem prover
Triple: [J Strother Moore, knownFor, Boyer–Moore theorem prover]
Generated description
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.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07 
Target entity: Boyer–Moore theorem prover
Target entity description: 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.
  • 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. 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. Vampire automated theorem prover
    Vampire automated theorem prover is a high-performance first-order logic reasoning system widely used in automated deduction and formal verification research.
  • D. 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.
  • E. 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.
  • 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_69ad859f218081909458d2cebbf57565 completed March 8, 2026, 2:20 p.m.
NER Named-entity recognition batch_69adb0c9470881908c36c1984fdbb67b completed March 8, 2026, 5:24 p.m.
NED1 Entity disambiguation (via context triple) batch_69b2f3e6e55881909417d54e0d8f0a26 completed March 12, 2026, 5:12 p.m.
NEDg Description generation batch_69b2fa93ebc0819084c4cdfdb8d6e48d completed March 12, 2026, 5:40 p.m.
NED2 Entity disambiguation (via description) batch_69b312b6e224819080957998acbed524 completed March 12, 2026, 7:23 p.m.
Created at: March 8, 2026, 3:11 p.m.