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