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