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