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