Proof step 1 from proof step-M10-M13 (conclusion) (back to tree)

System applied rule normalize

And obtained the following new goals

• Proof step 2:

  ls.n0 = get_hash(ls.e, ls.sz), ls.sz = # gs.ar, pcstepf(gs, ls, M10, a) = M13, # gs.ar ≠ 0, ls.e ≠ ls.e0, ls.e ≠ ⊥, ls.n < # gs.ar, ls.n0 < # gs.ar, allslotsfull(gs.ar, ls.n0, ls.n, ls.e, false), htok(gs.ar), pre(gs, ls, M10, a), ¬ ls.b, ls.e0 ≠ ⊥ → ls.e0 = gs.ar[ls.n] ⊦ (# gstepf(gs, ls, M10, a).ar ≠ 0 ∧ htok(gstepf(gs, ls, M10, a).ar)) ∧ lstepf(gs, ls, M10, a).n < # gstepf(gs, ls, M10, a).ar ∧ lstepf(gs, ls, M10, a).e ≠ ⊥ ∧ lstepf(gs, ls, M10, a).sz = # gstepf(gs, ls, M10, a).ar ∧ ( lstepf(gs, ls, M10, a).n0 < # gstepf(gs, ls, M10, a).ar ∧ lstepf(gs, ls, M10, a).n0 = get_hash(lstepf(gs, ls, M10, a).e, lstepf(gs, ls, M10, a).sz)) ∧ ¬ lstepf(gs, ls, M10, a).b ∧ (gstepf(gs, ls, M10, a).ar[lstepf(gs, ls, M10, a).n] ≠ ⊥ ∧ gstepf(gs, ls, M10, a).ar[lstepf(gs, ls, M10, a).n] ≠ lstepf(gs, ls, M10, a).e) ∧ lstepf(gs, ls, M10, a).e ≠ lstepf(gs, ls, M10, a).e0 ∧ allslotsfull(gstepf(gs, ls, M10, a).ar, lstepf(gs, ls, M10, a).n0, lstepf(gs, ls, M10, a).n, lstepf(gs, ls, M10, a).e, false)

Rule argument

Additional information

Proof step 2 from proof step-M10-M13 (previous step) (back to tree)

Heuristic simplifier applied rule simplifier

And closed the goal!

Rule argument

Additional information

Used simplifier rules: ⊦ lstepf(gs, ls, M10, τ) = ls; (s) ⊦ gstepf(gs, ls, M10, τ) = gs; (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 ⊦ pre(gs, ls, M10, a) ↔ a = τ; (s) ⊦ M11 ≠ M13; (s) ⊦ pcstepf(gs, ls, M10, a) = (ls.e0 = ⊥ ⊃ M11;M13); (s)