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