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