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