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