Exercise logic.propositional.dnf.unicode
Description
Proposition to DNF (unicode support)
((¬((T ∧ (q ∨ F)) → p) ∧ ((r ↔ s) ∨ ¬s)) ∨ (¬¬((T ∧ q) → p) ∧ ¬((r ↔ s) ∨ ¬(s ∨ F)))) ∧ ((¬((T ∧ (q ∨ F)) → p) ∧ ((r ↔ s) ∨ ¬s)) ∨ (¬¬((T ∧ q) → p) ∧ ¬((r ↔ s) ∨ ¬(s ∨ F))))
ready: noFeedback
Path 1
path | [] |
steps | 0 |
major rules | 0 |
active labels |