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