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