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