Exercise logic.propositional.cnf.unicode

Description
Proposition to CNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.falsezeroor

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

⇒ logic.propositional.defequiv

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

⇒ logic.propositional.idempand

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

⇒ logic.propositional.absorpand

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

⇒ logic.propositional.truezeroand

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