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