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