Exercise logic.propositional.cnf.unicode

Description
Proposition to CNF (unicode support)

Derivation

Final term is not finished

F ∨ ¬(((r ↔ r) ∧ r ∧ T) ∨ F)

⇒ logic.propositional.defequiv

F ∨ ¬((((r ∧ r) ∨ (¬r ∧ ¬r)) ∧ r ∧ T) ∨ F)

⇒ logic.propositional.idempand

F ∨ ¬(((r ∨ (¬r ∧ ¬r)) ∧ r ∧ T) ∨ F)

⇒ logic.propositional.absorpand

F ∨ ¬((r ∧ T) ∨ F)

⇒ logic.propositional.truezeroand

F ∨ ¬(r ∨ F)