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