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