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