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: Church–Rosser theorem | Statement: [Church–Rosser property, alsoKnownAs, Church–Rosser theorem]

Target entity: Church–Rosser theorem
Context triple: [Church–Rosser property, alsoKnownAs, Church–Rosser theorem]

• A. Church–Rosser property chosen
  The Church–Rosser property is a confluence property of rewriting systems stating that if an expression can be reduced in different ways, all reduction paths can be further reduced to a common equivalent form.
• B. Herbrand's theorem
  Herbrand's theorem is a fundamental result in mathematical logic and proof theory that characterizes the validity of first-order formulas via finite sets of ground instances, forming a basis for automated theorem proving.
• C. Knuth–Bendix completion algorithm
  The Knuth–Bendix completion algorithm is a procedure in term rewriting and automated theorem proving that transforms a set of equations into a confluent rewriting system, enabling decision of word problems in algebraic structures.
• D. Böhm–Jacopini theorem
  The Böhm–Jacopini theorem is a foundational result in computer science stating that any computer program can be written using only sequence, selection, and iteration constructs, without requiring goto statements.
• E. Tarski–Mostowski–Robinson theorem
  The Tarski–Mostowski–Robinson theorem is a fundamental result in model theory that characterizes when a class of structures is first-order axiomatizable, linking definability properties with closure under ultraproducts and isomorphisms.
• F. None of above.
• G. Unsure - the case is ambiguous/there is not enough information to decide.