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