[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 bwsiminv-implies-weakbwsim-aux (conclusion) (back to tree)

bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cINV, aINV) ⊦ weakbwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, aINV)

System applied rule normalize

And obtained the following new goals

Rule argument

Additional information

Proof step 2 from proof bwsiminv-implies-weakbwsim-aux (previous step) (back to tree)

bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cINV, aINV), ¬ weakbwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, aINV) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:proofobls-weakbackwardsim, seq:⊦ weakbwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, aINV) ↔ (∀ csl, al. cexec(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al⌝ ) → (∃ as. t(csl.last, as) ∧ aINV(as))) ∧ (∀ cs, as. cstartf(cs) ∧ t(cs, as) ∧ aINV(as) → astartf(as)) ∧ (∀ asl, al. aexec(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) → aINV(asl.last)) ∧ (∀ csl, al, a, cs0, as0. cexec(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al⌝ ) ∧ cstepf(csl.last, a, cs0) ∧ t(cs0, as0) ∧ aINV(as0) → (∃ as. aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, as0) ∧ t(csl.last, as))), subst:[cstartf, cstepf, astartf, aINV, t, astepf] → [cstartf, cstepf, astartf, aINV, t, astepf], <all paths>

Additional information

Used terms: aINV, t, astepf, astartf, cstepf, cstartf

Proof step 3 from proof bwsiminv-implies-weakbwsim-aux (previous step) (back to tree)

⊦ weakbwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, aINV) ↔ (∀ csl, al. cexec(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al⌝ ) → (∃ as. t(csl.last, as) ∧ aINV(as))) ∧ (∀ cs, as. cstartf(cs) ∧ t(cs, as) ∧ aINV(as) → astartf(as)) ∧ (∀ asl, al. aexec(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) → aINV(asl.last)) ∧ (∀ csl, al, a, cs0, as0. cexec(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al⌝ ) ∧ cstepf(csl.last, a, cs0) ∧ t(cs0, as0) ∧ aINV(as0) → (∃ as. aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, as0) ∧ t(csl.last, as)))

Lemma proofobls-weakbackwardsim

Proof step 4 from proof bwsiminv-implies-weakbwsim-aux (previous step) (back to tree)

bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cINV, aINV), (∃ csl, al. ¬(cexec(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al⌝ ) → (∃ as. t(csl.last, as) ∧ aINV(as)))) ∨ (∃ cs, as. ¬(cstartf(cs) ∧ t(cs, as) ∧ aINV(as) → astartf(as))) ∨ (∃ asl, al. ¬(aexec(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) → aINV(asl.last))) ∨ (∃ csl, al, a, cs0, as0. ¬ ( cexec(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al⌝ ) ∧ cstepf(csl.last, a, cs0) ∧ t(cs0, as0) ∧ aINV(as0) → (∃ as. aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, as0) ∧ t(csl.last, as)))) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ cexec(CIOAut(startf, stepf))(σ, β) ↔ cfrag(CIOAut(startf, stepf))(σ, β) ∧ startf(σ[0]); (s) ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ aexec(AIOAut(startf, stepf))(σ, β) ↔ afrag(AIOAut(startf, stepf))(σ, β) ∧ startf(σ[0]); (s)

Proof step 5 from proof bwsiminv-implies-weakbwsim-aux (previous step) (back to tree)

bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cINV, aINV), ¬(cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al⌝ ) ∧ cstartf(csl[0]) → (∃ as. t(csl.last, as) ∧ aINV(as))) ∨ ¬(cstartf(cs) ∧ t(cs, as) ∧ aINV(as) → astartf(as)) ∨ ¬(afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al0⌝ ) ∧ astartf(asl[0]) → aINV(asl.last)) ∨ ¬ ( cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , ⌜al1⌝ ) ∧ cstartf(csl0[0]) ∧ cstepf(csl0.last, a, cs0) ∧ t(cs0, as0) ∧ aINV(as0) → (∃ as. aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, as0) ∧ t(csl0.last, as))) ⊦

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:proofobls-backwardsiminv, seq:⊦ bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cINV, aINV) ↔ (∀ cs. cstartf(cs) → cINV(cs)) ∧ (∀ as. astartf(as) → aINV(as)) ∧ (∀ cs, a, cs0. cINV(cs) ∧ cstepf(cs, a, cs0) → cINV(cs0)) ∧ (∀ as, a, as0. aINV(as) ∧ astepf(as, a, as0) → aINV(as0)) ∧ (∀ cs. cINV(cs) → (∃ as. t(cs, as) ∧ aINV(as))) ∧ (∀ cs, as. cstartf(cs) ∧ t(cs, as) ∧ aINV(as) → astartf(as)) ∧ (∀ cs, a, cs0, as0. cINV(cs) ∧ cstepf(cs, a, cs0) ∧ t(cs0, as0) ∧ aINV(as0) → (∃ as. aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, as0) ∧ t(cs, as))), subst:[cstartf, cstepf, astartf, aINV, t, cINV, astepf] → [cstartf, cstepf, astartf, aINV, t, cINV, astepf]

Additional information

Used terms: cstartf, cstepf, astartf, astepf, t, cINV, aINV

Proof step 6 from proof bwsiminv-implies-weakbwsim-aux (previous step) (back to tree)

⊦ bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cINV, aINV) ↔ (∀ cs. cstartf(cs) → cINV(cs)) ∧ (∀ as. astartf(as) → aINV(as)) ∧ (∀ cs, a, cs0. cINV(cs) ∧ cstepf(cs, a, cs0) → cINV(cs0)) ∧ (∀ as, a, as0. aINV(as) ∧ astepf(as, a, as0) → aINV(as0)) ∧ (∀ cs. cINV(cs) → (∃ as. t(cs, as) ∧ aINV(as))) ∧ (∀ cs, as. cstartf(cs) ∧ t(cs, as) ∧ aINV(as) → astartf(as)) ∧ (∀ cs, a, cs0, as0. cINV(cs) ∧ cstepf(cs, a, cs0) ∧ t(cs0, as0) ∧ aINV(as0) → (∃ as. aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, as0) ∧ t(cs, as)))

Lemma proofobls-backwardsiminv

Proof step 7 from proof bwsiminv-implies-weakbwsim-aux (previous step) (back to tree)

bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cINV, aINV), bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cINV, aINV) ↔ (∀ cs. cstartf(cs) → cINV(cs)) ∧ (∀ as. astartf(as) → aINV(as)) ∧ (∀ cs, a, cs0. cINV(cs) ∧ cstepf(cs, a, cs0) → cINV(cs0)) ∧ (∀ as, a, as0. aINV(as) ∧ astepf(as, a, as0) → aINV(as0)) ∧ (∀ cs. cINV(cs) → (∃ as. t(cs, as) ∧ aINV(as))) ∧ (∀ cs, as. cstartf(cs) ∧ t(cs, as) ∧ aINV(as) → astartf(as)) ∧ (∀ cs, a, cs0, as0. cINV(cs) ∧ cstepf(cs, a, cs0) ∧ t(cs0, as0) ∧ aINV(as0) → (∃ as. aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, as0) ∧ t(cs, as))), ¬(cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al⌝ ) ∧ cstartf(csl[0]) → (∃ as. t(csl.last, as) ∧ aINV(as))) ∨ ¬(cstartf(cs) ∧ t(cs, as) ∧ aINV(as) → astartf(as)) ∨ ¬(afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al0⌝ ) ∧ astartf(asl[0]) → aINV(asl.last)) ∨ ¬ ( cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , ⌜al1⌝ ) ∧ cstartf(csl0[0]) ∧ cstepf(csl0.last, a, cs0) ∧ t(cs0, as0) ∧ aINV(as0) → (∃ as. aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, as0) ∧ t(csl0.last, as))) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 8 from proof bwsiminv-implies-weakbwsim-aux (previous step) (back to tree)

bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cINV, aINV), ∀ cs. cstartf(cs) → cINV(cs), ∀ as. astartf(as) → aINV(as), ∀ cs, a, cs0. cINV(cs) ∧ cstepf(cs, a, cs0) → cINV(cs0), ∀ as, a, as0. aINV(as) ∧ astepf(as, a, as0) → aINV(as0), ∀ cs. cINV(cs) → (∃ as. t(cs, as) ∧ aINV(as)), ∀ cs, as. cstartf(cs) ∧ t(cs, as) ∧ aINV(as) → astartf(as), ∀ cs, a, cs0, as0. cINV(cs) ∧ cstepf(cs, a, cs0) ∧ t(cs0, as0) ∧ aINV(as0) → (∃ as. aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, as0) ∧ t(cs, as)), ¬(cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al⌝ ) ∧ cstartf(csl[0]) → (∃ as. t(csl.last, as) ∧ aINV(as))) ∨ ¬(cstartf(cs) ∧ t(cs, as) ∧ aINV(as) → astartf(as)) ∨ ¬(afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al0⌝ ) ∧ astartf(asl[0]) → aINV(asl.last)) ∨ ¬ ( cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , ⌜al1⌝ ) ∧ cstartf(csl0[0]) ∧ cstepf(csl0.last, a, cs0) ∧ t(cs0, as0) ∧ aINV(as0) → (∃ as. aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, as0) ∧ t(csl0.last, as))) ⊦

User applied rule cut formula

And obtained the following new goals

Rule argument

fma: ∀ cs. (∃ csl, al. cexec(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al⌝ ) ∧ csl.last = cs) → cINV(cs)

Additional information

Used formulas: ∀ cs. (∃ csl, al. cexec(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al⌝ ) ∧ csl.last = cs) → cINV(cs)

Proof step 9 from proof bwsiminv-implies-weakbwsim-aux (previous step) (back to tree)

bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cINV, aINV), ∀ cs, a, cs0, as0. cINV(cs) ∧ cstepf(cs, a, cs0) ∧ t(cs0, as0) ∧ aINV(as0) → (∃ as. aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, as0) ∧ t(cs, as)), ∀ cs, as. cstartf(cs) ∧ t(cs, as) ∧ aINV(as) → astartf(as), ∀ cs. cINV(cs) → (∃ as. t(cs, as) ∧ aINV(as)), ∀ as, a, as0. aINV(as) ∧ astepf(as, a, as0) → aINV(as0), ∀ cs, a, cs0. cINV(cs) ∧ cstepf(cs, a, cs0) → cINV(cs0), ∀ as. astartf(as) → aINV(as), ∀ cs. cstartf(cs) → cINV(cs), ∀ cs. (∃ csl, al. cexec(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al⌝ ) ∧ csl.last = cs) → cINV(cs), ¬(cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al⌝ ) ∧ cstartf(csl[0]) → (∃ as. t(csl.last, as) ∧ aINV(as))) ∨ ¬(cstartf(cs) ∧ t(cs, as) ∧ aINV(as) → astartf(as)) ∨ ¬(afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al0⌝ ) ∧ astartf(asl[0]) → aINV(asl.last)) ∨ ¬ ( cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , ⌜al1⌝ ) ∧ cstartf(csl0[0]) ∧ cstepf(csl0.last, a, cs0) ∧ t(cs0, as0) ∧ aINV(as0) → (∃ as. aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, as0) ∧ t(csl0.last, as))) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ cexec(CIOAut(startf, stepf))(σ, β) ↔ cfrag(CIOAut(startf, stepf))(σ, β) ∧ startf(σ[0]); (s)

Proof step 10 from proof bwsiminv-implies-weakbwsim-aux (previous step) (back to tree)

bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cINV, aINV), ∀ cs. cstartf(cs) → cINV(cs), ∀ as. astartf(as) → aINV(as), ∀ cs, a, cs0. cINV(cs) ∧ cstepf(cs, a, cs0) → cINV(cs0), ∀ as, a, as0. aINV(as) ∧ astepf(as, a, as0) → aINV(as0), ∀ cs. cINV(cs) → (∃ as. t(cs, as) ∧ aINV(as)), ∀ cs, as. cstartf(cs) ∧ t(cs, as) ∧ aINV(as) → astartf(as), ∀ cs, a, cs0, as0. cINV(cs) ∧ cstepf(cs, a, cs0) ∧ t(cs0, as0) ∧ aINV(as0) → (∃ as. aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, as0) ∧ t(cs, as)), ∀ cs1. (∃ csl1, al2. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al2⌝ ) ∧ cstartf(csl1[0]) ∧ csl1.last = cs1) → cINV(cs1), ¬(cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al⌝ ) ∧ cstartf(csl[0]) → (∃ as. t(csl.last, as) ∧ aINV(as))) ∨ ¬(cstartf(cs) ∧ t(cs, as) ∧ aINV(as) → astartf(as)) ∨ ¬(afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al0⌝ ) ∧ astartf(asl[0]) → aINV(asl.last)) ∨ ¬ ( cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , ⌜al1⌝ ) ∧ cstartf(csl0[0]) ∧ cstepf(csl0.last, a, cs0) ∧ t(cs0, as0) ∧ aINV(as0) → (∃ as. aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, as0) ∧ t(csl0.last, as))) ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 10

Additional information

Proof step 11 from proof bwsiminv-implies-weakbwsim-aux (previous step) (back to tree)

bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cINV, aINV), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al⌝ ), cstartf(csl[0]), ∀ cs1. (∃ csl1, al2. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al2⌝ ) ∧ cstartf(csl1[0]) ∧ csl1.last = cs1) → cINV(cs1), ∀ cs, a, cs0, as0. cINV(cs) ∧ cstepf(cs, a, cs0) ∧ t(cs0, as0) ∧ aINV(as0) → (∃ as. aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, as0) ∧ t(cs, as)), ∀ cs, as. cstartf(cs) ∧ t(cs, as) ∧ aINV(as) → astartf(as), ∀ cs. cINV(cs) → (∃ as. t(cs, as) ∧ aINV(as)), ∀ as, a, as0. aINV(as) ∧ astepf(as, a, as0) → aINV(as0), ∀ cs, a, cs0. cINV(cs) ∧ cstepf(cs, a, cs0) → cINV(cs0), ∀ as. astartf(as) → aINV(as), ∀ cs. cstartf(cs) → cINV(cs) ⊦ ∃ as. t(csl.last, as) ∧ aINV(as)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 12 from proof bwsiminv-implies-weakbwsim-aux (previous step) (back to tree)

bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cINV, aINV), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al⌝ ), cstartf(csl[0]), ∀ cs. cstartf(cs) → cINV(cs), ∀ as. astartf(as) → aINV(as), ∀ cs, a, cs0. cINV(cs) ∧ cstepf(cs, a, cs0) → cINV(cs0), ∀ as, a, as0. aINV(as) ∧ astepf(as, a, as0) → aINV(as0), ∀ cs. cINV(cs) → (∃ as. t(cs, as) ∧ aINV(as)), ∀ cs, as. cstartf(cs) ∧ t(cs, as) ∧ aINV(as) → astartf(as), ∀ cs, a, cs0, as0. cINV(cs) ∧ cstepf(cs, a, cs0) ∧ t(cs0, as0) ∧ aINV(as0) → (∃ as. aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, as0) ∧ t(cs, as)), ∀ cs1. (∃ csl1, al2. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al2⌝ ) ∧ cstartf(csl1[0]) ∧ csl1.last = cs1) → cINV(cs1) ⊦ ∃ as. t(csl.last, as) ∧ aINV(as)

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 8 terms: csl.last abort: F discard: T computed: F

Additional information

Used terms: csl.last

Proof step 13 from proof bwsiminv-implies-weakbwsim-aux (previous step) (back to tree)

bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cINV, aINV), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al⌝ ), cstartf(csl[0]), cINV(csl.last) → (∃ as. t(csl.last, as) ∧ aINV(as)), ∀ cs1. (∃ csl1, al2. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al2⌝ ) ∧ cstartf(csl1[0]) ∧ csl1.last = cs1) → cINV(cs1), ∀ cs, a, cs0, as0. cINV(cs) ∧ cstepf(cs, a, cs0) ∧ t(cs0, as0) ∧ aINV(as0) → (∃ as. aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, as0) ∧ t(cs, as)), ∀ cs, as. cstartf(cs) ∧ t(cs, as) ∧ aINV(as) → astartf(as), ∀ as, a, as0. aINV(as) ∧ astepf(as, a, as0) → aINV(as0), ∀ cs, a, cs0. cINV(cs) ∧ cstepf(cs, a, cs0) → cINV(cs0), ∀ as. astartf(as) → aINV(as), ∀ cs. cstartf(cs) → cINV(cs) ⊦ ∃ as. t(csl.last, as) ∧ aINV(as)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 14 from proof bwsiminv-implies-weakbwsim-aux (previous step) (back to tree)

bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cINV, aINV), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al⌝ ), cstartf(csl[0]), ¬ cINV(csl.last), ∀ cs. cstartf(cs) → cINV(cs), ∀ as. astartf(as) → aINV(as), ∀ cs, a, cs0. cINV(cs) ∧ cstepf(cs, a, cs0) → cINV(cs0), ∀ as, a, as0. aINV(as) ∧ astepf(as, a, as0) → aINV(as0), ∀ cs, as. cstartf(cs) ∧ t(cs, as) ∧ aINV(as) → astartf(as), ∀ cs, a, cs0, as0. cINV(cs) ∧ cstepf(cs, a, cs0) ∧ t(cs0, as0) ∧ aINV(as0) → (∃ as. aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, as0) ∧ t(cs, as)), ∀ cs1. (∃ csl1, al2. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al2⌝ ) ∧ cstartf(csl1[0]) ∧ csl1.last = cs1) → cINV(cs1) ⊦ ∃ as. t(csl.last, as) ∧ aINV(as)

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 11 terms: csl.last abort: F discard: T computed: T

Additional information

Used terms: csl.last

Proof step 15 from proof bwsiminv-implies-weakbwsim-aux (previous step) (back to tree)

bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cINV, aINV), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al⌝ ), cstartf(csl[0]), ¬ cINV(csl.last), (∃ csl1, al2. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al2⌝ ) ∧ cstartf(csl1[0]) ∧ csl1.last = csl.last) → cINV(csl.last), ∀ cs, a, cs0, as0. cINV(cs) ∧ cstepf(cs, a, cs0) ∧ t(cs0, as0) ∧ aINV(as0) → (∃ as. aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, as0) ∧ t(cs, as)), ∀ cs, as. cstartf(cs) ∧ t(cs, as) ∧ aINV(as) → astartf(as), ∀ as, a, as0. aINV(as) ∧ astepf(as, a, as0) → aINV(as0), ∀ cs, a, cs0. cINV(cs) ∧ cstepf(cs, a, cs0) → cINV(cs0), ∀ as. astartf(as) → aINV(as), ∀ cs. cstartf(cs) → cINV(cs) ⊦ ∃ as. t(csl.last, as) ∧ aINV(as)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 16 from proof bwsiminv-implies-weakbwsim-aux (previous step) (back to tree)

bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cINV, aINV), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al⌝ ), cstartf(csl[0]), ¬ cINV(csl.last), ∀ cs. cstartf(cs) → cINV(cs), ∀ as. astartf(as) → aINV(as), ∀ cs, a, cs0. cINV(cs) ∧ cstepf(cs, a, cs0) → cINV(cs0), ∀ as, a, as0. aINV(as) ∧ astepf(as, a, as0) → aINV(as0), ∀ cs, as. cstartf(cs) ∧ t(cs, as) ∧ aINV(as) → astartf(as), ∀ cs, a, cs0, as0. cINV(cs) ∧ cstepf(cs, a, cs0) ∧ t(cs0, as0) ∧ aINV(as0) → (∃ as. aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, as0) ∧ t(cs, as)) ⊦ ∃ as. t(csl.last, as) ∧ aINV(as), ∃ csl1, al2. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al2⌝ ) ∧ cstartf(csl1[0]) ∧ csl1.last = csl.last

Heuristic quantifier closing applied rule exists right

And closed the goal!

Rule argument

pos: right 2 terms: csl, al

Additional information

Used terms: csl, al

Proof step 17 from proof bwsiminv-implies-weakbwsim-aux (previous step) (back to tree)

aINV(as), bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cINV, aINV), cstartf(cs), t(cs, as), ¬ astartf(as), ∀ cs1. (∃ csl1, al2. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al2⌝ ) ∧ cstartf(csl1[0]) ∧ csl1.last = cs1) → cINV(cs1), ∀ cs, a, cs0, as0. cINV(cs) ∧ cstepf(cs, a, cs0) ∧ t(cs0, as0) ∧ aINV(as0) → (∃ as. aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, as0) ∧ t(cs, as)), ∀ cs, as. cstartf(cs) ∧ t(cs, as) ∧ aINV(as) → astartf(as), ∀ cs. cINV(cs) → (∃ as. t(cs, as) ∧ aINV(as)), ∀ as, a, as0. aINV(as) ∧ astepf(as, a, as0) → aINV(as0), ∀ cs, a, cs0. cINV(cs) ∧ cstepf(cs, a, cs0) → cINV(cs0), ∀ as. astartf(as) → aINV(as), ∀ cs. cstartf(cs) → cINV(cs) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 18 from proof bwsiminv-implies-weakbwsim-aux (previous step) (back to tree)

aINV(as), bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cINV, aINV), cstartf(cs), t(cs, as), ¬ astartf(as), ∀ cs. cstartf(cs) → cINV(cs), ∀ as. astartf(as) → aINV(as), ∀ cs, a, cs0. cINV(cs) ∧ cstepf(cs, a, cs0) → cINV(cs0), ∀ as, a, as0. aINV(as) ∧ astepf(as, a, as0) → aINV(as0), ∀ cs. cINV(cs) → (∃ as. t(cs, as) ∧ aINV(as)), ∀ cs, as. cstartf(cs) ∧ t(cs, as) ∧ aINV(as) → astartf(as), ∀ cs, a, cs0, as0. cINV(cs) ∧ cstepf(cs, a, cs0) ∧ t(cs0, as0) ∧ aINV(as0) → (∃ as. aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, as0) ∧ t(cs, as)), ∀ cs1. (∃ csl1, al2. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al2⌝ ) ∧ cstartf(csl1[0]) ∧ csl1.last = cs1) → cINV(cs1) ⊦

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 11 terms: cs, as

Additional information

Used terms: cs, as

Proof step 19 from proof bwsiminv-implies-weakbwsim-aux (previous step) (back to tree)

afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al0⌝ ), astartf(asl[0]), bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cINV, aINV), ¬ aINV(asl.last), ∀ cs1. (∃ csl1, al2. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al2⌝ ) ∧ cstartf(csl1[0]) ∧ csl1.last = cs1) → cINV(cs1), ∀ cs, a, cs0, as0. cINV(cs) ∧ cstepf(cs, a, cs0) ∧ t(cs0, as0) ∧ aINV(as0) → (∃ as. aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, as0) ∧ t(cs, as)), ∀ cs, as. cstartf(cs) ∧ t(cs, as) ∧ aINV(as) → astartf(as), ∀ cs. cINV(cs) → (∃ as. t(cs, as) ∧ aINV(as)), ∀ as, a, as0. aINV(as) ∧ astepf(as, a, as0) → aINV(as0), ∀ cs, a, cs0. cINV(cs) ∧ cstepf(cs, a, cs0) → cINV(cs0), ∀ as. astartf(as) → aINV(as), ∀ cs. cstartf(cs) → cINV(cs) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 20 from proof bwsiminv-implies-weakbwsim-aux (previous step) (back to tree)

afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al0⌝ ), astartf(asl[0]), bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cINV, aINV), ¬ aINV(asl.last), ∀ cs. cstartf(cs) → cINV(cs), ∀ as. astartf(as) → aINV(as), ∀ cs, a, cs0. cINV(cs) ∧ cstepf(cs, a, cs0) → cINV(cs0), ∀ as, a, as0. aINV(as) ∧ astepf(as, a, as0) → aINV(as0), ∀ cs. cINV(cs) → (∃ as. t(cs, as) ∧ aINV(as)), ∀ cs, as. cstartf(cs) ∧ t(cs, as) ∧ aINV(as) → astartf(as), ∀ cs, a, cs0, as0. cINV(cs) ∧ cstepf(cs, a, cs0) ∧ t(cs0, as0) ∧ aINV(as0) → (∃ as. aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, as0) ∧ t(cs, as)), ∀ cs1. (∃ csl1, al2. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al2⌝ ) ∧ cstartf(csl1[0]) ∧ csl1.last = cs1) → cINV(cs1) ⊦

User applied rule weakening

And obtained the following new goals

Rule argument

poslist: left 3, left 5, left 7, left 9, left 10, left 11, left 12

Additional information

Proof step 21 from proof bwsiminv-implies-weakbwsim-aux (previous step) (back to tree)

afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al0⌝ ), astartf(asl[0]), ¬ aINV(asl.last), ∀ as, a, as0. aINV(as) ∧ astepf(as, a, as0) → aINV(as0), ∀ as. astartf(as) → aINV(as) ⊦

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 5 terms: asl[0] abort: F discard: T computed: T

Additional information

Used terms: asl[0]

Proof step 22 from proof bwsiminv-implies-weakbwsim-aux (previous step) (back to tree)

afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al0⌝ ), astartf(asl[0]), ¬ aINV(asl.last), astartf(asl[0]) → aINV(asl[0]), ∀ as, a, as0. aINV(as) ∧ astepf(as, a, as0) → aINV(as0) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 23 from proof bwsiminv-implies-weakbwsim-aux (previous step) (back to tree)

aINV(asl[0]), afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al0⌝ ), astartf(asl[0]), ¬ aINV(asl.last), ∀ as, a, as0. aINV(as) ∧ astepf(as, a, as0) → aINV(as0) ⊦

User applied rule weakening

And obtained the following new goals

Rule argument

poslist: left 3

Additional information

Proof step 24 from proof bwsiminv-implies-weakbwsim-aux (previous step) (back to tree)

aINV(asl[0]), afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al0⌝ ), ¬ aINV(asl.last), ∀ as, a, as0. aINV(as) ∧ astepf(as, a, as0) → aINV(as0) ⊦

User applied rule structural induction

And obtained the following new goals

Rule argument

indvar: asl

Additional information

Used simplifier rules: astatelist freely generated by [], +;; ⊦ ⌜[]⌝ = []; (s) ⊦ ¬ afrag(AIOAut(startf, stepf))([], α); (s)

Proof step 25 from proof bwsiminv-implies-weakbwsim-aux (previous step) (back to tree)

aINV((as + asl0)[0]), afrag(AIOAut(astartf, astepf))(⌜as + asl0⌝ , ⌜al0⌝ ), ¬ aINV((as + asl0).last), ∀ as, a, as0. aINV(as) ∧ astepf(as, a, as0) → aINV(as0), ∀ aINV, astartf, astepf, al0. ¬(aINV(asl0[0]) ∧ afrag(AIOAut(astartf, astepf))(⌜asl0⌝ , ⌜al0⌝ ) ∧ ¬ aINV(asl0.last) ∧ (∀ as, a, as0. aINV(as) ∧ astepf(as, a, as0) → aINV(as0))) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ a + x = a ' + x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[traceA-IOstatestream] ⊦ (a ' + x)[0] = a; (s) ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s)

Proof step 26 from proof bwsiminv-implies-weakbwsim-aux (previous step) (back to tree)

aINV(as), afrag(AIOAut(astartf, astepf))(⌜as '⌝ + ⌜asl0⌝ , ⌜al0⌝ ), ¬ aINV((as ' + asl0).last), ∀ as, a, as0. aINV(as) ∧ astepf(as, a, as0) → aINV(as0), ∀ aINV0, astartf0, astepf0, al. ¬ aINV0(asl0[0]) ∨ ¬ afrag(AIOAut(astartf0, astepf0))(⌜asl0⌝ , ⌜al⌝ ) ∨ aINV0(asl0.last) ∨ ¬(∀ as, a, as0. aINV0(as) ∧ astepf0(as, a, as0) → aINV0(as0)) ⊦

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: al0

Additional information

Used simplifier rules: actionlist freely generated by [], +;;

Proof step 27 from proof bwsiminv-implies-weakbwsim-aux (previous step) (back to tree)

al0 = [], aINV(as), afrag(AIOAut(astartf, astepf))(⌜as '⌝ + ⌜asl0⌝ , ⌜al0⌝ ), ¬ aINV((as ' + asl0).last), ∀ aINV0, astartf0, astepf0, al. ¬ aINV0(asl0[0]) ∨ ¬ afrag(AIOAut(astartf0, astepf0))(⌜asl0⌝ , ⌜al⌝ ) ∨ aINV0(asl0.last) ∨ ¬(∀ as, a, as0. aINV0(as) ∧ astepf0(as, a, as0) → aINV0(as0)), ∀ as, a, as0. aINV(as) ∧ astepf(as, a, as0) → aINV(as0) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ⌜[]⌝ = []; (s)

Proof step 28 from proof bwsiminv-implies-weakbwsim-aux (previous step) (back to tree)

aINV(as), afrag(AIOAut(astartf, astepf))(⌜as '⌝ + ⌜asl0⌝ , []), ¬ aINV((as ' + asl0).last), ∀ as, a, as0. aINV(as) ∧ astepf(as, a, as0) → aINV(as0), ∀ aINV0, astartf0, astepf0, al. ¬ aINV0(asl0[0]) ∨ ¬ afrag(AIOAut(astartf0, astepf0))(⌜asl0⌝ , ⌜al⌝ ) ∨ aINV0(asl0.last) ∨ ¬(∀ as, a, as0. aINV0(as) ∧ astepf0(as, a, as0) → aINV0(as0)) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: IOtrace[traceA], name:frag, seq:⊦ afrag(AIOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1])), subst:[β, σ, stepf, startf] → [[], ⌜as '⌝ + ⌜asl0⌝ , astepf, astartf], <all paths>

Additional information

Used simplifier rules: ⊦ #(σ + σ1) = # σ + # σ1; (s) ⊦ # a ' = 0 +1; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[traceA-IOstatestream] ⊦ ⌜(* n)⌝ + ⌜(* m)⌝ = ⌜n + m⌝ ; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic ⊦ m ≤ n → (⌜(* n)⌝ = ⌜(* m)⌝ + n∞2 ↔ ⌜n - m⌝ = n∞2); (s) ⊦ ⌜n⌝ = ⌜n0⌝ ↔ n = n0; (s) ⊦ # x = 0 ↔ x = []; (s) add-assoc: ⊦ (n∞ + n∞1) + n∞2 = n∞ + n∞1 + n∞2; from specification nat-inf add-comm: ⊦ n∞1 + n∞2 = n∞2 + n∞1; from specification nat-inf ⊦ # [] = ⌜0⌝ ; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ ¬ n < 0; (s) ⊦ x + [] = x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[traceA-IOstatestream] ⊦ a '.last = a; (s) ⊦ ⌜[]⌝ = []; (s) ⊦ ¬ afrag(AIOAut(startf, stepf))([], α); (s) Used terms: [], ⌜as '⌝ + ⌜asl0⌝ , astepf, astartf

Proof step 29 from proof bwsiminv-implies-weakbwsim-aux (previous step) (back to tree)

⊦ afrag(AIOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1]))

A spec-lemma

Proof step 30 from proof bwsiminv-implies-weakbwsim-aux (previous step) (back to tree)

al0 = a0 + al1, aINV(as), afrag(AIOAut(astartf, astepf))(⌜as '⌝ + ⌜asl0⌝ , ⌜al0⌝ ), ¬ aINV((as ' + asl0).last), ∀ aINV0, astartf0, astepf0, al. ¬ aINV0(asl0[0]) ∨ ¬ afrag(AIOAut(astartf0, astepf0))(⌜asl0⌝ , ⌜al⌝ ) ∨ aINV0(asl0.last) ∨ ¬(∀ as, a, as0. aINV0(as) ∧ astepf0(as, a, as0) → aINV0(as0)), ∀ as, a, as0. aINV(as) ∧ astepf(as, a, as0) → aINV(as0) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[actionstream] ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s) ⊦ a + x = a ' + x; (s)

Proof step 31 from proof bwsiminv-implies-weakbwsim-aux (previous step) (back to tree)

aINV(as), afrag(AIOAut(astartf, astepf))(⌜as '⌝ + ⌜asl0⌝ , ⌜a0 '⌝ + ⌜al1⌝ ), ¬ aINV((as ' + asl0).last), ∀ as, a, as0. aINV(as) ∧ astepf(as, a, as0) → aINV(as0), ∀ aINV0, astartf0, astepf0, al. ¬ aINV0(asl0[0]) ∨ ¬ afrag(AIOAut(astartf0, astepf0))(⌜asl0⌝ , ⌜al⌝ ) ∨ aINV0(asl0.last) ∨ ¬(∀ as, a, as0. aINV0(as) ∧ astepf0(as, a, as0) → aINV0(as0)) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: IOtrace[traceA], name:frag-rec, seq:⊦ afrag(AIOAut(startf, stepf))(⌜s '⌝ + σ, ⌜a '⌝ + α) ↔ stepf(s, a, hd(σ)) ∧ afrag(AIOAut(startf, stepf))(σ, α), subst:[s, α, σ, a, stepf, startf] → [as, ⌜al1⌝ , ⌜asl0⌝ , a0, astepf, astartf], <all paths>

Additional information

Used terms: ⌜al1⌝ , a0, ⌜asl0⌝ , as, astepf, astartf

Proof step 32 from proof bwsiminv-implies-weakbwsim-aux (previous step) (back to tree)

⊦ afrag(AIOAut(startf, stepf))(⌜s '⌝ + σ, ⌜a '⌝ + α) ↔ stepf(s, a, hd(σ)) ∧ afrag(AIOAut(startf, stepf))(σ, α)

A spec-lemma

Proof step 33 from proof bwsiminv-implies-weakbwsim-aux (previous step) (back to tree)

aINV(as), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ , ⌜al1⌝ ), astepf(as, a0, hd(⌜asl0⌝ )), ¬ aINV((as ' + asl0).last), ∀ aINV0, astartf0, astepf0, al. ¬ aINV0(asl0[0]) ∨ ¬ afrag(AIOAut(astartf0, astepf0))(⌜asl0⌝ , ⌜al⌝ ) ∨ aINV0(asl0.last) ∨ ¬(∀ as, a, as0. aINV0(as) ∧ astepf0(as, a, as0) → aINV0(as0)), ∀ as, a, as0. aINV(as) ∧ astepf(as, a, as0) → aINV(as0) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 34 from proof bwsiminv-implies-weakbwsim-aux (previous step) (back to tree)

aINV(as), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ , ⌜al1⌝ ), astepf(as, a0, hd(⌜asl0⌝ )), ¬ aINV((as ' + asl0).last), ∀ as, a, as0. aINV(as) ∧ astepf(as, a, as0) → aINV(as0), ∀ aINV0, astartf0, astepf0, al. ¬ aINV0(asl0[0]) ∨ ¬ afrag(AIOAut(astartf0, astepf0))(⌜asl0⌝ , ⌜al⌝ ) ∨ aINV0(asl0.last) ∨ ¬(∀ as, a, as0. aINV0(as) ∧ astepf0(as, a, as0) → aINV0(as0)) ⊦

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 6 terms: aINV, astartf, astepf, al1 abort: F discard: T computed: T

Additional information

Used terms: aINV, astartf, astepf, al1

Proof step 35 from proof bwsiminv-implies-weakbwsim-aux (previous step) (back to tree)

aINV(as), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ , ⌜al1⌝ ), astepf(as, a0, hd(⌜asl0⌝ )), ¬ aINV((as ' + asl0).last), ∀ as, a, as0. aINV(as) ∧ astepf(as, a, as0) → aINV(as0), ¬ aINV(asl0[0]) ∨ ¬ afrag(AIOAut(astartf, astepf))(⌜asl0⌝ , ⌜al1⌝ ) ∨ aINV(asl0.last) ∨ ¬(∀ as, a, as0. aINV(as) ∧ astepf(as, a, as0) → aINV(as0)) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 36 from proof bwsiminv-implies-weakbwsim-aux (previous step) (back to tree)

aINV(as), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ , ⌜al1⌝ ), astepf(as, a0, hd(⌜asl0⌝ )), ¬ aINV((as ' + asl0).last), ∀ as, a, as0. aINV(as) ∧ astepf(as, a, as0) → aINV(as0), ¬ aINV(asl0[0]) ∨ aINV(asl0.last) ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 6

Additional information

Proof step 37 from proof bwsiminv-implies-weakbwsim-aux (previous step) (back to tree)

aINV(as), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ , ⌜al1⌝ ), astepf(as, a0, hd(⌜asl0⌝ )), ¬ aINV(asl0[0]), ¬ aINV((as ' + asl0).last), ∀ as, a, as0. aINV(as) ∧ astepf(as, a, as0) → aINV(as0) ⊦

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: asl0

Additional information

Used simplifier rules: astatelist freely generated by [], +;; ⊦ ⌜[]⌝ = []; (s) ⊦ ¬ afrag(AIOAut(startf, stepf))([], α); (s)

Proof step 38 from proof bwsiminv-implies-weakbwsim-aux (previous step) (back to tree)

asl0 = as0 + asl1, aINV(as), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ , ⌜al1⌝ ), astepf(as, a0, hd(⌜asl0⌝ )), ¬ aINV(asl0[0]), ¬ aINV((as ' + asl0).last), ∀ as, a, as0. aINV(as) ∧ astepf(as, a, as0) → aINV(as0) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[traceA-IOstatestream] ⊦ (b ' + a ' + x).last = (a ' + x).last; (s) ⊦ a + x = a ' + x; (s) ⊦ (a ' + x)[0] = a; (s) ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[traceA-IOstatestream] ⊦ hd(⌜a '⌝ + ⌜x⌝ ) = a; (s)

Proof step 39 from proof bwsiminv-implies-weakbwsim-aux (previous step) (back to tree)

aINV(as), afrag(AIOAut(astartf, astepf))(⌜as0 '⌝ + ⌜asl1⌝ , ⌜al1⌝ ), astepf(as, a0, as0), ¬ aINV(as0), ¬ aINV((as0 ' + asl1).last), ∀ as, a, as0. aINV(as) ∧ astepf(as, a, as0) → aINV(as0) ⊦

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 6 terms: as, a0, as0

Additional information

Used terms: as, a0, as0

Proof step 40 from proof bwsiminv-implies-weakbwsim-aux (previous step) (back to tree)

aINV(as), aINV(asl0.last), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ , ⌜al1⌝ ), astepf(as, a0, hd(⌜asl0⌝ )), ¬ aINV((as ' + asl0).last), ∀ as, a, as0. aINV(as) ∧ astepf(as, a, as0) → aINV(as0) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list-last[traceA-IOstatestream], name:l-02, seq: ⊦ x ≠ [] → (a ' + x).last = x.last, subst:[x, a] → [asl0, as], <all paths>

Additional information

Used simplifier rules: ⊦ ⌜[]⌝ = []; (s) ⊦ ¬ afrag(AIOAut(startf, stepf))([], α); (s) Used terms: asl0, as

Proof step 41 from proof bwsiminv-implies-weakbwsim-aux (previous step) (back to tree)

⊦ x ≠ [] → (a ' + x).last = x.last

A spec-lemma

Proof step 42 from proof bwsiminv-implies-weakbwsim-aux (previous step) (back to tree)

aINV(as0), bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cINV, aINV), cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , ⌜al1⌝ ), cstartf(csl0[0]), cstepf(csl0.last, a, cs0), t(cs0, as0), ∀ cs1. (∃ csl1, al2. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al2⌝ ) ∧ cstartf(csl1[0]) ∧ csl1.last = cs1) → cINV(cs1), ∀ cs, a, cs0, as0. cINV(cs) ∧ cstepf(cs, a, cs0) ∧ t(cs0, as0) ∧ aINV(as0) → (∃ as. aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, as0) ∧ t(cs, as)), ∀ cs, as. cstartf(cs) ∧ t(cs, as) ∧ aINV(as) → astartf(as), ∀ cs. cINV(cs) → (∃ as. t(cs, as) ∧ aINV(as)), ∀ as, a, as0. aINV(as) ∧ astepf(as, a, as0) → aINV(as0), ∀ cs, a, cs0. cINV(cs) ∧ cstepf(cs, a, cs0) → cINV(cs0), ∀ as. astartf(as) → aINV(as), ∀ cs. cstartf(cs) → cINV(cs) ⊦ ∃ as. aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, as0) ∧ t(csl0.last, as)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 43 from proof bwsiminv-implies-weakbwsim-aux (previous step) (back to tree)

aINV(as0), bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cINV, aINV), cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , ⌜al1⌝ ), cstartf(csl0[0]), cstepf(csl0.last, a, cs0), t(cs0, as0), ∀ cs. cstartf(cs) → cINV(cs), ∀ as. astartf(as) → aINV(as), ∀ cs, a, cs0. cINV(cs) ∧ cstepf(cs, a, cs0) → cINV(cs0), ∀ as, a, as0. aINV(as) ∧ astepf(as, a, as0) → aINV(as0), ∀ cs. cINV(cs) → (∃ as. t(cs, as) ∧ aINV(as)), ∀ cs, as. cstartf(cs) ∧ t(cs, as) ∧ aINV(as) → astartf(as), ∀ cs, a, cs0, as0. cINV(cs) ∧ cstepf(cs, a, cs0) ∧ t(cs0, as0) ∧ aINV(as0) → (∃ as. aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, as0) ∧ t(cs, as)), ∀ cs1. (∃ csl1, al2. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al2⌝ ) ∧ cstartf(csl1[0]) ∧ csl1.last = cs1) → cINV(cs1) ⊦ ∃ as. aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, as0) ∧ t(csl0.last, as)

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 13 terms: csl0.last, a, cs0, as0 abort: F discard: T computed: T

Additional information

Used terms: csl0.last, a, cs0, as0

Proof step 44 from proof bwsiminv-implies-weakbwsim-aux (previous step) (back to tree)

aINV(as0), bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cINV, aINV), cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , ⌜al1⌝ ), cstartf(csl0[0]), cstepf(csl0.last, a, cs0), t(cs0, as0), cINV(csl0.last) ∧ cstepf(csl0.last, a, cs0) ∧ t(cs0, as0) ∧ aINV(as0) → (∃ as. aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, as0) ∧ t(csl0.last, as)), ∀ cs1. (∃ csl1, al2. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al2⌝ ) ∧ cstartf(csl1[0]) ∧ csl1.last = cs1) → cINV(cs1), ∀ cs, as. cstartf(cs) ∧ t(cs, as) ∧ aINV(as) → astartf(as), ∀ cs. cINV(cs) → (∃ as. t(cs, as) ∧ aINV(as)), ∀ as, a, as0. aINV(as) ∧ astepf(as, a, as0) → aINV(as0), ∀ cs, a, cs0. cINV(cs) ∧ cstepf(cs, a, cs0) → cINV(cs0), ∀ as. astartf(as) → aINV(as), ∀ cs. cstartf(cs) → cINV(cs) ⊦ ∃ as. aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, as0) ∧ t(csl0.last, as)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 45 from proof bwsiminv-implies-weakbwsim-aux (previous step) (back to tree)

aINV(as0), bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cINV, aINV), cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , ⌜al1⌝ ), cstartf(csl0[0]), cstepf(csl0.last, a, cs0), t(cs0, as0), ¬ cINV(csl0.last), ∀ cs. cstartf(cs) → cINV(cs), ∀ as. astartf(as) → aINV(as), ∀ cs, a, cs0. cINV(cs) ∧ cstepf(cs, a, cs0) → cINV(cs0), ∀ as, a, as0. aINV(as) ∧ astepf(as, a, as0) → aINV(as0), ∀ cs. cINV(cs) → (∃ as. t(cs, as) ∧ aINV(as)), ∀ cs, as. cstartf(cs) ∧ t(cs, as) ∧ aINV(as) → astartf(as), ∀ cs1. (∃ csl1, al2. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al2⌝ ) ∧ cstartf(csl1[0]) ∧ csl1.last = cs1) → cINV(cs1) ⊦ ∃ as. aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, as0) ∧ t(csl0.last, as)

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 14 terms: csl0.last abort: F discard: T computed: T

Additional information

Used terms: csl0.last

Proof step 46 from proof bwsiminv-implies-weakbwsim-aux (previous step) (back to tree)

aINV(as0), bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cINV, aINV), cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , ⌜al1⌝ ), cstartf(csl0[0]), cstepf(csl0.last, a, cs0), t(cs0, as0), ¬ cINV(csl0.last), (∃ csl1, al2. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al2⌝ ) ∧ cstartf(csl1[0]) ∧ csl1.last = csl0.last) → cINV(csl0.last), ∀ cs, as. cstartf(cs) ∧ t(cs, as) ∧ aINV(as) → astartf(as), ∀ cs. cINV(cs) → (∃ as. t(cs, as) ∧ aINV(as)), ∀ as, a, as0. aINV(as) ∧ astepf(as, a, as0) → aINV(as0), ∀ cs, a, cs0. cINV(cs) ∧ cstepf(cs, a, cs0) → cINV(cs0), ∀ as. astartf(as) → aINV(as), ∀ cs. cstartf(cs) → cINV(cs) ⊦ ∃ as. aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, as0) ∧ t(csl0.last, as)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 47 from proof bwsiminv-implies-weakbwsim-aux (previous step) (back to tree)

aINV(as0), bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cINV, aINV), cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , ⌜al1⌝ ), cstartf(csl0[0]), cstepf(csl0.last, a, cs0), t(cs0, as0), ¬ cINV(csl0.last), ∀ cs. cstartf(cs) → cINV(cs), ∀ as. astartf(as) → aINV(as), ∀ cs, a, cs0. cINV(cs) ∧ cstepf(cs, a, cs0) → cINV(cs0), ∀ as, a, as0. aINV(as) ∧ astepf(as, a, as0) → aINV(as0), ∀ cs. cINV(cs) → (∃ as. t(cs, as) ∧ aINV(as)), ∀ cs, as. cstartf(cs) ∧ t(cs, as) ∧ aINV(as) → astartf(as) ⊦ ∃ as. aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, as0) ∧ t(csl0.last, as), ∃ csl1, al2. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al2⌝ ) ∧ cstartf(csl1[0]) ∧ csl1.last = csl0.last

Heuristic quantifier closing applied rule exists right

And closed the goal!

Rule argument

pos: right 2 terms: csl0, al1

Additional information

Used terms: csl0, al1

Proof step 48 from proof bwsiminv-implies-weakbwsim-aux (previous step) (back to tree)

bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cINV, aINV), ∀ cs, a, cs0, as0. cINV(cs) ∧ cstepf(cs, a, cs0) ∧ t(cs0, as0) ∧ aINV(as0) → (∃ as. aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, as0) ∧ t(cs, as)), ∀ cs, as. cstartf(cs) ∧ t(cs, as) ∧ aINV(as) → astartf(as), ∀ cs. cINV(cs) → (∃ as. t(cs, as) ∧ aINV(as)), ∀ as, a, as0. aINV(as) ∧ astepf(as, a, as0) → aINV(as0), ∀ cs, a, cs0. cINV(cs) ∧ cstepf(cs, a, cs0) → cINV(cs0), ∀ as. astartf(as) → aINV(as), ∀ cs. cstartf(cs) → cINV(cs), ¬(cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al⌝ ) ∧ cstartf(csl[0]) → (∃ as. t(csl.last, as) ∧ aINV(as))) ∨ ¬(cstartf(cs) ∧ t(cs, as) ∧ aINV(as) → astartf(as)) ∨ ¬(afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al0⌝ ) ∧ astartf(asl[0]) → aINV(asl.last)) ∨ ¬ ( cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , ⌜al1⌝ ) ∧ cstartf(csl0[0]) ∧ cstepf(csl0.last, a, cs0) ∧ t(cs0, as0) ∧ aINV(as0) → (∃ as. aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, as0) ∧ t(csl0.last, as))) ⊦ ∀ cs. (∃ csl, al. cexec(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al⌝ ) ∧ csl.last = cs) → cINV(cs)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ cexec(CIOAut(startf, stepf))(σ, β) ↔ cfrag(CIOAut(startf, stepf))(σ, β) ∧ startf(σ[0]); (s)

Proof step 49 from proof bwsiminv-implies-weakbwsim-aux (previous step) (back to tree)

bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cINV, aINV), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al2⌝ ), cstartf(csl1[0]), ¬ cINV(csl1.last), ∀ cs. cstartf(cs) → cINV(cs), ∀ as. astartf(as) → aINV(as), ∀ cs, a, cs0. cINV(cs) ∧ cstepf(cs, a, cs0) → cINV(cs0), ∀ as, a, as0. aINV(as) ∧ astepf(as, a, as0) → aINV(as0), ∀ cs. cINV(cs) → (∃ as. t(cs, as) ∧ aINV(as)), ∀ cs, as. cstartf(cs) ∧ t(cs, as) ∧ aINV(as) → astartf(as), ∀ cs, a, cs0, as0. cINV(cs) ∧ cstepf(cs, a, cs0) ∧ t(cs0, as0) ∧ aINV(as0) → (∃ as. aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, as0) ∧ t(cs, as)), ¬(cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al⌝ ) ∧ cstartf(csl[0]) → (∃ as. t(csl.last, as) ∧ aINV(as))) ∨ ¬(cstartf(cs) ∧ t(cs, as) ∧ aINV(as) → astartf(as)) ∨ ¬(afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al0⌝ ) ∧ astartf(asl[0]) → aINV(asl.last)) ∨ ¬ ( cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , ⌜al1⌝ ) ∧ cstartf(csl0[0]) ∧ cstepf(csl0.last, a, cs0) ∧ t(cs0, as0) ∧ aINV(as0) → (∃ as. aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, as0) ∧ t(csl0.last, as))) ⊦

User applied rule weakening

And obtained the following new goals

Rule argument

poslist: left 1, left 6, left 8, left 9, left 10, left 11

Additional information

Proof step 50 from proof bwsiminv-implies-weakbwsim-aux (previous step) (back to tree)

cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al2⌝ ), cstartf(csl1[0]), ¬ cINV(csl1.last), ∀ cs, a, cs0. cINV(cs) ∧ cstepf(cs, a, cs0) → cINV(cs0), ∀ cs. cstartf(cs) → cINV(cs), ¬(cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al⌝ ) ∧ cstartf(csl[0]) → (∃ as. t(csl.last, as) ∧ aINV(as))) ∨ ¬(cstartf(cs) ∧ t(cs, as) ∧ aINV(as) → astartf(as)) ∨ ¬(afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al0⌝ ) ∧ astartf(asl[0]) → aINV(asl.last)) ∨ ¬ ( cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , ⌜al1⌝ ) ∧ cstartf(csl0[0]) ∧ cstepf(csl0.last, a, cs0) ∧ t(cs0, as0) ∧ aINV(as0) → (∃ as. aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, as0) ∧ t(csl0.last, as))) ⊦

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 5 terms: csl1[0] abort: F discard: T computed: T

Additional information

Used terms: csl1[0]

Proof step 51 from proof bwsiminv-implies-weakbwsim-aux (previous step) (back to tree)

cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al2⌝ ), cstartf(csl1[0]), ¬ cINV(csl1.last), cstartf(csl1[0]) → cINV(csl1[0]), ∀ cs, a, cs0. cINV(cs) ∧ cstepf(cs, a, cs0) → cINV(cs0), ¬(cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al⌝ ) ∧ cstartf(csl[0]) → (∃ as. t(csl.last, as) ∧ aINV(as))) ∨ ¬(cstartf(cs) ∧ t(cs, as) ∧ aINV(as) → astartf(as)) ∨ ¬(afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al0⌝ ) ∧ astartf(asl[0]) → aINV(asl.last)) ∨ ¬ ( cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , ⌜al1⌝ ) ∧ cstartf(csl0[0]) ∧ cstepf(csl0.last, a, cs0) ∧ t(cs0, as0) ∧ aINV(as0) → (∃ as. aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, as0) ∧ t(csl0.last, as))) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 52 from proof bwsiminv-implies-weakbwsim-aux (previous step) (back to tree)

cINV(csl1[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al2⌝ ), cstartf(csl1[0]), ¬ cINV(csl1.last), ∀ cs, a, cs0. cINV(cs) ∧ cstepf(cs, a, cs0) → cINV(cs0), ¬(cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al⌝ ) ∧ cstartf(csl[0]) → (∃ as. t(csl.last, as) ∧ aINV(as))) ∨ ¬(cstartf(cs) ∧ t(cs, as) ∧ aINV(as) → astartf(as)) ∨ ¬(afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al0⌝ ) ∧ astartf(asl[0]) → aINV(asl.last)) ∨ ¬ ( cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , ⌜al1⌝ ) ∧ cstartf(csl0[0]) ∧ cstepf(csl0.last, a, cs0) ∧ t(cs0, as0) ∧ aINV(as0) → (∃ as. aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, as0) ∧ t(csl0.last, as))) ⊦

User applied rule weakening

And obtained the following new goals

Rule argument

poslist: left 3, left 6

Additional information

Proof step 53 from proof bwsiminv-implies-weakbwsim-aux (previous step) (back to tree)

cINV(csl1[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al2⌝ ), ¬ cINV(csl1.last), ∀ cs, a, cs0. cINV(cs) ∧ cstepf(cs, a, cs0) → cINV(cs0) ⊦

User applied rule structural induction

And obtained the following new goals

Rule argument

indvar: csl1

Additional information

Used simplifier rules: cstatelist freely generated by [], +;; ⊦ ⌜[]⌝ = []; (s) ⊦ ¬ cfrag(CIOAut(startf, stepf))([], α); (s)

Proof step 54 from proof bwsiminv-implies-weakbwsim-aux (previous step) (back to tree)

cINV((cs + csl)[0]), cfrag(CIOAut(cstartf, cstepf))(⌜cs + csl⌝ , ⌜al2⌝ ), ¬ cINV((cs + csl).last), ∀ cs, a, cs0. cINV(cs) ∧ cstepf(cs, a, cs0) → cINV(cs0), ∀ cINV, cstartf, cstepf, al2. ¬(cINV(csl[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al2⌝ ) ∧ ¬ cINV(csl.last) ∧ (∀ cs, a, cs0. cINV(cs) ∧ cstepf(cs, a, cs0) → cINV(cs0))) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ a + x = a ' + x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[traceC-IOstatestream] ⊦ (a ' + x)[0] = a; (s) ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s)

Proof step 55 from proof bwsiminv-implies-weakbwsim-aux (previous step) (back to tree)

cINV(cs), cfrag(CIOAut(cstartf, cstepf))(⌜cs '⌝ + ⌜csl⌝ , ⌜al2⌝ ), ¬ cINV((cs ' + csl).last), ∀ cs, a, cs0. cINV(cs) ∧ cstepf(cs, a, cs0) → cINV(cs0), ∀ cINV0, cstartf0, cstepf0, al. ¬ cINV0(csl[0]) ∨ ¬ cfrag(CIOAut(cstartf0, cstepf0))(⌜csl⌝ , ⌜al⌝ ) ∨ cINV0(csl.last) ∨ ¬(∀ cs, a, cs0. cINV0(cs) ∧ cstepf0(cs, a, cs0) → cINV0(cs0)) ⊦

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: al2

Additional information

Used simplifier rules: actionlist freely generated by [], +;;

Proof step 56 from proof bwsiminv-implies-weakbwsim-aux (previous step) (back to tree)

al2 = [], cINV(cs), cfrag(CIOAut(cstartf, cstepf))(⌜cs '⌝ + ⌜csl⌝ , ⌜al2⌝ ), ¬ cINV((cs ' + csl).last), ∀ cINV0, cstartf0, cstepf0, al. ¬ cINV0(csl[0]) ∨ ¬ cfrag(CIOAut(cstartf0, cstepf0))(⌜csl⌝ , ⌜al⌝ ) ∨ cINV0(csl.last) ∨ ¬(∀ cs, a, cs0. cINV0(cs) ∧ cstepf0(cs, a, cs0) → cINV0(cs0)), ∀ cs, a, cs0. cINV(cs) ∧ cstepf(cs, a, cs0) → cINV(cs0) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ⌜[]⌝ = []; (s)

Proof step 57 from proof bwsiminv-implies-weakbwsim-aux (previous step) (back to tree)

cINV(cs), cfrag(CIOAut(cstartf, cstepf))(⌜cs '⌝ + ⌜csl⌝ , []), ¬ cINV((cs ' + csl).last), ∀ cs, a, cs0. cINV(cs) ∧ cstepf(cs, a, cs0) → cINV(cs0), ∀ cINV0, cstartf0, cstepf0, al. ¬ cINV0(csl[0]) ∨ ¬ cfrag(CIOAut(cstartf0, cstepf0))(⌜csl⌝ , ⌜al⌝ ) ∨ cINV0(csl.last) ∨ ¬(∀ cs, a, cs0. cINV0(cs) ∧ cstepf0(cs, a, cs0) → cINV0(cs0)) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: IOtrace[traceC], name:frag, seq:⊦ cfrag(CIOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1])), subst:[β, σ, stepf, startf] → [[], ⌜cs '⌝ + ⌜csl⌝ , cstepf, cstartf], <all paths>

Additional information

Used simplifier rules: ⊦ #(σ + σ1) = # σ + # σ1; (s) ⊦ # a ' = 0 +1; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[traceC-IOstatestream] ⊦ ⌜(* n)⌝ + ⌜(* m)⌝ = ⌜n + m⌝ ; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic ⊦ m ≤ n → (⌜(* n)⌝ = ⌜(* m)⌝ + n∞2 ↔ ⌜n - m⌝ = n∞2); (s) ⊦ ⌜n⌝ = ⌜n0⌝ ↔ n = n0; (s) ⊦ # x = 0 ↔ x = []; (s) add-assoc: ⊦ (n∞ + n∞1) + n∞2 = n∞ + n∞1 + n∞2; from specification nat-inf add-comm: ⊦ n∞1 + n∞2 = n∞2 + n∞1; from specification nat-inf ⊦ # [] = ⌜0⌝ ; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ ¬ n < 0; (s) ⊦ x + [] = x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[traceC-IOstatestream] ⊦ a '.last = a; (s) ⊦ ⌜[]⌝ = []; (s) ⊦ ¬ cfrag(CIOAut(startf, stepf))([], α); (s) Used terms: [], ⌜cs '⌝ + ⌜csl⌝ , cstepf, cstartf

Proof step 58 from proof bwsiminv-implies-weakbwsim-aux (previous step) (back to tree)

⊦ cfrag(CIOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1]))

A spec-lemma

Proof step 59 from proof bwsiminv-implies-weakbwsim-aux (previous step) (back to tree)

al2 = a0 + al0, cINV(cs), cfrag(CIOAut(cstartf, cstepf))(⌜cs '⌝ + ⌜csl⌝ , ⌜al2⌝ ), ¬ cINV((cs ' + csl).last), ∀ cINV0, cstartf0, cstepf0, al. ¬ cINV0(csl[0]) ∨ ¬ cfrag(CIOAut(cstartf0, cstepf0))(⌜csl⌝ , ⌜al⌝ ) ∨ cINV0(csl.last) ∨ ¬(∀ cs, a, cs0. cINV0(cs) ∧ cstepf0(cs, a, cs0) → cINV0(cs0)), ∀ cs, a, cs0. cINV(cs) ∧ cstepf(cs, a, cs0) → cINV(cs0) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[actionstream] ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s) ⊦ a + x = a ' + x; (s)

Proof step 60 from proof bwsiminv-implies-weakbwsim-aux (previous step) (back to tree)

cINV(cs), cfrag(CIOAut(cstartf, cstepf))(⌜cs '⌝ + ⌜csl⌝ , ⌜a0 '⌝ + ⌜al0⌝ ), ¬ cINV((cs ' + csl).last), ∀ cs, a, cs0. cINV(cs) ∧ cstepf(cs, a, cs0) → cINV(cs0), ∀ cINV0, cstartf0, cstepf0, al. ¬ cINV0(csl[0]) ∨ ¬ cfrag(CIOAut(cstartf0, cstepf0))(⌜csl⌝ , ⌜al⌝ ) ∨ cINV0(csl.last) ∨ ¬(∀ cs, a, cs0. cINV0(cs) ∧ cstepf0(cs, a, cs0) → cINV0(cs0)) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: IOtrace[traceC], name:frag-rec, seq:⊦ cfrag(CIOAut(startf, stepf))(⌜s '⌝ + σ, ⌜a '⌝ + α) ↔ stepf(s, a, hd(σ)) ∧ cfrag(CIOAut(startf, stepf))(σ, α), subst:[α, stepf, a, startf, s, σ] → [⌜al0⌝ , cstepf, a0, cstartf, cs, ⌜csl⌝ ], <all paths>

Additional information

Used terms: ⌜al0⌝ , a0, ⌜csl⌝ , cs, cstepf, cstartf

Proof step 61 from proof bwsiminv-implies-weakbwsim-aux (previous step) (back to tree)

⊦ cfrag(CIOAut(startf, stepf))(⌜s '⌝ + σ, ⌜a '⌝ + α) ↔ stepf(s, a, hd(σ)) ∧ cfrag(CIOAut(startf, stepf))(σ, α)

A spec-lemma

Proof step 62 from proof bwsiminv-implies-weakbwsim-aux (previous step) (back to tree)

cINV(cs), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), cstepf(cs, a0, hd(⌜csl⌝ )), ¬ cINV((cs ' + csl).last), ∀ cINV0, cstartf0, cstepf0, al. ¬ cINV0(csl[0]) ∨ ¬ cfrag(CIOAut(cstartf0, cstepf0))(⌜csl⌝ , ⌜al⌝ ) ∨ cINV0(csl.last) ∨ ¬(∀ cs, a, cs0. cINV0(cs) ∧ cstepf0(cs, a, cs0) → cINV0(cs0)), ∀ cs, a, cs0. cINV(cs) ∧ cstepf(cs, a, cs0) → cINV(cs0) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 63 from proof bwsiminv-implies-weakbwsim-aux (previous step) (back to tree)

cINV(cs), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), cstepf(cs, a0, hd(⌜csl⌝ )), ¬ cINV((cs ' + csl).last), ∀ cs, a, cs0. cINV(cs) ∧ cstepf(cs, a, cs0) → cINV(cs0), ∀ cINV0, cstartf0, cstepf0, al. ¬ cINV0(csl[0]) ∨ ¬ cfrag(CIOAut(cstartf0, cstepf0))(⌜csl⌝ , ⌜al⌝ ) ∨ cINV0(csl.last) ∨ ¬(∀ cs, a, cs0. cINV0(cs) ∧ cstepf0(cs, a, cs0) → cINV0(cs0)) ⊦

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 6 terms: cINV, cstartf, cstepf, al0 abort: F discard: T computed: T

Additional information

Used terms: cINV, cstartf, cstepf, al0

Proof step 64 from proof bwsiminv-implies-weakbwsim-aux (previous step) (back to tree)

cINV(cs), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), cstepf(cs, a0, hd(⌜csl⌝ )), ¬ cINV((cs ' + csl).last), ∀ cs, a, cs0. cINV(cs) ∧ cstepf(cs, a, cs0) → cINV(cs0), ¬ cINV(csl[0]) ∨ ¬ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ) ∨ cINV(csl.last) ∨ ¬(∀ cs, a, cs0. cINV(cs) ∧ cstepf(cs, a, cs0) → cINV(cs0)) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 65 from proof bwsiminv-implies-weakbwsim-aux (previous step) (back to tree)

cINV(cs), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), cstepf(cs, a0, hd(⌜csl⌝ )), ¬ cINV((cs ' + csl).last), ∀ cs, a, cs0. cINV(cs) ∧ cstepf(cs, a, cs0) → cINV(cs0), ¬ cINV(csl[0]) ∨ cINV(csl.last) ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 6

Additional information

Proof step 66 from proof bwsiminv-implies-weakbwsim-aux (previous step) (back to tree)

cINV(cs), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), cstepf(cs, a0, hd(⌜csl⌝ )), ¬ cINV(csl[0]), ¬ cINV((cs ' + csl).last), ∀ cs, a, cs0. cINV(cs) ∧ cstepf(cs, a, cs0) → cINV(cs0) ⊦

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: csl

Additional information

Used simplifier rules: cstatelist freely generated by [], +;; ⊦ ⌜[]⌝ = []; (s) ⊦ ¬ cfrag(CIOAut(startf, stepf))([], α); (s)

Proof step 67 from proof bwsiminv-implies-weakbwsim-aux (previous step) (back to tree)

csl = cs0 + csl0, cINV(cs), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), cstepf(cs, a0, hd(⌜csl⌝ )), ¬ cINV(csl[0]), ¬ cINV((cs ' + csl).last), ∀ cs, a, cs0. cINV(cs) ∧ cstepf(cs, a, cs0) → cINV(cs0) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[traceC-IOstatestream] ⊦ (b ' + a ' + x).last = (a ' + x).last; (s) ⊦ a + x = a ' + x; (s) ⊦ (a ' + x)[0] = a; (s) ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[traceC-IOstatestream] ⊦ hd(⌜a '⌝ + ⌜x⌝ ) = a; (s)

Proof step 68 from proof bwsiminv-implies-weakbwsim-aux (previous step) (back to tree)

cINV(cs), cfrag(CIOAut(cstartf, cstepf))(⌜cs0 '⌝ + ⌜csl0⌝ , ⌜al0⌝ ), cstepf(cs, a0, cs0), ¬ cINV(cs0), ¬ cINV((cs0 ' + csl0).last), ∀ cs, a, cs0. cINV(cs) ∧ cstepf(cs, a, cs0) → cINV(cs0) ⊦

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 6 terms: cs, a0, cs0

Additional information

Used terms: cs, a0, cs0

Proof step 69 from proof bwsiminv-implies-weakbwsim-aux (previous step) (back to tree)

cINV(cs), cINV(csl.last), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), cstepf(cs, a0, hd(⌜csl⌝ )), ¬ cINV((cs ' + csl).last), ∀ cs, a, cs0. cINV(cs) ∧ cstepf(cs, a, cs0) → cINV(cs0) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list-last[traceC-IOstatestream], name:l-02, seq: ⊦ x ≠ [] → (a ' + x).last = x.last, subst:[x, a] → [csl, cs], <all paths>

Additional information

Used simplifier rules: ⊦ ⌜[]⌝ = []; (s) ⊦ ¬ cfrag(CIOAut(startf, stepf))([], α); (s) Used terms: csl, cs

Proof step 70 from proof bwsiminv-implies-weakbwsim-aux (previous step) (back to tree)

⊦ x ≠ [] → (a ' + x).last = x.last

A spec-lemma

Proof Tree for bwsiminv-implies-weakbwsim-aux (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