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