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