[Imprint][Data Privacy Statement][E-Mail]



View long theorem info. View the proof. Back to main index. View the specification. View theorem base summary, View theorem base listing, the used properties by spec, the dependency list, the symbol table,

Proof step 1 from proof bwabs-reduce (conclusion) (back to tree)

⊦ bwabs(mkstate(gs, lsf, pcf), mkstate(ags, alsf, apcf)) → ( bwabs(mkstate(gs0, lsf0, pcf0), mkstate(ags0, alsf0, apcf0)) ↔ ags = mkdgs(gs.queue) → ags0 = mkdgs(gs0.queue) ∧ (∀ tid. alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval) ∧ apcf(tid) = bwabspcf(pcf(tid)) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ pcf(tid) = invDeq ∧ apcf(tid) = resDeq ∧ lsf(tid).obsEmpty → alsf0(tid) = mkls(lsf0(tid).tid, lsf0(tid).ival, lsf0(tid).oval, lsf0(tid).value, lsf0(tid).optval) ∧ apcf0(tid) = bwabspcf(pcf0(tid)) ∨ alsf0(tid) = mkls(lsf0(tid).tid, lsf0(tid).ival, Empty, lsf0(tid).value, lsf0(tid).optval) ∧ pcf0(tid) = invDeq ∧ apcf0(tid) = resDeq ∧ lsf0(tid).obsEmpty))

System applied rule normalize

And obtained the following new goals

Rule argument

Additional information

Proof step 2 from proof bwabs-reduce (previous step) (back to tree)

bwabs(mkstate(gs, lsf, pcf), mkstate(ags, alsf, apcf)) ⊦ bwabs(mkstate(gs0, lsf0, pcf0), mkstate(ags0, alsf0, apcf0)) ↔ ags = mkdgs(gs.queue) → ags0 = mkdgs(gs0.queue) ∧ (∀ tid. alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval) ∧ apcf(tid) = bwabspcf(pcf(tid)) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ pcf(tid) = invDeq ∧ apcf(tid) = resDeq ∧ lsf(tid).obsEmpty → alsf0(tid) = mkls(lsf0(tid).tid, lsf0(tid).ival, lsf0(tid).oval, lsf0(tid).value, lsf0(tid).optval) ∧ apcf0(tid) = bwabspcf(pcf0(tid)) ∨ alsf0(tid) = mkls(lsf0(tid).tid, lsf0(tid).ival, Empty, lsf0(tid).value, lsf0(tid).optval) ∧ pcf0(tid) = invDeq ∧ apcf0(tid) = resDeq ∧ lsf0(tid).obsEmpty)

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:bwabs-def, seq:⊦ bwabs(mkstate(gs, lsf, pcf), mkstate(ags, alsf, apcf)) ↔ ags = mkdgs(gs.queue) ∧ (∀ tid. alsf(tid) = mkls (lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval) ∧ apcf(tid) = bwabspcf(pcf(tid)) ∨ alsf(tid) = mkls (lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ pcf(tid) = invDeq ∧ apcf(tid) = resDeq ∧ lsf(tid).obsEmpty), subst:[gs, alsf, lsf, ags, pcf, apcf] → [gs, alsf, lsf, ags, pcf, apcf], <all paths>

Additional information

Used terms: gs, alsf, lsf, ags, pcf, apcf

Proof step 3 from proof bwabs-reduce (previous step) (back to tree)

⊦ bwabs(mkstate(gs, lsf, pcf), mkstate(ags, alsf, apcf)) ↔ ags = mkdgs(gs.queue) ∧ (∀ tid. alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval) ∧ apcf(tid) = bwabspcf(pcf(tid)) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ pcf(tid) = invDeq ∧ apcf(tid) = resDeq ∧ lsf(tid).obsEmpty)

Lemma bwabs-def

Proof step 4 from proof bwabs-reduce (previous step) (back to tree)

ags = mkdgs(gs.queue), ∀ tid. alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval) ∧ apcf(tid) = bwabspcf(pcf(tid)) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ pcf(tid) = invDeq ∧ apcf(tid) = resDeq ∧ lsf(tid).obsEmpty ⊦ bwabs(mkstate(gs0, lsf0, pcf0), mkstate(ags0, alsf0, apcf0)) ↔ ags = mkdgs(gs.queue) → ags0 = mkdgs(gs0.queue) ∧ (∀ tid. alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval) ∧ apcf(tid) = bwabspcf(pcf(tid)) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ pcf(tid) = invDeq ∧ apcf(tid) = resDeq ∧ lsf(tid).obsEmpty → alsf0(tid) = mkls(lsf0(tid).tid, lsf0(tid).ival, lsf0(tid).oval, lsf0(tid).value, lsf0(tid).optval) ∧ apcf0(tid) = bwabspcf(pcf0(tid)) ∨ alsf0(tid) = mkls(lsf0(tid).tid, lsf0(tid).ival, Empty, lsf0(tid).value, lsf0(tid).optval) ∧ pcf0(tid) = invDeq ∧ apcf0(tid) = resDeq ∧ lsf0(tid).obsEmpty)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: bwabs-def: ⊦ bwabs(mkstate(gs, lsf, pcf), mkstate(ags, alsf, apcf)) ↔ ags = mkdgs(gs.queue) ∧ (∀ tid. alsf(tid) = mkls (lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval) ∧ apcf(tid) = bwabspcf(pcf(tid)) ∨ alsf(tid) = mkls (lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ pcf(tid) = invDeq ∧ apcf(tid) = resDeq ∧ lsf(tid).obsEmpty);

Proof step 5 from proof bwabs-reduce (previous step) (back to tree)

∀ tid. alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval) ∧ apcf(tid) = bwabspcf(pcf(tid)) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ pcf(tid) = invDeq ∧ apcf(tid) = resDeq ∧ lsf(tid).obsEmpty ⊦ (∀ tid. alsf0(tid) = mkls(lsf0(tid).tid, lsf0(tid).ival, lsf0(tid).oval, lsf0(tid).value, lsf0(tid).optval) ∧ apcf0(tid) = bwabspcf(pcf0(tid)) ∨ alsf0(tid) = mkls(lsf0(tid).tid, lsf0(tid).ival, Empty, lsf0(tid).value, lsf0(tid).optval) ∧ pcf0(tid) = invDeq ∧ apcf0(tid) = resDeq ∧ lsf0(tid).obsEmpty) ↔ (∀ tid. alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval) ∧ apcf(tid) = bwabspcf(pcf(tid)) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ pcf(tid) = invDeq ∧ apcf(tid) = resDeq ∧ lsf(tid).obsEmpty → alsf0(tid) = mkls(lsf0(tid).tid, lsf0(tid).ival, lsf0(tid).oval, lsf0(tid).value, lsf0(tid).optval) ∧ apcf0(tid) = bwabspcf(pcf0(tid)) ∨ alsf0(tid) = mkls(lsf0(tid).tid, lsf0(tid).ival, Empty, lsf0(tid).value, lsf0(tid).optval) ∧ pcf0(tid) = invDeq ∧ apcf0(tid) = resDeq ∧ lsf0(tid).obsEmpty)

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 6 from proof bwabs-reduce (previous step) (back to tree)

∀ tid. alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval) ∧ apcf(tid) = bwabspcf(pcf(tid)) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ pcf(tid) = invDeq ∧ apcf(tid) = resDeq ∧ lsf(tid).obsEmpty, ∀ tid. alsf0(tid) = mkls(lsf0(tid).tid, lsf0(tid).ival, lsf0(tid).oval, lsf0(tid).value, lsf0(tid).optval) ∧ apcf0(tid) = bwabspcf(pcf0(tid)) ∨ alsf0(tid) = mkls(lsf0(tid).tid, lsf0(tid).ival, Empty, lsf0(tid).value, lsf0(tid).optval) ∧ pcf0(tid) = invDeq ∧ apcf0(tid) = resDeq ∧ lsf0(tid).obsEmpty ⊦ ∀ tid. alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval) ∧ apcf(tid) = bwabspcf(pcf(tid)) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ pcf(tid) = invDeq ∧ apcf(tid) = resDeq ∧ lsf(tid).obsEmpty → alsf0(tid) = mkls(lsf0(tid).tid, lsf0(tid).ival, lsf0(tid).oval, lsf0(tid).value, lsf0(tid).optval) ∧ apcf0(tid) = bwabspcf(pcf0(tid)) ∨ alsf0(tid) = mkls(lsf0(tid).tid, lsf0(tid).ival, Empty, lsf0(tid).value, lsf0(tid).optval) ∧ pcf0(tid) = invDeq ∧ apcf0(tid) = resDeq ∧ lsf0(tid).obsEmpty

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 7 from proof bwabs-reduce (previous step) (back to tree)

∀ tid. alsf0(tid) = mkls(lsf0(tid).tid, lsf0(tid).ival, lsf0(tid).oval, lsf0(tid).value, lsf0(tid).optval) ∧ apcf0(tid) = bwabspcf(pcf0(tid)) ∨ alsf0(tid) = mkls(lsf0(tid).tid, lsf0(tid).ival, Empty, lsf0(tid).value, lsf0(tid).optval) ∧ pcf0(tid) = invDeq ∧ apcf0(tid) = resDeq ∧ lsf0(tid).obsEmpty, ∀ tid. alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval) ∧ apcf(tid) = bwabspcf(pcf(tid)) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ pcf(tid) = invDeq ∧ apcf(tid) = resDeq ∧ lsf(tid).obsEmpty, alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval) ∧ apcf(tid) = bwabspcf(pcf(tid)) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ pcf(tid) = invDeq ∧ apcf(tid) = resDeq ∧ lsf(tid).obsEmpty ⊦ alsf0(tid) = mkls(lsf0(tid).tid, lsf0(tid).ival, lsf0(tid).oval, lsf0(tid).value, lsf0(tid).optval) ∧ apcf0(tid) = bwabspcf(pcf0(tid)), alsf0(tid) = mkls(lsf0(tid).tid, lsf0(tid).ival, Empty, lsf0(tid).value, lsf0(tid).optval) ∧ pcf0(tid) = invDeq ∧ apcf0(tid) = resDeq ∧ lsf0(tid).obsEmpty

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: DQ, name:elim-mkls, seq:⊦ ( ( ((tid = ls.tid ∧ (obsEmpty ↔ ls.obsEmpty)) ∧ ival = ls.ival) ∧ oval = ls.oval) ∧ value = ls.value) ∧ optval = ls.optval ↔ ls = mkls(tid, obsEmpty, ival, oval, value, optval), subst:[value, ival, obsEmpty, ls, oval, tid, optval] → [val0, val, obsEmpty, lsf(tid), optval, tid0, optval0]

Additional information

Used simplifier rules: ⊦ ( ( ((tid = ls.tid ∧ (obsEmpty ↔ ls.obsEmpty)) ∧ ival = ls.ival) ∧ oval = ls.oval) ∧ value = ls.value) ∧ optval = ls.optval ↔ ls = mkls(tid, obsEmpty, ival, oval, value, optval); (elim) Used terms: value, ival, obsEmpty, lsf(tid), oval, tid0, optval

Proof step 8 from proof bwabs-reduce (previous step) (back to tree)

lsf(tid) = mkls(tid0, obsEmpty, val, optval, val0, optval0), ∀ tid. alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval) ∧ apcf(tid) = bwabspcf(pcf(tid)) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ pcf(tid) = invDeq ∧ apcf(tid) = resDeq ∧ lsf(tid).obsEmpty, ∀ tid. alsf0(tid) = mkls(lsf0(tid).tid, lsf0(tid).ival, lsf0(tid).oval, lsf0(tid).value, lsf0(tid).optval) ∧ apcf0(tid) = bwabspcf(pcf0(tid)) ∨ alsf0(tid) = mkls(lsf0(tid).tid, lsf0(tid).ival, Empty, lsf0(tid).value, lsf0(tid).optval) ∧ pcf0(tid) = invDeq ∧ apcf0(tid) = resDeq ∧ lsf0(tid).obsEmpty, alsf(tid) = mkls(tid0, val, optval, val0, optval0) ∧ apcf(tid) = bwabspcf(pcf(tid)) ∨ alsf(tid) = mkls(tid0, val, Empty, val0, optval0) ∧ pcf(tid) = invDeq ∧ apcf(tid) = resDeq ∧ obsEmpty ⊦ alsf0(tid) = mkls(lsf0(tid).tid, lsf0(tid).ival, Empty, lsf0(tid).value, lsf0(tid).optval) ∧ pcf0(tid) = invDeq ∧ apcf0(tid) = resDeq ∧ lsf0(tid).obsEmpty, alsf0(tid) = mkls(lsf0(tid).tid, lsf0(tid).ival, lsf0(tid).oval, lsf0(tid).value, lsf0(tid).optval) ∧ apcf0(tid) = bwabspcf(pcf0(tid))

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: DQ, name:elim-mkls, seq:⊦ ( ( ((tid = ls.tid ∧ (obsEmpty ↔ ls.obsEmpty)) ∧ ival = ls.ival) ∧ oval = ls.oval) ∧ value = ls.value) ∧ optval = ls.optval ↔ ls = mkls(tid, obsEmpty, ival, oval, value, optval), subst:[value, ival, obsEmpty, ls, oval, tid, optval] → [val2, val1, obsEmpty0, lsf0(tid), optval1, tid1, optval2]

Additional information

Used simplifier rules: ⊦ ( ( ((tid = ls.tid ∧ (obsEmpty ↔ ls.obsEmpty)) ∧ ival = ls.ival) ∧ oval = ls.oval) ∧ value = ls.value) ∧ optval = ls.optval ↔ ls = mkls(tid, obsEmpty, ival, oval, value, optval); (elim) Used terms: value, ival, obsEmpty0, lsf0(tid), oval, tid1, optval1

Proof step 9 from proof bwabs-reduce (previous step) (back to tree)

lsf(tid) = mkls(tid0, obsEmpty, val, optval, val0, optval0), lsf0(tid) = mkls(tid1, obsEmpty0, val1, optval1, val2, optval2), ∀ tid. alsf0(tid) = mkls(lsf0(tid).tid, lsf0(tid).ival, lsf0(tid).oval, lsf0(tid).value, lsf0(tid).optval) ∧ apcf0(tid) = bwabspcf(pcf0(tid)) ∨ alsf0(tid) = mkls(lsf0(tid).tid, lsf0(tid).ival, Empty, lsf0(tid).value, lsf0(tid).optval) ∧ pcf0(tid) = invDeq ∧ apcf0(tid) = resDeq ∧ lsf0(tid).obsEmpty, ∀ tid. alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval) ∧ apcf(tid) = bwabspcf(pcf(tid)) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ pcf(tid) = invDeq ∧ apcf(tid) = resDeq ∧ lsf(tid).obsEmpty, alsf(tid) = mkls(tid0, val, optval, val0, optval0) ∧ apcf(tid) = bwabspcf(pcf(tid)) ∨ alsf(tid) = mkls(tid0, val, Empty, val0, optval0) ∧ pcf(tid) = invDeq ∧ apcf(tid) = resDeq ∧ obsEmpty ⊦ alsf0(tid) = mkls(tid1, val1, optval1, val2, optval2) ∧ apcf0(tid) = bwabspcf(pcf0(tid)), alsf0(tid) = mkls(tid1, val1, Empty, val2, optval2) ∧ pcf0(tid) = invDeq ∧ apcf0(tid) = resDeq ∧ obsEmpty0

User applied rule all left

And closed the goal!

Rule argument

pos: left 3 terms: tid abort: F discard: T computed: T

Additional information

Used simplifier rules: ⊦ mkls(tid, obsEmpty, ival, oval, ival0, oval0).oval = oval; (s) ⊦ mkls(tid, obsEmpty, ival, oval, ival0, oval0).tid = tid; (s) ⊦ mkls(tid, obsEmpty, ival, oval, ival0, oval0).ival = ival; (s) ⊦ mkls(tid, obsEmpty, ival, oval, ival0, oval0).value = ival0; (s) ⊦ mkls(tid, obsEmpty, ival, oval, ival0, oval0).optval = oval0; (s) ⊦ mkls(tid, obsEmpty, ival, oval, ival0, oval0).obsEmpty ↔ obsEmpty; (s) Used terms: tid

Proof step 10 from proof bwabs-reduce (previous step) (back to tree)

∀ tid. alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval) ∧ apcf(tid) = bwabspcf(pcf(tid)) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ pcf(tid) = invDeq ∧ apcf(tid) = resDeq ∧ lsf(tid).obsEmpty, ∀ tid. alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval) ∧ apcf(tid) = bwabspcf(pcf(tid)) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ pcf(tid) = invDeq ∧ apcf(tid) = resDeq ∧ lsf(tid).obsEmpty → alsf0(tid) = mkls(lsf0(tid).tid, lsf0(tid).ival, lsf0(tid).oval, lsf0(tid).value, lsf0(tid).optval) ∧ apcf0(tid) = bwabspcf(pcf0(tid)) ∨ alsf0(tid) = mkls(lsf0(tid).tid, lsf0(tid).ival, Empty, lsf0(tid).value, lsf0(tid).optval) ∧ pcf0(tid) = invDeq ∧ apcf0(tid) = resDeq ∧ lsf0(tid).obsEmpty ⊦ ∀ tid. alsf0(tid) = mkls(lsf0(tid).tid, lsf0(tid).ival, lsf0(tid).oval, lsf0(tid).value, lsf0(tid).optval) ∧ apcf0(tid) = bwabspcf(pcf0(tid)) ∨ alsf0(tid) = mkls(lsf0(tid).tid, lsf0(tid).ival, Empty, lsf0(tid).value, lsf0(tid).optval) ∧ pcf0(tid) = invDeq ∧ apcf0(tid) = resDeq ∧ lsf0(tid).obsEmpty

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 11 from proof bwabs-reduce (previous step) (back to tree)

∀ tid. alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval) ∧ apcf(tid) = bwabspcf(pcf(tid)) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ pcf(tid) = invDeq ∧ apcf(tid) = resDeq ∧ lsf(tid).obsEmpty → alsf0(tid) = mkls(lsf0(tid).tid, lsf0(tid).ival, lsf0(tid).oval, lsf0(tid).value, lsf0(tid).optval) ∧ apcf0(tid) = bwabspcf(pcf0(tid)) ∨ alsf0(tid) = mkls(lsf0(tid).tid, lsf0(tid).ival, Empty, lsf0(tid).value, lsf0(tid).optval) ∧ pcf0(tid) = invDeq ∧ apcf0(tid) = resDeq ∧ lsf0(tid).obsEmpty, ∀ tid. alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval) ∧ apcf(tid) = bwabspcf(pcf(tid)) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ pcf(tid) = invDeq ∧ apcf(tid) = resDeq ∧ lsf(tid).obsEmpty ⊦ alsf0(tid) = mkls(lsf0(tid).tid, lsf0(tid).ival, lsf0(tid).oval, lsf0(tid).value, lsf0(tid).optval) ∧ apcf0(tid) = bwabspcf(pcf0(tid)), alsf0(tid) = mkls(lsf0(tid).tid, lsf0(tid).ival, Empty, lsf0(tid).value, lsf0(tid).optval) ∧ pcf0(tid) = invDeq ∧ apcf0(tid) = resDeq ∧ lsf0(tid).obsEmpty

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: DQ, name:elim-mkls, seq:⊦ ( ( ((tid = ls.tid ∧ (obsEmpty ↔ ls.obsEmpty)) ∧ ival = ls.ival) ∧ oval = ls.oval) ∧ value = ls.value) ∧ optval = ls.optval ↔ ls = mkls(tid, obsEmpty, ival, oval, value, optval), subst:[value, ival, obsEmpty, ls, oval, tid, optval] → [val0, val, obsEmpty, lsf0(tid), optval, tid0, optval0]

Additional information

Used simplifier rules: ⊦ ( ( ((tid = ls.tid ∧ (obsEmpty ↔ ls.obsEmpty)) ∧ ival = ls.ival) ∧ oval = ls.oval) ∧ value = ls.value) ∧ optval = ls.optval ↔ ls = mkls(tid, obsEmpty, ival, oval, value, optval); (elim) Used terms: value, ival, obsEmpty, lsf0(tid), oval, tid0, optval

Proof step 12 from proof bwabs-reduce (previous step) (back to tree)

lsf0(tid) = mkls(tid0, obsEmpty, val, optval, val0, optval0), ∀ tid. alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval) ∧ apcf(tid) = bwabspcf(pcf(tid)) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ pcf(tid) = invDeq ∧ apcf(tid) = resDeq ∧ lsf(tid).obsEmpty, ∀ tid. alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval) ∧ apcf(tid) = bwabspcf(pcf(tid)) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ pcf(tid) = invDeq ∧ apcf(tid) = resDeq ∧ lsf(tid).obsEmpty → alsf0(tid) = mkls(lsf0(tid).tid, lsf0(tid).ival, lsf0(tid).oval, lsf0(tid).value, lsf0(tid).optval) ∧ apcf0(tid) = bwabspcf(pcf0(tid)) ∨ alsf0(tid) = mkls(lsf0(tid).tid, lsf0(tid).ival, Empty, lsf0(tid).value, lsf0(tid).optval) ∧ pcf0(tid) = invDeq ∧ apcf0(tid) = resDeq ∧ lsf0(tid).obsEmpty ⊦ alsf0(tid) = mkls(tid0, val, Empty, val0, optval0) ∧ pcf0(tid) = invDeq ∧ apcf0(tid) = resDeq ∧ obsEmpty, alsf0(tid) = mkls(tid0, val, optval, val0, optval0) ∧ apcf0(tid) = bwabspcf(pcf0(tid))

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 3 terms: tid abort: F discard: T computed: T

Additional information

Used terms: tid

Proof step 13 from proof bwabs-reduce (previous step) (back to tree)

lsf0(tid) = mkls(tid0, obsEmpty, val, optval, val0, optval0), alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval) ∧ apcf(tid) = bwabspcf(pcf(tid)) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ pcf(tid) = invDeq ∧ apcf(tid) = resDeq ∧ lsf(tid).obsEmpty → alsf0(tid) = mkls(lsf0(tid).tid, lsf0(tid).ival, lsf0(tid).oval, lsf0(tid).value, lsf0(tid).optval) ∧ apcf0(tid) = bwabspcf(pcf0(tid)) ∨ alsf0(tid) = mkls(lsf0(tid).tid, lsf0(tid).ival, Empty, lsf0(tid).value, lsf0(tid).optval) ∧ pcf0(tid) = invDeq ∧ apcf0(tid) = resDeq ∧ lsf0(tid).obsEmpty, ∀ tid. alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval) ∧ apcf(tid) = bwabspcf(pcf(tid)) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ pcf(tid) = invDeq ∧ apcf(tid) = resDeq ∧ lsf(tid).obsEmpty ⊦ alsf0(tid) = mkls(tid0, val, optval, val0, optval0) ∧ apcf0(tid) = bwabspcf(pcf0(tid)), alsf0(tid) = mkls(tid0, val, Empty, val0, optval0) ∧ pcf0(tid) = invDeq ∧ apcf0(tid) = resDeq ∧ obsEmpty

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ mkls(tid, obsEmpty, ival, oval, ival0, oval0).obsEmpty ↔ obsEmpty; (s) ⊦ mkls(tid, obsEmpty, ival, oval, ival0, oval0).optval = oval0; (s) ⊦ mkls(tid, obsEmpty, ival, oval, ival0, oval0).value = ival0; (s) ⊦ mkls(tid, obsEmpty, ival, oval, ival0, oval0).ival = ival; (s) ⊦ mkls(tid, obsEmpty, ival, oval, ival0, oval0).tid = tid; (s) ⊦ mkls(tid, obsEmpty, ival, oval, ival0, oval0).oval = oval; (s)

Proof step 14 from proof bwabs-reduce (previous step) (back to tree)

lsf0(tid) = mkls(tid0, obsEmpty, val, optval, val0, optval0), ∀ tid. alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval) ∧ apcf(tid) = bwabspcf(pcf(tid)) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ pcf(tid) = invDeq ∧ apcf(tid) = resDeq ∧ lsf(tid).obsEmpty ⊦ alsf0(tid) = mkls(tid0, val, optval, val0, optval0) ∧ apcf0(tid) = bwabspcf(pcf0(tid)), alsf0(tid) = mkls(tid0, val, Empty, val0, optval0) ∧ pcf0(tid) = invDeq ∧ apcf0(tid) = resDeq ∧ obsEmpty, alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval) ∧ apcf(tid) = bwabspcf(pcf(tid)), alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ pcf(tid) = invDeq ∧ apcf(tid) = resDeq ∧ lsf(tid).obsEmpty

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: DQ, name:elim-mkls, seq:⊦ ( ( ((tid = ls.tid ∧ (obsEmpty ↔ ls.obsEmpty)) ∧ ival = ls.ival) ∧ oval = ls.oval) ∧ value = ls.value) ∧ optval = ls.optval ↔ ls = mkls(tid, obsEmpty, ival, oval, value, optval), subst:[value, ival, obsEmpty, ls, oval, tid, optval] → [val2, val1, obsEmpty0, lsf(tid), optval1, tid1, optval2]

Additional information

Used simplifier rules: ⊦ ( ( ((tid = ls.tid ∧ (obsEmpty ↔ ls.obsEmpty)) ∧ ival = ls.ival) ∧ oval = ls.oval) ∧ value = ls.value) ∧ optval = ls.optval ↔ ls = mkls(tid, obsEmpty, ival, oval, value, optval); (elim) Used terms: value, ival, obsEmpty0, lsf(tid), oval, tid1, optval1

Proof step 15 from proof bwabs-reduce (previous step) (back to tree)

lsf(tid) = mkls(tid1, obsEmpty0, val1, optval1, val2, optval2), lsf0(tid) = mkls(tid0, obsEmpty, val, optval, val0, optval0), ∀ tid. alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval) ∧ apcf(tid) = bwabspcf(pcf(tid)) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ pcf(tid) = invDeq ∧ apcf(tid) = resDeq ∧ lsf(tid).obsEmpty ⊦ alsf(tid) = mkls(tid1, val1, Empty, val2, optval2) ∧ pcf(tid) = invDeq ∧ apcf(tid) = resDeq ∧ obsEmpty0, alsf(tid) = mkls(tid1, val1, optval1, val2, optval2) ∧ apcf(tid) = bwabspcf(pcf(tid)), alsf0(tid) = mkls(tid0, val, Empty, val0, optval0) ∧ pcf0(tid) = invDeq ∧ apcf0(tid) = resDeq ∧ obsEmpty, alsf0(tid) = mkls(tid0, val, optval, val0, optval0) ∧ apcf0(tid) = bwabspcf(pcf0(tid))

User applied rule all left

And closed the goal!

Rule argument

pos: left 3 terms: tid abort: F discard: T computed: T

Additional information

Used simplifier rules: ⊦ mkls(tid, obsEmpty, ival, oval, ival0, oval0).oval = oval; (s) ⊦ mkls(tid, obsEmpty, ival, oval, ival0, oval0).tid = tid; (s) ⊦ mkls(tid, obsEmpty, ival, oval, ival0, oval0).ival = ival; (s) ⊦ mkls(tid, obsEmpty, ival, oval, ival0, oval0).value = ival0; (s) ⊦ mkls(tid, obsEmpty, ival, oval, ival0, oval0).optval = oval0; (s) ⊦ mkls(tid, obsEmpty, ival, oval, ival0, oval0).obsEmpty ↔ obsEmpty; (s) Used terms: tid

Proof Tree for bwabs-reduce (View conclusion)

The following image shows the proof tree of sequent calculus. The proved goal is at the bottom. You can click on the nodes to view additional rules. See here for details on colors in a proof tree.

the proof tree