Exercise logic.propositional.cnf.unicode

Description
Proposition to CNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.defequiv

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

⇒ logic.propositional.falsezeroor

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

⇒ logic.propositional.idempand

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

⇒ logic.propositional.absorpand

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

⇒ logic.propositional.truezeroand

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