Triple

T23281161
Position Surface form Disambiguated ID Type / Status
Subject Curry–Howard correspondence E588866 entity
Predicate usedIn P98 FINISHED
Object Lean theorem prover — NE NERFINISHED

How this triple was built (3 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: Lean theorem prover | Statement: [Curry–Howard correspondence, usedIn, Lean theorem prover]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07 
Target entity: Lean theorem prover
Context triple: [Curry–Howard correspondence, usedIn, Lean theorem prover]
  • 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. Archive of Formal Proofs
    The Archive of Formal Proofs is an online, peer-reviewed collection of machine-checked mathematical and computer science proofs formalized primarily in the Isabelle proof assistant.
  • 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.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07 
Target entity: Lean theorem prover
Target entity description: Lean theorem prover is an interactive proof assistant and programming language designed for writing and verifying formal mathematical proofs and certified software.
  • 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. Archive of Formal Proofs
    The Archive of Formal Proofs is an online, peer-reviewed collection of machine-checked mathematical and computer science proofs formalized primarily in the Isabelle proof assistant.
  • 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 (2 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_69e25d16e2c08190a291de254703129e completed April 17, 2026, 4:17 p.m.
NER Named-entity recognition batch_69f19642b46481909fd455acd2155792 completed April 29, 2026, 5:25 a.m.
Created at: April 17, 2026, 4:57 p.m.