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