Exercise logic.propositional.cnf.unicode
Description
Proposition to CNF (unicode support)
Derivation
Final term is not finished¬((r ↔ r) ∧ T) ∨ ¬r ∨ ¬((r ↔ r) ∧ T ∧ r) ∨ ¬(r ↔ r) ∨ ¬(r ↔ r) ∨ ¬¬F ∨ ¬r ∨ ¬(T ∧ r)
⇒ logic.propositional.notfalse¬((r ↔ r) ∧ T) ∨ ¬r ∨ ¬((r ↔ r) ∧ T ∧ r) ∨ ¬(r ↔ r) ∨ ¬(r ↔ r) ∨ ¬T ∨ ¬r ∨ ¬(T ∧ r)