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