Exercise logic.propositional.cnf.unicode

Description
Proposition to CNF (unicode support)

Derivation

Final term is not finished
(F ∧ T) ∨ ¬((r ↔ r) ∧ (((F ∨ T) ∧ r) ∨ F) ∧ T)
logic.propositional.falsezeroor
(F ∧ T) ∨ ¬((r ↔ r) ∧ ((T ∧ r) ∨ F) ∧ T)