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