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