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