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