Exercise logic.propositional.cnf.unicode

Description
Proposition to CNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.falsezeroor

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

⇒ logic.propositional.falsezeroor

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

⇒ logic.propositional.idempand

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