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