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