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