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