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