Triple

T20836505
Position Surface form Disambiguated ID Type / Status
Subject Cook–Levin theorem E512972 entity
Predicate originalPaperTitle P6930 FINISHED
Object The Complexity of Theorem-Proving Procedures — NE NERFINISHED

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: The Complexity of Theorem-Proving Procedures | Statement: [Cook–Levin theorem, originalPaperTitle, The Complexity of Theorem-Proving Procedures]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07 
Target entity: The Complexity of Theorem-Proving Procedures
Context triple: [Cook–Levin theorem, originalPaperTitle, The Complexity of Theorem-Proving Procedures]
  • A. "The Complexity of Theorem-Proving Procedures" chosen
    "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.
  • B. A Computing Procedure for Quantification Theory
    "A Computing Procedure for Quantification Theory" is a seminal 1960 paper by Martin Davis and Hilary Putnam that introduced the Davis–Putnam algorithm, laying foundational work for automated theorem proving and propositional satisfiability.
  • C. First-Order Logic and Automated Theorem Proving
    "First-Order Logic and Automated Theorem Proving" is a foundational textbook that systematically introduces first-order logic while presenting key methods and algorithms used in automated theorem proving.
  • D. "Logic for Computer Science: Foundations of Automatic Theorem Proving"
    "Logic for Computer Science: Foundations of Automatic Theorem Proving" is a textbook that introduces the logical foundations and practical techniques underlying automated theorem proving and its applications in computer science.
  • E. Handbook of Automated Reasoning
    The "Handbook of Automated Reasoning" is a comprehensive reference work that surveys the theories, methods, and tools used in the field of automated theorem proving and formal reasoning in computer science and logic.
  • F. None of above.
  • G. Unsure - the case is ambiguous/there is not enough information to decide.

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_69e0b4cf62a88190bbf92351e9e57259 completed April 16, 2026, 10:07 a.m.
NER Named-entity recognition batch_69e6c326daec8190bd4caa41a4b38833 completed April 21, 2026, 12:21 a.m.
Created at: April 16, 2026, 12:42 p.m.