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