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