Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

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

ready: no

Feedback

• onefirst
• allfirsts (1)
• allapplications
• derivation
• microsteps

Path 1

path	[0, 2, 0, 0, 1, 2, 0, 0]
steps	8
major rules	1
active labels	dnf specialdistrnot