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