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