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