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