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: SPASS automated theorem prover | Statement: [Vampire automated theorem prover, relatedTo, SPASS automated theorem prover]

Target entity: SPASS automated theorem prover
Context triple: [Vampire automated theorem prover, relatedTo, SPASS automated theorem prover]

• A. 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.
• B. 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.
• C. 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.
• 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. 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.
• 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: SPASS automated theorem prover
Triple: [Vampire automated theorem prover, relatedTo, 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.

Target entity: SPASS automated theorem prover
Target entity description: 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.

• A. 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.
• B. 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.
• C. 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.
• 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. 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.
• F. None of above. chosen