Exercise logic.propositional.cnf.unicode

Description
Proposition to CNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.falsezeroor

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