Triple
T14981618
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Matt Kaufmann |
E373588
|
entity |
| Predicate | notablePublication |
P4
|
FINISHED |
| Object | "ACL2: An Industrial Strength Version of Nqthm" |
E347188
|
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: "ACL2: An Industrial Strength Version of Nqthm" | Statement: [Matt Kaufmann, notablePublication, "ACL2: An Industrial Strength Version of Nqthm"]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: "ACL2: An Industrial Strength Version of Nqthm" Context triple: [Matt Kaufmann, notablePublication, "ACL2: An Industrial Strength Version of Nqthm"]
-
A.
ACL2 theorem proving system
chosen
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.
-
B.
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.
-
C.
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.
-
D.
"The Complexity of Theorem-Proving Procedures"
"The Complexity of Theorem-Proving Procedures" is Stephen Cook’s landmark 1971 paper that introduced the concept of NP-completeness and proved the Boolean satisfiability problem (SAT) to be NP-complete, laying the foundation for modern computational complexity theory.
-
E.
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.
- 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_69d85ccbbcd48190acb56e7cf104d8ad |
completed | April 10, 2026, 2:13 a.m. |
| NER | Named-entity recognition | batch_69ded6fe42a081909308f788fdf024d5 |
completed | April 15, 2026, 12:08 a.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69fe8bef015c8190bdfb1b9144b2a55c |
completed | May 9, 2026, 1:20 a.m. |
Created at: April 10, 2026, 2:52 a.m.