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