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