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