[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 step-absstep-I14-I15-tau-same (conclusion) (back to tree)

# gs.ar ≠ 0 ∧ htok(gs.ar), # gs0.ar ≠ 0 ∧ htok(gs0.ar), lsf(tid) = ls, lsf0(tid) = ls0, alsf(tid) = als, alsf(tid).tid = tid, lsf(tid).tid = tid, ∀ tid0. tid0 ≠ tid → lsf(tid0).tid = tid0, ∀ tid0. tid0 ≠ tid → alsf(tid0).tid = tid0, pcf(tid) = I14, pcf0(tid) = I15, apcf(tid) = apc, ls.e = ls.e0 ∧ ls.e = gs.ar[ls.n] ∧ allslotsfull(gs.ar, ls.n0, ls.n, ls.e, false) ∧ ls.n < # gs.ar ∧ ls.e ≠ ⊥ ∧ ls.sz = # gs.ar ∧ (ls.n0 < # gs.ar ∧ ls.n0 = get_hash(ls.e, ls.sz)) ∧ ¬ ls.b, ls0.e = gs0.ar[ls0.n] ∧ allslotsfull(gs0.ar, ls0.n0, ls0.n, ls0.e, false) ∧ ls0.n < # gs0.ar ∧ ls0.e ≠ ⊥ ∧ ls0.sz = # gs0.ar ∧ (ls0.n0 < # gs0.ar ∧ ls0.n0 = get_hash(ls0.e, ls0.sz)) ∧ ls0.b, SetLInv(ags, als, apc), ∀ tid0. tid0 ≠ tid → HashsetLInv(gs, lsf(tid0), pcf(tid0)) ∧ SetLInv(ags, alsf(tid0), apcf(tid0)) ∧ labs(gs, lsf(tid0), pcf(tid0), ags, alsf(tid0), apcf(tid0)), pre(gs, ls, I14, τ) ∧ gs0 = gstepf(gs, ls, I14, τ) ∧ ls0 = lstepf(gs, ls, I14, τ) ∧ I15 = pcstepf(gs, ls, I14, τ), absset(gs.ar, ags.set), ls.tid = als.tid ∧ apc = retInsert ∧ (ls.e = ls.e0 → als.lb) ∧ (apc = invMember ∨ apc = invInsert → ls.e = als.le) ⊦ absset(gs0.ar, ags.set) ∧ ls0.tid = als.tid ∧ apc = retInsert ∧ (als.lb ↔ ls0.b) ∧ (apc = invMember ∨ apc = invInsert → ls0.e = als.le)

System applied rule normalize

And obtained the following new goals

Rule argument

Additional information

Proof step 2 from proof step-absstep-I14-I15-tau-same (previous step) (back to tree)

ls0.e = gs0.ar[ls0.n], ls.e = ls.e0, ls.e = gs.ar[ls.n], ls0.n0 = get_hash(ls0.e, ls0.sz), ls.n0 = get_hash(ls.e, ls.sz), ls0.sz = # gs0.ar, ls.sz = # gs.ar, ls.tid = als.tid, lsf(tid).tid = tid, alsf(tid).tid = tid, I15 = pcstepf(gs, ls, I14, τ), alsf(tid) = als, apc = retInsert, apcf(tid) = apc, gs0 = gstepf(gs, ls, I14, τ), ls0 = lstepf(gs, ls, I14, τ), lsf(tid) = ls, lsf0(tid) = ls0, pcf(tid) = I14, pcf0(tid) = I15, # gs.ar ≠ 0, # gs0.ar ≠ 0, ls.e ≠ ⊥, ls0.e ≠ ⊥, ls0.b, ls0.n < # gs0.ar, ls0.n0 < # gs0.ar, ls.n < # gs.ar, ls.n0 < # gs.ar, SetLInv(ags, als, apc), absset(gs.ar, ags.set), allslotsfull(gs0.ar, ls0.n0, ls0.n, ls0.e, false), allslotsfull(gs.ar, ls.n0, ls.n, ls.e, false), htok(gs0.ar), htok(gs.ar), pre(gs, ls, I14, τ), ¬ ls.b, ls.e = ls.e0 → als.lb, apc = invMember ∨ apc = invInsert → ls.e = als.le, ∀ tid0. tid0 ≠ tid → HashsetLInv(gs, lsf(tid0), pcf(tid0)) ∧ SetLInv(ags, alsf(tid0), apcf(tid0)) ∧ labs(gs, lsf(tid0), pcf(tid0), ags, alsf(tid0), apcf(tid0)), ∀ tid0. tid0 ≠ tid → alsf(tid0).tid = tid0, ∀ tid0. tid0 ≠ tid → lsf(tid0).tid = tid0 ⊦ absset(gs0.ar, ags.set) ∧ ls0.tid = als.tid ∧ apc = retInsert ∧ (als.lb ↔ ls0.b) ∧ (apc = invMember ∨ apc = invInsert → ls0.e = als.le)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ invInsert ≠ retInsert; (s) ⊦ invMember ≠ retInsert; (s) ⊦ m < n → n ≠ 0; (s) lf-01: ⊦ m < n ∧ n = n0 → m < n0; (forward) from specification nat-basic lf-02: ⊦ m < n ∧ m = n0 → n0 < n; (forward) from specification nat-basic f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic ⊦ gstepf(gs, ls, I14, τ) = gs; (s) ⊦ pre(gs, ls, I14, a) ↔ a = τ; (s) ⊦ pcstepf(gs, ls, I14, a) = I15; (s) ⊦ lstepf(gs, ls, I14, τ) = ls.b:= true; (s)

Proof step 3 from proof step-absstep-I14-I15-tau-same (previous step) (back to tree)

lsf0(tid).e = gs.ar[lsf0(tid).n], lsf(tid).e = lsf(tid).e0, lsf(tid).e0 = gs.ar[lsf(tid).n], lsf0(tid).n0 = get_hash(lsf0(tid).e, # gs.ar), lsf(tid).n0 = get_hash(lsf(tid).e0, # gs.ar), lsf0(tid).sz = # gs.ar, lsf(tid).sz = # gs.ar, lsf(tid).tid = tid, alsf(tid).tid = tid, apcf(tid) = retInsert, lsf0(tid) = lsf(tid).b:= true, pcf(tid) = I14, pcf0(tid) = I15, lsf0(tid).e ≠ ⊥, lsf(tid).e0 ≠ ⊥, lsf0(tid).tid ≠ tid, lsf0(tid).b, alsf(tid).lb, lsf0(tid).n < # gs.ar, lsf0(tid).n0 < # gs.ar, lsf(tid).n < # gs.ar, lsf(tid).n0 < # gs.ar, SetLInv(ags, alsf(tid), retInsert), absset(gs.ar, ags.set), allslotsfull(gs.ar, lsf0(tid).n0, lsf0(tid).n, lsf0(tid).e, false), allslotsfull(gs.ar, lsf(tid).n0, lsf(tid).n, lsf(tid).e0, false), htok(gs.ar), ¬ lsf(tid).b, ∀ tid0. tid0 ≠ tid → HashsetLInv(gs, lsf(tid0), pcf(tid0)) ∧ SetLInv(ags, alsf(tid0), apcf(tid0)) ∧ labs(gs, lsf(tid0), pcf(tid0), ags, alsf(tid0), apcf(tid0)), ∀ tid0. alsf(tid0).tid = tid0, ∀ tid0. lsf(tid0).tid = tid0 ⊦

Heuristic use patterns applied rule apply elim lemma

And closed the goal!

Rule argument

spec: Hashset, name:elim-mkls, seq:⊦ ( ((((tid = ls.tid ∧ e = ls.e) ∧ (b ↔ ls.b)) ∧ sz = ls.sz) ∧ sz0 = ls.n0) ∧ n = ls.n) ∧ e0 = ls.e0 ↔ ls = mkls(tid, e, b, sz, sz0, n, e0), subst:[ls, b, tid, sz0, e0, e, sz, n] → [lsf(tid), b, tid1, n0, e0, e, n, n1]

Additional information

Used simplifier rules: ⊦ mkls(tid, e, b, sz, sz0, sz1, e0).b:= b0 = mkls(tid, e, b0, sz, sz0, sz1, e0); (s) lf-02: ⊦ m < n ∧ m = n0 → n0 < n; (forward) from specification nat-basic lf-01: ⊦ m < n ∧ n = n0 → m < n0; (forward) from specification nat-basic ⊦ mkls(tid, e, b, sz, sz0, sz1, e0).sz = sz; (s) ⊦ mkls(tid, e, b, sz, sz0, sz1, e0).n0 = sz0; (s) ⊦ mkls(tid, e, b, sz, sz0, sz1, e0).n = sz1; (s) ⊦ mkls(tid, e, b, sz, sz0, sz1, e0).e = e; (s) ⊦ mkls(tid, e, b, sz, sz0, sz1, e0).tid = tid; (s) ⊦ (((((tid = ls.tid ∧ e = ls.e) ∧ (b ↔ ls.b)) ∧ sz = ls.sz) ∧ sz0 = ls.n0) ∧ n = ls.n) ∧ e0 = ls.e0 ↔ ls = mkls(tid, e, b, sz, sz0, n, e0); (elim) Used terms: lsf(tid), b, tid1, n0, e0, e, n, n1

Proof Tree for step-absstep-I14-I15-tau-same (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