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