Exercise logic.propositional.cnf.unicode

Description
Proposition to CNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.falsezeroor

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

⇒ logic.propositional.falsezeroor

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

⇒ logic.propositional.idempor

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