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