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