Exercise logic.propositional.cnf.unicode

Description
Proposition to CNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.falsezeroor

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

⇒ logic.propositional.absorpand

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

⇒ logic.propositional.idempor

¬((r ↔ r) ∧ T ∧ r)