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