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