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