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