Triple
T6816299
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Robert S. Boyer |
E156763
|
entity |
| Predicate | knownFor |
P22
|
FINISHED |
| Object | Nqthm theorem prover |
E347187
|
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: Nqthm theorem prover | Statement: [Robert S. Boyer, knownFor, Nqthm theorem prover]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Nqthm theorem prover Context triple: [Robert S. Boyer, knownFor, Nqthm theorem prover]
-
A.
Boyer–Moore theorem prover
chosen
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.
-
B.
ACL2 theorem proving system
The ACL2 theorem proving system is an automated reasoning tool and programming language based on a subset of Common Lisp, widely used for modeling and mechanically verifying hardware, software, and mathematical theorems.
-
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.
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.
-
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_69c68828b26c819090fe9df7612bbc27 |
completed | March 27, 2026, 1:37 p.m. |
| NER | Named-entity recognition | batch_69c6d32dc19c8190a871cc1ff1471a58 |
completed | March 27, 2026, 6:57 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69c723e0c62c8190b3b3b092ea48d4c5 |
completed | March 28, 2026, 12:42 a.m. |
Created at: March 27, 2026, 2:17 p.m.