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