Exercise logic.propositional.cnf.unicode

Description
Proposition to CNF (unicode support)

Derivation

Final term is not finished

¬(((((r ∧ r) ∨ (¬r ∧ ¬r)) ∧ T) ∨ (((r ∧ r ∧ T) ∨ (¬r ∧ ¬r)) ∧ F)) ∧ r)

⇒ logic.propositional.truezeroand

¬(((((r ∧ r) ∨ (¬r ∧ ¬r)) ∧ T) ∨ (((r ∧ r) ∨ (¬r ∧ ¬r)) ∧ F)) ∧ r)