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