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