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