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