Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

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

Feedback

Path 1

path[]
steps0
major rules0
active labels