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