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