Proof step 1 from proof step-I17-I20 (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, I17, a) = I20, # gs.ar ≠ 0, ls.e ≠ ⊥, ls.n < # gs.ar, ls.n0 < # gs.ar, allslotsfull(gs.ar, ls.n0, ls.n, ls.e, true), htok(gs.ar), pre(gs, ls, I17, a), ¬ ls.b ⊦ (# gstepf(gs, ls, I17, a).ar ≠ 0 ∧ htok(gstepf(gs, ls, I17, a).ar)) ∧ allslotsfull(gstepf(gs, ls, I17, a).ar, lstepf(gs, ls, I17, a).n0, lstepf(gs, ls, I17, a).n, lstepf(gs, ls, I17, a).e, false) ∧ lstepf(gs, ls, I17, a).n ≠ lstepf(gs, ls, I17, a).n0 ∧ lstepf(gs, ls, I17, a).n < # gstepf(gs, ls, I17, a).ar ∧ lstepf(gs, ls, I17, a).e ≠ ⊥ ∧ lstepf(gs, ls, I17, a).sz = # gstepf(gs, ls, I17, a).ar ∧ ( lstepf(gs, ls, I17, a).n0 < # gstepf(gs, ls, I17, a).ar ∧ lstepf(gs, ls, I17, a).n0 = get_hash(lstepf(gs, ls, I17, a).e, lstepf(gs, ls, I17, a).sz)) ∧ ¬ lstepf(gs, ls, I17, a).b

Rule argument

Additional information

Proof step 2 from proof step-I17-I20 (previous step) (back to tree)

Heuristic simplifier applied rule simplifier

And closed the goal!

Rule argument

Additional information

Used simplifier rules: ⊦ lstepf(gs, ls, I17, τ) = ls; (s) ⊦ gstepf(gs, ls, I17, τ) = 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 ⊦ n0 ≠ n → (allslotsfull(ar, n0, n, e, true) ↔ allslotsfull(ar, n0, n, e, false)); (s) ⊦ pre(gs, ls, I17, a) ↔ a = τ; (s) ⊦ I18 ≠ I20; (s) ⊦ pcstepf(gs, ls, I17, a) = (ls.n = ls.n0 ⊃ I18;I20); (s)