Exercise logic.propositional.cnf.unicode

Description
Proposition to CNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.truezeroand

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

⇒ logic.propositional.defequiv

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

⇒ logic.propositional.idempand

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

⇒ logic.propositional.absorpand

F ∨ (¬r ∧ T ∧ T)