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