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