Triple

T20558696
Position Surface form Disambiguated ID Type / Status
Subject First-Order Logic and Automated Theorem Proving E504787 entity
Predicate title P38 FINISHED
Object First-Order Logic and Automated Theorem Proving — 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: First-Order Logic and Automated Theorem Proving | Statement: [First-Order Logic and Automated Theorem Proving, title, First-Order Logic and Automated Theorem Proving]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07 
Target entity: First-Order Logic and Automated Theorem Proving
Context triple: [First-Order Logic and Automated Theorem Proving, title, First-Order Logic and Automated Theorem Proving]
  • A. First-Order Logic and Automated Theorem Proving chosen
    "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.
  • B. 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.
  • C. "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.
  • 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. SPASS automated theorem prover
    SPASS automated theorem prover is a first-order logic theorem proving system known for its use of superposition calculus and its application in automated reasoning and formal verification.
  • 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_69e0b4b6587c8190aee63dc7cff244ea completed April 16, 2026, 10:06 a.m.
NER Named-entity recognition batch_69e6a5e178648190910795bae5422e50 completed April 20, 2026, 10:17 p.m.
Created at: April 16, 2026, 11:38 a.m.