Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

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

Feedback

Path 1

path[0, 2, 0, 0, 0, 5, 5, 5, 4]
steps9
major rules1
active labels
  • dnf
  • simplify

enter dnf, check, navigator.down, check, enter simplify, navigator.down, navigator.down, navigator.down, logic.propositional.notnot