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