Triple

T4493127
Position Surface form Disambiguated ID Type / Status
Subject Gödel's ontological proof E100625 entity
Predicate verifiedIn P50856 FINISHED
Object Coq
Coq is an interactive theorem prover and functional programming language based on dependent type theory, widely used for formally verifying mathematical proofs and software correctness.
 E446868 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: Coq | Statement: [Gödel's ontological proof, verifiedIn, Coq]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07 
Target entity: Coq
Context triple: [Gödel's ontological proof, verifiedIn, Coq]
  • A. coq gaulois
    Coq gaulois is the French term for the Gallic rooster, a national emblem of France symbolizing courage, pride, and the French nation.
  • B. 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.
  • 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. OCaml
    OCaml is a statically typed functional programming language from the ML family, known for its powerful type system, pattern matching, and efficient native code compilation.
  • E. ReasonML
    ReasonML is a syntax and toolchain for the OCaml language that offers a JavaScript-friendly, type-safe alternative for building web and native applications.
  • 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: Coq
Triple: [Gödel's ontological proof, verifiedIn, Coq]
Generated description
Coq is an interactive theorem prover and functional programming language based on dependent type theory, widely used for formally verifying mathematical proofs and software correctness.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07 
Target entity: Coq
Target entity description: Coq is an interactive theorem prover and functional programming language based on dependent type theory, widely used for formally verifying mathematical proofs and software correctness.
  • A. coq gaulois
    Coq gaulois is the French term for the Gallic rooster, a national emblem of France symbolizing courage, pride, and the French nation.
  • B. 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.
  • 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. OCaml
    OCaml is a statically typed functional programming language from the ML family, known for its powerful type system, pattern matching, and efficient native code compilation.
  • E. ReasonML
    ReasonML is a syntax and toolchain for the OCaml language that offers a JavaScript-friendly, type-safe alternative for building web and native applications.
  • 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_69bd43cdf15081909a4fa2585ff63b3e completed March 20, 2026, 12:55 p.m.
NER Named-entity recognition batch_69bd6231856c8190be9386a0ae15e7cf completed March 20, 2026, 3:05 p.m.
NED1 Entity disambiguation (via context triple) batch_69bd67b40fd4819098636b6f29304312 completed March 20, 2026, 3:28 p.m.
NEDg Description generation batch_69bd688e84fc8190a8900be40e3cf694 completed March 20, 2026, 3:32 p.m.
NED2 Entity disambiguation (via description) batch_69bd69bcf10c8190bd6ceb6bc604b3f5 completed March 20, 2026, 3:37 p.m.
Created at: March 20, 2026, 12:59 p.m.