Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

(¬(q → p) ↔ ((((T ∧ r) ∨ (T ∧ r)) ↔ s) ∨ ¬s)) ∨ (¬(q → p) ↔ ((((T ∧ r) ∨ (T ∧ r)) ↔ s) ∨ ¬s))
ready: no

Feedback

Path 1

path[]
steps0
major rules0
active labels