Exercise logic.propositional.cnf.unicode
Description
Proposition to CNF (unicode support)
Derivation
Final term is not finished
F ∨ ¬((r ↔ r) ∧ T ∧ r) ∨ ¬(T ∧ r ∧ (r ↔ r))
⇒ logic.propositional.defequivF ∨ ¬((r ↔ r) ∧ T ∧ r) ∨ ¬(T ∧ r ∧ ((r ∧ r) ∨ (¬r ∧ ¬r)))
⇒ logic.propositional.idempandF ∨ ¬((r ↔ r) ∧ T ∧ r) ∨ ¬(T ∧ r ∧ (r ∨ (¬r ∧ ¬r)))
⇒ logic.propositional.absorpandF ∨ ¬((r ↔ r) ∧ T ∧ r) ∨ ¬(T ∧ r)
⇒ logic.propositional.truezeroandF ∨ ¬((r ↔ r) ∧ T ∧ r) ∨ ¬r