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