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