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