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