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