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