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