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