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: IC3: Incremental Construction of Inductive Clauses for Indubitable Correctness | Statement: [Kenneth McMillan, notableWork, IC3: Incremental Construction of Inductive Clauses for Indubitable Correctness]

Target entity: IC3: Incremental Construction of Inductive Clauses for Indubitable Correctness
Context triple: [Kenneth McMillan, notableWork, IC3: Incremental Construction of Inductive Clauses for Indubitable Correctness]

• A. Satisfiability Modulo Theories (SMT)
  Satisfiability Modulo Theories (SMT) is a framework in computer science and mathematical logic for deciding the satisfiability of logical formulas with respect to background theories such as arithmetic, bit-vectors, arrays, and data types, widely used in verification, synthesis, and automated reasoning.
• B. Nelson–Oppen combination method
  The Nelson–Oppen combination method is a decision procedure framework that combines satisfiability solvers for different first-order theories to determine the satisfiability of formulas in their union.
• C. 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.
• D. DPLL(T)
  DPLL(T) is a framework that extends the classic DPLL SAT-solving algorithm with theory solvers to efficiently decide satisfiability modulo background theories such as arithmetic, arrays, or bit-vectors.
• E. Z3: An Efficient SMT Solver
  Z3: An Efficient SMT Solver is a high-performance satisfiability modulo theories (SMT) solver widely used in program verification, formal methods, and automated reasoning.
• 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: IC3: Incremental Construction of Inductive Clauses for Indubitable Correctness
Triple: [Kenneth McMillan, notableWork, IC3: Incremental Construction of Inductive Clauses for Indubitable Correctness]

IC3: Incremental Construction of Inductive Clauses for Indubitable Correctness is a seminal model checking algorithm introduced by Kenneth McMillan that incrementally builds inductive invariants to efficiently verify hardware and software system correctness.

Target entity: IC3: Incremental Construction of Inductive Clauses for Indubitable Correctness
Target entity description: IC3: Incremental Construction of Inductive Clauses for Indubitable Correctness is a seminal model checking algorithm introduced by Kenneth McMillan that incrementally builds inductive invariants to efficiently verify hardware and software system correctness.

• A. Satisfiability Modulo Theories (SMT)
  Satisfiability Modulo Theories (SMT) is a framework in computer science and mathematical logic for deciding the satisfiability of logical formulas with respect to background theories such as arithmetic, bit-vectors, arrays, and data types, widely used in verification, synthesis, and automated reasoning.
• B. Nelson–Oppen combination method
  The Nelson–Oppen combination method is a decision procedure framework that combines satisfiability solvers for different first-order theories to determine the satisfiability of formulas in their union.
• C. 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.
• D. DPLL(T)
  DPLL(T) is a framework that extends the classic DPLL SAT-solving algorithm with theory solvers to efficiently decide satisfiability modulo background theories such as arithmetic, arrays, or bit-vectors.
• E. Z3: An Efficient SMT Solver
  Z3: An Efficient SMT Solver is a high-performance satisfiability modulo theories (SMT) solver widely used in program verification, formal methods, and automated reasoning.
• F. None of above. chosen