Exercise

Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

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

ready: no

Feedback

onefirst
allfirsts (2)
allapplications
derivation
microsteps

Path 1

path [0, 1, 0, 1, 1, 0, 0, 1, 3, 2, 2, 0, 1]
steps 13
major rules 2
active labels
dnf
eliminateimplequiv

enter dnf, check, enter simplify, enter andrules, logic.propositional.truezeroand, exit andrules, exit simplify, check, enter eliminateimplequiv, navigator.down, navigator.right, navigator.down, logic.propositional.defequiv

path	[0, 1, 0, 1, 1, 0, 0, 1, 3, 2, 2, 0, 1]
steps	13
major rules	2
active labels	dnf eliminateimplequiv