Triple

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).

Phrase: "The Complexity of Theorem-Proving Procedures" | Statement: [Stephen Cook, notableWork, "The Complexity of Theorem-Proving Procedures"]

Target entity: "The Complexity of Theorem-Proving Procedures"
Context triple: [Stephen Cook, notableWork, "The Complexity of Theorem-Proving Procedures"]

• A. 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.
• B. the Logic Theorist program
  The Logic Theorist program was an early artificial intelligence system developed in the 1950s that automatically proved theorems in symbolic logic and is often regarded as the first AI program.
• C. 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.
• D. Davis–Putnam algorithm
  The Davis–Putnam algorithm is a pioneering procedure in automated theorem proving and propositional logic satisfiability that laid foundational groundwork for modern SAT solvers.
• E. Recherches sur la théorie de la démonstration
  Recherches sur la théorie de la démonstration is Jacques Herbrand’s foundational work in mathematical logic, introducing key results in proof theory and what is now known as Herbrand’s theorem.
• F. None of above. chosen
• G. Unsure - the case is ambiguous/there is not enough information to decide.

Generate a one-sentence description of the target entity. 
You are given a context triple in the form (subject, predicate, object), where the object is the target entity. 
# Instructions
Use the triple to infer relevant information about the entity. Describe the entity based on what is most defining, well-known. 
Avoid repeating the information from the triple, unless really essential.
# Response Format
Return only the sentence: "Description: [one-sentence description of the target entity]"

Entity: "The Complexity of Theorem-Proving Procedures"
Triple: [Stephen Cook, notableWork, "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.

Target entity: "The Complexity of Theorem-Proving Procedures"
Target entity description: "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.

• A. 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.
• B. the Logic Theorist program
  The Logic Theorist program was an early artificial intelligence system developed in the 1950s that automatically proved theorems in symbolic logic and is often regarded as the first AI program.
• C. 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.
• D. Davis–Putnam algorithm
  The Davis–Putnam algorithm is a pioneering procedure in automated theorem proving and propositional logic satisfiability that laid foundational groundwork for modern SAT solvers.
• E. Recherches sur la théorie de la démonstration
  Recherches sur la théorie de la démonstration is Jacques Herbrand’s foundational work in mathematical logic, introducing key results in proof theory and what is now known as Herbrand’s theorem.
• F. None of above. chosen