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