Triple

T5234095
Position Surface form Disambiguated ID Type / Status
Subject Melvin Fitting E118179 entity
Predicate notableWork P4 FINISHED
Object First-Order Logic and Automated Theorem Proving (book with Richard L. Mendelsohn) E504787 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: First-Order Logic and Automated Theorem Proving (book with Richard L. Mendelsohn) | Statement: [Melvin Fitting, notableWork, First-Order Logic and Automated Theorem Proving (book with Richard L. Mendelsohn)]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07 
Target entity: First-Order Logic and Automated Theorem Proving (book with Richard L. Mendelsohn)
Context triple: [Melvin Fitting, notableWork, First-Order Logic and Automated Theorem Proving (book with Richard L. Mendelsohn)]
  • 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. "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.
  • 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. Hilbert-style deductive systems
    Hilbert-style deductive systems are axiomatic proof systems in mathematical logic that use a small set of axiom schemas and a few inference rules (typically including modus ponens) to derive theorems in formal theories such as Zermelo–Fraenkel set theory.
  • 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_69bd4467db0881909b3b0982df32cc8f completed March 20, 2026, 12:58 p.m.
NER Named-entity recognition batch_69bd7b04c03481908d901788ce2c4128 completed March 20, 2026, 4:51 p.m.
NED1 Entity disambiguation (via context triple) batch_69befe6323708190bfc95f01c65dc234 completed March 21, 2026, 8:24 p.m.
Created at: March 20, 2026, 1:49 p.m.