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