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