[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 fwsim-init (conclusion) (back to tree)

⊦ DMSQinit(cs) → (∃ as. abs(cs, as) ∧ DQinit(as))

System applied rule normalize

And obtained the following new goals

Rule argument

Additional information

Proof step 2 from proof fwsim-init (previous step) (back to tree)

DMSQinit(cs) ⊦ ∃ as. abs(cs, as) ∧ DQinit(as)

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:AIOAut-lem, seq: ⊦ AIOAut?(AIOAut(DQinit, DQstep)), subst:

Additional information

Used terms:

Proof step 3 from proof fwsim-init (previous step) (back to tree)

⊦ AIOAut?(AIOAut(DQinit, DQstep))

Lemma AIOAut-lem

Proof step 4 from proof fwsim-init (previous step) (back to tree)

AIOAut?(AIOAut(DQinit, DQstep)), DMSQinit(cs) ⊦ ∃ as. abs(cs, as) ∧ DQinit(as)

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: IO-Automaton[DQatrace-absAction], name:isIOAut-def, seq: ⊦ AIOAut?(AIOAut(startf, stepf)) ↔ (∃ s. startf(s)), subst:[startf, stepf] → [DQinit, DQstep], <all paths>

Additional information

Used terms: DQinit, DQstep

Proof step 5 from proof fwsim-init (previous step) (back to tree)

⊦ AIOAut?(AIOAut(startf, stepf)) ↔ (∃ s. startf(s))

A spec-lemma

Proof step 6 from proof fwsim-init (previous step) (back to tree)

DMSQinit(cs), ∃ s. DQinit(s) ⊦ ∃ as. abs(cs, as) ∧ DQinit(as)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 7 from proof fwsim-init (previous step) (back to tree)

DMSQinit(cs), DQinit(as) ⊦ ∃ as. abs(cs, as) ∧ DQinit(as)

User applied rule exists right

And obtained the following new goals

Rule argument

pos: right 1 terms: as abort: F discard: T computed: T

Additional information

Used terms: as

Proof step 8 from proof fwsim-init (previous step) (back to tree)

DMSQinit(cs), DQinit(as) ⊦ abs(cs, as) ∧ DQinit(as)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 9 from proof fwsim-init (previous step) (back to tree)

DMSQinit(cs), DQinit(as), ¬ abs(cs, as) ⊦

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: cs

Additional information

Used simplifier rules: DMSQState freely generated by mkstate;;

Proof step 10 from proof fwsim-init (previous step) (back to tree)

cs = mkstate(gs, lsf, pcf), DMSQinit(cs), DQinit(as), ¬ abs(cs, as) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 11 from proof fwsim-init (previous step) (back to tree)

DMSQinit(mkstate(gs, lsf, pcf)), DQinit(as), ¬ abs(mkstate(gs, lsf, pcf), as) ⊦

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: as

Additional information

Used simplifier rules: DQState freely generated by mkstate;;

Proof step 12 from proof fwsim-init (previous step) (back to tree)

as = mkstate(ags, alsf, apcf), DMSQinit(mkstate(gs, lsf, pcf)), DQinit(as), ¬ abs(mkstate(gs, lsf, pcf), as) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 13 from proof fwsim-init (previous step) (back to tree)

DMSQinit(mkstate(gs, lsf, pcf)), DQinit(mkstate(ags, alsf, apcf)), ¬ abs(mkstate(gs, lsf, pcf), mkstate(ags, alsf, apcf)) ⊦

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: ags

Additional information

Used simplifier rules: DQGState freely generated by mkgs;;

Proof step 14 from proof fwsim-init (previous step) (back to tree)

ags = mkgs(q), DMSQinit(mkstate(gs, lsf, pcf)), DQinit(mkstate(ags, alsf, apcf)), ¬ abs(mkstate(gs, lsf, pcf), mkstate(ags, alsf, apcf)) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 15 from proof fwsim-init (previous step) (back to tree)

DMSQinit(mkstate(gs, lsf, pcf)), DQinit(mkstate(mkgs(q), alsf, apcf)), ¬ abs(mkstate(gs, lsf, pcf), mkstate(mkgs(q), alsf, apcf)) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: abs, name:abs-def, seq:⊦ abs(mkstate(gs, lsf, pcf), mkstate(mkgs(q), alsf, apcf)) ↔ q = content(gs.qrl, gs.ps) ∧ (∀ tid. absls(gs, lsf(tid), pcf(tid), alsf(tid)) ∧ abspc(gs, lsf(tid), pcf(tid)) = apcf(tid)), subst:[alsf, lsf, q, apcf, pcf, gs] → [alsf, lsf, q, apcf, pcf, gs], <all paths>

Additional information

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

Proof step 16 from proof fwsim-init (previous step) (back to tree)

⊦ abs(mkstate(gs, lsf, pcf), mkstate(mkgs(q), alsf, apcf)) ↔ q = content(gs.qrl, gs.ps) ∧ (∀ tid. absls(gs, lsf(tid), pcf(tid), alsf(tid)) ∧ abspc(gs, lsf(tid), pcf(tid)) = apcf(tid))

A spec-lemma

Proof step 17 from proof fwsim-init (previous step) (back to tree)

DMSQinit(mkstate(gs, lsf, pcf)), DQinit(mkstate(mkgs(q), alsf, apcf)), q ≠ content(gs.qrl, gs.ps) ∨ (∃ tid. ¬(absls(gs, lsf(tid), pcf(tid), alsf(tid)) ∧ abspc(gs, lsf(tid), pcf(tid)) = apcf(tid))) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 18 from proof fwsim-init (previous step) (back to tree)

DMSQinit(mkstate(gs, lsf, pcf)), DQinit(mkstate(mkgs(q), alsf, apcf)), q ≠ content(gs.qrl, gs.ps) ∨ ¬ absls(gs, lsf(tid), pcf(tid), alsf(tid)) ∨ abspc(gs, lsf(tid), pcf(tid)) ≠ apcf(tid) ⊦

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:elim-mkgs, seq:⊦ ( ( ( ( ( ( ( ( ( ( (ps = gs.ps ∧ vs = gs.vs) ∧ phead = gs.phead) ∧ vhead = gs.vhead) ∧ vtail = gs.vtail) ∧ vretRefs = gs.vretRefs) ∧ pretRefs = gs.pretRefs) ∧ vrvHp = gs.vrvHp) ∧ prvHp = gs.prvHp) ∧ qrl = gs.qrl) ∧ orl = gs.orl) ∧ owns = gs.owns) ∧ rvowns = gs.rvowns ↔ gs = mkgs (ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), subst:[qrl, ps, phead, vrvHp, vretRefs, vhead, vtail, gs, owns, rvowns, orl, prvHp, pretRefs, vs] → [qrl, ps, phead, vrvHp, vretRefs, vhead, vhead0, gs, owns, rvowns, orl, prvHp, pretRefs, vs]

Additional information

Used simplifier rules: ⊦ ( ( ( ( ( ( ( ( ( ((ps = gs.ps ∧ vs = gs.vs) ∧ phead = gs.phead) ∧ vhead = gs.vhead) ∧ vtail = gs.vtail) ∧ vretRefs = gs.vretRefs) ∧ pretRefs = gs.pretRefs) ∧ vrvHp = gs.vrvHp) ∧ prvHp = gs.prvHp) ∧ qrl = gs.qrl) ∧ orl = gs.orl) ∧ owns = gs.owns) ∧ rvowns = gs.rvowns ↔ gs = mkgs (ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns); (elim) Used terms: qrl, ps, phead, vrvHp, vretRefs, vhead, vtail, gs, owns, rvowns, orl, prvHp, pretRefs, vs

Proof step 19 from proof fwsim-init (previous step) (back to tree)

gs = mkgs(ps, vs, phead, vhead, vhead0, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), DMSQinit(mkstate(gs, lsf, pcf)), DQinit(mkstate(mkgs(q), alsf, apcf)), q ≠ content(qrl, ps) ∨ ¬ absls(gs, lsf(tid), pcf(tid), alsf(tid)) ∨ abspc(gs, lsf(tid), pcf(tid)) ≠ apcf(tid) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 20 from proof fwsim-init (previous step) (back to tree)

DMSQinit(mkstate(mkgs(ps, vs, phead, vhead, vhead0, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf, pcf)), DQinit(mkstate(mkgs(q), alsf, apcf)), q ≠ content(qrl, ps) ∨ ¬ absls(mkgs(ps, vs, phead, vhead, vhead0, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid), alsf(tid)) ∨ abspc(mkgs(ps, vs, phead, vhead, vhead0, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid)) ≠ apcf(tid) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: abs, name:DMSQinit-def, seq:⊦ DMSQinit(mkstate(gs, lsf, pcf)) ↔ (∃ r, val. r ≠ null ∧ gs.ps = ∅[r, mk(val, Some(dummytid), null)] ∧ gs.phead = r ∧ gs.vhead = r ∧ gs.vtail = r ∧ gs.orl = r ' ∧ gs.qrl = [] ∧ gs.vs = gs.ps) ∧ gs.vrvHp = ∅ ∧ gs.prvHp = ∅ ∧ gs.vretRefs = (λ tid. null) ∧ gs.pretRefs = (λ tid. null) ∧ gs.owns = (λ r. None) ∧ pcf = (λ tid. idle) ∧ (∀ tid. lsf(tid).tid = tid), subst:[gs, lsf, pcf] → [mkgs (ps, vs, phead, vhead, vhead0, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf, pcf], <all paths>

Additional information

Used terms: mkgs (ps, vs, phead, vhead, vhead0, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf, pcf

Proof step 21 from proof fwsim-init (previous step) (back to tree)

⊦ DMSQinit(mkstate(gs, lsf, pcf)) ↔ (∃ r, val. r ≠ null ∧ gs.ps = ∅[r, mk(val, Some(dummytid), null)] ∧ gs.phead = r ∧ gs.vhead = r ∧ gs.vtail = r ∧ gs.orl = r ' ∧ gs.qrl = [] ∧ gs.vs = gs.ps) ∧ gs.vrvHp = ∅ ∧ gs.prvHp = ∅ ∧ gs.vretRefs = (λ tid. null) ∧ gs.pretRefs = (λ tid. null) ∧ gs.owns = (λ r. None) ∧ pcf = (λ tid. idle) ∧ (∀ tid. lsf(tid).tid = tid)

A spec-lemma

Proof step 22 from proof fwsim-init (previous step) (back to tree)

mkgs(ps, vs, phead, vhead, vhead0, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns = (λ r. None), mkgs(ps, vs, phead, vhead, vhead0, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).pretRefs = (λ tid. null), mkgs(ps, vs, phead, vhead, vhead0, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).prvHp = ∅, mkgs(ps, vs, phead, vhead, vhead0, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs = (λ tid. null), mkgs(ps, vs, phead, vhead, vhead0, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp = ∅, pcf = (λ tid. idle), DQinit(mkstate(mkgs(q), alsf, apcf)), ∀ tid. lsf(tid).tid = tid, ∃ r, val. r ≠ null ∧ mkgs(ps, vs, phead, vhead, vhead0, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps = ∅[r, mk(val, Some(dummytid), null)] ∧ mkgs(ps, vs, phead, vhead, vhead0, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).phead = r ∧ mkgs(ps, vs, phead, vhead, vhead0, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead = r ∧ mkgs(ps, vs, phead, vhead, vhead0, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail = r ∧ mkgs(ps, vs, phead, vhead, vhead0, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl = r ' ∧ mkgs(ps, vs, phead, vhead, vhead0, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl = [] ∧ mkgs(ps, vs, phead, vhead, vhead0, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs = mkgs(ps, vs, phead, vhead, vhead0, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps, q ≠ content(qrl, ps) ∨ ¬ absls(mkgs(ps, vs, phead, vhead, vhead0, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid), alsf(tid)) ∨ abspc(mkgs(ps, vs, phead, vhead, vhead0, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid)) ≠ apcf(tid) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ content([], ps) = []; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .phead = phead; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .owns = owns; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .pretRefs = vretRefs0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .prvHp = vrvHp0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vretRefs = vretRefs; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vrvHp = vrvHp; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .ps = ps; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vs = ps0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .qrl = qrl; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .orl = qrl0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vtail = phead1; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vhead = phead0; (s)

Proof step 23 from proof fwsim-init (previous step) (back to tree)

phead ≠ null, DQinit(mkstate(mkgs(q), alsf, apcf)), ∀ tid. lsf(tid).tid = tid, q ≠ [] ∨ ¬ absls (mkgs (∅[phead, mk(val, Some(dummytid), null)], ∅[phead, mk(val, Some(dummytid), null)], phead, phead, phead, λ tid. null, λ tid. null, ∅, ∅, [], phead ', λ r. None, rvowns), lsf(tid), idle, alsf(tid)) ∨ abspc (mkgs (∅[phead, mk(val, Some(dummytid), null)], ∅[phead, mk(val, Some(dummytid), null)], phead, phead, phead, λ tid. null, λ tid. null, ∅, ∅, [], phead ', λ r. None, rvowns), lsf(tid), idle) ≠ apcf(tid) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: abs, name:abspc-def, seq:⊦ abspc(gs, ls, pc) = (pc = idle ⊃ idle ;(pc = ready ⊃ ready ;(pc = crashed ⊃ crashed ;( pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∧ ¬ ls.success ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∧ (ls.success → ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null) ∨ pc = E11 ∧ ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ⊃ invEnq ;(pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E4 ∨ pc = E13 ∨ pc = E17 ⊃ resEnq ;( pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∧ ¬ ls.success ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∧ (ls.success → gs.ps[ls.nxt].deqID = None) ∨ pc = D21 ∧ gs.ps[ls.nxt].deqID = None ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ⊃ invDeq ;resDeq ) ) ) ) ) ), subst:[gs, ls, pc] → [mkgs (∅[phead, mk(val, Some(dummytid), null)], ∅[phead, mk(val, Some(dummytid), null)], phead, phead, phead, λ tid. null, λ tid. null, ∅, ∅, [], phead ', λ r. None, rvowns), lsf(tid), idle], <all paths>

Additional information

Used terms: mkgs (∅[phead, mk(val, Some(dummytid), null)], ∅[phead, mk(val, Some(dummytid), null)], phead, phead, phead, λ tid. null, λ tid. null, ∅, ∅, [], phead ', λ r. None, rvowns), lsf(tid), idle

Proof step 24 from proof fwsim-init (previous step) (back to tree)

⊦ abspc(gs, ls, pc) = (pc = idle ⊃ idle ;(pc = ready ⊃ ready ;(pc = crashed ⊃ crashed ;( pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∧ ¬ ls.success ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∧ (ls.success → ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null) ∨ pc = E11 ∧ ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ⊃ invEnq ;(pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E4 ∨ pc = E13 ∨ pc = E17 ⊃ resEnq ;( pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∧ ¬ ls.success ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∧ (ls.success → gs.ps[ls.nxt].deqID = None) ∨ pc = D21 ∧ gs.ps[ls.nxt].deqID = None ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ⊃ invDeq ;resDeq ) ) ) ) ) )

A spec-lemma

Proof step 25 from proof fwsim-init (previous step) (back to tree)

phead ≠ null, DQinit(mkstate(mkgs(q), alsf, apcf)), ∀ tid. lsf(tid).tid = tid, q ≠ [] ∨ ¬ absls (mkgs (∅[phead, mk(val, Some(dummytid), null)], ∅[phead, mk(val, Some(dummytid), null)], phead, phead, phead, λ tid. null, λ tid. null, ∅, ∅, [], phead ', λ r. None, rvowns), lsf(tid), idle, alsf(tid)) ∨ (idle = idle ⊃ idle ;(idle = ready ⊃ ready ;(idle = crashed ⊃ crashed ;( idle = E1 ∨ idle = E2 ∨ idle = E3 ∨ idle = E4 ∧ ¬ lsf(tid).success ∨ idle = E5 ∨ idle = E6 ∨ idle = E7 ∨ idle = E8 ∨ idle = E9 ∨ idle = E10 ∧ ( lsf(tid).success → lsf(tid).lst = mkgs (∅[phead, mk(val, Some(dummytid), null)], ∅[phead, mk(val, Some(dummytid), null)], phead, phead, phead, λ tid. null, λ tid. null, ∅, ∅, [], phead ', λ r. None, rvowns) .vtail ∧ mkgs (∅[phead, mk(val, Some(dummytid), null)], ∅[phead, mk(val, Some(dummytid), null)], phead, phead, phead, λ tid. null, λ tid. null, ∅, ∅, [], phead ', λ r. None, rvowns) .ps [lsf(tid).lst ] .next = null) ∨ idle = E11 ∧ lsf(tid).lst = mkgs (∅[phead, mk(val, Some(dummytid), null)], ∅[phead, mk(val, Some(dummytid), null)], phead, phead, phead, λ tid. null, λ tid. null, ∅, ∅, [], phead ', λ r. None, rvowns) .vtail ∧ mkgs (∅[phead, mk(val, Some(dummytid), null)], ∅[phead, mk(val, Some(dummytid), null)], phead, phead, phead, λ tid. null, λ tid. null, ∅, ∅, [], phead ', λ r. None, rvowns) .ps [lsf(tid).lst ] .next = null ∨ idle = E13 ∨ idle = E14 ∨ idle = E15 ∨ idle = E16 ⊃ invEnq ;(idle = E10 ∨ idle = E11 ∨ idle = E12 ∨ idle = E4 ∨ idle = E13 ∨ idle = E17 ⊃ resEnq ;( idle = D1 ∨ idle = D2 ∨ idle = D3 ∨ idle = D4 ∨ idle = D5 ∨ idle = D6 ∧ ¬ lsf(tid).success ∨ idle = D7 ∨ idle = D8 ∨ idle = D9 ∨ idle = D10 ∨ idle = D11 ∨ idle = D12 ∨ idle = D13 ∨ idle = D14 ∨ idle = D16 ∨ idle = D17 ∨ idle = D18 ∨ idle = D19 ∨ idle = D20 ∧ ( lsf(tid).success → mkgs (∅[phead, mk(val, Some(dummytid), null)], ∅[phead, mk(val, Some(dummytid), null)], phead, phead, phead, λ tid. null, λ tid. null, ∅, ∅, [], phead ', λ r. None, rvowns) .ps [lsf(tid).nxt ] .deqID = None) ∨ idle = D21 ∧ mkgs (∅[phead, mk(val, Some(dummytid), null)], ∅[phead, mk(val, Some(dummytid), null)], phead, phead, phead, λ tid. null, λ tid. null, ∅, ∅, [], phead ', λ r. None, rvowns) .ps [lsf(tid).nxt ] .deqID = None ∨ idle = D25 ∨ idle = D26 ∨ idle = D27 ∨ idle = D28 ∨ idle = D29 ∨ idle = D30 ∨ idle = D31 ∨ idle = D32 ∨ idle = D33 ⊃ invDeq ;resDeq ) ) ) ) ) ) ≠ apcf(tid) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 26 from proof fwsim-init (previous step) (back to tree)

phead ≠ null, DQinit(mkstate(mkgs(q), alsf, apcf)), ∀ tid. lsf(tid).tid = tid, q ≠ [] ∨ ¬ absls (mkgs (∅[phead, mk(val, Some(dummytid), null)], ∅[phead, mk(val, Some(dummytid), null)], phead, phead, phead, λ tid. null, λ tid. null, ∅, ∅, [], phead ', λ r. None, rvowns), lsf(tid), idle, alsf(tid)) ∨ idle ≠ apcf(tid) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: abs, name:absls-def, seq:⊦ absls(gs, ls, pc, als) ↔ ls.tid = als.tid ∧ ( pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∧ ¬ ls.success ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∧ (ls.success → ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null) ∨ pc = E11 ∧ ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.value = als.ival) ∧ ( (pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14) ∧ ls.nxt = null → als.obsEmpty) ∧ ( pc = D20 ∧ ls.success ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D21 ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D22 → als.oval = ls.optval) ∧ ( pc = D15 ∨ pc = D23 ∨ pc = D24 ∨ pc = D6 ∧ ls.success ∨ pc = D34 → als.oval = gs.vrvHp[gs.vretRefs(ls.tid)]), subst:[gs, ls, pc, als] → [mkgs (∅[phead, mk(val, Some(dummytid), null)], ∅[phead, mk(val, Some(dummytid), null)], phead, phead, phead, λ tid. null, λ tid. null, ∅, ∅, [], phead ', λ r. None, rvowns), lsf(tid), idle, alsf(tid)], <all paths>

Additional information

Used terms: mkgs (∅[phead, mk(val, Some(dummytid), null)], ∅[phead, mk(val, Some(dummytid), null)], phead, phead, phead, λ tid. null, λ tid. null, ∅, ∅, [], phead ', λ r. None, rvowns), lsf(tid), idle, alsf(tid)

Proof step 27 from proof fwsim-init (previous step) (back to tree)

⊦ absls(gs, ls, pc, als) ↔ ls.tid = als.tid ∧ ( pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∧ ¬ ls.success ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∧ (ls.success → ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null) ∨ pc = E11 ∧ ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.value = als.ival) ∧ ((pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14) ∧ ls.nxt = null → als.obsEmpty) ∧ (pc = D20 ∧ ls.success ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D21 ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D22 → als.oval = ls.optval) ∧ (pc = D15 ∨ pc = D23 ∨ pc = D24 ∨ pc = D6 ∧ ls.success ∨ pc = D34 → als.oval = gs.vrvHp[gs.vretRefs(ls.tid)])

A spec-lemma

Proof step 28 from proof fwsim-init (previous step) (back to tree)

phead ≠ null, DQinit(mkstate(mkgs(q), alsf, apcf)), ∀ tid. lsf(tid).tid = tid, q ≠ [] ∨ ¬ ( lsf(tid).tid = alsf(tid).tid ∧ ( idle = E1 ∨ idle = E2 ∨ idle = E3 ∨ idle = E4 ∧ ¬ lsf(tid).success ∨ idle = E5 ∨ idle = E6 ∨ idle = E7 ∨ idle = E8 ∨ idle = E9 ∨ idle = E10 ∧ ( lsf(tid).success → lsf(tid).lst = mkgs (∅[phead, mk(val, Some(dummytid), null)], ∅[phead, mk(val, Some(dummytid), null)], phead, phead, phead, λ tid. null, λ tid. null, ∅, ∅, [], phead ', λ r. None, rvowns) .vtail ∧ mkgs (∅[phead, mk(val, Some(dummytid), null)], ∅[phead, mk(val, Some(dummytid), null)], phead, phead, phead, λ tid. null, λ tid. null, ∅, ∅, [], phead ', λ r. None, rvowns) .ps [lsf(tid).lst ] .next = null) ∨ idle = E11 ∧ lsf(tid).lst = mkgs (∅[phead, mk(val, Some(dummytid), null)], ∅[phead, mk(val, Some(dummytid), null)], phead, phead, phead, λ tid. null, λ tid. null, ∅, ∅, [], phead ', λ r. None, rvowns) .vtail ∧ mkgs (∅[phead, mk(val, Some(dummytid), null)], ∅[phead, mk(val, Some(dummytid), null)], phead, phead, phead, λ tid. null, λ tid. null, ∅, ∅, [], phead ', λ r. None, rvowns) .ps [lsf(tid).lst ] .next = null ∨ idle = E13 ∨ idle = E14 ∨ idle = E15 ∨ idle = E16 → lsf(tid).value = alsf(tid).ival) ∧ ((idle = D10 ∨ idle = D11 ∨ idle = D12 ∨ idle = D13 ∨ idle = D14) ∧ lsf(tid).nxt = null → alsf(tid).obsEmpty) ∧ ( idle = D20 ∧ lsf(tid).success ∧ mkgs (∅[phead, mk(val, Some(dummytid), null)], ∅[phead, mk(val, Some(dummytid), null)], phead, phead, phead, λ tid. null, λ tid. null, ∅, ∅, [], phead ', λ r. None, rvowns) .ps [lsf(tid).nxt ] .deqID ≠ None ∨ idle = D21 ∧ mkgs (∅[phead, mk(val, Some(dummytid), null)], ∅[phead, mk(val, Some(dummytid), null)], phead, phead, phead, λ tid. null, λ tid. null, ∅, ∅, [], phead ', λ r. None, rvowns) .ps [lsf(tid).nxt ] .deqID ≠ None ∨ idle = D22 → alsf(tid).oval = lsf(tid).optval) ∧ ( idle = D15 ∨ idle = D23 ∨ idle = D24 ∨ idle = D6 ∧ lsf(tid).success ∨ idle = D34 → alsf(tid).oval = mkgs (∅[phead, mk(val, Some(dummytid), null)], ∅[phead, mk(val, Some(dummytid), null)], phead, phead, phead, λ tid. null, λ tid. null, ∅, ∅, [], phead ', λ r. None, rvowns) .vrvHp [mkgs (∅[phead, mk(val, Some(dummytid), null)], ∅[phead, mk(val, Some(dummytid), null)], phead, phead, phead, λ tid. null, λ tid. null, ∅, ∅, [], phead ', λ r. None, rvowns) .vretRefs (lsf(tid).tid) ])) ∨ idle ≠ apcf(tid) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ D34 ≠ idle; (s) ⊦ D6 ≠ idle; (s) ⊦ D24 ≠ idle; (s) ⊦ D23 ≠ idle; (s) ⊦ D15 ≠ idle; (s) ⊦ D22 ≠ idle; (s) ⊦ D21 ≠ idle; (s) ⊦ D20 ≠ idle; (s) ⊦ D14 ≠ idle; (s) ⊦ D13 ≠ idle; (s) ⊦ D12 ≠ idle; (s) ⊦ D11 ≠ idle; (s) ⊦ D10 ≠ idle; (s) ⊦ E16 ≠ idle; (s) ⊦ E15 ≠ idle; (s) ⊦ E14 ≠ idle; (s) ⊦ E13 ≠ idle; (s) ⊦ E11 ≠ idle; (s) ⊦ E10 ≠ idle; (s) ⊦ E9 ≠ idle; (s) ⊦ E8 ≠ idle; (s) ⊦ E7 ≠ idle; (s) ⊦ E6 ≠ idle; (s) ⊦ E5 ≠ idle; (s) ⊦ E4 ≠ idle; (s) ⊦ E3 ≠ idle; (s) ⊦ E2 ≠ idle; (s) ⊦ E1 ≠ idle; (s)

Proof step 29 from proof fwsim-init (previous step) (back to tree)

phead ≠ null, DQinit(mkstate(mkgs(q), alsf, apcf)), ∀ tid. lsf(tid).tid = tid, q ≠ [] ∨ lsf(tid).tid ≠ alsf(tid).tid ∨ idle ≠ apcf(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] → [val0, val, obsEmpty, alsf(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, alsf(tid), oval, tid0, optval

Proof step 30 from proof fwsim-init (previous step) (back to tree)

alsf(tid) = mkls(tid0, obsEmpty, val, optval, val0, optval0), phead ≠ null, DQinit(mkstate(mkgs(q), alsf, apcf)), ∀ tid. lsf(tid).tid = tid, q ≠ [] ∨ lsf(tid).tid ≠ tid0 ∨ idle ≠ apcf(tid) ⊦

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:elim-mkls, seq:⊦ ( ( ( ( ( ( ( ( ( ( (tid = ls.tid ∧ value = ls.value) ∧ optval = ls.optval) ∧ node = ls.node) ∧ nd = ls.nd) ∧ (success ↔ ls.success)) ∧ lst = ls.lst) ∧ nxt = ls.nxt) ∧ rvref = ls.rvref) ∧ optval0 = ls.optval0) ∧ first = ls.first) ∧ othertid = ls.othertid) ∧ addr = ls.addr ↔ ls = mkls (tid, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr), subst:[value, nxt, optval0, node, nd, ls, addr, tid, lst, first, rvref, othertid, success, optval] → [val1, phead2, optval2, phead0, nd, lsf(tid), addr, tid1, phead1, phead3, rvref, tid2, obsEmpty0, optval1]

Additional information

Used simplifier rules: ⊦ ( ( ( ( ( ( ( ( ( ( (tid = ls.tid ∧ value = ls.value) ∧ optval = ls.optval) ∧ node = ls.node) ∧ nd = ls.nd) ∧ (success ↔ ls.success)) ∧ lst = ls.lst) ∧ nxt = ls.nxt) ∧ rvref = ls.rvref) ∧ optval0 = ls.optval0) ∧ first = ls.first) ∧ othertid = ls.othertid) ∧ addr = ls.addr ↔ ls = mkls (tid, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr); (elim) Used terms: value, nxt, optval1, node, nd, lsf(tid), addr, tid1, lst, first, rvref, othertid, success, optval1

Proof step 31 from proof fwsim-init (previous step) (back to tree)

alsf(tid) = mkls(tid0, obsEmpty, val, optval, val0, optval0), lsf(tid) = mkls(tid1, val1, optval1, phead0, nd, obsEmpty0, phead1, phead2, rvref, optval2, phead3, tid2, addr), phead ≠ null, DQinit(mkstate(mkgs(q), alsf, apcf)), ∀ tid. lsf(tid).tid = tid, q ≠ [] ∨ tid1 ≠ tid0 ∨ idle ≠ apcf(tid) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: abs, name:DQinit-def, seq:⊦ DQinit(mkstate(ags, alsf, apcf)) ↔ ags.queue = [] ∧ apcf = (λ tid. idle) ∧ (∀ tid. alsf(tid).tid = tid), subst:[ags, alsf, apcf] → [mkgs(q), alsf, apcf], <all paths>

Additional information

Used terms: mkgs(q), alsf, apcf

Proof step 32 from proof fwsim-init (previous step) (back to tree)

⊦ DQinit(mkstate(ags, alsf, apcf)) ↔ ags.queue = [] ∧ apcf = (λ tid. idle) ∧ (∀ tid. alsf(tid).tid = tid)

A spec-lemma

Proof step 33 from proof fwsim-init (previous step) (back to tree)

mkgs(q).queue = [], alsf(tid) = mkls(tid0, obsEmpty, val, optval, val0, optval0), apcf = (λ tid. idle), lsf(tid) = mkls(tid1, val1, optval1, phead0, nd, obsEmpty0, phead1, phead2, rvref, optval2, phead3, tid2, addr), phead ≠ null, ∀ tid. lsf(tid).tid = tid, ∀ tid. alsf(tid).tid = tid, q ≠ [] ∨ tid1 ≠ tid0 ∨ idle ≠ apcf(tid) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ mkgs(queue).queue = queue; (s)

Proof step 34 from proof fwsim-init (previous step) (back to tree)

alsf(tid) = mkls(tid0, obsEmpty, val, optval, val0, optval0), lsf(tid) = mkls(tid1, val1, optval1, phead0, nd, obsEmpty0, phead1, phead2, rvref, optval2, phead3, tid2, addr), phead ≠ null, tid1 ≠ tid0, ∀ tid. lsf(tid).tid = tid, ∀ tid. alsf(tid).tid = tid ⊦

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 5 terms: tid0 abort: F discard: F computed: T

Additional information

Used terms: tid0

Proof step 35 from proof fwsim-init (previous step) (back to tree)

lsf(tid0).tid = tid0, alsf(tid) = mkls(tid0, obsEmpty, val, optval, val0, optval0), lsf(tid) = mkls(tid1, val1, optval1, phead0, nd, obsEmpty0, phead1, phead2, rvref, optval2, phead3, tid2, addr), phead ≠ null, tid1 ≠ tid0, ∀ tid. alsf(tid).tid = tid, ∀ tid. lsf(tid).tid = tid ⊦

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:elim-mkls, seq:⊦ ( ( ( ( ( ( ( ( ( ( (tid = ls.tid ∧ value = ls.value) ∧ optval = ls.optval) ∧ node = ls.node) ∧ nd = ls.nd) ∧ (success ↔ ls.success)) ∧ lst = ls.lst) ∧ nxt = ls.nxt) ∧ rvref = ls.rvref) ∧ optval0 = ls.optval0) ∧ first = ls.first) ∧ othertid = ls.othertid) ∧ addr = ls.addr ↔ ls = mkls (tid, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr), subst:[value, nxt, optval0, node, nd, ls, addr, tid, lst, first, rvref, othertid, success, optval] → [val2, phead6, optval4, phead4, nd0, lsf(tid0), addr0, tid3, phead5, phead7, rvref0, tid4, obsEmpty1, optval3]

Additional information

Used simplifier rules: ⊦ ( ( ( ( ( ( ( ( ( ( (tid = ls.tid ∧ value = ls.value) ∧ optval = ls.optval) ∧ node = ls.node) ∧ nd = ls.nd) ∧ (success ↔ ls.success)) ∧ lst = ls.lst) ∧ nxt = ls.nxt) ∧ rvref = ls.rvref) ∧ optval0 = ls.optval0) ∧ first = ls.first) ∧ othertid = ls.othertid) ∧ addr = ls.addr ↔ ls = mkls (tid, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr); (elim) Used terms: value, nxt, optval3, node, nd0, lsf(tid0), addr0, tid3, lst, first, rvref0, othertid, success, optval3

Proof step 36 from proof fwsim-init (previous step) (back to tree)

alsf(tid) = mkls(tid0, obsEmpty, val, optval, val0, optval0), lsf(tid) = mkls(tid1, val1, optval1, phead0, nd, obsEmpty0, phead1, phead2, rvref, optval2, phead3, tid2, addr), lsf(tid0) = mkls(tid3, val2, optval3, phead4, nd0, obsEmpty1, phead5, phead6, rvref0, optval4, phead7, tid4, addr0), tid3 = tid0, phead ≠ null, tid1 ≠ tid0, ∀ tid. lsf(tid).tid = tid, ∀ tid. alsf(tid).tid = tid ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 37 from proof fwsim-init (previous step) (back to tree)

alsf(tid) = mkls(tid0, obsEmpty, val, optval, val0, optval0), lsf(tid0) = mkls(tid0, val2, optval3, phead4, nd0, obsEmpty1, phead5, phead6, rvref0, optval4, phead7, tid4, addr0), lsf(tid) = mkls(tid1, val1, optval1, phead0, nd, obsEmpty0, phead1, phead2, rvref, optval2, phead3, tid2, addr), phead ≠ null, tid1 ≠ tid0, ∀ tid. alsf(tid).tid = tid, ∀ tid. lsf(tid).tid = tid ⊦

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 7 terms: tid1 abort: F discard: F computed: T

Additional information

Used terms: tid1

Proof step 38 from proof fwsim-init (previous step) (back to tree)

lsf(tid1).tid = tid1, alsf(tid) = mkls(tid0, obsEmpty, val, optval, val0, optval0), lsf(tid) = mkls(tid1, val1, optval1, phead0, nd, obsEmpty0, phead1, phead2, rvref, optval2, phead3, tid2, addr), lsf(tid0) = mkls(tid0, val2, optval3, phead4, nd0, obsEmpty1, phead5, phead6, rvref0, optval4, phead7, tid4, addr0), phead ≠ null, tid1 ≠ tid0, ∀ tid. lsf(tid).tid = tid, ∀ tid. alsf(tid).tid = tid ⊦

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:elim-mkls, seq:⊦ ( ( ( ( ( ( ( ( ( ( (tid = ls.tid ∧ value = ls.value) ∧ optval = ls.optval) ∧ node = ls.node) ∧ nd = ls.nd) ∧ (success ↔ ls.success)) ∧ lst = ls.lst) ∧ nxt = ls.nxt) ∧ rvref = ls.rvref) ∧ optval0 = ls.optval0) ∧ first = ls.first) ∧ othertid = ls.othertid) ∧ addr = ls.addr ↔ ls = mkls (tid, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr), subst:[value, nxt, optval0, node, nd, ls, addr, tid, lst, first, rvref, othertid, success, optval] → [val3, phead10, optval6, phead8, nd1, lsf(tid1), addr1, tid3, phead9, phead11, rvref1, tid5, obsEmpty2, optval5]

Additional information

Used simplifier rules: ⊦ ( ( ( ( ( ( ( ( ( ( (tid = ls.tid ∧ value = ls.value) ∧ optval = ls.optval) ∧ node = ls.node) ∧ nd = ls.nd) ∧ (success ↔ ls.success)) ∧ lst = ls.lst) ∧ nxt = ls.nxt) ∧ rvref = ls.rvref) ∧ optval0 = ls.optval0) ∧ first = ls.first) ∧ othertid = ls.othertid) ∧ addr = ls.addr ↔ ls = mkls (tid, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr); (elim) Used terms: value, nxt, optval5, node, nd1, lsf(tid1), addr1, tid3, lst, first, rvref1, othertid, success, optval5

Proof step 39 from proof fwsim-init (previous step) (back to tree)

alsf(tid) = mkls(tid0, obsEmpty, val, optval, val0, optval0), lsf(tid0) = mkls(tid0, val2, optval3, phead4, nd0, obsEmpty1, phead5, phead6, rvref0, optval4, phead7, tid4, addr0), lsf(tid) = mkls(tid1, val1, optval1, phead0, nd, obsEmpty0, phead1, phead2, rvref, optval2, phead3, tid2, addr), lsf(tid1) = mkls(tid3, val3, optval5, phead8, nd1, obsEmpty2, phead9, phead10, rvref1, optval6, phead11, tid5, addr1), tid3 = tid1, phead ≠ null, tid1 ≠ tid0, ∀ tid. alsf(tid).tid = tid, ∀ tid. lsf(tid).tid = tid ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 40 from proof fwsim-init (previous step) (back to tree)

alsf(tid) = mkls(tid0, obsEmpty, val, optval, val0, optval0), lsf(tid1) = mkls(tid1, val3, optval5, phead8, nd1, obsEmpty2, phead9, phead10, rvref1, optval6, phead11, tid5, addr1), lsf(tid) = mkls(tid1, val1, optval1, phead0, nd, obsEmpty0, phead1, phead2, rvref, optval2, phead3, tid2, addr), lsf(tid0) = mkls(tid0, val2, optval3, phead4, nd0, obsEmpty1, phead5, phead6, rvref0, optval4, phead7, tid4, addr0), phead ≠ null, tid1 ≠ tid0, ∀ tid. lsf(tid).tid = tid, ∀ tid. alsf(tid).tid = tid ⊦

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 7 terms: tid abort: F discard: F computed: F

Additional information

Used terms: tid

Proof step 41 from proof fwsim-init (previous step) (back to tree)

lsf(tid).tid = tid, alsf(tid) = mkls(tid0, obsEmpty, val, optval, val0, optval0), lsf(tid0) = mkls(tid0, val2, optval3, phead4, nd0, obsEmpty1, phead5, phead6, rvref0, optval4, phead7, tid4, addr0), lsf(tid) = mkls(tid1, val1, optval1, phead0, nd, obsEmpty0, phead1, phead2, rvref, optval2, phead3, tid2, addr), lsf(tid1) = mkls(tid1, val3, optval5, phead8, nd1, obsEmpty2, phead9, phead10, rvref1, optval6, phead11, tid5, addr1), phead ≠ null, tid1 ≠ tid0, ∀ tid. alsf(tid).tid = tid, ∀ tid. lsf(tid).tid = tid ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) = mkls (tid1, value0, optval1, node3, nd0, success0, node4, node5, rvref1, optval2, node6, tid2, rvref2) ↔ tid = tid1 ∧ value = value0 ∧ optval = optval1 ∧ node = node3 ∧ nd = nd0 ∧ (success ↔ success0) ∧ node0 = node4 ∧ node1 = node5 ∧ rvref = rvref1 ∧ optval0 = optval2 ∧ node2 = node6 ∧ tid0 = tid2 ∧ rvref0 = rvref2; (ws) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .tid = tid; (s)

Proof step 42 from proof fwsim-init (previous step) (back to tree)

alsf(tid1) = mkls(tid0, obsEmpty, val, optval, val0, optval0), lsf(tid0) = mkls(tid0, val2, optval3, phead4, nd0, obsEmpty1, phead5, phead6, rvref0, optval4, phead7, tid4, addr0), lsf(tid1) = mkls(tid1, val3, optval5, phead8, nd1, obsEmpty2, phead9, phead10, rvref1, optval6, phead11, tid5, addr1), phead ≠ null, tid1 ≠ tid0, ∀ tid. alsf(tid).tid = tid, ∀ tid. lsf(tid).tid = tid ⊦

User applied rule all left

And closed the goal!

Rule argument

pos: left 6 terms: tid1 abort: F discard: F computed: T

Additional information

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

Proof Tree for fwsim-init (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