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