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: Boolean satisfiability problem | Statement: [Cook–Levin theorem, firstNPCompleteProblem, Boolean satisfiability problem]

Target entity: Boolean satisfiability problem
Context triple: [Cook–Levin theorem, firstNPCompleteProblem, Boolean satisfiability problem]

• A. 3-SAT
  3-SAT is a classic Boolean satisfiability problem where each clause has exactly three literals and which serves as a fundamental NP-complete benchmark in computational complexity theory.
• B. 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.
• C. Max-3-SAT
  Max-3-SAT is an optimization variant of the Boolean satisfiability problem where the goal is to maximize the number of satisfied clauses, each containing exactly three literals, and it serves as a central problem in the study of approximation algorithms and hardness of approximation.
• D. Max-SAT
  Max-SAT is the optimization variant of the Boolean satisfiability problem in which the goal is to find an assignment that satisfies the maximum possible number of clauses, making it a central problem in approximation algorithms and complexity theory.
• E. Unique-SAT
  Unique-SAT is a specialized version of the Boolean satisfiability problem where instances are guaranteed to have at most one satisfying assignment, and it plays a central role in complexity theory due to its connections to randomness and NP-completeness.
• F. None of above. chosen
• G. Unsure - the case is ambiguous/there is not enough information to decide.

Target entity: Boolean satisfiability problem
Target entity description: The Boolean satisfiability problem (SAT) is the canonical NP-complete decision problem of determining whether there exists an assignment of truth values to variables that makes a given Boolean formula evaluate to true.

• A. 3-SAT
  3-SAT is a classic Boolean satisfiability problem where each clause has exactly three literals and which serves as a fundamental NP-complete benchmark in computational complexity theory.
• B. 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.
• C. Max-3-SAT
  Max-3-SAT is an optimization variant of the Boolean satisfiability problem where the goal is to maximize the number of satisfied clauses, each containing exactly three literals, and it serves as a central problem in the study of approximation algorithms and hardness of approximation.
• D. Max-SAT
  Max-SAT is the optimization variant of the Boolean satisfiability problem in which the goal is to find an assignment that satisfies the maximum possible number of clauses, making it a central problem in approximation algorithms and complexity theory.
• E. Unique-SAT
  Unique-SAT is a specialized version of the Boolean satisfiability problem where instances are guaranteed to have at most one satisfying assignment, and it plays a central role in complexity theory due to its connections to randomness and NP-completeness.
• F. None of above. chosen