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