[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 DurQstep-def0 (conclusion) (back to tree)

⊦ DurQstep(mkstate(gs, lsf, pcf), a, durqs0) ↔ (a = globalACrash ⊃ durqs0 = mkstate(gs, lsf, λ tid. (pcf(tid) = idle ⊃ idle;crashed)) ;∃ tid. pre(gs, lsf(tid), pcf(tid), a) ∧ durqs0 = mkstate(gstepf(gs, lsf(tid), pcf(tid), a), lsf(tid; lstepf(gs, lsf(tid), pcf(tid), a)), pcf(tid; pcstepf(gs, lsf(tid), pcf(tid), a))) )

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: durqs0

Additional information

Used simplifier rules: gen-DurQState: ⊦ ;

Proof step 2 from proof DurQstep-def0 (previous step) (back to tree)

durqs0 = mkstate(gs0, lsf0, pcf0) ⊦ DurQstep(mkstate(gs, lsf, pcf), a, durqs0) ↔ (a = globalACrash ⊃ durqs0 = mkstate(gs, lsf, λ tid. (pcf(tid) = idle ⊃ idle;crashed)) ;∃ tid. pre(gs, lsf(tid), pcf(tid), a) ∧ durqs0 = mkstate(gstepf(gs, lsf(tid), pcf(tid), a), lsf(tid; lstepf(gs, lsf(tid), pcf(tid), a)), pcf(tid; pcstepf(gs, lsf(tid), pcf(tid), a))) )

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 3 from proof DurQstep-def0 (previous step) (back to tree)

⊦ DurQstep(mkstate(gs, lsf, pcf), a, mkstate(gs0, lsf0, pcf0)) ↔ (a = globalACrash ⊃ mkstate(gs0, lsf0, pcf0) = mkstate(gs, lsf, λ tid. (pcf(tid) = idle ⊃ idle;crashed)) ;∃ tid. pre(gs, lsf(tid), pcf(tid), a) ∧ mkstate(gs0, lsf0, pcf0) = mkstate(gstepf(gs, lsf(tid), pcf(tid), a), lsf(tid; lstepf(gs, lsf(tid), pcf(tid), a)), pcf(tid; pcstepf(gs, lsf(tid), pcf(tid), a))) )

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:DurQstep, seq:⊦ DurQstep(mkstate(gs, lsf, pcf), a, mkstate(gs0, lsf0, pcf0)) ↔ (∃ tid, ls, pc. lstep(gs, lsf(tid), pcf(tid), a, gs0, ls, pc) ∧ lsf0 = lsf(tid; ls) ∧ pcf0 = pcf(tid; pc)) ∨ a = globalACrash ∧ ⟨ACrash(; pcf)⟩ (gs0 = gs ∧ lsf0 = lsf ∧ pcf0 = pcf), subst:[pcf0, lsf0, lsf, gs0, a, gs, pcf] → [pcf0, lsf0, lsf, gs0, a, gs, pcf], <all paths>

Additional information

Used terms: pcf0, lsf0, lsf, gs0, a, gs, pcf

Proof step 4 from proof DurQstep-def0 (previous step) (back to tree)

⊦ DurQstep(mkstate(gs, lsf, pcf), a, mkstate(gs0, lsf0, pcf0)) ↔ (∃ tid, ls, pc. lstep(gs, lsf(tid), pcf(tid), a, gs0, ls, pc) ∧ lsf0 = lsf(tid; ls) ∧ pcf0 = pcf(tid; pc)) ∨ a = globalACrash ∧ ⟨ACrash(; pcf)⟩ (gs0 = gs ∧ lsf0 = lsf ∧ pcf0 = pcf)

Lemma DurQstep

Proof step 5 from proof DurQstep-def0 (previous step) (back to tree)

⊦ (∃ tid, ls, pc. lstep(gs, lsf(tid), pcf(tid), a, gs0, ls, pc) ∧ lsf0 = lsf(tid; ls) ∧ pcf0 = pcf(tid; pc)) ∨ a = globalACrash ∧ ⟨ACrash(; pcf)⟩ (gs0 = gs ∧ lsf0 = lsf ∧ pcf0 = pcf) ↔ (a = globalACrash ⊃ mkstate(gs0, lsf0, pcf0) = mkstate(gs, lsf, λ tid. (pcf(tid) = idle ⊃ idle;crashed)) ;∃ tid. pre(gs, lsf(tid), pcf(tid), a) ∧ mkstate(gs0, lsf0, pcf0) = mkstate(gstepf(gs, lsf(tid), pcf(tid), a), lsf(tid; lstepf(gs, lsf(tid), pcf(tid), a)), pcf(tid; pcstepf(gs, lsf(tid), pcf(tid), a))) )

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 6 from proof DurQstep-def0 (previous step) (back to tree)

(∃ tid, ls, pc. lstep(gs, lsf(tid), pcf(tid), a, gs0, ls, pc) ∧ lsf0 = lsf(tid; ls) ∧ pcf0 = pcf(tid; pc)) ∨ a = globalACrash ∧ ⟨ACrash(; pcf)⟩ (gs0 = gs ∧ lsf0 = lsf ∧ pcf0 = pcf) ⊦ (a = globalACrash ⊃ mkstate(gs0, lsf0, pcf0) = mkstate(gs, lsf, λ tid. (pcf(tid) = idle ⊃ idle;crashed)) ;∃ tid. pre(gs, lsf(tid), pcf(tid), a) ∧ mkstate(gs0, lsf0, pcf0) = mkstate(gstepf(gs, lsf(tid), pcf(tid), a), lsf(tid; lstepf(gs, lsf(tid), pcf(tid), a)), pcf(tid; pcstepf(gs, lsf(tid), pcf(tid), a))) )

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 7 from proof DurQstep-def0 (previous step) (back to tree)

lstep(gs, lsf(tid), pcf(tid), a, gs0, ls, pc) ∧ lsf0 = lsf(tid; ls) ∧ pcf0 = pcf(tid; pc) ∨ a = globalACrash ∧ ⟨ACrash(; pcf)⟩ (gs0 = gs ∧ lsf0 = lsf ∧ pcf0 = pcf) ⊦ (a = globalACrash ⊃ mkstate(gs0, lsf0, pcf0) = mkstate(gs, lsf, λ tid. (pcf(tid) = idle ⊃ idle;crashed)) ;∃ tid. pre(gs, lsf(tid), pcf(tid), a) ∧ mkstate(gs0, lsf0, pcf0) = mkstate(gstepf(gs, lsf(tid), pcf(tid), a), lsf(tid; lstepf(gs, lsf(tid), pcf(tid), a)), pcf(tid; pcstepf(gs, lsf(tid), pcf(tid), a))) )

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 8 from proof DurQstep-def0 (previous step) (back to tree)

lstep(gs, lsf(tid), pcf(tid), a, gs0, ls, pc) ∧ lsf0 = lsf(tid; ls) ∧ pcf0 = pcf(tid; pc) ∨ a = globalACrash ∧ ⟨ACrash(; pcf)⟩ (gs0 = gs ∧ lsf0 = lsf ∧ pcf0 = pcf), a = globalACrash, mkstate(gs0, lsf0, pcf0) ≠ mkstate(gs, lsf, λ tid. (pcf(tid) = idle ⊃ idle;crashed)) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 9 from proof DurQstep-def0 (previous step) (back to tree)

lstep(gs, lsf(tid), pcf(tid), globalACrash, gs0, ls, pc) ∧ lsf0 = lsf(tid; ls) ∧ pcf0 = pcf(tid; pc) ∨ ⟨ACrash(; pcf)⟩ (gs0 = gs ∧ lsf0 = lsf ∧ pcf0 = pcf), mkstate(gs0, lsf0, pcf0) ≠ mkstate(gs, lsf, λ tid. (pcf(tid) = idle ⊃ idle;crashed)) ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 1

Additional information

Proof step 10 from proof DurQstep-def0 (previous step) (back to tree)

lsf0 = lsf(tid; ls), pcf0 = pcf(tid; pc), mkstate(gs0, lsf0, pcf0) ≠ mkstate(gs, lsf, λ tid. (pcf(tid) = idle ⊃ idle;crashed)), lstep(gs, lsf(tid), pcf(tid), globalACrash, gs0, ls, pc) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 11 from proof DurQstep-def0 (previous step) (back to tree)

mkstate(gs0, lsf(tid; ls), pcf(tid; pc)) ≠ mkstate(gs, lsf, λ tid. (pcf(tid) = idle ⊃ idle;crashed)), lstep(gs, lsf(tid), pcf(tid), globalACrash, gs0, ls, pc) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:lstep, seq:⊦ lstep(gs, ls, pc, a, gs0, ls0, pc0) ↔ pre(gs, ls, pc, a) ∧ ls0 = lstepf(gs, ls, pc, a) ∧ gs0 = gstepf(gs, ls, pc, a) ∧ pc0 = pcstepf(gs, ls, pc, a), subst:[ls0, gs0, a, gs, pc, pc0, ls] → [ls, gs0, globalACrash, gs, pcf(tid), pc, lsf(tid)], <all paths>

Additional information

Used terms: ls, gs0, globalACrash, gs, pcf(tid), pc, lsf(tid)

Proof step 12 from proof DurQstep-def0 (previous step) (back to tree)

⊦ lstep(gs, ls, pc, a, gs0, ls0, pc0) ↔ pre(gs, ls, pc, a) ∧ ls0 = lstepf(gs, ls, pc, a) ∧ gs0 = gstepf(gs, ls, pc, a) ∧ pc0 = pcstepf(gs, ls, pc, a)

Lemma lstep

Proof step 13 from proof DurQstep-def0 (previous step) (back to tree)

gs0 = gstepf(gs, lsf(tid), pcf(tid), globalACrash), ls = lstepf(gs, lsf(tid), pcf(tid), globalACrash), pc = pcstepf(gs, lsf(tid), pcf(tid), globalACrash), mkstate(gs0, lsf(tid; ls), pcf(tid; pc)) ≠ mkstate(gs, lsf, λ tid. (pcf(tid) = idle ⊃ idle;crashed)), pre(gs, lsf(tid), pcf(tid), globalACrash) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 14 from proof DurQstep-def0 (previous step) (back to tree)

mkstate (gstepf(gs, lsf(tid), pcf(tid), globalACrash), lsf(tid; lstepf(gs, lsf(tid), pcf(tid), globalACrash)), pcf(tid; pcstepf(gs, lsf(tid), pcf(tid), globalACrash))) ≠ mkstate(gs, lsf, λ tid. (pcf(tid) = idle ⊃ idle;crashed)), pre(gs, lsf(tid), pcf(tid), globalACrash) ⊦

User applied rule structural induction

And closed the goal!

Rule argument

term: pcf(tid)

Additional information

Used simplifier rules: gen-DurQPC: ⊦ ; pre-crashed: ⊦ pre(gs, ls, crashed, a) ↔ false; pre-idle: ⊦ pre(gs, ls, idle, a) ↔ a = callARun(ls.tid); disj-callARun-globalACrash: ⊦ callARun(tid) ≠ globalACrash; gstepf-invDeq-ADODEQ: ⊦ gstepf(gs, ls, invDeq, a) = (gs.queue = [] ⊃ gs;gs.queue:= gs.queue.tail); pre-invDeq: ⊦ pre(gs, ls, invDeq, a) ↔ a = ADoDeq(ls.tid); disj-ADoDeq-globalACrash: ⊦ ADoDeq(tid) ≠ globalACrash; pre-invEnq: ⊦ pre(gs, ls, invEnq, a) ↔ a = ADoEnq(ls.tid); disj-ADoEnq-globalACrash: ⊦ ADoEnq(tid) ≠ globalACrash; gstepf-ready: ⊦ gstepf(gs, ls, ready, a) = gs; pre-ready: ⊦ pre(gs, ls, ready, a) ↔ (∃ value. a = AInvEnq(ls.tid, value)) ∨ a = AInvDeq(ls.tid); disj-AInvEnq-globalACrash: ⊦ AInvEnq(tid, val) ≠ globalACrash; disj-AInvDeq-globalACrash: ⊦ AInvDeq(tid) ≠ globalACrash; pre-resDeq: ⊦ pre(gs, ls, resDeq, a) ↔ a = ARetDeq(ls.tid, ls.oval); disj-ARetDeq-globalACrash: ⊦ ARetDeq(tid, optval) ≠ globalACrash; pre-resEnq: ⊦ pre(gs, ls, resEnq, a) ↔ a = ARetEnq(ls.tid); disj-ARetEnq-globalACrash: ⊦ ARetEnq(tid) ≠ globalACrash;

Proof step 15 from proof DurQstep-def0 (previous step) (back to tree)

⟨ACrash(; pcf)⟩ (gs0 = gs ∧ lsf0 = lsf ∧ pcf0 = pcf), mkstate(gs0, lsf0, pcf0) ≠ mkstate(gs, lsf, λ tid. (pcf(tid) = idle ⊃ idle;crashed)) ⊦

User applied rule call left

And obtained the following new goals

Rule argument

pos: left 1

Additional information

Used simplifier rules: Crash: ⊦ ;

Proof step 16 from proof DurQstep-def0 (previous step) (back to tree)

⟨pcf := λ tid. (pcf(tid) = idle ⊃ idle;crashed)⟩ (gs0 = gs ∧ lsf0 = lsf ∧ pcf0 = pcf), mkstate(gs0, lsf0, pcf0) ≠ mkstate(gs, lsf, λ tid. (pcf(tid) = idle ⊃ idle;crashed)) ⊦

Heuristic symbolic execution applied rule assign left

And closed the goal!

Rule argument

Additional information

Proof step 17 from proof DurQstep-def0 (previous step) (back to tree)

lstep(gs, lsf(tid), pcf(tid), a, gs0, ls, pc) ∧ lsf0 = lsf(tid; ls) ∧ pcf0 = pcf(tid; pc) ∨ a = globalACrash ∧ ⟨ACrash(; pcf)⟩ (gs0 = gs ∧ lsf0 = lsf ∧ pcf0 = pcf), a ≠ globalACrash ⊦ ∃ tid. pre(gs, lsf(tid), pcf(tid), a) ∧ mkstate(gs0, lsf0, pcf0) = mkstate(gstepf(gs, lsf(tid), pcf(tid), a), lsf(tid; lstepf(gs, lsf(tid), pcf(tid), a)), pcf(tid; pcstepf(gs, lsf(tid), pcf(tid), a)))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 18 from proof DurQstep-def0 (previous step) (back to tree)

a ≠ globalACrash, lstep(gs, lsf(tid), pcf(tid), a, gs0, ls, pc) ⊦ ∃ tid0. pre(gs, lsf(tid0), pcf(tid0), a) ∧ mkstate(gs0, lsf(tid; ls), pcf(tid; pc)) = mkstate(gstepf(gs, lsf(tid0), pcf(tid0), a), lsf(tid0; lstepf(gs, lsf(tid0), pcf(tid0), a)), pcf(tid0; pcstepf(gs, lsf(tid0), pcf(tid0), a)))

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:lstep, seq:⊦ lstep(gs, ls, pc, a, gs0, ls0, pc0) ↔ pre(gs, ls, pc, a) ∧ ls0 = lstepf(gs, ls, pc, a) ∧ gs0 = gstepf(gs, ls, pc, a) ∧ pc0 = pcstepf(gs, ls, pc, a), subst:[ls0, gs0, a, gs, pc, pc0, ls] → [ls, gs0, a, gs, pcf(tid), pc, lsf(tid)], <all paths>

Additional information

Used terms: ls, gs0, a, gs, pcf(tid), pc, lsf(tid)

Proof step 19 from proof DurQstep-def0 (previous step) (back to tree)

⊦ lstep(gs, ls, pc, a, gs0, ls0, pc0) ↔ pre(gs, ls, pc, a) ∧ ls0 = lstepf(gs, ls, pc, a) ∧ gs0 = gstepf(gs, ls, pc, a) ∧ pc0 = pcstepf(gs, ls, pc, a)

Lemma lstep

Proof step 20 from proof DurQstep-def0 (previous step) (back to tree)

gs0 = gstepf(gs, lsf(tid), pcf(tid), a), ls = lstepf(gs, lsf(tid), pcf(tid), a), pc = pcstepf(gs, lsf(tid), pcf(tid), a), a ≠ globalACrash, pre(gs, lsf(tid), pcf(tid), a) ⊦ ∃ tid0. pre(gs, lsf(tid0), pcf(tid0), a) ∧ mkstate(gs0, lsf(tid; ls), pcf(tid; pc)) = mkstate(gstepf(gs, lsf(tid0), pcf(tid0), a), lsf(tid0; lstepf(gs, lsf(tid0), pcf(tid0), a)), pcf(tid0; pcstepf(gs, lsf(tid0), pcf(tid0), a)))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 21 from proof DurQstep-def0 (previous step) (back to tree)

a ≠ globalACrash, pre(gs, lsf(tid), pcf(tid), a) ⊦ ∃ tid0. pre(gs, lsf(tid0), pcf(tid0), a) ∧ mkstate(gstepf(gs, lsf(tid), pcf(tid), a), lsf(tid; lstepf(gs, lsf(tid), pcf(tid), a)), pcf(tid; pcstepf(gs, lsf(tid), pcf(tid), a))) = mkstate(gstepf(gs, lsf(tid0), pcf(tid0), a), lsf(tid0; lstepf(gs, lsf(tid0), pcf(tid0), a)), pcf(tid0; pcstepf(gs, lsf(tid0), pcf(tid0), a)))

Heuristic quantifier closing applied rule exists right

And closed the goal!

Rule argument

pos: right 1 terms: tid

Additional information

Used terms: tid

Proof step 22 from proof DurQstep-def0 (previous step) (back to tree)

(a = globalACrash ⊃ mkstate(gs0, lsf0, pcf0) = mkstate(gs, lsf, λ tid. (pcf(tid) = idle ⊃ idle;crashed)) ;∃ tid. pre(gs, lsf(tid), pcf(tid), a) ∧ mkstate(gs0, lsf0, pcf0) = mkstate(gstepf(gs, lsf(tid), pcf(tid), a), lsf(tid; lstepf(gs, lsf(tid), pcf(tid), a)), pcf(tid; pcstepf(gs, lsf(tid), pcf(tid), a))) ) ⊦ a = globalACrash ∧ ⟨ACrash(; pcf)⟩ (gs0 = gs ∧ lsf0 = lsf ∧ pcf0 = pcf), ∃ tid, ls, pc. lstep(gs, lsf(tid), pcf(tid), a, gs0, ls, pc) ∧ lsf0 = lsf(tid; ls) ∧ pcf0 = pcf(tid; pc)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 23 from proof DurQstep-def0 (previous step) (back to tree)

(a = globalACrash ⊃ mkstate(gs0, lsf0, pcf0) = mkstate(gs, lsf, λ tid. (pcf(tid) = idle ⊃ idle;crashed)) ; pre(gs, lsf(tid), pcf(tid), a) ∧ mkstate(gs0, lsf0, pcf0) = mkstate(gstepf(gs, lsf(tid), pcf(tid), a), lsf(tid; lstepf(gs, lsf(tid), pcf(tid), a)), pcf(tid; pcstepf(gs, lsf(tid), pcf(tid), a))) ) ⊦ a = globalACrash ∧ ⟨ACrash(; pcf)⟩ (gs0 = gs ∧ lsf0 = lsf ∧ pcf0 = pcf), ∃ tid, ls, pc. lstep(gs, lsf(tid), pcf(tid), a, gs0, ls, pc) ∧ lsf0 = lsf(tid; ls) ∧ pcf0 = pcf(tid; pc)

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 1

Additional information

Proof step 24 from proof DurQstep-def0 (previous step) (back to tree)

a = globalACrash, mkstate(gs0, lsf0, pcf0) = mkstate(gs, lsf, λ tid. (pcf(tid) = idle ⊃ idle;crashed)) ⊦ a = globalACrash ∧ ⟨ACrash(; pcf)⟩ (gs0 = gs ∧ lsf0 = lsf ∧ pcf0 = pcf), ∃ tid, ls, pc. lstep(gs, lsf(tid), pcf(tid), a, gs0, ls, pc) ∧ lsf0 = lsf(tid; ls) ∧ pcf0 = pcf(tid; pc)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: inj-mkstate: ⊦ mkstate(gstate, lsf, pcf) = mkstate(gstate0, lsf0, pcf0) ↔ gstate = gstate0 ∧ lsf = lsf0 ∧ pcf = pcf0;

Proof step 25 from proof DurQstep-def0 (previous step) (back to tree)

pcf0 = (λ tid. (pcf(tid) = idle ⊃ idle;crashed)) ⊦ ⟨ACrash(; pcf)⟩ (pcf0 = pcf), ∃ tid, pc. lstep(gs, lsf(tid), pcf(tid), globalACrash, gs, lsf(tid), pc) ∧ (λ tid. (pcf(tid) = idle ⊃ idle;crashed)) = pcf(tid; pc)

User applied rule call right

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Used simplifier rules: Crash: ⊦ ;

Proof step 26 from proof DurQstep-def0 (previous step) (back to tree)

pcf0 = (λ tid. (pcf(tid) = idle ⊃ idle;crashed)) ⊦ ⟨pcf := λ tid. (pcf(tid) = idle ⊃ idle;crashed)⟩ (pcf0 = pcf), ∃ tid, pc. lstep(gs, lsf(tid), pcf(tid), globalACrash, gs, lsf(tid), pc) ∧ (λ tid. (pcf(tid) = idle ⊃ idle;crashed)) = pcf(tid; pc)

Heuristic symbolic execution applied rule assign right

And closed the goal!

Rule argument

Additional information

Proof step 27 from proof DurQstep-def0 (previous step) (back to tree)

mkstate(gs0, lsf0, pcf0) = mkstate(gstepf(gs, lsf(tid), pcf(tid), a), lsf(tid; lstepf(gs, lsf(tid), pcf(tid), a)), pcf(tid; pcstepf(gs, lsf(tid), pcf(tid), a))), a ≠ globalACrash, pre(gs, lsf(tid), pcf(tid), a) ⊦ a = globalACrash ∧ ⟨ACrash(; pcf)⟩ (gs0 = gs ∧ lsf0 = lsf ∧ pcf0 = pcf), ∃ tid, ls, pc. lstep(gs, lsf(tid), pcf(tid), a, gs0, ls, pc) ∧ lsf0 = lsf(tid; ls) ∧ pcf0 = pcf(tid; pc)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: inj-mkstate: ⊦ mkstate(gstate, lsf, pcf) = mkstate(gstate0, lsf0, pcf0) ↔ gstate = gstate0 ∧ lsf = lsf0 ∧ pcf = pcf0;

Proof step 28 from proof DurQstep-def0 (previous step) (back to tree)

a ≠ globalACrash, pre(gs, lsf(tid), pcf(tid), a) ⊦ ∃ tid0, ls, pc. lstep(gs, lsf(tid0), pcf(tid0), a, gstepf(gs, lsf(tid), pcf(tid), a), ls, pc) ∧ lsf(tid; lstepf(gs, lsf(tid), pcf(tid), a)) = lsf(tid0; ls) ∧ pcf(tid; pcstepf(gs, lsf(tid), pcf(tid), a)) = pcf(tid0; pc)

User applied rule exists right

And obtained the following new goals

Rule argument

pos: right 1 terms: tid, lstepf(gs, lsf(tid), pcf(tid), a), pcstepf(gs, lsf(tid), pcf(tid), a) abort: F discard: F computed: T

Additional information

Used terms: tid, lstepf(gs, lsf(tid), pcf(tid), a), pcstepf(gs, lsf(tid), pcf(tid), a)

Proof step 29 from proof DurQstep-def0 (previous step) (back to tree)

a ≠ globalACrash, pre(gs, lsf(tid), pcf(tid), a) ⊦ ∃ tid0, ls, pc. lstep(gs, lsf(tid0), pcf(tid0), a, gstepf(gs, lsf(tid), pcf(tid), a), ls, pc) ∧ lsf(tid; lstepf(gs, lsf(tid), pcf(tid), a)) = lsf(tid0; ls) ∧ pcf(tid; pcstepf(gs, lsf(tid), pcf(tid), a)) = pcf(tid0; pc), lstep(gs, lsf(tid), pcf(tid), a, gstepf(gs, lsf(tid), pcf(tid), a), lstepf(gs, lsf(tid), pcf(tid), a), pcstepf(gs, lsf(tid), pcf(tid), a)) ∧ lsf(tid; lstepf(gs, lsf(tid), pcf(tid), a)) = lsf(tid; lstepf(gs, lsf(tid), pcf(tid), a)) ∧ pcf(tid; pcstepf(gs, lsf(tid), pcf(tid), a)) = pcf(tid; pcstepf(gs, lsf(tid), pcf(tid), a))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 30 from proof DurQstep-def0 (previous step) (back to tree)

a ≠ globalACrash, pre(gs, lsf(tid), pcf(tid), a), ¬ lstep(gs, lsf(tid), pcf(tid), a, gstepf(gs, lsf(tid), pcf(tid), a), lstepf(gs, lsf(tid), pcf(tid), a), pcstepf(gs, lsf(tid), pcf(tid), a)) ⊦ ∃ tid0, ls, pc. lstep(gs, lsf(tid0), pcf(tid0), a, gstepf(gs, lsf(tid), pcf(tid), a), ls, pc) ∧ lsf(tid; lstepf(gs, lsf(tid), pcf(tid), a)) = lsf(tid0; ls) ∧ pcf(tid; pcstepf(gs, lsf(tid), pcf(tid), a)) = pcf(tid0; pc)

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:lstep, seq:⊦ lstep(gs, ls, pc, a, gs0, ls0, pc0) ↔ pre(gs, ls, pc, a) ∧ ls0 = lstepf(gs, ls, pc, a) ∧ gs0 = gstepf(gs, ls, pc, a) ∧ pc0 = pcstepf(gs, ls, pc, a), subst:[ls0, gs0, a, gs, pc, pc0, ls] → [lstepf(gs, lsf(tid), pcf(tid), a), gstepf(gs, lsf(tid), pcf(tid), a), a, gs, pcf(tid), pcstepf(gs, lsf(tid), pcf(tid), a), lsf(tid)], <all paths>

Additional information

Used terms: lstepf(gs, lsf(tid), pcf(tid), a), gstepf(gs, lsf(tid), pcf(tid), a), a, gs, pcf(tid), pcstepf(gs, lsf(tid), pcf(tid), a), lsf(tid)

Proof step 31 from proof DurQstep-def0 (previous step) (back to tree)

⊦ lstep(gs, ls, pc, a, gs0, ls0, pc0) ↔ pre(gs, ls, pc, a) ∧ ls0 = lstepf(gs, ls, pc, a) ∧ gs0 = gstepf(gs, ls, pc, a) ∧ pc0 = pcstepf(gs, ls, pc, a)

Lemma lstep

Proof Tree for DurQstep-def0 (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