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