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