Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

All applications

• Rule	falsezeroor.inv
  Location	[]

  

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

  ready: no

• Rule	falsezeroor.inv
  Location	[]

  

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

  ready: no

• Rule	falsezeroor.inv
  Location	[0]

  

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

  ready: no

• Rule	falsezeroor.inv
  Location	[0]

  

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

  ready: no

• Rule	falsezeroor.inv
  Location	[0,0]

  

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

  ready: no

• Rule	falsezeroor.inv
  Location	[0,0]

  

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

  ready: no

• Rule	falsezeroor.inv
  Location	[0,0,0]

  

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

  ready: no

• Rule	falsezeroor.inv
  Location	[0,0,0]

  

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

  ready: no

• Rule	falsezeroor.inv
  Location	[0,0,1]

  

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

  ready: no

• Rule	falsezeroor.inv
  Location	[0,0,1]

  

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

  ready: no

• Rule	falsezeroor.inv
  Location	[1]

  

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

  ready: no

• Rule	falsezeroor.inv
  Location	[1]

  

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

  ready: no

• Rule	falsezeroor.inv
  Location	[1,0]

  

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

  ready: no

• Rule	falsezeroor.inv
  Location	[1,0]

  

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

  ready: no

• Rule	falsezeroor.inv
  Location	[1,0,0]

  

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

  ready: no

• Rule	falsezeroor.inv
  Location	[1,0,0]

  

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

  ready: no

• Rule	falsezeroor.inv
  Location	[1,0,1]

  

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

  ready: no

• Rule	falsezeroor.inv
  Location	[1,0,1]

  

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

  ready: no

• Rule	falsezeroor.inv
  Location	[1,1]

  

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

  ready: no

• Rule	falsezeroor.inv
  Location	[1,1]

  

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

  ready: no

• Rule	falsezeroor.inv
  Location	[1,1,0]

  

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

  ready: no

• Rule	falsezeroor.inv
  Location	[1,1,0]

  

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

  ready: no

• Rule	idempand.inv
  Location	[]

  

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

  ready: no

• Rule	idempand.inv
  Location	[0]

  

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

  ready: no

• Rule	idempand.inv
  Location	[0,0]

  

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

  ready: no

• Rule	idempand.inv
  Location	[0,0,0]

  

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

  ready: no

• Rule	idempand.inv
  Location	[0,0,1]

  

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

  ready: no

• Rule	idempand.inv
  Location	[1]

  

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

  ready: no

• Rule	idempand.inv
  Location	[1,0]

  

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

  ready: no

• Rule	idempand.inv
  Location	[1,0,0]

  

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

  ready: no

• Rule	idempand.inv
  Location	[1,0,1]

  

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

  ready: no

• Rule	idempand.inv
  Location	[1,1]

  

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

  ready: no

• Rule	idempand.inv
  Location	[1,1,0]

  

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

  ready: no

• Rule	idempor.inv
  Location	[]

  

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

  ready: no

• Rule	idempor.inv
  Location	[0]

  

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

  ready: no

• Rule	idempor.inv
  Location	[0,0]

  

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

  ready: no

• Rule	idempor.inv
  Location	[0,0,0]

  

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

  ready: no

• Rule	idempor.inv
  Location	[0,0,1]

  

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

  ready: no

• Rule	idempor.inv
  Location	[1]

  

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

  ready: no

• Rule	idempor.inv
  Location	[1,0]

  

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

  ready: no

• Rule	idempor.inv
  Location	[1,0,0]

  

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

  ready: no

• Rule	idempor.inv
  Location	[1,0,1]

  

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

  ready: no

• Rule	idempor.inv
  Location	[1,1]

  

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

  ready: no

• Rule	idempor.inv
  Location	[1,1,0]

  

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

  ready: no

• Rule	logic.propositional.buggy.commimp
  Location	[0,0]

• Rule	logic.propositional.buggy.defimpl.inv
  Location	[1]

• Rule	logic.propositional.buggy.equivelim1
  Location	[]

• Rule	logic.propositional.buggy.equivelim1
  Location	[]

• Rule	logic.propositional.buggy.equivelim1
  Location	[]

• Rule	logic.propositional.buggy.equivelim1
  Location	[]

• Rule	logic.propositional.buggy.equivelim1
  Location	[]

• Rule	logic.propositional.buggy.equivelim1
  Location	[1,0]

• Rule	logic.propositional.buggy.equivelim1
  Location	[1,0]

• Rule	logic.propositional.buggy.equivelim1
  Location	[1,0]

• Rule	logic.propositional.buggy.equivelim1
  Location	[1,0]

• Rule	logic.propositional.buggy.equivelim1
  Location	[1,0]

• Rule	logic.propositional.buggy.equivelim2
  Location	[]

• Rule	logic.propositional.buggy.equivelim2
  Location	[]

• Rule	logic.propositional.buggy.equivelim2
  Location	[]

• Rule	logic.propositional.buggy.equivelim2
  Location	[1,0]

• Rule	logic.propositional.buggy.equivelim2
  Location	[1,0]

• Rule	logic.propositional.buggy.equivelim2
  Location	[1,0]

• Rule	logic.propositional.buggy.equivelim3
  Location	[]

• Rule	logic.propositional.buggy.equivelim3
  Location	[1,0]

• Rule	logic.propositional.buggy.idemequiv.inv
  Location	[]

• Rule	logic.propositional.buggy.idemequiv.inv
  Location	[0]

• Rule	logic.propositional.buggy.idemequiv.inv
  Location	[0,0]

• Rule	logic.propositional.buggy.idemequiv.inv
  Location	[0,0,0]

• Rule	logic.propositional.buggy.idemequiv.inv
  Location	[0,0,1]

• Rule	logic.propositional.buggy.idemequiv.inv
  Location	[1]

• Rule	logic.propositional.buggy.idemequiv.inv
  Location	[1,0]

• Rule	logic.propositional.buggy.idemequiv.inv
  Location	[1,0,0]

• Rule	logic.propositional.buggy.idemequiv.inv
  Location	[1,0,1]

• Rule	logic.propositional.buggy.idemequiv.inv
  Location	[1,1]

• Rule	logic.propositional.buggy.idemequiv.inv
  Location	[1,1,0]

• Rule	logic.propositional.buggy.idemimp.inv
  Location	[]

• Rule	logic.propositional.buggy.idemimp.inv
  Location	[0]

• Rule	logic.propositional.buggy.idemimp.inv
  Location	[0,0]

• Rule	logic.propositional.buggy.idemimp.inv
  Location	[0,0,0]

• Rule	logic.propositional.buggy.idemimp.inv
  Location	[0,0,1]

• Rule	logic.propositional.buggy.idemimp.inv
  Location	[1]

• Rule	logic.propositional.buggy.idemimp.inv
  Location	[1,0]

• Rule	logic.propositional.buggy.idemimp.inv
  Location	[1,0,0]

• Rule	logic.propositional.buggy.idemimp.inv
  Location	[1,0,1]

• Rule	logic.propositional.buggy.idemimp.inv
  Location	[1,1]

• Rule	logic.propositional.buggy.idemimp.inv
  Location	[1,1,0]

• Rule	logic.propositional.buggy.implelim
  Location	[0,0]

• Rule	logic.propositional.buggy.implelim
  Location	[0,0]

• Rule	logic.propositional.buggy.implelim
  Location	[0,0]

• Rule	logic.propositional.buggy.implelim
  Location	[0,0]

• Rule	logic.propositional.buggy.implelim1
  Location	[0,0]

• Rule	logic.propositional.buggy.implelim2
  Location	[0,0]

• Rule	logic.propositional.buggy.notoverimpl
  Location	[0]

• Rule	logic.propositional.commor
  Location	[1]

  

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

  ready: no

• Rule	logic.propositional.defequiv
  Location	[]

  

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

  ready: no

• Rule	logic.propositional.defequiv
  Location	[1,0]

  

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

  ready: no

• Rule	logic.propositional.defimpl
  Location	[0,0]

  

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

  ready: no

• Rule	notnot.inv
  Location	[]

  

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

  ready: no

• Rule	notnot.inv
  Location	[0]

  

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

  ready: no

• Rule	notnot.inv
  Location	[0,0]

  

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

  ready: no

• Rule	notnot.inv
  Location	[0,0,0]

  

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

  ready: no

• Rule	notnot.inv
  Location	[0,0,1]

  

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

  ready: no

• Rule	notnot.inv
  Location	[1]

  

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

  ready: no

• Rule	notnot.inv
  Location	[1,0]

  

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

  ready: no

• Rule	notnot.inv
  Location	[1,0,0]

  

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

  ready: no

• Rule	notnot.inv
  Location	[1,0,1]

  

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

  ready: no

• Rule	notnot.inv
  Location	[1,1]

  

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

  ready: no

• Rule	notnot.inv
  Location	[1,1,0]

  

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

  ready: no

• Rule	truezeroand.inv
  Location	[]

  

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

  ready: no

• Rule	truezeroand.inv
  Location	[]

  

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

  ready: no

• Rule	truezeroand.inv
  Location	[0]

  

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

  ready: no

• Rule	truezeroand.inv
  Location	[0]

  

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

  ready: no

• Rule	truezeroand.inv
  Location	[0,0]

  

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

  ready: no

• Rule	truezeroand.inv
  Location	[0,0]

  

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

  ready: no

• Rule	truezeroand.inv
  Location	[0,0,0]

  

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

  ready: no

• Rule	truezeroand.inv
  Location	[0,0,0]

  

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

  ready: no

• Rule	truezeroand.inv
  Location	[0,0,1]

  

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

  ready: no

• Rule	truezeroand.inv
  Location	[0,0,1]

  

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

  ready: no

• Rule	truezeroand.inv
  Location	[1]

  

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

  ready: no

• Rule	truezeroand.inv
  Location	[1]

  

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

  ready: no

• Rule	truezeroand.inv
  Location	[1,0]

  

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

  ready: no

• Rule	truezeroand.inv
  Location	[1,0]

  

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

  ready: no

• Rule	truezeroand.inv
  Location	[1,0,0]

  

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

  ready: no

• Rule	truezeroand.inv
  Location	[1,0,0]

  

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

  ready: no

• Rule	truezeroand.inv
  Location	[1,0,1]

  

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

  ready: no

• Rule	truezeroand.inv
  Location	[1,0,1]

  

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

  ready: no

• Rule	truezeroand.inv
  Location	[1,1]

  

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

  ready: no

• Rule	truezeroand.inv
  Location	[1,1]

  

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

  ready: no

• Rule	truezeroand.inv
  Location	[1,1,0]

  

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

  ready: no

• Rule	truezeroand.inv
  Location	[1,1,0]

  

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

  ready: no