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: Newman’s lemma | Statement: [Church–Rosser property, relatedTo, Newman’s lemma]

Target entity: Newman’s lemma
Context triple: [Church–Rosser property, relatedTo, Newman’s lemma]

• A. Bailey lemma
  The Bailey lemma is a key result in the theory of basic hypergeometric series that provides a systematic method for generating Rogers–Ramanujan-type identities and other q-series relations.
• B. Ky Fan’s lemma
  Ky Fan’s lemma is a combinatorial topological result that generalizes Tucker’s lemma and provides conditions guaranteeing the existence of certain balanced or fully labeled simplices in labeled triangulations of spheres or simplices.
• C. Church–Rosser property
  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.
• D. Löb's theorem
  Löb's theorem is a fundamental result in mathematical logic that characterizes when a sufficiently strong formal system can prove statements about its own provability, closely refining the insights of Gödel’s incompleteness theorems.
• E. 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.
• 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: Newman’s lemma
Triple: [Church–Rosser property, relatedTo, Newman’s lemma]

Newman’s lemma is a result in rewriting theory that states a terminating abstract reduction system is confluent if and only if it is locally confluent.

Target entity: Newman’s lemma
Target entity description: Newman’s lemma is a result in rewriting theory that states a terminating abstract reduction system is confluent if and only if it is locally confluent.

• A. Bailey lemma
  The Bailey lemma is a key result in the theory of basic hypergeometric series that provides a systematic method for generating Rogers–Ramanujan-type identities and other q-series relations.
• B. Ky Fan’s lemma
  Ky Fan’s lemma is a combinatorial topological result that generalizes Tucker’s lemma and provides conditions guaranteeing the existence of certain balanced or fully labeled simplices in labeled triangulations of spheres or simplices.
• C. 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.
• D. Löb's theorem
  Löb's theorem is a fundamental result in mathematical logic that characterizes when a sufficiently strong formal system can prove statements about its own provability, closely refining the insights of Gödel’s incompleteness theorems.
• E. 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.
• F. None of above.