Exercise logic.propositional.cnf.unicode
Description
Proposition to CNF (unicode support)
Derivation
Final term is not finished¬(r ∧ (((T ∧ r) ∨ F) ↔ r) ∧ T) ∧ ¬(r ∧ (r ↔ r) ∧ T) ∧ T
⇒ logic.propositional.truezeroand¬(r ∧ ((r ∨ F) ↔ r) ∧ T) ∧ ¬(r ∧ (r ↔ r) ∧ T) ∧ T