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