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