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