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