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