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