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