[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 normedfw-branchingfw-aux (conclusion) (back to tree)

nfwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), r, size10f) ⊦ bfwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), λ as, cs. ∃ as0. amove(AIOAut(astartf, astepf))(as, [], as0) ∧ r(as0, cs))

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: branchingIOforward, name:proofobls-branchingforwardsim, seq:⊦ bfwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), r) ↔ (∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as))) ∧ (∀ cs, a, cs0, as. r(as, cs) ∧ cstepf(cs, a, cs0) → (a = τ ⊃ r(as, cs0) ;∃ asl, al, as1. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ ⌜al⌝ ^ = [] ∧ hd(asl) = as ∧ (∀ as. as ∈ asl → r(as, cs)) ∧ astepf(asl.last, a, as1) ∧ r(as1, cs0) )), subst:[cstartf, cstepf, astartf, r, astepf] → [cstartf, cstepf, astartf, λ as, cs. ∃ as0. amove(AIOAut(astartf, astepf))(as, [], as0) ∧ r(as0, cs), astepf], <all paths>

Additional information

Used terms: λ as, cs. ∃ as0. amove(AIOAut(astartf, astepf))(as, [], as0) ∧ r(as0, cs), astepf, astartf, cstepf, cstartf

Proof step 2 from proof normedfw-branchingfw-aux (previous step) (back to tree)

⊦ bfwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), r) ↔ (∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as))) ∧ (∀ cs, a, cs0, as. r(as, cs) ∧ cstepf(cs, a, cs0) → (a = τ ⊃ r(as, cs0) ;∃ asl, al, as1. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ ⌜al⌝ ^ = [] ∧ hd(asl) = as ∧ (∀ as. as ∈ asl → r(as, cs)) ∧ astepf(asl.last, a, as1) ∧ r(as1, cs0) ))

A spec-lemma

Proof step 3 from proof normedfw-branchingfw-aux (previous step) (back to tree)

nfwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), r, size10f) ⊦ (∀ cs. cstartf(cs) → (∃ as. (∃ as0. amove(AIOAut(astartf, astepf))(as, [], as0) ∧ r(as0, cs)) ∧ astartf(as))) ∧ (∀ cs, a, cs0, as. (∃ as0. amove(AIOAut(astartf, astepf))(as, [], as0) ∧ r(as0, cs)) ∧ cstepf(cs, a, cs0) → (a = τ ⊃ ∃ as0. amove(AIOAut(astartf, astepf))(as, [], as0) ∧ r(as0, cs0) ;∃ asl, al, as1. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ ⌜al⌝ ^ = [] ∧ hd(asl) = as ∧ (∀ as. as ∈ asl → (∃ as0. amove(AIOAut(astartf, astepf))(as, [], as0) ∧ r(as0, cs))) ∧ astepf(asl.last, a, as1) ∧ (∃ as0. amove(AIOAut(astartf, astepf))(as1, [], as0) ∧ r(as0, cs0)) ))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 4 from proof normedfw-branchingfw-aux (previous step) (back to tree)

nfwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), r, size10f) ⊦ (cstartf(cs) → (∃ as. (∃ as0. amove(AIOAut(astartf, astepf))(as, [], as0) ∧ r(as0, cs)) ∧ astartf(as))) ∧ ( amove(AIOAut(astartf, astepf))(as, [], as0) ∧ r(as0, cs0) ∧ cstepf(cs0, a, cs1) → (a = τ ⊃ ∃ as0. amove(AIOAut(astartf, astepf))(as, [], as0) ∧ r(as0, cs1) ;∃ asl, al, as1. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ ⌜al⌝ ^ = [] ∧ hd(asl) = as ∧ (∀ as. as ∈ asl → (∃ as0. amove(AIOAut(astartf, astepf))(as, [], as0) ∧ r(as0, cs0))) ∧ astepf(asl.last, a, as1) ∧ (∃ as0. amove(AIOAut(astartf, astepf))(as1, [], as0) ∧ r(as0, cs1)) ))

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: normedIOforward, name:proofobls-normedforwardsim, seq:⊦ nfwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), r, size10f) ↔ (∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as))) ∧ (∀ cs, a, cs', as. r(as, cs) ∧ cstepf(cs, a, cs') → r(as, cs') ∧ a = τ ∨ (∃ as'. astepf(as, a, as') ∧ r(as', cs') ∨ (∃ as'. astepf(as, τ, as') ∧ r(as', cs) ∧ size10f(cs, a, cs', as') < size10f(cs, a, cs', as)))), subst:[cstartf, cstepf, astartf, size10f, r, astepf] → [cstartf, cstepf, astartf, size10f, r, astepf]

Additional information

Used terms: cstartf, cstepf, astartf, astepf, r, size10f

Proof step 5 from proof normedfw-branchingfw-aux (previous step) (back to tree)

⊦ nfwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), r, size10f) ↔ (∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as))) ∧ (∀ cs, a, cs', as. r(as, cs) ∧ cstepf(cs, a, cs') → r(as, cs') ∧ a = τ ∨ (∃ as'. astepf(as, a, as') ∧ r(as', cs') ∨ (∃ as'. astepf(as, τ, as') ∧ r(as', cs) ∧ size10f(cs, a, cs', as') < size10f(cs, a, cs', as))))

A spec-lemma

Proof step 6 from proof normedfw-branchingfw-aux (previous step) (back to tree)

nfwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), r, size10f), nfwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), r, size10f) ↔ (∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as))) ∧ (∀ cs, a, cs', as. r(as, cs) ∧ cstepf(cs, a, cs') → r(as, cs') ∧ a = τ ∨ (∃ as'. astepf(as, a, as') ∧ r(as', cs') ∨ (∃ as'. astepf(as, τ, as') ∧ r(as', cs) ∧ size10f(cs, a, cs', as') < size10f(cs, a, cs', as)))) ⊦ (cstartf(cs) → (∃ as. (∃ as0. amove(AIOAut(astartf, astepf))(as, [], as0) ∧ r(as0, cs)) ∧ astartf(as))) ∧ ( amove(AIOAut(astartf, astepf))(as, [], as0) ∧ r(as0, cs0) ∧ cstepf(cs0, a, cs1) → (a = τ ⊃ ∃ as0. amove(AIOAut(astartf, astepf))(as, [], as0) ∧ r(as0, cs1) ;∃ asl, al, as1. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ ⌜al⌝ ^ = [] ∧ hd(asl) = as ∧ (∀ as. as ∈ asl → (∃ as0. amove(AIOAut(astartf, astepf))(as, [], as0) ∧ r(as0, cs0))) ∧ astepf(asl.last, a, as1) ∧ (∃ as0. amove(AIOAut(astartf, astepf))(as1, [], as0) ∧ r(as0, cs1)) ))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 7 from proof normedfw-branchingfw-aux (previous step) (back to tree)

nfwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), r, size10f), ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)), ∀ cs2, a0, cs', as1. r(as1, cs2) ∧ cstepf(cs2, a0, cs') → r(as1, cs') ∧ a0 = τ ∨ (∃ as'. astepf(as1, a0, as') ∧ r(as', cs')) ∨ (∃ as'. astepf(as1, τ, as') ∧ r(as', cs2) ∧ size10f(cs2, a0, cs', as') < size10f(cs2, a0, cs', as1)) ⊦ (cstartf(cs) → (∃ as. (∃ as0. amove(AIOAut(astartf, astepf))(as, [], as0) ∧ r(as0, cs)) ∧ astartf(as))) ∧ ( amove(AIOAut(astartf, astepf))(as, [], as0) ∧ r(as0, cs0) ∧ cstepf(cs0, a, cs1) → (a = τ ⊃ ∃ as0. amove(AIOAut(astartf, astepf))(as, [], as0) ∧ r(as0, cs1) ;∃ asl, al, as1. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ ⌜al⌝ ^ = [] ∧ hd(asl) = as ∧ (∀ as. as ∈ asl → (∃ as0. amove(AIOAut(astartf, astepf))(as, [], as0) ∧ r(as0, cs0))) ∧ astepf(asl.last, a, as1) ∧ (∃ as0. amove(AIOAut(astartf, astepf))(as1, [], as0) ∧ r(as0, cs1)) ))

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 8 from proof normedfw-branchingfw-aux (previous step) (back to tree)

cstartf(cs), nfwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), r, size10f), ∀ cs2, a0, cs', as1. r(as1, cs2) ∧ cstepf(cs2, a0, cs') → r(as1, cs') ∧ a0 = τ ∨ (∃ as'. astepf(as1, a0, as') ∧ r(as', cs')) ∨ (∃ as'. astepf(as1, τ, as') ∧ r(as', cs2) ∧ size10f(cs2, a0, cs', as') < size10f(cs2, a0, cs', as1)), ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)) ⊦ ∃ as. (∃ as0. amove(AIOAut(astartf, astepf))(as, [], as0) ∧ r(as0, cs)) ∧ astartf(as)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 9 from proof normedfw-branchingfw-aux (previous step) (back to tree)

cstartf(cs), nfwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), r, size10f), ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)), ∀ cs2, a0, cs', as1. r(as1, cs2) ∧ cstepf(cs2, a0, cs') → r(as1, cs') ∧ a0 = τ ∨ (∃ as'. astepf(as1, a0, as') ∧ r(as', cs')) ∨ (∃ as'. astepf(as1, τ, as') ∧ r(as', cs2) ∧ size10f(cs2, a0, cs', as') < size10f(cs2, a0, cs', as1)) ⊦ ∃ as. (∃ as0. amove(AIOAut(astartf, astepf))(as, [], as0) ∧ r(as0, cs)) ∧ astartf(as)

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 3 terms: cs abort: F discard: T computed: T

Additional information

Used terms: cs

Proof step 10 from proof normedfw-branchingfw-aux (previous step) (back to tree)

cstartf(cs), nfwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), r, size10f), cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)), ∀ cs2, a0, cs', as1. r(as1, cs2) ∧ cstepf(cs2, a0, cs') → r(as1, cs') ∧ a0 = τ ∨ (∃ as'. astepf(as1, a0, as') ∧ r(as', cs')) ∨ (∃ as'. astepf(as1, τ, as') ∧ r(as', cs2) ∧ size10f(cs2, a0, cs', as') < size10f(cs2, a0, cs', as1)) ⊦ ∃ as. (∃ as0. amove(AIOAut(astartf, astepf))(as, [], as0) ∧ r(as0, cs)) ∧ astartf(as)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 11 from proof normedfw-branchingfw-aux (previous step) (back to tree)

astartf(as), cstartf(cs), nfwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), r, size10f), r(as, cs), ∀ cs2, a0, cs', as1. r(as1, cs2) ∧ cstepf(cs2, a0, cs') → r(as1, cs') ∧ a0 = τ ∨ (∃ as'. astepf(as1, a0, as') ∧ r(as', cs')) ∨ (∃ as'. astepf(as1, τ, as') ∧ r(as', cs2) ∧ size10f(cs2, a0, cs', as') < size10f(cs2, a0, cs', as1)) ⊦ ∃ as. (∃ as0. amove(AIOAut(astartf, astepf))(as, [], as0) ∧ r(as0, cs)) ∧ astartf(as)

User applied rule exists right

And obtained the following new goals

Rule argument

pos: right 1 terms: as abort: F discard: T computed: T

Additional information

Used terms: as

Proof step 12 from proof normedfw-branchingfw-aux (previous step) (back to tree)

astartf(as), cstartf(cs), nfwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), r, size10f), r(as, cs), ∀ cs2, a0, cs', as1. r(as1, cs2) ∧ cstepf(cs2, a0, cs') → r(as1, cs') ∧ a0 = τ ∨ (∃ as'. astepf(as1, a0, as') ∧ r(as', cs')) ∨ (∃ as'. astepf(as1, τ, as') ∧ r(as', cs2) ∧ size10f(cs2, a0, cs', as') < size10f(cs2, a0, cs', as1)) ⊦ (∃ as0. amove(AIOAut(astartf, astepf))(as, [], as0) ∧ r(as0, cs)) ∧ astartf(as)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 13 from proof normedfw-branchingfw-aux (previous step) (back to tree)

astartf(as), cstartf(cs), nfwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), r, size10f), r(as, cs), ∀ cs2, a0, cs', as1. r(as1, cs2) ∧ cstepf(cs2, a0, cs') → r(as1, cs') ∧ a0 = τ ∨ (∃ as'. astepf(as1, a0, as') ∧ r(as', cs')) ∨ (∃ as'. astepf(as1, τ, as') ∧ r(as', cs2) ∧ size10f(cs2, a0, cs', as') < size10f(cs2, a0, cs', as1)) ⊦ ∃ as0. amove(AIOAut(astartf, astepf))(as, [], as0) ∧ r(as0, cs)

Heuristic quantifier closing applied rule exists right

And closed the goal!

Rule argument

pos: right 1 terms: as

Additional information

Used simplifier rules: ⊦ amove(AIOAut(startf, stepf))(s, [], s); (s) Used terms: as

Proof step 14 from proof normedfw-branchingfw-aux (previous step) (back to tree)

amove(AIOAut(astartf, astepf))(as, [], as0), cstepf(cs0, a, cs1), nfwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), r, size10f), r(as0, cs0), ∀ cs2, a0, cs', as1. r(as1, cs2) ∧ cstepf(cs2, a0, cs') → r(as1, cs') ∧ a0 = τ ∨ (∃ as'. astepf(as1, a0, as') ∧ r(as', cs')) ∨ (∃ as'. astepf(as1, τ, as') ∧ r(as', cs2) ∧ size10f(cs2, a0, cs', as') < size10f(cs2, a0, cs', as1)), ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)) ⊦ (a = τ ⊃ ∃ as0. amove(AIOAut(astartf, astepf))(as, [], as0) ∧ r(as0, cs1) ;∃ asl, al, as1. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ ⌜al⌝ ^ = [] ∧ hd(asl) = as ∧ (∀ as. as ∈ asl → (∃ as0. amove(AIOAut(astartf, astepf))(as, [], as0) ∧ r(as0, cs0))) ∧ astepf(asl.last, a, as1) ∧ (∃ as0. amove(AIOAut(astartf, astepf))(as1, [], as0) ∧ r(as0, cs1)) )

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 15 from proof normedfw-branchingfw-aux (previous step) (back to tree)

amove(AIOAut(astartf, astepf))(as, [], as0), cstepf(cs0, a, cs1), nfwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), r, size10f), r(as0, cs0), ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)), ∀ cs2, a0, cs', as1. r(as1, cs2) ∧ cstepf(cs2, a0, cs') → r(as1, cs') ∧ a0 = τ ∨ (∃ as'. astepf(as1, a0, as') ∧ r(as', cs')) ∨ (∃ as'. astepf(as1, τ, as') ∧ r(as', cs2) ∧ size10f(cs2, a0, cs', as') < size10f(cs2, a0, cs', as1)) ⊦ (a = τ ⊃ ∃ as0. amove(AIOAut(astartf, astepf))(as, [], as0) ∧ r(as0, cs1) ;∃ asl, al, as1. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ ⌜al⌝ ^ = [] ∧ hd(asl) = as ∧ (∀ as. as ∈ asl → (∃ as0. amove(AIOAut(astartf, astepf))(as, [], as0) ∧ r(as0, cs0))) ∧ astepf(asl.last, a, as1) ∧ (∃ as0. amove(AIOAut(astartf, astepf))(as1, [], as0) ∧ r(as0, cs1)) )

Heuristic if-then-else split applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 16 from proof normedfw-branchingfw-aux (previous step) (back to tree)

a = τ, amove(AIOAut(astartf, astepf))(as, [], as0), cstepf(cs0, a, cs1), nfwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), r, size10f), r(as0, cs0), ∀ cs2, a0, cs', as1. r(as1, cs2) ∧ cstepf(cs2, a0, cs') → r(as1, cs') ∧ a0 = τ ∨ (∃ as'. astepf(as1, a0, as') ∧ r(as', cs')) ∨ (∃ as'. astepf(as1, τ, as') ∧ r(as', cs2) ∧ size10f(cs2, a0, cs', as') < size10f(cs2, a0, cs', as1)), ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)) ⊦ ∃ as0. amove(AIOAut(astartf, astepf))(as, [], as0) ∧ r(as0, cs1)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 17 from proof normedfw-branchingfw-aux (previous step) (back to tree)

amove(AIOAut(astartf, astepf))(as, [], as0), cstepf(cs0, τ, cs1), nfwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), r, size10f), r(as0, cs0), ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)), ∀ cs2, a0, cs', as1. r(as1, cs2) ∧ cstepf(cs2, a0, cs') → r(as1, cs') ∧ a0 = τ ∨ (∃ as'. astepf(as1, a0, as') ∧ r(as', cs')) ∨ (∃ as'. astepf(as1, τ, as') ∧ r(as', cs2) ∧ size10f(cs2, a0, cs', as') < size10f(cs2, a0, cs', as1)) ⊦ ∃ as0. amove(AIOAut(astartf, astepf))(as, [], as0) ∧ r(as0, cs1)

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:triang-fin, seq:nfwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), r, size10f), cstepf(cs, a, cs'), r(as, cs) ⊦ ∃ asl, al. asl[0] = as ∧ ⌜al⌝ ^ = [] ∧ afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ (∀ as. as ∈ asl → r(as, cs)) ∧ ((∃ as'. astepf(asl.last, a, as') ∧ r(as', cs')) ∨ a = τ ∧ r(asl.last, cs')), subst:[cstartf, cs, cstepf, astartf, size10f, a, as, r, cs', astepf] → [cstartf, cs0, cstepf, astartf, size10f, τ, as0, r, cs1, astepf]

Additional information

Used terms: cstartf, cstepf, astartf, astepf, r, size10f, cs0, τ, cs1, as0

Proof step 18 from proof normedfw-branchingfw-aux (previous step) (back to tree)

nfwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), r, size10f), cstepf(cs, a, cs'), r(as, cs) ⊦ ∃ asl, al. asl[0] = as ∧ ⌜al⌝ ^ = [] ∧ afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ (∀ as. as ∈ asl → r(as, cs)) ∧ ((∃ as'. astepf(asl.last, a, as') ∧ r(as', cs')) ∨ a = τ ∧ r(asl.last, cs'))

Lemma triang-fin

Proof step 19 from proof normedfw-branchingfw-aux (previous step) (back to tree)

amove(AIOAut(astartf, astepf))(as, [], as0), cstepf(cs0, τ, cs1), nfwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), r, size10f), r(as0, cs0), ∀ cs2, a0, cs', as1. r(as1, cs2) ∧ cstepf(cs2, a0, cs') → r(as1, cs') ∧ a0 = τ ∨ (∃ as'. astepf(as1, a0, as') ∧ r(as', cs')) ∨ (∃ as'. astepf(as1, τ, as') ∧ r(as', cs2) ∧ size10f(cs2, a0, cs', as') < size10f(cs2, a0, cs', as1)), ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)), ∃ asl, al. asl[0] = as0 ∧ ⌜al⌝ ^ = [] ∧ afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ (∀ as. as ∈ asl → r(as, cs0)) ∧ ((∃ as'. astepf(asl.last, τ, as') ∧ r(as', cs1)) ∨ τ = τ ∧ r(asl.last, cs1)) ⊦ ∃ as0. amove(AIOAut(astartf, astepf))(as, [], as0) ∧ r(as0, cs1)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 20 from proof normedfw-branchingfw-aux (previous step) (back to tree)

⌜al⌝ ^ = [], afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ), amove(AIOAut(astartf, astepf))(as, [], asl[0]), cstepf(cs0, τ, cs1), nfwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), r, size10f), r(asl[0], cs0), ∀ as. as ∈ asl → r(as, cs0), ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)), ∀ cs2, a0, cs', as1. r(as1, cs2) ∧ cstepf(cs2, a0, cs') → r(as1, cs') ∧ a0 = τ ∨ (∃ as'. astepf(as1, a0, as') ∧ r(as', cs')) ∨ (∃ as'. astepf(as1, τ, as') ∧ r(as', cs2) ∧ size10f(cs2, a0, cs', as') < size10f(cs2, a0, cs', as1)), astepf(asl.last, τ, as') ∧ r(as', cs1) ∨ r(asl.last, cs1) ⊦ ∃ as0. amove(AIOAut(astartf, astepf))(as, [], as0) ∧ r(as0, cs1)

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: IOtrace[traceA], name:move-trans, seq:⊦ amove(AIOAut(startf, stepf))(s, α1, s1) ∧ amove(AIOAut(startf, stepf))(s1, α2, s2) → amove(AIOAut(startf, stepf))(s, α1 + α2, s2), subst:[s, s1, α2, stepf, s2, startf, α1] → [as, asl[0], [], astepf, asl.last, astartf, []]

Additional information

Used terms: astartf, astepf, as, [], asl[0], [], asl.last

Proof step 21 from proof normedfw-branchingfw-aux (previous step) (back to tree)

⊦ amove(AIOAut(startf, stepf))(s, α1, s1) ∧ amove(AIOAut(startf, stepf))(s1, α2, s2) → amove(AIOAut(startf, stepf))(s, α1 + α2, s2)

A spec-lemma

Proof step 22 from proof normedfw-branchingfw-aux (previous step) (back to tree)

⌜al⌝ ^ = [], afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ), amove(AIOAut(astartf, astepf))(as, [], asl[0]), cstepf(cs0, τ, cs1), nfwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), r, size10f), r(asl[0], cs0), amove(AIOAut(astartf, astepf))(as, [], asl[0]) ∧ amove(AIOAut(astartf, astepf))(asl[0], [], asl.last) → amove(AIOAut(astartf, astepf))(as, [] + [], asl.last), ∀ cs2, a0, cs', as1. r(as1, cs2) ∧ cstepf(cs2, a0, cs') → r(as1, cs') ∧ a0 = τ ∨ (∃ as'. astepf(as1, a0, as') ∧ r(as', cs')) ∨ (∃ as'. astepf(as1, τ, as') ∧ r(as', cs2) ∧ size10f(cs2, a0, cs', as') < size10f(cs2, a0, cs', as1)), ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)), ∀ as. as ∈ asl → r(as, cs0), astepf(asl.last, τ, as') ∧ r(as', cs1) ∨ r(asl.last, cs1) ⊦ ∃ as0. amove(AIOAut(astartf, astepf))(as, [], as0) ∧ r(as0, cs1)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ [] + σ = σ; (s)

Proof step 23 from proof normedfw-branchingfw-aux (previous step) (back to tree)

⌜al⌝ ^ = [], afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ), amove(AIOAut(astartf, astepf))(as, [], asl[0]), cstepf(cs0, τ, cs1), nfwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), r, size10f), r(asl[0], cs0), amove(AIOAut(astartf, astepf))(asl[0], [], asl.last) → amove(AIOAut(astartf, astepf))(as, [], asl.last), ∀ as. as ∈ asl → r(as, cs0), ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)), ∀ cs2, a0, cs', as1. r(as1, cs2) ∧ cstepf(cs2, a0, cs') → r(as1, cs') ∧ a0 = τ ∨ (∃ as'. astepf(as1, a0, as') ∧ r(as', cs')) ∨ (∃ as'. astepf(as1, τ, as') ∧ r(as', cs2) ∧ size10f(cs2, a0, cs', as') < size10f(cs2, a0, cs', as1)), astepf(asl.last, τ, as') ∧ r(as', cs1) ∨ r(asl.last, cs1) ⊦ ∃ as0. amove(AIOAut(astartf, astepf))(as, [], as0) ∧ r(as0, cs1)

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 7

Additional information

Proof step 24 from proof normedfw-branchingfw-aux (previous step) (back to tree)

⌜al⌝ ^ = [], afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ), amove(AIOAut(astartf, astepf))(as, [], asl[0]), cstepf(cs0, τ, cs1), nfwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), r, size10f), r(asl[0], cs0), ¬ amove(AIOAut(astartf, astepf))(asl[0], [], asl.last), ∀ cs2, a0, cs', as1. r(as1, cs2) ∧ cstepf(cs2, a0, cs') → r(as1, cs') ∧ a0 = τ ∨ (∃ as'. astepf(as1, a0, as') ∧ r(as', cs')) ∨ (∃ as'. astepf(as1, τ, as') ∧ r(as', cs2) ∧ size10f(cs2, a0, cs', as') < size10f(cs2, a0, cs', as1)), ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)), ∀ as. as ∈ asl → r(as, cs0), astepf(asl.last, τ, as') ∧ r(as', cs1) ∨ r(asl.last, cs1) ⊦ ∃ as0. amove(AIOAut(astartf, astepf))(as, [], as0) ∧ r(as0, cs1)

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: IOtrace[traceA], name:move, seq:⊦ amove(AIOAut(startf, stepf))(s1, β, s2) ↔ (∃ α, sl. afrag*(AIOAut(startf, stepf))(⌜sl⌝ , α) ∧ s1 = sl[0] ∧ s2 = sl.last ∧ α ^ = β), subst:[s1, stepf, β, s2, startf] → [asl[0], astepf, [], asl.last, astartf], <all paths>

Additional information

Used terms: asl.last, [], asl[0], astepf, astartf

Proof step 25 from proof normedfw-branchingfw-aux (previous step) (back to tree)

⊦ amove(AIOAut(startf, stepf))(s1, β, s2) ↔ (∃ α, sl. afrag*(AIOAut(startf, stepf))(⌜sl⌝ , α) ∧ s1 = sl[0] ∧ s2 = sl.last ∧ α ^ = β)

A spec-lemma

Proof step 26 from proof normedfw-branchingfw-aux (previous step) (back to tree)

⌜al⌝ ^ = [], afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ), amove(AIOAut(astartf, astepf))(as, [], asl[0]), cstepf(cs0, τ, cs1), nfwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), r, size10f), r(asl[0], cs0), ∀ as. as ∈ asl → r(as, cs0), ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)), ∀ cs2, a0, cs', as1. r(as1, cs2) ∧ cstepf(cs2, a0, cs') → r(as1, cs') ∧ a0 = τ ∨ (∃ as'. astepf(as1, a0, as') ∧ r(as', cs')) ∨ (∃ as'. astepf(as1, τ, as') ∧ r(as', cs2) ∧ size10f(cs2, a0, cs', as') < size10f(cs2, a0, cs', as1)), ∀ α, sl. ¬(afrag*(AIOAut(astartf, astepf))(⌜sl⌝ , α) ∧ asl[0] = sl[0] ∧ asl.last = sl.last ∧ α ^ = []), astepf(asl.last, τ, as') ∧ r(as', cs1) ∨ r(asl.last, cs1) ⊦ ∃ as0. amove(AIOAut(astartf, astepf))(as, [], as0) ∧ r(as0, cs1)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ afrag*(AIOAut(startf, stepf))(σ, β) ↔ afrag(AIOAut(startf, stepf))(σ, β) ∧ finp(β); (s)

Proof step 27 from proof normedfw-branchingfw-aux (previous step) (back to tree)

⌜al⌝ ^ = [], afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ), amove(AIOAut(astartf, astepf))(as, [], asl[0]), cstepf(cs0, τ, cs1), nfwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), r, size10f), r(asl[0], cs0), ∀ cs2, a0, cs', as1. r(as1, cs2) ∧ cstepf(cs2, a0, cs') → r(as1, cs') ∧ a0 = τ ∨ (∃ as'. astepf(as1, a0, as') ∧ r(as', cs')) ∨ (∃ as'. astepf(as1, τ, as') ∧ r(as', cs2) ∧ size10f(cs2, a0, cs', as') < size10f(cs2, a0, cs', as1)), ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)), ∀ as. as ∈ asl → r(as, cs0), ∀ α, sl. ¬ afrag(AIOAut(astartf, astepf))(⌜sl⌝ , α) ∨ ¬ finp(α) ∨ asl[0] ≠ sl[0] ∨ asl.last ≠ sl.last ∨ α ^ ≠ [], astepf(asl.last, τ, as') ∧ r(as', cs1) ∨ r(asl.last, cs1) ⊦ ∃ as0. amove(AIOAut(astartf, astepf))(as, [], as0) ∧ r(as0, cs1)

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 10 terms: ⌜al⌝ , asl

Additional information

Used simplifier rules: ⊦ finp(⌜x⌝ ); (s) Used terms: ⌜al⌝ , asl

Proof step 28 from proof normedfw-branchingfw-aux (previous step) (back to tree)

⌜al⌝ ^ = [], afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ), amove(AIOAut(astartf, astepf))(as, [], asl[0]), amove(AIOAut(astartf, astepf))(as, [], asl.last), cstepf(cs0, τ, cs1), nfwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), r, size10f), r(asl[0], cs0), ∀ cs2, a0, cs', as1. r(as1, cs2) ∧ cstepf(cs2, a0, cs') → r(as1, cs') ∧ a0 = τ ∨ (∃ as'. astepf(as1, a0, as') ∧ r(as', cs')) ∨ (∃ as'. astepf(as1, τ, as') ∧ r(as', cs2) ∧ size10f(cs2, a0, cs', as') < size10f(cs2, a0, cs', as1)), ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)), ∀ as. as ∈ asl → r(as, cs0), astepf(asl.last, τ, as') ∧ r(as', cs1) ∨ r(asl.last, cs1) ⊦ ∃ as0. amove(AIOAut(astartf, astepf))(as, [], as0) ∧ r(as0, cs1)

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 11

Additional information

Proof step 29 from proof normedfw-branchingfw-aux (previous step) (back to tree)

⌜al⌝ ^ = [], afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ), amove(AIOAut(astartf, astepf))(as, [], asl.last), amove(AIOAut(astartf, astepf))(as, [], asl[0]), astepf(asl.last, τ, as'), cstepf(cs0, τ, cs1), nfwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), r, size10f), r(asl[0], cs0), r(as', cs1), ∀ as. as ∈ asl → r(as, cs0), ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)), ∀ cs2, a0, cs', as1. r(as1, cs2) ∧ cstepf(cs2, a0, cs') → r(as1, cs') ∧ a0 = τ ∨ (∃ as'. astepf(as1, a0, as') ∧ r(as', cs')) ∨ (∃ as'. astepf(as1, τ, as') ∧ r(as', cs2) ∧ size10f(cs2, a0, cs', as') < size10f(cs2, a0, cs', as1)) ⊦ ∃ as0. amove(AIOAut(astartf, astepf))(as, [], as0) ∧ r(as0, cs1)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 30 from proof normedfw-branchingfw-aux (previous step) (back to tree)

⌜al⌝ ^ = [], afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ), amove(AIOAut(astartf, astepf))(as, [], asl[0]), amove(AIOAut(astartf, astepf))(as, [], asl.last), astepf(asl.last, τ, as'), cstepf(cs0, τ, cs1), nfwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), r, size10f), r(as', cs1), r(asl[0], cs0), ∀ cs2, a0, cs', as1. r(as1, cs2) ∧ cstepf(cs2, a0, cs') → r(as1, cs') ∧ a0 = τ ∨ (∃ as'. astepf(as1, a0, as') ∧ r(as', cs')) ∨ (∃ as'. astepf(as1, τ, as') ∧ r(as', cs2) ∧ size10f(cs2, a0, cs', as') < size10f(cs2, a0, cs', as1)), ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)), ∀ as. as ∈ asl → r(as, cs0) ⊦ ∃ as0. amove(AIOAut(astartf, astepf))(as, [], as0) ∧ r(as0, cs1)

User applied rule exists right

And obtained the following new goals

Rule argument

pos: right 1 terms: as' abort: F discard: T computed: T

Additional information

Used terms: as'

Proof step 31 from proof normedfw-branchingfw-aux (previous step) (back to tree)

⌜al⌝ ^ = [], afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ), amove(AIOAut(astartf, astepf))(as, [], asl.last), amove(AIOAut(astartf, astepf))(as, [], asl[0]), astepf(asl.last, τ, as'), cstepf(cs0, τ, cs1), nfwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), r, size10f), r(asl[0], cs0), r(as', cs1), ∀ as. as ∈ asl → r(as, cs0), ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)), ∀ cs2, a0, cs', as1. r(as1, cs2) ∧ cstepf(cs2, a0, cs') → r(as1, cs') ∧ a0 = τ ∨ (∃ as'. astepf(as1, a0, as') ∧ r(as', cs')) ∨ (∃ as'. astepf(as1, τ, as') ∧ r(as', cs2) ∧ size10f(cs2, a0, cs', as') < size10f(cs2, a0, cs', as1)) ⊦ amove(AIOAut(astartf, astepf))(as, [], as') ∧ r(as', cs1)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 32 from proof normedfw-branchingfw-aux (previous step) (back to tree)

⌜al⌝ ^ = [], afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ), amove(AIOAut(astartf, astepf))(as, [], asl[0]), amove(AIOAut(astartf, astepf))(as, [], asl.last), astepf(asl.last, τ, as'), cstepf(cs0, τ, cs1), nfwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), r, size10f), r(as', cs1), r(asl[0], cs0), ¬ amove(AIOAut(astartf, astepf))(as, [], as'), ∀ cs2, a0, cs', as1. r(as1, cs2) ∧ cstepf(cs2, a0, cs') → r(as1, cs') ∧ a0 = τ ∨ (∃ as'. astepf(as1, a0, as') ∧ r(as', cs')) ∨ (∃ as'. astepf(as1, τ, as') ∧ r(as', cs2) ∧ size10f(cs2, a0, cs', as') < size10f(cs2, a0, cs', as1)), ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)), ∀ as. as ∈ asl → r(as, cs0) ⊦

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: IOtrace[traceA], name:move-trans, seq:⊦ amove(AIOAut(startf, stepf))(s, α1, s1) ∧ amove(AIOAut(startf, stepf))(s1, α2, s2) → amove(AIOAut(startf, stepf))(s, α1 + α2, s2), subst:[s, s1, α2, stepf, s2, startf, α1] → [as, asl.last, [], astepf, as', astartf, []]

Additional information

Used terms: astartf, astepf, as, [], asl.last, [], as'

Proof step 33 from proof normedfw-branchingfw-aux (previous step) (back to tree)

⊦ amove(AIOAut(startf, stepf))(s, α1, s1) ∧ amove(AIOAut(startf, stepf))(s1, α2, s2) → amove(AIOAut(startf, stepf))(s, α1 + α2, s2)

A spec-lemma

Proof step 34 from proof normedfw-branchingfw-aux (previous step) (back to tree)

⌜al⌝ ^ = [], afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ), amove(AIOAut(astartf, astepf))(as, [], asl.last), amove(AIOAut(astartf, astepf))(as, [], asl[0]), astepf(asl.last, τ, as'), cstepf(cs0, τ, cs1), nfwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), r, size10f), r(asl[0], cs0), r(as', cs1), ¬ amove(AIOAut(astartf, astepf))(as, [], as'), amove(AIOAut(astartf, astepf))(as, [], asl.last) ∧ amove(AIOAut(astartf, astepf))(asl.last, [], as') → amove(AIOAut(astartf, astepf))(as, [] + [], as'), ∀ as. as ∈ asl → r(as, cs0), ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)), ∀ cs2, a0, cs', as1. r(as1, cs2) ∧ cstepf(cs2, a0, cs') → r(as1, cs') ∧ a0 = τ ∨ (∃ as'. astepf(as1, a0, as') ∧ r(as', cs')) ∨ (∃ as'. astepf(as1, τ, as') ∧ r(as', cs2) ∧ size10f(cs2, a0, cs', as') < size10f(cs2, a0, cs', as1)) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ [] + σ = σ; (s)

Proof step 35 from proof normedfw-branchingfw-aux (previous step) (back to tree)

⌜al⌝ ^ = [], afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ), amove(AIOAut(astartf, astepf))(as, [], asl[0]), amove(AIOAut(astartf, astepf))(as, [], asl.last), astepf(asl.last, τ, as'), cstepf(cs0, τ, cs1), nfwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), r, size10f), r(as', cs1), r(asl[0], cs0), ¬ amove(AIOAut(astartf, astepf))(as, [], as'), ¬ amove(AIOAut(astartf, astepf))(asl.last, [], as'), ∀ cs2, a0, cs', as1. r(as1, cs2) ∧ cstepf(cs2, a0, cs') → r(as1, cs') ∧ a0 = τ ∨ (∃ as'. astepf(as1, a0, as') ∧ r(as', cs')) ∨ (∃ as'. astepf(as1, τ, as') ∧ r(as', cs2) ∧ size10f(cs2, a0, cs', as') < size10f(cs2, a0, cs', as1)), ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)), ∀ as. as ∈ asl → r(as, cs0) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: IOtrace[traceA], name:move, seq:⊦ amove(AIOAut(startf, stepf))(s1, β, s2) ↔ (∃ α, sl. afrag*(AIOAut(startf, stepf))(⌜sl⌝ , α) ∧ s1 = sl[0] ∧ s2 = sl.last ∧ α ^ = β), subst:[s1, stepf, β, s2, startf] → [asl.last, astepf, [], as', astartf], <all paths>

Additional information

Used terms: as', [], asl.last, astepf, astartf

Proof step 36 from proof normedfw-branchingfw-aux (previous step) (back to tree)

⊦ amove(AIOAut(startf, stepf))(s1, β, s2) ↔ (∃ α, sl. afrag*(AIOAut(startf, stepf))(⌜sl⌝ , α) ∧ s1 = sl[0] ∧ s2 = sl.last ∧ α ^ = β)

A spec-lemma

Proof step 37 from proof normedfw-branchingfw-aux (previous step) (back to tree)

⌜al⌝ ^ = [], afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ), amove(AIOAut(astartf, astepf))(as, [], asl.last), amove(AIOAut(astartf, astepf))(as, [], asl[0]), astepf(asl.last, τ, as'), cstepf(cs0, τ, cs1), nfwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), r, size10f), r(asl[0], cs0), r(as', cs1), ¬ amove(AIOAut(astartf, astepf))(as, [], as'), ∀ as. as ∈ asl → r(as, cs0), ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)), ∀ cs2, a0, cs', as1. r(as1, cs2) ∧ cstepf(cs2, a0, cs') → r(as1, cs') ∧ a0 = τ ∨ (∃ as'. astepf(as1, a0, as') ∧ r(as', cs')) ∨ (∃ as'. astepf(as1, τ, as') ∧ r(as', cs2) ∧ size10f(cs2, a0, cs', as') < size10f(cs2, a0, cs', as1)), ∀ α, sl. ¬(afrag*(AIOAut(astartf, astepf))(⌜sl⌝ , α) ∧ asl.last = sl[0] ∧ as' = sl.last ∧ α ^ = []) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ afrag*(AIOAut(startf, stepf))(σ, β) ↔ afrag(AIOAut(startf, stepf))(σ, β) ∧ finp(β); (s)

Proof step 38 from proof normedfw-branchingfw-aux (previous step) (back to tree)

⌜al⌝ ^ = [], afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ), amove(AIOAut(astartf, astepf))(as, [], asl[0]), amove(AIOAut(astartf, astepf))(as, [], asl.last), astepf(asl.last, τ, as'), cstepf(cs0, τ, cs1), nfwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), r, size10f), r(as', cs1), r(asl[0], cs0), ¬ amove(AIOAut(astartf, astepf))(as, [], as'), ∀ cs2, a0, cs', as1. r(as1, cs2) ∧ cstepf(cs2, a0, cs') → r(as1, cs') ∧ a0 = τ ∨ (∃ as'. astepf(as1, a0, as') ∧ r(as', cs')) ∨ (∃ as'. astepf(as1, τ, as') ∧ r(as', cs2) ∧ size10f(cs2, a0, cs', as') < size10f(cs2, a0, cs', as1)), ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)), ∀ as. as ∈ asl → r(as, cs0), ∀ α, sl. ¬ afrag(AIOAut(astartf, astepf))(⌜sl⌝ , α) ∨ ¬ finp(α) ∨ asl.last ≠ sl[0] ∨ as' ≠ sl.last ∨ α ^ ≠ [] ⊦

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 14 terms: ⌜τ '⌝ , asl.last + as' ' abort: F discard: T computed: F

Additional information

Used terms: ⌜τ '⌝ , asl.last + as' '

Proof step 39 from proof normedfw-branchingfw-aux (previous step) (back to tree)

⌜al⌝ ^ = [], afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ), amove(AIOAut(astartf, astepf))(as, [], asl.last), amove(AIOAut(astartf, astepf))(as, [], asl[0]), astepf(asl.last, τ, as'), cstepf(cs0, τ, cs1), nfwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), r, size10f), r(asl[0], cs0), r(as', cs1), ¬ amove(AIOAut(astartf, astepf))(as, [], as'), ∀ as. as ∈ asl → r(as, cs0), ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)), ∀ cs2, a0, cs', as1. r(as1, cs2) ∧ cstepf(cs2, a0, cs') → r(as1, cs') ∧ a0 = τ ∨ (∃ as'. astepf(as1, a0, as') ∧ r(as', cs')) ∨ (∃ as'. astepf(as1, τ, as') ∧ r(as', cs2) ∧ size10f(cs2, a0, cs', as') < size10f(cs2, a0, cs', as1)), ¬ afrag(AIOAut(astartf, astepf))(⌜asl.last + as' '⌝ , ⌜τ '⌝ ) ∨ ¬ finp(⌜τ '⌝ ) ∨ asl.last ≠ (asl.last + as' ')[0] ∨ as' ≠ (asl.last + as' ').last ∨ ⌜τ '⌝ ^ ≠ [] ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 40 from proof normedfw-branchingfw-aux (previous step) (back to tree)

⌜al⌝ ^ = [], afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ), amove(AIOAut(astartf, astepf))(as, [], asl[0]), amove(AIOAut(astartf, astepf))(as, [], asl.last), astepf(asl.last, τ, as'), cstepf(cs0, τ, cs1), nfwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), r, size10f), r(as', cs1), r(asl[0], cs0), ¬ afrag(AIOAut(astartf, astepf))(⌜asl.last '⌝ + ⌜as' '⌝ , ⌜τ '⌝ ), ¬ amove(AIOAut(astartf, astepf))(as, [], as'), ∀ cs2, a0, cs', as1. r(as1, cs2) ∧ cstepf(cs2, a0, cs') → r(as1, cs') ∧ a0 = τ ∨ (∃ as'. astepf(as1, a0, as') ∧ r(as', cs')) ∨ (∃ as'. astepf(as1, τ, as') ∧ r(as', cs2) ∧ size10f(cs2, a0, cs', as') < size10f(cs2, a0, cs', as1)), ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)), ∀ as. as ∈ asl → r(as, cs0) ⊦

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] → [⌜τ '⌝ , ⌜asl.last '⌝ + ⌜as' '⌝ , astepf, astartf], <all paths>

Additional information

Used simplifier rules: ⊦ #(σ + σ1) = # σ + # σ1; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ # a ' = 0 +1; (s) ⊦ ⌜(* 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 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 ⊦ ⌜n⌝ = ⌜n0⌝ ↔ n = n0; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ # a ' = 0 +1; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ m < 1 ↔ m = 0; (s) ⊦ (⌜a '⌝ + σ)[0] = a; (s) ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ a '[0] = a; (s) n ≠ 0 ⊦ (⌜a '⌝ + σ)[(* n)] = σ[n - 1]; (s) ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ a '[0] = a; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[traceA-IOstatestream] Used terms: ⌜τ '⌝ , ⌜asl.last '⌝ + ⌜as' '⌝ , astepf, astartf

Proof step 41 from proof normedfw-branchingfw-aux (previous step) (back to tree)

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

A spec-lemma

Proof step 42 from proof normedfw-branchingfw-aux (previous step) (back to tree)

⌜al⌝ ^ = [], afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ), amove(AIOAut(astartf, astepf))(as, [], asl.last), amove(AIOAut(astartf, astepf))(as, [], asl[0]), cstepf(cs0, τ, cs1), nfwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), r, size10f), r(asl[0], cs0), r(asl.last, cs1), ∀ as. as ∈ asl → r(as, cs0), ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)), ∀ cs2, a0, cs', as1. r(as1, cs2) ∧ cstepf(cs2, a0, cs') → r(as1, cs') ∧ a0 = τ ∨ (∃ as'. astepf(as1, a0, as') ∧ r(as', cs')) ∨ (∃ as'. astepf(as1, τ, as') ∧ r(as', cs2) ∧ size10f(cs2, a0, cs', as') < size10f(cs2, a0, cs', as1)) ⊦ ∃ as0. amove(AIOAut(astartf, astepf))(as, [], as0) ∧ r(as0, cs1)

Heuristic quantifier closing applied rule exists right

And closed the goal!

Rule argument

pos: right 1 terms: asl.last

Additional information

Used terms: asl.last

Proof step 43 from proof normedfw-branchingfw-aux (previous step) (back to tree)

a ≠ τ, amove(AIOAut(astartf, astepf))(as, [], as0), cstepf(cs0, a, cs1), nfwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), r, size10f), r(as0, cs0), ∀ cs2, a0, cs', as1. r(as1, cs2) ∧ cstepf(cs2, a0, cs') → r(as1, cs') ∧ a0 = τ ∨ (∃ as'. astepf(as1, a0, as') ∧ r(as', cs')) ∨ (∃ as'. astepf(as1, τ, as') ∧ r(as', cs2) ∧ size10f(cs2, a0, cs', as') < size10f(cs2, a0, cs', as1)), ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)) ⊦ ∃ asl, al, as1. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ ⌜al⌝ ^ = [] ∧ hd(asl) = as ∧ (∀ as. as ∈ asl → (∃ as0. amove(AIOAut(astartf, astepf))(as, [], as0) ∧ r(as0, cs0))) ∧ astepf(asl.last, a, as1) ∧ (∃ as0. amove(AIOAut(astartf, astepf))(as1, [], as0) ∧ r(as0, cs1))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 44 from proof normedfw-branchingfw-aux (previous step) (back to tree)

a ≠ τ, amove(AIOAut(astartf, astepf))(as, [], as0), cstepf(cs0, a, cs1), nfwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), r, size10f), r(as0, cs0), ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)), ∀ cs2, a0, cs', as1. r(as1, cs2) ∧ cstepf(cs2, a0, cs') → r(as1, cs') ∧ a0 = τ ∨ (∃ as'. astepf(as1, a0, as') ∧ r(as', cs')) ∨ (∃ as'. astepf(as1, τ, as') ∧ r(as', cs2) ∧ size10f(cs2, a0, cs', as') < size10f(cs2, a0, cs', as1)) ⊦ ∃ asl, al, as1. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ ⌜al⌝ ^ = [] ∧ hd(asl) = as ∧ (∀ as. as ∈ asl → (∃ as0. amove(AIOAut(astartf, astepf))(as, [], as0) ∧ r(as0, cs0))) ∧ astepf(asl.last, a, as1) ∧ (∃ as0. amove(AIOAut(astartf, astepf))(as1, [], as0) ∧ r(as0, cs1))

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:triang-fin, seq:nfwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), r, size10f), cstepf(cs, a, cs'), r(as, cs) ⊦ ∃ asl, al. asl[0] = as ∧ ⌜al⌝ ^ = [] ∧ afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ (∀ as. as ∈ asl → r(as, cs)) ∧ ((∃ as'. astepf(asl.last, a, as') ∧ r(as', cs')) ∨ a = τ ∧ r(asl.last, cs')), subst:[cstartf, cs, cstepf, astartf, size10f, a, as, r, cs', astepf] → [cstartf, cs0, cstepf, astartf, size10f, a, as0, r, cs1, astepf]

Additional information

Used terms: cstartf, cstepf, astartf, astepf, r, size10f, cs0, a, cs1, as0

Proof step 45 from proof normedfw-branchingfw-aux (previous step) (back to tree)

nfwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), r, size10f), cstepf(cs, a, cs'), r(as, cs) ⊦ ∃ asl, al. asl[0] = as ∧ ⌜al⌝ ^ = [] ∧ afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ (∀ as. as ∈ asl → r(as, cs)) ∧ ((∃ as'. astepf(asl.last, a, as') ∧ r(as', cs')) ∨ a = τ ∧ r(asl.last, cs'))

Lemma triang-fin

Proof step 46 from proof normedfw-branchingfw-aux (previous step) (back to tree)

a ≠ τ, amove(AIOAut(astartf, astepf))(as, [], as0), cstepf(cs0, a, cs1), nfwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), r, size10f), r(as0, cs0), ∀ cs2, a0, cs', as1. r(as1, cs2) ∧ cstepf(cs2, a0, cs') → r(as1, cs') ∧ a0 = τ ∨ (∃ as'. astepf(as1, a0, as') ∧ r(as', cs')) ∨ (∃ as'. astepf(as1, τ, as') ∧ r(as', cs2) ∧ size10f(cs2, a0, cs', as') < size10f(cs2, a0, cs', as1)), ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)), ∃ asl, al. asl[0] = as0 ∧ ⌜al⌝ ^ = [] ∧ afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ (∀ as. as ∈ asl → r(as, cs0)) ∧ ((∃ as'. astepf(asl.last, a, as') ∧ r(as', cs1)) ∨ a = τ ∧ r(asl.last, cs1)) ⊦ ∃ asl, al, as1. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ ⌜al⌝ ^ = [] ∧ hd(asl) = as ∧ (∀ as. as ∈ asl → (∃ as0. amove(AIOAut(astartf, astepf))(as, [], as0) ∧ r(as0, cs0))) ∧ astepf(asl.last, a, as1) ∧ (∃ as0. amove(AIOAut(astartf, astepf))(as1, [], as0) ∧ r(as0, cs1))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 47 from proof normedfw-branchingfw-aux (previous step) (back to tree)

⌜al⌝ ^ = [], a ≠ τ, afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ), amove(AIOAut(astartf, astepf))(as, [], asl[0]), astepf(asl.last, a, as'), cstepf(cs0, a, cs1), nfwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), r, size10f), r(asl[0], cs0), r(as', cs1), ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)), ∀ cs2, a0, cs', as1. r(as1, cs2) ∧ cstepf(cs2, a0, cs') → r(as1, cs') ∧ a0 = τ ∨ (∃ as'. astepf(as1, a0, as') ∧ r(as', cs')) ∨ (∃ as'. astepf(as1, τ, as') ∧ r(as', cs2) ∧ size10f(cs2, a0, cs', as') < size10f(cs2, a0, cs', as1)), ∀ as. as ∈ asl → r(as, cs0) ⊦ ∃ asl, al, as1. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ ⌜al⌝ ^ = [] ∧ hd(asl) = as ∧ (∀ as. as ∈ asl → (∃ as0. amove(AIOAut(astartf, astepf))(as, [], as0) ∧ r(as0, cs0))) ∧ astepf(asl.last, a, as1) ∧ (∃ as0. amove(AIOAut(astartf, astepf))(as1, [], as0) ∧ r(as0, cs1))

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: IOtrace[traceA], name:move, seq:⊦ amove(AIOAut(startf, stepf))(s1, β, s2) ↔ (∃ α, sl. afrag*(AIOAut(startf, stepf))(⌜sl⌝ , α) ∧ s1 = sl[0] ∧ s2 = sl.last ∧ α ^ = β), subst:[s1, stepf, β, s2, startf] → [as, astepf, [], asl[0], astartf], <all paths>

Additional information

Used terms: asl[0], [], as, astepf, astartf

Proof step 48 from proof normedfw-branchingfw-aux (previous step) (back to tree)

⊦ amove(AIOAut(startf, stepf))(s1, β, s2) ↔ (∃ α, sl. afrag*(AIOAut(startf, stepf))(⌜sl⌝ , α) ∧ s1 = sl[0] ∧ s2 = sl.last ∧ α ^ = β)

A spec-lemma

Proof step 49 from proof normedfw-branchingfw-aux (previous step) (back to tree)

⌜al⌝ ^ = [], a ≠ τ, afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ), astepf(asl.last, a, as'), cstepf(cs0, a, cs1), nfwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), r, size10f), r(as', cs1), r(asl[0], cs0), ∀ as. as ∈ asl → r(as, cs0), ∀ cs2, a0, cs', as1. r(as1, cs2) ∧ cstepf(cs2, a0, cs') → r(as1, cs') ∧ a0 = τ ∨ (∃ as'. astepf(as1, a0, as') ∧ r(as', cs')) ∨ (∃ as'. astepf(as1, τ, as') ∧ r(as', cs2) ∧ size10f(cs2, a0, cs', as') < size10f(cs2, a0, cs', as1)), ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)), ∃ α, sl. afrag*(AIOAut(astartf, astepf))(⌜sl⌝ , α) ∧ as = sl[0] ∧ asl[0] = sl.last ∧ α ^ = [] ⊦ ∃ asl, al, as1. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ ⌜al⌝ ^ = [] ∧ hd(asl) = as ∧ (∀ as. as ∈ asl → (∃ as0. amove(AIOAut(astartf, astepf))(as, [], as0) ∧ r(as0, cs0))) ∧ astepf(asl.last, a, as1) ∧ (∃ as0. amove(AIOAut(astartf, astepf))(as1, [], as0) ∧ r(as0, cs1))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ finp(⌜x⌝ ); (s) stream-fin-forward: ⊦ finp(σ) → (∃ x. ⌜x⌝ = σ); (forward) from specification stream-basic[actionstream] ⊦ afrag*(AIOAut(startf, stepf))(σ, β) ↔ afrag(AIOAut(startf, stepf))(σ, β) ∧ finp(β); (s)

Proof step 50 from proof normedfw-branchingfw-aux (previous step) (back to tree)

asl[0] = asl0.last, ⌜al0⌝ ^ = [], ⌜al⌝ ^ = [], a ≠ τ, afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ , ⌜al0⌝ ), astepf(asl.last, a, as'), cstepf(cs0, a, cs1), nfwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), r, size10f), r(asl[0], cs0), r(as', cs1), ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)), ∀ cs2, a0, cs', as1. r(as1, cs2) ∧ cstepf(cs2, a0, cs') → r(as1, cs') ∧ a0 = τ ∨ (∃ as'. astepf(as1, a0, as') ∧ r(as', cs')) ∨ (∃ as'. astepf(as1, τ, as') ∧ r(as', cs2) ∧ size10f(cs2, a0, cs', as') < size10f(cs2, a0, cs', as1)), ∀ as. as ∈ asl → r(as, cs0) ⊦ ∃ asl, al, as1. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ ⌜al⌝ ^ = [] ∧ hd(asl) = asl0[0] ∧ (∀ as. as ∈ asl → (∃ as0. amove(AIOAut(astartf, astepf))(as, [], as0) ∧ r(as0, cs0))) ∧ astepf(asl.last, a, as1) ∧ (∃ as0. amove(AIOAut(astartf, astepf))(as1, [], as0) ∧ r(as0, cs1))

User applied rule exists right

And obtained the following new goals

Rule argument

pos: right 1 terms: asl0.butlast + asl, al0 + al, as' abort: F discard: T computed: F

Additional information

Used terms: asl0.butlast + asl, al0 + al, as'

Proof step 51 from proof normedfw-branchingfw-aux (previous step) (back to tree)

asl[0] = asl0.last, ⌜al⌝ ^ = [], ⌜al0⌝ ^ = [], a ≠ τ, afrag(AIOAut(astartf, astepf))(⌜asl0⌝ , ⌜al0⌝ ), afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ), astepf(asl.last, a, as'), cstepf(cs0, a, cs1), nfwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), r, size10f), r(as', cs1), r(asl[0], cs0), ∀ as. as ∈ asl → r(as, cs0), ∀ cs2, a0, cs', as1. r(as1, cs2) ∧ cstepf(cs2, a0, cs') → r(as1, cs') ∧ a0 = τ ∨ (∃ as'. astepf(as1, a0, as') ∧ r(as', cs')) ∨ (∃ as'. astepf(as1, τ, as') ∧ r(as', cs2) ∧ size10f(cs2, a0, cs', as') < size10f(cs2, a0, cs', as1)), ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)) ⊦ afrag(AIOAut(astartf, astepf))(⌜asl0.butlast + asl⌝ , ⌜al0 + al⌝ ) ∧ ⌜al0 + al⌝ ^ = [] ∧ hd(asl0.butlast + asl) = asl0[0] ∧ (∀ as. as ∈ asl0.butlast + asl → (∃ as0. amove(AIOAut(astartf, astepf))(as, [], as0) ∧ r(as0, cs0))) ∧ astepf((asl0.butlast + asl).last, a, as') ∧ (∃ as0. amove(AIOAut(astartf, astepf))(as', [], as0) ∧ r(as0, cs1))

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] ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ σ0 + σ1 = [] ↔ σ0 = [] ∧ σ1 = []; (ws) ⊦ (⌜al⌝ + α2)^ = ⌜al⌝ ^ + α2 ^; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[actionstream] ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s) ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s)

Proof step 52 from proof normedfw-branchingfw-aux (previous step) (back to tree)

asl[0] = asl0.last, ⌜al0⌝ ^ = [], ⌜al⌝ ^ = [], a ≠ τ, afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ , ⌜al0⌝ ), astepf(asl.last, a, as'), cstepf(cs0, a, cs1), nfwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), r, size10f), r(asl[0], cs0), r(as', cs1), ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)), ∀ cs2, a0, cs', as1. r(as1, cs2) ∧ cstepf(cs2, a0, cs') → r(as1, cs') ∧ a0 = τ ∨ (∃ as'. astepf(as1, a0, as') ∧ r(as', cs')) ∨ (∃ as'. astepf(as1, τ, as') ∧ r(as', cs2) ∧ size10f(cs2, a0, cs', as') < size10f(cs2, a0, cs', as1)), ∀ as. as ∈ asl → r(as, cs0) ⊦ afrag(AIOAut(astartf, astepf))(⌜asl0.butlast⌝ + ⌜asl⌝ , ⌜al0⌝ + ⌜al⌝ ) ∧ hd(asl0.butlast + asl) = asl0[0] ∧ (as ∈ asl0.butlast ∨ as ∈ asl → (∃ as0. amove(AIOAut(astartf, astepf))(as, [], as0) ∧ r(as0, cs0))) ∧ astepf((asl0.butlast + asl).last, a, as') ∧ (∃ as0. amove(AIOAut(astartf, astepf))(as', [], as0) ∧ r(as0, cs1))

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: IOtrace[traceA], name:frag-trans, seq:afrag(AIOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), afrag(AIOAut(startf, stepf))(⌜sl0⌝ , ⌜al0⌝ ), sl0[0] = sl.last ⊦ afrag(AIOAut(startf, stepf))(⌜sl.butlast⌝ + ⌜sl0⌝ , ⌜al⌝ + ⌜al0⌝ ), subst:[al, sl, al0, stepf, sl0, startf] → [al0, asl0, al, astepf, asl, astartf]

Additional information

Used terms: astartf, astepf, asl0, al0, asl, al

Proof step 53 from proof normedfw-branchingfw-aux (previous step) (back to tree)

afrag(AIOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), afrag(AIOAut(startf, stepf))(⌜sl0⌝ , ⌜al0⌝ ), sl0[0] = sl.last ⊦ afrag(AIOAut(startf, stepf))(⌜sl.butlast⌝ + ⌜sl0⌝ , ⌜al⌝ + ⌜al0⌝ )

A spec-lemma

Proof step 54 from proof normedfw-branchingfw-aux (previous step) (back to tree)

asl[0] = asl0.last, ⌜al⌝ ^ = [], ⌜al0⌝ ^ = [], a ≠ τ, afrag(AIOAut(astartf, astepf))(⌜asl0⌝ , ⌜al0⌝ ), afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ), afrag(AIOAut(astartf, astepf))(⌜asl0.butlast⌝ + ⌜asl⌝ , ⌜al0⌝ + ⌜al⌝ ), astepf(asl.last, a, as'), cstepf(cs0, a, cs1), nfwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), r, size10f), r(as', cs1), r(asl[0], cs0), ∀ as. as ∈ asl → r(as, cs0), ∀ cs2, a0, cs', as1. r(as1, cs2) ∧ cstepf(cs2, a0, cs') → r(as1, cs') ∧ a0 = τ ∨ (∃ as'. astepf(as1, a0, as') ∧ r(as', cs')) ∨ (∃ as'. astepf(as1, τ, as') ∧ r(as', cs2) ∧ size10f(cs2, a0, cs', as') < size10f(cs2, a0, cs', as1)), ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)) ⊦ afrag(AIOAut(astartf, astepf))(⌜asl0.butlast⌝ + ⌜asl⌝ , ⌜al0⌝ + ⌜al⌝ ) ∧ hd(asl0.butlast + asl) = asl0[0] ∧ (as ∈ asl0.butlast ∨ as ∈ asl → (∃ as0. amove(AIOAut(astartf, astepf))(as, [], as0) ∧ r(as0, cs0))) ∧ astepf((asl0.butlast + asl).last, a, as') ∧ (∃ as0. amove(AIOAut(astartf, astepf))(as', [], as0) ∧ r(as0, cs1))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 55 from proof normedfw-branchingfw-aux (previous step) (back to tree)

asl[0] = asl0.last, ⌜al0⌝ ^ = [], ⌜al⌝ ^ = [], a ≠ τ, afrag(AIOAut(astartf, astepf))(⌜asl0.butlast⌝ + ⌜asl⌝ , ⌜al0⌝ + ⌜al⌝ ), afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ , ⌜al0⌝ ), astepf(asl.last, a, as'), cstepf(cs0, a, cs1), nfwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), r, size10f), r(asl[0], cs0), r(as', cs1), ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)), ∀ cs2, a0, cs', as1. r(as1, cs2) ∧ cstepf(cs2, a0, cs') → r(as1, cs') ∧ a0 = τ ∨ (∃ as'. astepf(as1, a0, as') ∧ r(as', cs')) ∨ (∃ as'. astepf(as1, τ, as') ∧ r(as', cs2) ∧ size10f(cs2, a0, cs', as') < size10f(cs2, a0, cs', as1)), ∀ as. as ∈ asl → r(as, cs0) ⊦ hd(asl0.butlast + asl) = asl0[0] ∧ (as ∈ asl0.butlast ∨ as ∈ asl → (∃ as0. amove(AIOAut(astartf, astepf))(as, [], as0) ∧ r(as0, cs0))) ∧ astepf((asl0.butlast + asl).last, a, as') ∧ (∃ as0. amove(AIOAut(astartf, astepf))(as', [], as0) ∧ r(as0, cs1))

User applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: list-last[traceA-IOstatestream], name:last-elim, seq:x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a ', subst:[x, a, y] → [asl0, as2, asl1]

Additional information

Used simplifier rules: ⊦ ⌜[]⌝ = []; (s) ⊦ ¬ afrag(AIOAut(startf, stepf))([], α); (s) x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: asl0, as2, y

Proof step 56 from proof normedfw-branchingfw-aux (previous step) (back to tree)

asl[0] = as2, ⌜al⌝ ^ = [], ⌜al0⌝ ^ = [], asl0 = asl1 + as2 ', a ≠ τ, asl0 ≠ [], afrag(AIOAut(astartf, astepf))(⌜asl0⌝ , ⌜al0⌝ ), afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ), afrag(AIOAut(astartf, astepf))(⌜asl1⌝ + ⌜asl⌝ , ⌜al0⌝ + ⌜al⌝ ), astepf(asl.last, a, as'), cstepf(cs0, a, cs1), nfwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), r, size10f), r(as', cs1), r(asl[0], cs0), ∀ as. as ∈ asl → r(as, cs0), ∀ cs2, a0, cs', as1. r(as1, cs2) ∧ cstepf(cs2, a0, cs') → r(as1, cs') ∧ a0 = τ ∨ (∃ as'. astepf(as1, a0, as') ∧ r(as', cs')) ∨ (∃ as'. astepf(as1, τ, as') ∧ r(as', cs2) ∧ size10f(cs2, a0, cs', as') < size10f(cs2, a0, cs', as1)), ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)) ⊦ hd(asl1 + asl) = asl0[0] ∧ (as ∈ asl1 ∨ as ∈ asl → (∃ as0. amove(AIOAut(astartf, astepf))(as, [], as0) ∧ r(as0, cs0))) ∧ astepf((asl1 + asl).last, a, as') ∧ (∃ as0. amove(AIOAut(astartf, astepf))(as', [], as0) ∧ r(as0, cs1))

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] ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s) ⊦ x + a ' ≠ []; (s)

Proof step 57 from proof normedfw-branchingfw-aux (previous step) (back to tree)

⌜al0⌝ ^ = [], ⌜al⌝ ^ = [], a ≠ τ, afrag(AIOAut(astartf, astepf))(⌜asl1⌝ + ⌜asl⌝ , ⌜al0⌝ + ⌜al⌝ ), afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ), afrag(AIOAut(astartf, astepf))(⌜asl1⌝ + ⌜asl[0] '⌝ , ⌜al0⌝ ), astepf(asl.last, a, as'), cstepf(cs0, a, cs1), nfwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), r, size10f), r(asl[0], cs0), r(as', cs1), ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)), ∀ cs2, a0, cs', as1. r(as1, cs2) ∧ cstepf(cs2, a0, cs') → r(as1, cs') ∧ a0 = τ ∨ (∃ as'. astepf(as1, a0, as') ∧ r(as', cs')) ∨ (∃ as'. astepf(as1, τ, as') ∧ r(as', cs2) ∧ size10f(cs2, a0, cs', as') < size10f(cs2, a0, cs', as1)), ∀ as. as ∈ asl → r(as, cs0) ⊦ hd(asl1 + asl) = (asl1 + asl[0] ')[0] ∧ (as ∈ asl1 ∨ as ∈ asl → (∃ as0. amove(AIOAut(astartf, astepf))(as, [], as0) ∧ r(as0, cs0))) ∧ astepf((asl1 + asl).last, a, as') ∧ (∃ as0. amove(AIOAut(astartf, astepf))(as', [], as0) ∧ r(as0, cs1))

User applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: list-last[traceA-IOstatestream], name:last-elim, seq:x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a ', subst:[x, a, y] → [asl, as2, asl0]

Additional information

Used simplifier rules: ⊦ σ + [] = σ; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[traceA-IOstatestream] ⊦ ⌜[]⌝ = []; (s) ⊦ ¬ afrag(AIOAut(startf, stepf))([], α); (s) x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: asl, as2, y

Proof step 58 from proof normedfw-branchingfw-aux (previous step) (back to tree)

⌜al⌝ ^ = [], ⌜al0⌝ ^ = [], asl = asl0 + as2 ', a ≠ τ, asl ≠ [], afrag(AIOAut(astartf, astepf))(⌜asl1⌝ + ⌜asl[0] '⌝ , ⌜al0⌝ ), afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ), afrag(AIOAut(astartf, astepf))(⌜asl1⌝ + ⌜asl⌝ , ⌜al0⌝ + ⌜al⌝ ), astepf(as2, a, as'), cstepf(cs0, a, cs1), nfwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), r, size10f), r(as', cs1), r(asl[0], cs0), ∀ as. as ∈ asl → r(as, cs0), ∀ cs2, a0, cs', as1. r(as1, cs2) ∧ cstepf(cs2, a0, cs') → r(as1, cs') ∧ a0 = τ ∨ (∃ as'. astepf(as1, a0, as') ∧ r(as', cs')) ∨ (∃ as'. astepf(as1, τ, as') ∧ r(as', cs2) ∧ size10f(cs2, a0, cs', as') < size10f(cs2, a0, cs', as1)), ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)) ⊦ hd(asl1 + asl) = (asl1 + asl[0] ')[0] ∧ (as ∈ asl1 ∨ as ∈ asl → (∃ as0. amove(AIOAut(astartf, astepf))(as, [], as0) ∧ r(as0, cs0))) ∧ astepf((asl1 + asl).last, a, as') ∧ (∃ as0. amove(AIOAut(astartf, astepf))(as', [], as0) ∧ r(as0, cs1))

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] ⊦ (x + a ').last = a; (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[traceA-IOstatestream] ⊦ x + a ' ≠ []; (s)

Proof step 59 from proof normedfw-branchingfw-aux (previous step) (back to tree)

⌜al0⌝ ^ = [], ⌜al⌝ ^ = [], a ≠ τ, afrag(AIOAut(astartf, astepf))(⌜asl1⌝ + ⌜(asl0 + as2 ')[0] '⌝ , ⌜al0⌝ ), afrag(AIOAut(astartf, astepf))(⌜asl1⌝ + ⌜asl0⌝ + ⌜as2 '⌝ , ⌜al0⌝ + ⌜al⌝ ), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ + ⌜as2 '⌝ , ⌜al⌝ ), astepf(as2, a, as'), cstepf(cs0, a, cs1), nfwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), r, size10f), r((asl0 + as2 ')[0], cs0), r(as', cs1), ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)), ∀ cs2, a0, cs', as1. r(as1, cs2) ∧ cstepf(cs2, a0, cs') → r(as1, cs') ∧ a0 = τ ∨ (∃ as'. astepf(as1, a0, as') ∧ r(as', cs')) ∨ (∃ as'. astepf(as1, τ, as') ∧ r(as', cs2) ∧ size10f(cs2, a0, cs', as') < size10f(cs2, a0, cs', as1)), ∀ as0. as0 ∈ asl0 ∨ as0 = as2 → r(as0, cs0) ⊦ hd(asl1 + asl0 + as2 ') = (asl1 + (asl0 + as2 ')[0] ')[0] ∧ (as ∈ asl1 ∨ as ∈ asl0 ∨ as = as2 → (∃ as0. amove(AIOAut(astartf, astepf))(as, [], as0) ∧ r(as0, cs0))) ∧ (∃ as0. amove(AIOAut(astartf, astepf))(as', [], as0) ∧ r(as0, cs1))

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: list-data[traceA-IOstatestream], name:elim-list-c, seq:x ≠ [] ⊦ a = hd(x) ∧ y = tl(x) ↔ x = a + y, subst:[x, a, y] → [asl1 + asl0 + as2 ', as'0, asl]

Additional information

Used simplifier rules: ⊦ x + y = [] ↔ x = [] ∧ y = []; (as) ⊦ x + a ' ≠ []; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[traceA-IOstatestream] x ≠ [] ⊦ a = hd(x) ∧ y = tl(x) ↔ x = a + y; (elim) Used terms: asl1 + asl0 + as2 ', as'0, y

Proof step 60 from proof normedfw-branchingfw-aux (previous step) (back to tree)

asl1 + asl0 + as2 ' = as'0 + asl, ⌜al⌝ ^ = [], ⌜al0⌝ ^ = [], asl1 + asl0 + as2 ' ≠ [], a ≠ τ, afrag(AIOAut(astartf, astepf))(⌜asl0⌝ + ⌜as2 '⌝ , ⌜al⌝ ), afrag(AIOAut(astartf, astepf))(⌜asl1⌝ + ⌜asl0⌝ + ⌜as2 '⌝ , ⌜al0⌝ + ⌜al⌝ ), afrag(AIOAut(astartf, astepf))(⌜asl1⌝ + ⌜(asl0 + as2 ')[0] '⌝ , ⌜al0⌝ ), astepf(as2, a, as'), cstepf(cs0, a, cs1), nfwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), r, size10f), r(as', cs1), r((asl0 + as2 ')[0], cs0), ∀ as0. as0 ∈ asl0 ∨ as0 = as2 → r(as0, cs0), ∀ cs2, a0, cs', as1. r(as1, cs2) ∧ cstepf(cs2, a0, cs') → r(as1, cs') ∧ a0 = τ ∨ (∃ as'. astepf(as1, a0, as') ∧ r(as', cs')) ∨ (∃ as'. astepf(as1, τ, as') ∧ r(as', cs2) ∧ size10f(cs2, a0, cs', as') < size10f(cs2, a0, cs', as1)), ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)) ⊦ as'0 = (asl1 + (asl0 + as2 ')[0] ')[0] ∧ (as ∈ asl1 ∨ as ∈ asl0 ∨ as = as2 → (∃ as0. amove(AIOAut(astartf, astepf))(as, [], as0) ∧ r(as0, cs0))) ∧ (∃ as0. amove(AIOAut(astartf, astepf))(as', [], as0) ∧ r(as0, cs1))

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] ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[traceA-IOstatestream] in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[traceA-IOstatestream] ⊦ x + a ' ≠ []; (s) ⊦ a + x = a ' + x; (s)

Proof step 61 from proof normedfw-branchingfw-aux (previous step) (back to tree)

asl1 + asl0 + as2 ' = as'0 ' + asl, ⌜al⌝ ^ = [], ⌜al0⌝ ^ = [], a ≠ τ, afrag(AIOAut(astartf, astepf))(⌜asl0⌝ + ⌜as2 '⌝ , ⌜al⌝ ), afrag(AIOAut(astartf, astepf))(⌜asl1⌝ + ⌜asl0⌝ + ⌜as2 '⌝ , ⌜al0⌝ + ⌜al⌝ ), afrag(AIOAut(astartf, astepf))(⌜asl1⌝ + ⌜(asl0 + as2 ')[0] '⌝ , ⌜al0⌝ ), astepf(as2, a, as'), cstepf(cs0, a, cs1), nfwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), r, size10f), r(as', cs1), r((asl0 + as2 ')[0], cs0), ∀ as0. as0 ∈ asl0 ∨ as0 = as2 → r(as0, cs0), ∀ cs2, a0, cs', as1. r(as1, cs2) ∧ cstepf(cs2, a0, cs') → r(as1, cs') ∧ a0 = τ ∨ (∃ as'. astepf(as1, a0, as') ∧ r(as', cs')) ∨ (∃ as'. astepf(as1, τ, as') ∧ r(as', cs2) ∧ size10f(cs2, a0, cs', as') < size10f(cs2, a0, cs', as1)), ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)), as2 = as'0 ∨ as2 ∈ asl, as'0 ∈ asl1 ∨ as'0 ∈ asl0 ∨ as'0 = as2 ⊦ as'0 = (asl1 + (asl0 + as2 ')[0] ')[0] ∧ (as ∈ asl1 ∨ as ∈ asl0 ∨ as = as2 → (∃ as0. amove(AIOAut(astartf, astepf))(as, [], as0) ∧ r(as0, cs0))) ∧ (∃ as0. amove(AIOAut(astartf, astepf))(as', [], as0) ∧ r(as0, cs1))

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 62 from proof normedfw-branchingfw-aux (previous step) (back to tree)

asl1 + asl0 + as2 ' = as'0 ' + asl, ⌜al0⌝ ^ = [], ⌜al⌝ ^ = [], a ≠ τ, as'0 ≠ (asl1 + (asl0 + as2 ')[0] ')[0], afrag(AIOAut(astartf, astepf))(⌜asl1⌝ + ⌜(asl0 + as2 ')[0] '⌝ , ⌜al0⌝ ), afrag(AIOAut(astartf, astepf))(⌜asl1⌝ + ⌜asl0⌝ + ⌜as2 '⌝ , ⌜al0⌝ + ⌜al⌝ ), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ + ⌜as2 '⌝ , ⌜al⌝ ), astepf(as2, a, as'), cstepf(cs0, a, cs1), nfwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), r, size10f), r((asl0 + as2 ')[0], cs0), r(as', cs1), ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)), ∀ cs2, a0, cs', as1. r(as1, cs2) ∧ cstepf(cs2, a0, cs') → r(as1, cs') ∧ a0 = τ ∨ (∃ as'. astepf(as1, a0, as') ∧ r(as', cs')) ∨ (∃ as'. astepf(as1, τ, as') ∧ r(as', cs2) ∧ size10f(cs2, a0, cs', as') < size10f(cs2, a0, cs', as1)), ∀ as0. as0 ∈ asl0 ∨ as0 = as2 → r(as0, cs0), as'0 ∈ asl1 ∨ as'0 ∈ asl0 ∨ as'0 = as2, as2 = as'0 ∨ as2 ∈ asl ⊦

User applied rule constructor cut

And closed the goal!

Rule argument

var: asl1

Additional information

Used simplifier rules: astatelist freely generated by [], +;; ⊦ a ' + x = b ' + y ↔ a = b ∧ x = y; (ws) ⊦ a + x = a ' + x; (s) ⊦ (a ' + x)[0] = a; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[traceA-IOstatestream] ⊦ [] + x = x; (s) ⊦ a '[0] = a; (s) ⊦ ⌜[]⌝ = []; (s) ⊦ [] + σ = σ; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[traceA-IOstatestream] ⊦ ¬ a ∈ []; (s) in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[traceA-IOstatestream]

Proof step 63 from proof normedfw-branchingfw-aux (previous step) (back to tree)

asl1 + asl0 + as2 ' = as'0 ' + asl, ⌜al0⌝ ^ = [], ⌜al⌝ ^ = [], a ≠ τ, afrag(AIOAut(astartf, astepf))(⌜asl1⌝ + ⌜(asl0 + as2 ')[0] '⌝ , ⌜al0⌝ ), afrag(AIOAut(astartf, astepf))(⌜asl1⌝ + ⌜asl0⌝ + ⌜as2 '⌝ , ⌜al0⌝ + ⌜al⌝ ), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ + ⌜as2 '⌝ , ⌜al⌝ ), astepf(as2, a, as'), cstepf(cs0, a, cs1), nfwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), r, size10f), r((asl0 + as2 ')[0], cs0), r(as', cs1), ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)), ∀ cs2, a0, cs', as1. r(as1, cs2) ∧ cstepf(cs2, a0, cs') → r(as1, cs') ∧ a0 = τ ∨ (∃ as'. astepf(as1, a0, as') ∧ r(as', cs')) ∨ (∃ as'. astepf(as1, τ, as') ∧ r(as', cs2) ∧ size10f(cs2, a0, cs', as') < size10f(cs2, a0, cs', as1)), ∀ as0. as0 ∈ asl0 ∨ as0 = as2 → r(as0, cs0), as ∈ asl1 ∨ as ∈ asl0 ∨ as = as2, as'0 ∈ asl1 ∨ as'0 ∈ asl0 ∨ as'0 = as2, as2 = as'0 ∨ as2 ∈ asl ⊦ ∃ as0. amove(AIOAut(astartf, astepf))(as, [], as0) ∧ r(as0, cs0)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 64 from proof normedfw-branchingfw-aux (previous step) (back to tree)

asl1 + asl0 + as2 ' = as'0 ' + asl, ⌜al⌝ ^ = [], ⌜al0⌝ ^ = [], a ≠ τ, afrag(AIOAut(astartf, astepf))(⌜asl0⌝ + ⌜as2 '⌝ , ⌜al⌝ ), afrag(AIOAut(astartf, astepf))(⌜asl1⌝ + ⌜asl0⌝ + ⌜as2 '⌝ , ⌜al0⌝ + ⌜al⌝ ), afrag(AIOAut(astartf, astepf))(⌜asl1⌝ + ⌜(asl0 + as2 ')[0] '⌝ , ⌜al0⌝ ), astepf(as2, a, as'), cstepf(cs0, a, cs1), nfwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), r, size10f), r(as', cs1), r((asl0 + as2 ')[0], cs0), ∀ as0. as0 ∈ asl0 ∨ as0 = as2 → r(as0, cs0), ∀ cs2, a0, cs', as1. r(as1, cs2) ∧ cstepf(cs2, a0, cs') → r(as1, cs') ∧ a0 = τ ∨ (∃ as'. astepf(as1, a0, as') ∧ r(as', cs')) ∨ (∃ as'. astepf(as1, τ, as') ∧ r(as', cs2) ∧ size10f(cs2, a0, cs', as') < size10f(cs2, a0, cs', as1)), ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)), as2 = as'0 ∨ as2 ∈ asl, as'0 ∈ asl1 ∨ as'0 ∈ asl0 ∨ as'0 = as2, as ∈ asl1 ∨ as ∈ asl0 ∨ as = as2 ⊦ ∃ as0. amove(AIOAut(astartf, astepf))(as, [], as0) ∧ r(as0, cs0)

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 13 terms: as abort: F discard: F computed: T

Additional information

Used terms: as

Proof step 65 from proof normedfw-branchingfw-aux (previous step) (back to tree)

asl1 + asl0 + as2 ' = as'0 ' + asl, ⌜al0⌝ ^ = [], ⌜al⌝ ^ = [], a ≠ τ, afrag(AIOAut(astartf, astepf))(⌜asl1⌝ + ⌜(asl0 + as2 ')[0] '⌝ , ⌜al0⌝ ), afrag(AIOAut(astartf, astepf))(⌜asl1⌝ + ⌜asl0⌝ + ⌜as2 '⌝ , ⌜al0⌝ + ⌜al⌝ ), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ + ⌜as2 '⌝ , ⌜al⌝ ), astepf(as2, a, as'), cstepf(cs0, a, cs1), nfwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), r, size10f), r((asl0 + as2 ')[0], cs0), r(as', cs1), as ∈ asl0 ∨ as = as2 → r(as, cs0), ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)), ∀ cs2, a0, cs', as1. r(as1, cs2) ∧ cstepf(cs2, a0, cs') → r(as1, cs') ∧ a0 = τ ∨ (∃ as'. astepf(as1, a0, as') ∧ r(as', cs')) ∨ (∃ as'. astepf(as1, τ, as') ∧ r(as', cs2) ∧ size10f(cs2, a0, cs', as') < size10f(cs2, a0, cs', as1)), ∀ as0. as0 ∈ asl0 ∨ as0 = as2 → r(as0, cs0), as ∈ asl1 ∨ as ∈ asl0 ∨ as = as2, as'0 ∈ asl1 ∨ as'0 ∈ asl0 ∨ as'0 = as2, as2 = as'0 ∨ as2 ∈ asl ⊦ ∃ as0. amove(AIOAut(astartf, astepf))(as, [], as0) ∧ r(as0, cs0)

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 13

Additional information

Proof step 66 from proof normedfw-branchingfw-aux (previous step) (back to tree)

asl1 + asl0 + as2 ' = as'0 ' + asl, ⌜al⌝ ^ = [], ⌜al0⌝ ^ = [], a ≠ τ, as ≠ as2, afrag(AIOAut(astartf, astepf))(⌜asl0⌝ + ⌜as2 '⌝ , ⌜al⌝ ), afrag(AIOAut(astartf, astepf))(⌜asl1⌝ + ⌜asl0⌝ + ⌜as2 '⌝ , ⌜al0⌝ + ⌜al⌝ ), afrag(AIOAut(astartf, astepf))(⌜asl1⌝ + ⌜(asl0 + as2 ')[0] '⌝ , ⌜al0⌝ ), astepf(as2, a, as'), cstepf(cs0, a, cs1), nfwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), r, size10f), r(as', cs1), r((asl0 + as2 ')[0], cs0), ¬ as ∈ asl0, ∀ as0. as0 ∈ asl0 ∨ as0 = as2 → r(as0, cs0), ∀ cs2, a0, cs', as1. r(as1, cs2) ∧ cstepf(cs2, a0, cs') → r(as1, cs') ∧ a0 = τ ∨ (∃ as'. astepf(as1, a0, as') ∧ r(as', cs')) ∨ (∃ as'. astepf(as1, τ, as') ∧ r(as', cs2) ∧ size10f(cs2, a0, cs', as') < size10f(cs2, a0, cs', as1)), ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)), as2 = as'0 ∨ as2 ∈ asl, as'0 ∈ asl1 ∨ as'0 ∈ asl0 ∨ as'0 = as2, as ∈ asl1 ∨ as ∈ asl0 ∨ as = as2 ⊦ ∃ as0. amove(AIOAut(astartf, astepf))(as, [], as0) ∧ r(as0, cs0)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 67 from proof normedfw-branchingfw-aux (previous step) (back to tree)

asl1 + asl0 + as2 ' = as'0 ' + asl, ⌜al0⌝ ^ = [], ⌜al⌝ ^ = [], a ≠ τ, as ≠ as2, afrag(AIOAut(astartf, astepf))(⌜asl1⌝ + ⌜(asl0 + as2 ')[0] '⌝ , ⌜al0⌝ ), afrag(AIOAut(astartf, astepf))(⌜asl1⌝ + ⌜asl0⌝ + ⌜as2 '⌝ , ⌜al0⌝ + ⌜al⌝ ), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ + ⌜as2 '⌝ , ⌜al⌝ ), astepf(as2, a, as'), cstepf(cs0, a, cs1), nfwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), r, size10f), r((asl0 + as2 ')[0], cs0), r(as', cs1), as ∈ asl1, ¬ as ∈ asl0, ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)), ∀ cs2, a0, cs', as1. r(as1, cs2) ∧ cstepf(cs2, a0, cs') → r(as1, cs') ∧ a0 = τ ∨ (∃ as'. astepf(as1, a0, as') ∧ r(as', cs')) ∨ (∃ as'. astepf(as1, τ, as') ∧ r(as', cs2) ∧ size10f(cs2, a0, cs', as') < size10f(cs2, a0, cs', as1)), ∀ as0. as0 ∈ asl0 ∨ as0 = as2 → r(as0, cs0), as'0 ∈ asl1 ∨ as'0 ∈ asl0 ∨ as'0 = as2, as2 = as'0 ∨ as2 ∈ asl ⊦ ∃ as0. amove(AIOAut(astartf, astepf))(as, [], as0) ∧ r(as0, cs0)

User applied rule exists right

And obtained the following new goals

Rule argument

pos: right 1 terms: (asl0 + as2 ')[0] abort: F discard: T computed: T

Additional information

Used terms: (asl0 + as2 ')[0]

Proof step 68 from proof normedfw-branchingfw-aux (previous step) (back to tree)

asl1 + asl0 + as2 ' = as'0 ' + asl, ⌜al⌝ ^ = [], ⌜al0⌝ ^ = [], a ≠ τ, as ≠ as2, afrag(AIOAut(astartf, astepf))(⌜asl0⌝ + ⌜as2 '⌝ , ⌜al⌝ ), afrag(AIOAut(astartf, astepf))(⌜asl1⌝ + ⌜asl0⌝ + ⌜as2 '⌝ , ⌜al0⌝ + ⌜al⌝ ), afrag(AIOAut(astartf, astepf))(⌜asl1⌝ + ⌜(asl0 + as2 ')[0] '⌝ , ⌜al0⌝ ), astepf(as2, a, as'), cstepf(cs0, a, cs1), nfwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), r, size10f), r(as', cs1), r((asl0 + as2 ')[0], cs0), as ∈ asl1, ¬ as ∈ asl0, ∀ as0. as0 ∈ asl0 ∨ as0 = as2 → r(as0, cs0), ∀ cs2, a0, cs', as1. r(as1, cs2) ∧ cstepf(cs2, a0, cs') → r(as1, cs') ∧ a0 = τ ∨ (∃ as'. astepf(as1, a0, as') ∧ r(as', cs')) ∨ (∃ as'. astepf(as1, τ, as') ∧ r(as', cs2) ∧ size10f(cs2, a0, cs', as') < size10f(cs2, a0, cs', as1)), ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)), as2 = as'0 ∨ as2 ∈ asl, as'0 ∈ asl1 ∨ as'0 ∈ asl0 ∨ as'0 = as2 ⊦ amove(AIOAut(astartf, astepf))(as, [], (asl0 + as2 ')[0]) ∧ r((asl0 + as2 ')[0], cs0)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 69 from proof normedfw-branchingfw-aux (previous step) (back to tree)

asl1 + asl0 + as2 ' = as'0 ' + asl, ⌜al0⌝ ^ = [], ⌜al⌝ ^ = [], a ≠ τ, as ≠ as2, afrag(AIOAut(astartf, astepf))(⌜asl1⌝ + ⌜(asl0 + as2 ')[0] '⌝ , ⌜al0⌝ ), afrag(AIOAut(astartf, astepf))(⌜asl1⌝ + ⌜asl0⌝ + ⌜as2 '⌝ , ⌜al0⌝ + ⌜al⌝ ), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ + ⌜as2 '⌝ , ⌜al⌝ ), astepf(as2, a, as'), cstepf(cs0, a, cs1), nfwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), r, size10f), r((asl0 + as2 ')[0], cs0), r(as', cs1), as ∈ asl1, ¬ amove(AIOAut(astartf, astepf))(as, [], (asl0 + as2 ')[0]), ¬ as ∈ asl0, ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)), ∀ cs2, a0, cs', as1. r(as1, cs2) ∧ cstepf(cs2, a0, cs') → r(as1, cs') ∧ a0 = τ ∨ (∃ as'. astepf(as1, a0, as') ∧ r(as', cs')) ∨ (∃ as'. astepf(as1, τ, as') ∧ r(as', cs2) ∧ size10f(cs2, a0, cs', as') < size10f(cs2, a0, cs', as1)), ∀ as0. as0 ∈ asl0 ∨ as0 = as2 → r(as0, cs0), as'0 ∈ asl1 ∨ as'0 ∈ asl0 ∨ as'0 = as2, as2 = as'0 ∨ as2 ∈ asl ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: IOtrace[traceA], name:move, seq:⊦ amove(AIOAut(startf, stepf))(s1, β, s2) ↔ (∃ α, sl. afrag*(AIOAut(startf, stepf))(⌜sl⌝ , α) ∧ s1 = sl[0] ∧ s2 = sl.last ∧ α ^ = β), subst:[s1, stepf, β, s2, startf] → [as, astepf, [], (asl0 + as2 ')[0], astartf], <all paths>

Additional information

Used terms: (asl0 + as2 ')[0], [], as, astepf, astartf

Proof step 70 from proof normedfw-branchingfw-aux (previous step) (back to tree)

⊦ amove(AIOAut(startf, stepf))(s1, β, s2) ↔ (∃ α, sl. afrag*(AIOAut(startf, stepf))(⌜sl⌝ , α) ∧ s1 = sl[0] ∧ s2 = sl.last ∧ α ^ = β)

A spec-lemma

Proof step 71 from proof normedfw-branchingfw-aux (previous step) (back to tree)

asl1 + asl0 + as2 ' = as'0 ' + asl, ⌜al⌝ ^ = [], ⌜al0⌝ ^ = [], a ≠ τ, as ≠ as2, afrag(AIOAut(astartf, astepf))(⌜asl0⌝ + ⌜as2 '⌝ , ⌜al⌝ ), afrag(AIOAut(astartf, astepf))(⌜asl1⌝ + ⌜asl0⌝ + ⌜as2 '⌝ , ⌜al0⌝ + ⌜al⌝ ), afrag(AIOAut(astartf, astepf))(⌜asl1⌝ + ⌜(asl0 + as2 ')[0] '⌝ , ⌜al0⌝ ), astepf(as2, a, as'), cstepf(cs0, a, cs1), nfwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), r, size10f), r(as', cs1), r((asl0 + as2 ')[0], cs0), as ∈ asl1, ¬ as ∈ asl0, ∀ as0. as0 ∈ asl0 ∨ as0 = as2 → r(as0, cs0), ∀ cs2, a0, cs', as1. r(as1, cs2) ∧ cstepf(cs2, a0, cs') → r(as1, cs') ∧ a0 = τ ∨ (∃ as'. astepf(as1, a0, as') ∧ r(as', cs')) ∨ (∃ as'. astepf(as1, τ, as') ∧ r(as', cs2) ∧ size10f(cs2, a0, cs', as') < size10f(cs2, a0, cs', as1)), ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)), ∀ α, sl. ¬(afrag*(AIOAut(astartf, astepf))(⌜sl⌝ , α) ∧ as = sl[0] ∧ (asl0 + as2 ')[0] = sl.last ∧ α ^ = []), as2 = as'0 ∨ as2 ∈ asl, as'0 ∈ asl1 ∨ as'0 ∈ asl0 ∨ as'0 = as2 ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ afrag*(AIOAut(startf, stepf))(σ, β) ↔ afrag(AIOAut(startf, stepf))(σ, β) ∧ finp(β); (s)

Proof step 72 from proof normedfw-branchingfw-aux (previous step) (back to tree)

asl1 + asl0 + as2 ' = as'0 ' + asl, ⌜al0⌝ ^ = [], ⌜al⌝ ^ = [], a ≠ τ, as ≠ as2, afrag(AIOAut(astartf, astepf))(⌜asl1⌝ + ⌜(asl0 + as2 ')[0] '⌝ , ⌜al0⌝ ), afrag(AIOAut(astartf, astepf))(⌜asl1⌝ + ⌜asl0⌝ + ⌜as2 '⌝ , ⌜al0⌝ + ⌜al⌝ ), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ + ⌜as2 '⌝ , ⌜al⌝ ), astepf(as2, a, as'), cstepf(cs0, a, cs1), nfwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), r, size10f), r((asl0 + as2 ')[0], cs0), r(as', cs1), as ∈ asl1, ¬ as ∈ asl0, ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)), ∀ cs2, a0, cs', as1. r(as1, cs2) ∧ cstepf(cs2, a0, cs') → r(as1, cs') ∧ a0 = τ ∨ (∃ as'. astepf(as1, a0, as') ∧ r(as', cs')) ∨ (∃ as'. astepf(as1, τ, as') ∧ r(as', cs2) ∧ size10f(cs2, a0, cs', as') < size10f(cs2, a0, cs', as1)), ∀ as0. as0 ∈ asl0 ∨ as0 = as2 → r(as0, cs0), ∀ α, sl. ¬ afrag(AIOAut(astartf, astepf))(⌜sl⌝ , α) ∨ ¬ finp(α) ∨ as ≠ sl[0] ∨ (asl0 + as2 ')[0] ≠ sl.last ∨ α ^ ≠ [], as'0 ∈ asl1 ∨ as'0 ∈ asl0 ∨ as'0 = as2, as2 = as'0 ∨ as2 ∈ asl ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list[traceA-IOstatestream], name:in-def, seq: ⊦ a ∈ x ↔ (∃ y, z. x = y + (a + z)), subst:[x, a] → [asl1, as], <all paths>

Additional information

Used terms: asl1, as

Proof step 73 from proof normedfw-branchingfw-aux (previous step) (back to tree)

⊦ a ∈ x ↔ (∃ y, z. x = y + (a + z))

A spec-lemma

Proof step 74 from proof normedfw-branchingfw-aux (previous step) (back to tree)

asl1 + asl0 + as2 ' = as'0 ' + asl, ⌜al⌝ ^ = [], ⌜al0⌝ ^ = [], a ≠ τ, as ≠ as2, afrag(AIOAut(astartf, astepf))(⌜asl0⌝ + ⌜as2 '⌝ , ⌜al⌝ ), afrag(AIOAut(astartf, astepf))(⌜asl1⌝ + ⌜asl0⌝ + ⌜as2 '⌝ , ⌜al0⌝ + ⌜al⌝ ), afrag(AIOAut(astartf, astepf))(⌜asl1⌝ + ⌜(asl0 + as2 ')[0] '⌝ , ⌜al0⌝ ), astepf(as2, a, as'), cstepf(cs0, a, cs1), nfwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), r, size10f), r(as', cs1), r((asl0 + as2 ')[0], cs0), ¬ as ∈ asl0, ∀ α, sl. ¬ afrag(AIOAut(astartf, astepf))(⌜sl⌝ , α) ∨ ¬ finp(α) ∨ as ≠ sl[0] ∨ (asl0 + as2 ')[0] ≠ sl.last ∨ α ^ ≠ [], ∀ as0. as0 ∈ asl0 ∨ as0 = as2 → r(as0, cs0), ∀ cs2, a0, cs', as1. r(as1, cs2) ∧ cstepf(cs2, a0, cs') → r(as1, cs') ∧ a0 = τ ∨ (∃ as'. astepf(as1, a0, as') ∧ r(as', cs')) ∨ (∃ as'. astepf(as1, τ, as') ∧ r(as', cs2) ∧ size10f(cs2, a0, cs', as') < size10f(cs2, a0, cs', as1)), ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)), ∃ y, z. asl1 = y + (as + z), as2 = as'0 ∨ as2 ∈ asl, as'0 ∈ asl1 ∨ as'0 ∈ asl0 ∨ as'0 = as2 ⊦

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] ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[traceA-IOstatestream] ⊦ a + x = a ' + x; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[traceA-IOstatestream] ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s)

Proof step 75 from proof normedfw-branchingfw-aux (previous step) (back to tree)

asl2 + (as ' + asl3) + asl0 + as2 ' = as'0 ' + asl, ⌜al⌝ ^ = [], ⌜al0⌝ ^ = [], a ≠ τ, as ≠ as2, afrag(AIOAut(astartf, astepf))((⌜asl2⌝ + ⌜as '⌝ + ⌜asl3⌝ ) + ⌜asl0⌝ + ⌜as2 '⌝ , ⌜al0⌝ + ⌜al⌝ ), afrag(AIOAut(astartf, astepf))((⌜asl2⌝ + ⌜as '⌝ + ⌜asl3⌝ ) + ⌜(asl0 + as2 ')[0] '⌝ , ⌜al0⌝ ), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ + ⌜as2 '⌝ , ⌜al⌝ ), astepf(as2, a, as'), cstepf(cs0, a, cs1), nfwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), r, size10f), r(as', cs1), r((asl0 + as2 ')[0], cs0), ¬ as ∈ asl0, ∀ α, sl. ¬ afrag(AIOAut(astartf, astepf))(⌜sl⌝ , α) ∨ ¬ finp(α) ∨ as ≠ sl[0] ∨ (asl0 + as2 ')[0] ≠ sl.last ∨ α ^ ≠ [], ∀ as0. as0 ∈ asl0 ∨ as0 = as2 → r(as0, cs0), ∀ cs2, a0, cs', as1. r(as1, cs2) ∧ cstepf(cs2, a0, cs') → r(as1, cs') ∧ a0 = τ ∨ (∃ as'. astepf(as1, a0, as') ∧ r(as', cs')) ∨ (∃ as'. astepf(as1, τ, as') ∧ r(as', cs2) ∧ size10f(cs2, a0, cs', as') < size10f(cs2, a0, cs', as1)), ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)), as2 = as'0 ∨ as2 ∈ asl, as'0 ∈ asl2 ∨ as'0 = as ∨ as'0 ∈ asl3 ∨ as'0 ∈ asl0 ∨ as'0 = as2 ⊦

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: IOtrace[traceA], name:frag-split, seq:⊦ afrag(AIOAut(startf, stepf))(σ, α) ∧ ⌜n⌝ < # α → afrag*(AIOAut(startf, stepf))(σ to n + 1, α to n) ∧ afrag(AIOAut(startf, stepf))(σ from n, α from n), subst:[n, α, σ, stepf, startf] → [# asl2, ⌜al0⌝ , (⌜asl2⌝ + ⌜as '⌝ + ⌜asl3⌝ ) + ⌜(asl0 + as2 ')[0] '⌝ , astepf, astartf]

Additional information

Used terms: astartf, astepf, (⌜asl2⌝ + ⌜as '⌝ + ⌜asl3⌝ ) + ⌜(asl0 + as2 ')[0] '⌝ , ⌜al0⌝ , # asl2

Proof step 76 from proof normedfw-branchingfw-aux (previous step) (back to tree)

⊦ afrag(AIOAut(startf, stepf))(σ, α) ∧ ⌜n⌝ < # α → afrag*(AIOAut(startf, stepf))(σ to n + 1, α to n) ∧ afrag(AIOAut(startf, stepf))(σ from n, α from n)

A spec-lemma

Proof step 77 from proof normedfw-branchingfw-aux (previous step) (back to tree)

asl2 + (as ' + asl3) + asl0 + as2 ' = as'0 ' + asl, ⌜al0⌝ ^ = [], ⌜al⌝ ^ = [], a ≠ τ, as ≠ as2, afrag(AIOAut(astartf, astepf))(⌜asl0⌝ + ⌜as2 '⌝ , ⌜al⌝ ), afrag(AIOAut(astartf, astepf))((⌜asl2⌝ + ⌜as '⌝ + ⌜asl3⌝ ) + ⌜(asl0 + as2 ')[0] '⌝ , ⌜al0⌝ ), afrag(AIOAut(astartf, astepf))((⌜asl2⌝ + ⌜as '⌝ + ⌜asl3⌝ ) + ⌜asl0⌝ + ⌜as2 '⌝ , ⌜al0⌝ + ⌜al⌝ ), astepf(as2, a, as'), cstepf(cs0, a, cs1), nfwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), r, size10f), r((asl0 + as2 ')[0], cs0), r(as', cs1), ¬ as ∈ asl0, afrag(AIOAut(astartf, astepf))((⌜asl2⌝ + ⌜as '⌝ + ⌜asl3⌝ ) + ⌜(asl0 + as2 ')[0] '⌝ , ⌜al0⌝ ) ∧ ⌜# asl2⌝ < # ⌜al0⌝ → afrag*(AIOAut(astartf, astepf))((⌜asl2⌝ + ⌜as '⌝ + ⌜asl3⌝ ) + ⌜(asl0 + as2 ')[0] '⌝ to # asl2 + 1, ⌜al0⌝ to # asl2) ∧ afrag(AIOAut(astartf, astepf))((⌜asl2⌝ + ⌜as '⌝ + ⌜asl3⌝ ) + ⌜(asl0 + as2 ')[0] '⌝ from # asl2, ⌜al0⌝ from # asl2), ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)), ∀ cs2, a0, cs', as1. r(as1, cs2) ∧ cstepf(cs2, a0, cs') → r(as1, cs') ∧ a0 = τ ∨ (∃ as'. astepf(as1, a0, as') ∧ r(as', cs')) ∨ (∃ as'. astepf(as1, τ, as') ∧ r(as', cs2) ∧ size10f(cs2, a0, cs', as') < size10f(cs2, a0, cs', as1)), ∀ as0. as0 ∈ asl0 ∨ as0 = as2 → r(as0, cs0), ∀ α, sl. ¬ afrag(AIOAut(astartf, astepf))(⌜sl⌝ , α) ∨ ¬ finp(α) ∨ as ≠ sl[0] ∨ (asl0 + as2 ')[0] ≠ sl.last ∨ α ^ ≠ [], as'0 ∈ asl2 ∨ as'0 = as ∨ as'0 ∈ asl3 ∨ as'0 ∈ asl0 ∨ as'0 = as2, as2 = as'0 ∨ as2 ∈ asl ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ⌜x⌝ from n = ⌜x from n⌝ ; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[traceA-IOstatestream] ⊦ ⌜x⌝ + σ from # x = σ; (s) ⊦ finp(⌜x⌝ ); (s) ⊦ afrag*(AIOAut(startf, stepf))(σ, β) ↔ afrag(AIOAut(startf, stepf))(σ, β) ∧ finp(β); (s) ⊦ ⌜x⌝ to n = ⌜x to n⌝ ; (s) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ ⌜a '⌝ + σ to 1 = ⌜a '⌝ ; (s) ⊦ ⌜x⌝ + σ to m + # x = ⌜x⌝ + (σ to m); (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s)

Proof step 78 from proof normedfw-branchingfw-aux (previous step) (back to tree)

asl2 + (as ' + asl3) + asl0 + as2 ' = as'0 ' + asl, ⌜al⌝ ^ = [], ⌜al0⌝ ^ = [], a ≠ τ, as ≠ as2, afrag(AIOAut(astartf, astepf))((⌜asl2⌝ + ⌜as '⌝ + ⌜asl3⌝ ) + ⌜asl0⌝ + ⌜as2 '⌝ , ⌜al0⌝ + ⌜al⌝ ), afrag(AIOAut(astartf, astepf))((⌜asl2⌝ + ⌜as '⌝ + ⌜asl3⌝ ) + ⌜(asl0 + as2 ')[0] '⌝ , ⌜al0⌝ ), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ + ⌜as2 '⌝ , ⌜al⌝ ), astepf(as2, a, as'), cstepf(cs0, a, cs1), nfwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), r, size10f), r(as', cs1), r((asl0 + as2 ')[0], cs0), ¬ as ∈ asl0, # asl2 < # al0 → afrag(AIOAut(astartf, astepf))(⌜asl2⌝ + ⌜as '⌝ , ⌜al0 to # asl2⌝ ) ∧ afrag(AIOAut(astartf, astepf))(⌜as '⌝ + ⌜asl3⌝ + ⌜(asl0 + as2 ')[0] '⌝ , ⌜al0 from # asl2⌝ ), ∀ α, sl. ¬ afrag(AIOAut(astartf, astepf))(⌜sl⌝ , α) ∨ ¬ finp(α) ∨ as ≠ sl[0] ∨ (asl0 + as2 ')[0] ≠ sl.last ∨ α ^ ≠ [], ∀ as0. as0 ∈ asl0 ∨ as0 = as2 → r(as0, cs0), ∀ cs2, a0, cs', as1. r(as1, cs2) ∧ cstepf(cs2, a0, cs') → r(as1, cs') ∧ a0 = τ ∨ (∃ as'. astepf(as1, a0, as') ∧ r(as', cs')) ∨ (∃ as'. astepf(as1, τ, as') ∧ r(as', cs2) ∧ size10f(cs2, a0, cs', as') < size10f(cs2, a0, cs', as1)), ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)), as2 = as'0 ∨ as2 ∈ asl, as'0 ∈ asl2 ∨ as'0 = as ∨ as'0 ∈ asl3 ∨ as'0 ∈ asl0 ∨ as'0 = as2 ⊦

User applied rule cut formula

And obtained the following new goals

Rule argument

fma: # al0 ≤ # asl2

Additional information

Used formulas: # al0 ≤ # asl2

Proof step 79 from proof normedfw-branchingfw-aux (previous step) (back to tree)

asl2 + (as ' + asl3) + asl0 + as2 ' = as'0 ' + asl, ⌜al0⌝ ^ = [], ⌜al⌝ ^ = [], a ≠ τ, as ≠ as2, afrag(AIOAut(astartf, astepf))(⌜asl0⌝ + ⌜as2 '⌝ , ⌜al⌝ ), afrag(AIOAut(astartf, astepf))((⌜asl2⌝ + ⌜as '⌝ + ⌜asl3⌝ ) + ⌜(asl0 + as2 ')[0] '⌝ , ⌜al0⌝ ), afrag(AIOAut(astartf, astepf))((⌜asl2⌝ + ⌜as '⌝ + ⌜asl3⌝ ) + ⌜asl0⌝ + ⌜as2 '⌝ , ⌜al0⌝ + ⌜al⌝ ), astepf(as2, a, as'), cstepf(cs0, a, cs1), nfwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), r, size10f), r((asl0 + as2 ')[0], cs0), r(as', cs1), # al0 ≤ # asl2, ¬ as ∈ asl0, # asl2 < # al0 → afrag(AIOAut(astartf, astepf))(⌜asl2⌝ + ⌜as '⌝ , ⌜al0 to # asl2⌝ ) ∧ afrag(AIOAut(astartf, astepf))(⌜as '⌝ + ⌜asl3⌝ + ⌜(asl0 + as2 ')[0] '⌝ , ⌜al0 from # asl2⌝ ), ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)), ∀ cs2, a0, cs', as1. r(as1, cs2) ∧ cstepf(cs2, a0, cs') → r(as1, cs') ∧ a0 = τ ∨ (∃ as'. astepf(as1, a0, as') ∧ r(as', cs')) ∨ (∃ as'. astepf(as1, τ, as') ∧ r(as', cs2) ∧ size10f(cs2, a0, cs', as') < size10f(cs2, a0, cs', as1)), ∀ as0. as0 ∈ asl0 ∨ as0 = as2 → r(as0, cs0), ∀ α, sl. ¬ afrag(AIOAut(astartf, astepf))(⌜sl⌝ , α) ∨ ¬ finp(α) ∨ as ≠ sl[0] ∨ (asl0 + as2 ')[0] ≠ sl.last ∨ α ^ ≠ [], as'0 ∈ asl2 ∨ as'0 = as ∨ as'0 ∈ asl3 ∨ as'0 ∈ asl0 ∨ as'0 = as2, as2 = as'0 ∨ as2 ∈ asl ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ m ≤ n → (n < m ↔ false); (s)

Proof step 80 from proof normedfw-branchingfw-aux (previous step) (back to tree)

asl2 + (as ' + asl3) + asl0 + as2 ' = as'0 ' + asl, ⌜al⌝ ^ = [], ⌜al0⌝ ^ = [], a ≠ τ, as ≠ as2, afrag(AIOAut(astartf, astepf))((⌜asl2⌝ + ⌜as '⌝ + ⌜asl3⌝ ) + ⌜asl0⌝ + ⌜as2 '⌝ , ⌜al0⌝ + ⌜al⌝ ), afrag(AIOAut(astartf, astepf))((⌜asl2⌝ + ⌜as '⌝ + ⌜asl3⌝ ) + ⌜(asl0 + as2 ')[0] '⌝ , ⌜al0⌝ ), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ + ⌜as2 '⌝ , ⌜al⌝ ), astepf(as2, a, as'), cstepf(cs0, a, cs1), nfwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), r, size10f), r(as', cs1), r((asl0 + as2 ')[0], cs0), # al0 ≤ # asl2, ¬ as ∈ asl0, ∀ α, sl. ¬ afrag(AIOAut(astartf, astepf))(⌜sl⌝ , α) ∨ ¬ finp(α) ∨ as ≠ sl[0] ∨ (asl0 + as2 ')[0] ≠ sl.last ∨ α ^ ≠ [], ∀ as0. as0 ∈ asl0 ∨ as0 = as2 → r(as0, cs0), ∀ cs2, a0, cs', as1. r(as1, cs2) ∧ cstepf(cs2, a0, cs') → r(as1, cs') ∧ a0 = τ ∨ (∃ as'. astepf(as1, a0, as') ∧ r(as', cs')) ∨ (∃ as'. astepf(as1, τ, as') ∧ r(as', cs2) ∧ size10f(cs2, a0, cs', as') < size10f(cs2, a0, cs', as1)), ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)), as2 = as'0 ∨ as2 ∈ asl, as'0 ∈ asl2 ∨ as'0 = as ∨ as'0 ∈ asl3 ∨ as'0 ∈ asl0 ∨ as'0 = as2 ⊦

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] → [⌜al0⌝ , (⌜asl2⌝ + ⌜as '⌝ + ⌜asl3⌝ ) + ⌜(asl0 + as2 ')[0] '⌝ , astepf, astartf], <all paths>

Additional information

Used terms: ⌜al0⌝ , (⌜asl2⌝ + ⌜as '⌝ + ⌜asl3⌝ ) + ⌜(asl0 + as2 ')[0] '⌝ , astepf, astartf

Proof step 81 from proof normedfw-branchingfw-aux (previous step) (back to tree)

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

A spec-lemma

Proof step 82 from proof normedfw-branchingfw-aux (previous step) (back to tree)

#((⌜asl2⌝ + ⌜as '⌝ + ⌜asl3⌝ ) + ⌜(asl0 + as2 ')[0] '⌝ ) = # ⌜al0⌝ + ⌜1⌝ , asl2 + (as ' + asl3) + asl0 + as2 ' = as'0 ' + asl, ⌜al0⌝ ^ = [], ⌜al⌝ ^ = [], a ≠ τ, as ≠ as2, afrag(AIOAut(astartf, astepf))(⌜asl0⌝ + ⌜as2 '⌝ , ⌜al⌝ ), afrag(AIOAut(astartf, astepf))((⌜asl2⌝ + ⌜as '⌝ + ⌜asl3⌝ ) + ⌜asl0⌝ + ⌜as2 '⌝ , ⌜al0⌝ + ⌜al⌝ ), astepf(as2, a, as'), cstepf(cs0, a, cs1), nfwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), r, size10f), r((asl0 + as2 ')[0], cs0), r(as', cs1), # al0 ≤ # asl2, ¬ as ∈ asl0, ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)), ∀ cs2, a0, cs', as1. r(as1, cs2) ∧ cstepf(cs2, a0, cs') → r(as1, cs') ∧ a0 = τ ∨ (∃ as'. astepf(as1, a0, as') ∧ r(as', cs')) ∨ (∃ as'. astepf(as1, τ, as') ∧ r(as', cs2) ∧ size10f(cs2, a0, cs', as') < size10f(cs2, a0, cs', as1)), ∀ as0. as0 ∈ asl0 ∨ as0 = as2 → r(as0, cs0), ∀ α, sl. ¬ afrag(AIOAut(astartf, astepf))(⌜sl⌝ , α) ∨ ¬ finp(α) ∨ as ≠ sl[0] ∨ (asl0 + as2 ')[0] ≠ sl.last ∨ α ^ ≠ [], ∀ n. ⌜n⌝ < # ⌜al0⌝ → astepf(((⌜asl2⌝ + ⌜as '⌝ + ⌜asl3⌝ ) + ⌜(asl0 + as2 ')[0] '⌝ )[n], ⌜al0⌝ [n], ((⌜asl2⌝ + ⌜as '⌝ + ⌜asl3⌝ ) + ⌜(asl0 + as2 ')[0] '⌝ )[n +1]), as'0 ∈ asl2 ∨ as'0 = as ∨ as'0 ∈ asl3 ∨ as'0 ∈ asl0 ∨ as'0 = as2, as2 = as'0 ∨ as2 ∈ asl ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ m +1 = m + 1; (s) ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) add-comm: ⊦ n∞1 + n∞2 = n∞2 + n∞1; from specification nat-inf add-assoc: ⊦ (n∞ + n∞1) + n∞2 = n∞ + n∞1 + n∞2; from specification nat-inf ⊦ ⌜n1⌝ + ⌜n⌝ + ⌜m⌝ = ⌜n0⌝ ↔ n1 + n + m = n0; (s) ⊦ n < m → (⌜(* n)⌝ + n∞1 = ⌜(* m)⌝ + n∞2 ↔ n∞1 = ⌜m - n⌝ + n∞2); (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[traceA-IOstatestream] c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ ⌜(* n)⌝ + ⌜(* m)⌝ = ⌜n + m⌝ ; (s) ⊦ # a ' = 0 +1; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ #(σ + σ1) = # σ + # σ1; (s)

Proof step 83 from proof normedfw-branchingfw-aux (previous step) (back to tree)

asl2 + (as ' + asl3) + asl0 + as2 ' = as'0 ' + asl, 1 + # asl2 + # asl3 = # al0, ⌜al⌝ ^ = [], ⌜al0⌝ ^ = [], a ≠ τ, as ≠ as2, afrag(AIOAut(astartf, astepf))((⌜asl2⌝ + ⌜as '⌝ + ⌜asl3⌝ ) + ⌜asl0⌝ + ⌜as2 '⌝ , ⌜al0⌝ + ⌜al⌝ ), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ + ⌜as2 '⌝ , ⌜al⌝ ), astepf(as2, a, as'), cstepf(cs0, a, cs1), nfwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), r, size10f), r(as', cs1), r((asl0 + as2 ')[0], cs0), # al0 ≤ # asl2, ¬ as ∈ asl0, ∀ α, sl. ¬ afrag(AIOAut(astartf, astepf))(⌜sl⌝ , α) ∨ ¬ finp(α) ∨ as ≠ sl[0] ∨ (asl0 + as2 ')[0] ≠ sl.last ∨ α ^ ≠ [], ∀ as0. as0 ∈ asl0 ∨ as0 = as2 → r(as0, cs0), ∀ cs2, a0, cs', as1. r(as1, cs2) ∧ cstepf(cs2, a0, cs') → r(as1, cs') ∧ a0 = τ ∨ (∃ as'. astepf(as1, a0, as') ∧ r(as', cs')) ∨ (∃ as'. astepf(as1, τ, as') ∧ r(as', cs2) ∧ size10f(cs2, a0, cs', as') < size10f(cs2, a0, cs', as1)), ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)), ∀ n. n < # al0 → astepf(((⌜asl2⌝ + ⌜as '⌝ + ⌜asl3⌝ ) + ⌜(asl0 + as2 ')[0] '⌝ )[n], al0[n], ((⌜asl2⌝ + ⌜as '⌝ + ⌜asl3⌝ ) + ⌜(asl0 + as2 ')[0] '⌝ )[n + 1]), as2 = as'0 ∨ as2 ∈ asl, as'0 ∈ asl2 ∨ as'0 = as ∨ as'0 ∈ asl3 ∨ as'0 ∈ asl0 ∨ as'0 = as2 ⊦

User applied rule subst equation

And closed the goal!

Rule argument

pos: left 2, flags: rotate, discard

Additional information

Used simplifier rules: ⊦ m + 1 ≤ n ↔ m < n; (s) ⊦ ¬ m + n < m; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic

Proof step 84 from proof normedfw-branchingfw-aux (previous step) (back to tree)

asl2 + (as ' + asl3) + asl0 + as2 ' = as'0 ' + asl, ⌜al0⌝ ^ = [], ⌜al⌝ ^ = [], a ≠ τ, as ≠ as2, afrag(AIOAut(astartf, astepf))(⌜asl0⌝ + ⌜as2 '⌝ , ⌜al⌝ ), afrag(AIOAut(astartf, astepf))((⌜asl2⌝ + ⌜as '⌝ + ⌜asl3⌝ ) + ⌜(asl0 + as2 ')[0] '⌝ , ⌜al0⌝ ), afrag(AIOAut(astartf, astepf))((⌜asl2⌝ + ⌜as '⌝ + ⌜asl3⌝ ) + ⌜asl0⌝ + ⌜as2 '⌝ , ⌜al0⌝ + ⌜al⌝ ), astepf(as2, a, as'), cstepf(cs0, a, cs1), nfwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), r, size10f), r((asl0 + as2 ')[0], cs0), r(as', cs1), ¬ as ∈ asl0, ¬ # al0 ≤ # asl2, # asl2 < # al0 → afrag(AIOAut(astartf, astepf))(⌜asl2⌝ + ⌜as '⌝ , ⌜al0 to # asl2⌝ ) ∧ afrag(AIOAut(astartf, astepf))(⌜as '⌝ + ⌜asl3⌝ + ⌜(asl0 + as2 ')[0] '⌝ , ⌜al0 from # asl2⌝ ), ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)), ∀ cs2, a0, cs', as1. r(as1, cs2) ∧ cstepf(cs2, a0, cs') → r(as1, cs') ∧ a0 = τ ∨ (∃ as'. astepf(as1, a0, as') ∧ r(as', cs')) ∨ (∃ as'. astepf(as1, τ, as') ∧ r(as', cs2) ∧ size10f(cs2, a0, cs', as') < size10f(cs2, a0, cs', as1)), ∀ as0. as0 ∈ asl0 ∨ as0 = as2 → r(as0, cs0), ∀ α, sl. ¬ afrag(AIOAut(astartf, astepf))(⌜sl⌝ , α) ∨ ¬ finp(α) ∨ as ≠ sl[0] ∨ (asl0 + as2 ')[0] ≠ sl.last ∨ α ^ ≠ [], as'0 ∈ asl2 ∨ as'0 = as ∨ as'0 ∈ asl3 ∨ as'0 ∈ asl0 ∨ as'0 = as2, as2 = as'0 ∨ as2 ∈ asl ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ # x = 0 ↔ x = []; (s) f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic ⊦ m ≤ n ↔ ¬ n < m; (ss)

Proof step 85 from proof normedfw-branchingfw-aux (previous step) (back to tree)

asl2 + (as ' + asl3) + asl0 + as2 ' = as'0 ' + asl, ⌜al0⌝ ^ = [], ⌜al⌝ ^ = [], a ≠ τ, al0 ≠ [], as ≠ as2, # asl2 < # al0, afrag(AIOAut(astartf, astepf))(⌜as '⌝ + ⌜asl3⌝ + ⌜(asl0 + as2 ')[0] '⌝ , ⌜al0 from # asl2⌝ ), afrag(AIOAut(astartf, astepf))(⌜asl2⌝ + ⌜as '⌝ , ⌜al0 to # asl2⌝ ), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ + ⌜as2 '⌝ , ⌜al⌝ ), afrag(AIOAut(astartf, astepf))((⌜asl2⌝ + ⌜as '⌝ + ⌜asl3⌝ ) + ⌜(asl0 + as2 ')[0] '⌝ , ⌜al0⌝ ), afrag(AIOAut(astartf, astepf))((⌜asl2⌝ + ⌜as '⌝ + ⌜asl3⌝ ) + ⌜asl0⌝ + ⌜as2 '⌝ , ⌜al0⌝ + ⌜al⌝ ), astepf(as2, a, as'), cstepf(cs0, a, cs1), nfwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), r, size10f), r((asl0 + as2 ')[0], cs0), r(as', cs1), ¬ as ∈ asl0, ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)), ∀ cs2, a0, cs', as1. r(as1, cs2) ∧ cstepf(cs2, a0, cs') → r(as1, cs') ∧ a0 = τ ∨ (∃ as'. astepf(as1, a0, as') ∧ r(as', cs')) ∨ (∃ as'. astepf(as1, τ, as') ∧ r(as', cs2) ∧ size10f(cs2, a0, cs', as') < size10f(cs2, a0, cs', as1)), ∀ as0. as0 ∈ asl0 ∨ as0 = as2 → r(as0, cs0), ∀ α, sl. ¬ afrag(AIOAut(astartf, astepf))(⌜sl⌝ , α) ∨ ¬ finp(α) ∨ as ≠ sl[0] ∨ (asl0 + as2 ')[0] ≠ sl.last ∨ α ^ ≠ [], as'0 ∈ asl2 ∨ as'0 = as ∨ as'0 ∈ asl3 ∨ as'0 ∈ asl0 ∨ as'0 = as2, as2 = as'0 ∨ as2 ∈ asl ⊦

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 22 terms: ⌜al0 from # asl2⌝ , as + (asl3 + (asl0 + as2 ')[0] ') abort: F discard: T computed: F

Additional information

Used terms: ⌜al0 from # asl2⌝ , as + (asl3 + (asl0 + as2 ')[0] ')

Proof step 86 from proof normedfw-branchingfw-aux (previous step) (back to tree)

asl2 + (as ' + asl3) + asl0 + as2 ' = as'0 ' + asl, ⌜al⌝ ^ = [], ⌜al0⌝ ^ = [], a ≠ τ, al0 ≠ [], as ≠ as2, # asl2 < # al0, afrag(AIOAut(astartf, astepf))((⌜asl2⌝ + ⌜as '⌝ + ⌜asl3⌝ ) + ⌜asl0⌝ + ⌜as2 '⌝ , ⌜al0⌝ + ⌜al⌝ ), afrag(AIOAut(astartf, astepf))((⌜asl2⌝ + ⌜as '⌝ + ⌜asl3⌝ ) + ⌜(asl0 + as2 ')[0] '⌝ , ⌜al0⌝ ), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ + ⌜as2 '⌝ , ⌜al⌝ ), afrag(AIOAut(astartf, astepf))(⌜asl2⌝ + ⌜as '⌝ , ⌜al0 to # asl2⌝ ), afrag(AIOAut(astartf, astepf))(⌜as '⌝ + ⌜asl3⌝ + ⌜(asl0 + as2 ')[0] '⌝ , ⌜al0 from # asl2⌝ ), astepf(as2, a, as'), cstepf(cs0, a, cs1), nfwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), r, size10f), r(as', cs1), r((asl0 + as2 ')[0], cs0), ¬ as ∈ asl0, ∀ as0. as0 ∈ asl0 ∨ as0 = as2 → r(as0, cs0), ∀ cs2, a0, cs', as1. r(as1, cs2) ∧ cstepf(cs2, a0, cs') → r(as1, cs') ∧ a0 = τ ∨ (∃ as'. astepf(as1, a0, as') ∧ r(as', cs')) ∨ (∃ as'. astepf(as1, τ, as') ∧ r(as', cs2) ∧ size10f(cs2, a0, cs', as') < size10f(cs2, a0, cs', as1)), ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)), as2 = as'0 ∨ as2 ∈ asl, as'0 ∈ asl2 ∨ as'0 = as ∨ as'0 ∈ asl3 ∨ as'0 ∈ asl0 ∨ as'0 = as2, ¬ afrag(AIOAut(astartf, astepf))(⌜as + (asl3 + (asl0 + as2 ')[0] ')⌝ , ⌜al0 from # asl2⌝ ) ∨ ¬ finp(⌜al0 from # asl2⌝ ) ∨ as ≠ (as + (asl3 + (asl0 + as2 ')[0] '))[0] ∨ (asl0 + as2 ')[0] ≠ (as + (asl3 + (asl0 + as2 ')[0] ')).last ∨ ⌜al0 from # asl2⌝ ^ ≠ [] ⊦

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] ⊦ (a ' + x + b ').last = b; (s) ⊦ a + x = a ' + x; (s) ⊦ (a ' + x)[0] = a; (s) ⊦ finp(⌜x⌝ ); (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[traceA-IOstatestream] ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s)

Proof step 87 from proof normedfw-branchingfw-aux (previous step) (back to tree)

asl2 + (as ' + asl3) + asl0 + as2 ' = as'0 ' + asl, ⌜al0⌝ ^ = [], ⌜al⌝ ^ = [], ⌜al0 from # asl2⌝ ^ ≠ [], a ≠ τ, al0 ≠ [], as ≠ as2, # asl2 < # al0, afrag(AIOAut(astartf, astepf))(⌜as '⌝ + ⌜asl3⌝ + ⌜(asl0 + as2 ')[0] '⌝ , ⌜al0 from # asl2⌝ ), afrag(AIOAut(astartf, astepf))(⌜asl2⌝ + ⌜as '⌝ , ⌜al0 to # asl2⌝ ), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ + ⌜as2 '⌝ , ⌜al⌝ ), afrag(AIOAut(astartf, astepf))((⌜asl2⌝ + ⌜as '⌝ + ⌜asl3⌝ ) + ⌜(asl0 + as2 ')[0] '⌝ , ⌜al0⌝ ), afrag(AIOAut(astartf, astepf))((⌜asl2⌝ + ⌜as '⌝ + ⌜asl3⌝ ) + ⌜asl0⌝ + ⌜as2 '⌝ , ⌜al0⌝ + ⌜al⌝ ), astepf(as2, a, as'), cstepf(cs0, a, cs1), nfwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), r, size10f), r((asl0 + as2 ')[0], cs0), r(as', cs1), ¬ as ∈ asl0, ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)), ∀ cs2, a0, cs', as1. r(as1, cs2) ∧ cstepf(cs2, a0, cs') → r(as1, cs') ∧ a0 = τ ∨ (∃ as'. astepf(as1, a0, as') ∧ r(as', cs')) ∨ (∃ as'. astepf(as1, τ, as') ∧ r(as', cs2) ∧ size10f(cs2, a0, cs', as') < size10f(cs2, a0, cs', as1)), ∀ as0. as0 ∈ asl0 ∨ as0 = as2 → r(as0, cs0), as'0 ∈ asl2 ∨ as'0 = as ∨ as'0 ∈ asl3 ∨ as'0 ∈ asl0 ∨ as'0 = as2, as2 = as'0 ∨ as2 ∈ asl ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: remtau, name:remtau-empty-equiv, seq: ⊦ α ^ = [] ↔ (∀ n. ⌜n⌝ < # α → α[n] = τ), subst:[α] → [⌜al0 from # asl2⌝ ], <all paths>

Additional information

Used terms: ⌜al0 from # asl2⌝

Proof step 88 from proof normedfw-branchingfw-aux (previous step) (back to tree)

⊦ α ^ = [] ↔ (∀ n. ⌜n⌝ < # α → α[n] = τ)

A spec-lemma

Proof step 89 from proof normedfw-branchingfw-aux (previous step) (back to tree)

asl2 + (as ' + asl3) + asl0 + as2 ' = as'0 ' + asl, ⌜al⌝ ^ = [], ⌜al0⌝ ^ = [], a ≠ τ, al0 ≠ [], as ≠ as2, # asl2 < # al0, afrag(AIOAut(astartf, astepf))((⌜asl2⌝ + ⌜as '⌝ + ⌜asl3⌝ ) + ⌜asl0⌝ + ⌜as2 '⌝ , ⌜al0⌝ + ⌜al⌝ ), afrag(AIOAut(astartf, astepf))((⌜asl2⌝ + ⌜as '⌝ + ⌜asl3⌝ ) + ⌜(asl0 + as2 ')[0] '⌝ , ⌜al0⌝ ), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ + ⌜as2 '⌝ , ⌜al⌝ ), afrag(AIOAut(astartf, astepf))(⌜asl2⌝ + ⌜as '⌝ , ⌜al0 to # asl2⌝ ), afrag(AIOAut(astartf, astepf))(⌜as '⌝ + ⌜asl3⌝ + ⌜(asl0 + as2 ')[0] '⌝ , ⌜al0 from # asl2⌝ ), astepf(as2, a, as'), cstepf(cs0, a, cs1), nfwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), r, size10f), r(as', cs1), r((asl0 + as2 ')[0], cs0), ¬ as ∈ asl0, ∀ as0. as0 ∈ asl0 ∨ as0 = as2 → r(as0, cs0), ∀ cs2, a0, cs', as1. r(as1, cs2) ∧ cstepf(cs2, a0, cs') → r(as1, cs') ∧ a0 = τ ∨ (∃ as'. astepf(as1, a0, as') ∧ r(as', cs')) ∨ (∃ as'. astepf(as1, τ, as') ∧ r(as', cs2) ∧ size10f(cs2, a0, cs', as') < size10f(cs2, a0, cs', as1)), ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)), ∃ n. ¬(⌜n⌝ < # ⌜al0 from # asl2⌝ → ⌜al0 from # asl2⌝ [n] = τ), as2 = as'0 ∨ as2 ∈ asl, as'0 ∈ asl2 ∨ as'0 = as ∨ as'0 ∈ asl3 ∨ as'0 ∈ asl0 ∨ as'0 = as2 ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: m + m0 < # x ⊦ (x from m)[m0] = x[m + m0]; (s) ⊦ m < n → (n ≤ m ↔ false); (s) c: ⊦ m + n = n + m; from specification nat-basic ⊦ m < n ↔ ¬ n ≤ m; (ss) n0 ≤ n ⊦ m < n - n0 ↔ m + n0 < n; (s) ⊦ m < n → m ≤ n; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ¬ # x < n ⊦ #(x from n) = # x - n; (s) ⊦ m < n → ¬ n < m; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ ⌜x⌝ [n] = x[n]; (s)

Proof step 90 from proof normedfw-branchingfw-aux (previous step) (back to tree)

asl2 + (as ' + asl3) + asl0 + as2 ' = as'0 ' + asl, ⌜al0⌝ ^ = [], ⌜al⌝ ^ = [], al0[# asl2 + n] ≠ τ, a ≠ τ, al0 ≠ [], as ≠ as2, # asl2 < # al0, n + # asl2 < # al0, afrag(AIOAut(astartf, astepf))(⌜as '⌝ + ⌜asl3⌝ + ⌜(asl0 + as2 ')[0] '⌝ , ⌜al0 from # asl2⌝ ), afrag(AIOAut(astartf, astepf))(⌜asl2⌝ + ⌜as '⌝ , ⌜al0 to # asl2⌝ ), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ + ⌜as2 '⌝ , ⌜al⌝ ), afrag(AIOAut(astartf, astepf))((⌜asl2⌝ + ⌜as '⌝ + ⌜asl3⌝ ) + ⌜(asl0 + as2 ')[0] '⌝ , ⌜al0⌝ ), afrag(AIOAut(astartf, astepf))((⌜asl2⌝ + ⌜as '⌝ + ⌜asl3⌝ ) + ⌜asl0⌝ + ⌜as2 '⌝ , ⌜al0⌝ + ⌜al⌝ ), astepf(as2, a, as'), cstepf(cs0, a, cs1), nfwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), r, size10f), r((asl0 + as2 ')[0], cs0), r(as', cs1), ¬ as ∈ asl0, ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)), ∀ cs2, a0, cs', as1. r(as1, cs2) ∧ cstepf(cs2, a0, cs') → r(as1, cs') ∧ a0 = τ ∨ (∃ as'. astepf(as1, a0, as') ∧ r(as', cs')) ∨ (∃ as'. astepf(as1, τ, as') ∧ r(as', cs2) ∧ size10f(cs2, a0, cs', as') < size10f(cs2, a0, cs', as1)), ∀ as0. as0 ∈ asl0 ∨ as0 = as2 → r(as0, cs0), as'0 ∈ asl2 ∨ as'0 = as ∨ as'0 ∈ asl3 ∨ as'0 ∈ asl0 ∨ as'0 = as2, as2 = as'0 ∨ as2 ∈ asl ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: remtau, name:remtau-empty-equiv, seq: ⊦ α ^ = [] ↔ (∀ n. ⌜n⌝ < # α → α[n] = τ), subst:[α] → [⌜al0⌝ ], <all paths>

Additional information

Used terms: ⌜al0⌝

Proof step 91 from proof normedfw-branchingfw-aux (previous step) (back to tree)

⊦ α ^ = [] ↔ (∀ n. ⌜n⌝ < # α → α[n] = τ)

A spec-lemma

Proof step 92 from proof normedfw-branchingfw-aux (previous step) (back to tree)

asl2 + (as ' + asl3) + asl0 + as2 ' = as'0 ' + asl, ⌜al⌝ ^ = [], al0[# asl2 + n] ≠ τ, a ≠ τ, al0 ≠ [], as ≠ as2, n + # asl2 < # al0, # asl2 < # al0, afrag(AIOAut(astartf, astepf))((⌜asl2⌝ + ⌜as '⌝ + ⌜asl3⌝ ) + ⌜asl0⌝ + ⌜as2 '⌝ , ⌜al0⌝ + ⌜al⌝ ), afrag(AIOAut(astartf, astepf))((⌜asl2⌝ + ⌜as '⌝ + ⌜asl3⌝ ) + ⌜(asl0 + as2 ')[0] '⌝ , ⌜al0⌝ ), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ + ⌜as2 '⌝ , ⌜al⌝ ), afrag(AIOAut(astartf, astepf))(⌜asl2⌝ + ⌜as '⌝ , ⌜al0 to # asl2⌝ ), afrag(AIOAut(astartf, astepf))(⌜as '⌝ + ⌜asl3⌝ + ⌜(asl0 + as2 ')[0] '⌝ , ⌜al0 from # asl2⌝ ), astepf(as2, a, as'), cstepf(cs0, a, cs1), nfwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), r, size10f), r(as', cs1), r((asl0 + as2 ')[0], cs0), ¬ as ∈ asl0, ∀ as0. as0 ∈ asl0 ∨ as0 = as2 → r(as0, cs0), ∀ cs2, a0, cs', as1. r(as1, cs2) ∧ cstepf(cs2, a0, cs') → r(as1, cs') ∧ a0 = τ ∨ (∃ as'. astepf(as1, a0, as') ∧ r(as', cs')) ∨ (∃ as'. astepf(as1, τ, as') ∧ r(as', cs2) ∧ size10f(cs2, a0, cs', as') < size10f(cs2, a0, cs', as1)), ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)), ∀ n. ⌜n⌝ < # ⌜al0⌝ → ⌜al0⌝ [n] = τ, as2 = as'0 ∨ as2 ∈ asl, as'0 ∈ asl2 ∨ as'0 = as ∨ as'0 ∈ asl3 ∨ as'0 ∈ asl0 ∨ as'0 = as2 ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s)

Proof step 93 from proof normedfw-branchingfw-aux (previous step) (back to tree)

asl2 + (as ' + asl3) + asl0 + as2 ' = as'0 ' + asl, ⌜al⌝ ^ = [], al0[# asl2 + n] ≠ τ, a ≠ τ, al0 ≠ [], as ≠ as2, # asl2 < # al0, n + # asl2 < # al0, afrag(AIOAut(astartf, astepf))(⌜as '⌝ + ⌜asl3⌝ + ⌜(asl0 + as2 ')[0] '⌝ , ⌜al0 from # asl2⌝ ), afrag(AIOAut(astartf, astepf))(⌜asl2⌝ + ⌜as '⌝ , ⌜al0 to # asl2⌝ ), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ + ⌜as2 '⌝ , ⌜al⌝ ), afrag(AIOAut(astartf, astepf))((⌜asl2⌝ + ⌜as '⌝ + ⌜asl3⌝ ) + ⌜(asl0 + as2 ')[0] '⌝ , ⌜al0⌝ ), afrag(AIOAut(astartf, astepf))((⌜asl2⌝ + ⌜as '⌝ + ⌜asl3⌝ ) + ⌜asl0⌝ + ⌜as2 '⌝ , ⌜al0⌝ + ⌜al⌝ ), astepf(as2, a, as'), cstepf(cs0, a, cs1), nfwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), r, size10f), r((asl0 + as2 ')[0], cs0), r(as', cs1), ¬ as ∈ asl0, ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)), ∀ cs2, a0, cs', as1. r(as1, cs2) ∧ cstepf(cs2, a0, cs') → r(as1, cs') ∧ a0 = τ ∨ (∃ as'. astepf(as1, a0, as') ∧ r(as', cs')) ∨ (∃ as'. astepf(as1, τ, as') ∧ r(as', cs2) ∧ size10f(cs2, a0, cs', as') < size10f(cs2, a0, cs', as1)), ∀ as0. as0 ∈ asl0 ∨ as0 = as2 → r(as0, cs0), ∀ n0. n0 < # al0 → al0[n0] = τ, as'0 ∈ asl2 ∨ as'0 = as ∨ as'0 ∈ asl3 ∨ as'0 ∈ asl0 ∨ as'0 = as2, as2 = as'0 ∨ as2 ∈ asl ⊦

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 23 terms: n + # asl2

Additional information

Used simplifier rules: c: ⊦ m + n = n + m; from specification nat-basic Used terms: n + # asl2

Proof step 94 from proof normedfw-branchingfw-aux (previous step) (back to tree)

asl1 + asl0 + as2 ' = as'0 ' + asl, ⌜al⌝ ^ = [], ⌜al0⌝ ^ = [], a ≠ τ, afrag(AIOAut(astartf, astepf))(⌜asl0⌝ + ⌜as2 '⌝ , ⌜al⌝ ), afrag(AIOAut(astartf, astepf))(⌜asl1⌝ + ⌜asl0⌝ + ⌜as2 '⌝ , ⌜al0⌝ + ⌜al⌝ ), afrag(AIOAut(astartf, astepf))(⌜asl1⌝ + ⌜(asl0 + as2 ')[0] '⌝ , ⌜al0⌝ ), astepf(as2, a, as'), cstepf(cs0, a, cs1), nfwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), r, size10f), r(as', cs1), r((asl0 + as2 ')[0], cs0), r(as, cs0), ∀ as0. as0 ∈ asl0 ∨ as0 = as2 → r(as0, cs0), ∀ cs2, a0, cs', as1. r(as1, cs2) ∧ cstepf(cs2, a0, cs') → r(as1, cs') ∧ a0 = τ ∨ (∃ as'. astepf(as1, a0, as') ∧ r(as', cs')) ∨ (∃ as'. astepf(as1, τ, as') ∧ r(as', cs2) ∧ size10f(cs2, a0, cs', as') < size10f(cs2, a0, cs', as1)), ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)), as2 = as'0 ∨ as2 ∈ asl, as'0 ∈ asl1 ∨ as'0 ∈ asl0 ∨ as'0 = as2, as ∈ asl1 ∨ as ∈ asl0 ∨ as = as2 ⊦ ∃ as0. amove(AIOAut(astartf, astepf))(as, [], as0) ∧ r(as0, cs0)

Heuristic quantifier closing applied rule exists right

And closed the goal!

Rule argument

pos: right 1 terms: as

Additional information

Used simplifier rules: ⊦ amove(AIOAut(startf, stepf))(s, [], s); (s) Used terms: as

Proof step 95 from proof normedfw-branchingfw-aux (previous step) (back to tree)

asl1 + asl0 + as2 ' = as'0 ' + asl, ⌜al0⌝ ^ = [], ⌜al⌝ ^ = [], a ≠ τ, afrag(AIOAut(astartf, astepf))(⌜asl1⌝ + ⌜(asl0 + as2 ')[0] '⌝ , ⌜al0⌝ ), afrag(AIOAut(astartf, astepf))(⌜asl1⌝ + ⌜asl0⌝ + ⌜as2 '⌝ , ⌜al0⌝ + ⌜al⌝ ), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ + ⌜as2 '⌝ , ⌜al⌝ ), astepf(as2, a, as'), cstepf(cs0, a, cs1), nfwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), r, size10f), r((asl0 + as2 ')[0], cs0), r(as', cs1), ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)), ∀ cs2, a0, cs', as1. r(as1, cs2) ∧ cstepf(cs2, a0, cs') → r(as1, cs') ∧ a0 = τ ∨ (∃ as'. astepf(as1, a0, as') ∧ r(as', cs')) ∨ (∃ as'. astepf(as1, τ, as') ∧ r(as', cs2) ∧ size10f(cs2, a0, cs', as') < size10f(cs2, a0, cs', as1)), ∀ as0. as0 ∈ asl0 ∨ as0 = as2 → r(as0, cs0), as'0 ∈ asl1 ∨ as'0 ∈ asl0 ∨ as'0 = as2, as2 = as'0 ∨ as2 ∈ asl ⊦ ∃ as0. amove(AIOAut(astartf, astepf))(as', [], as0) ∧ r(as0, cs1)

Heuristic quantifier closing applied rule exists right

And closed the goal!

Rule argument

pos: right 1 terms: as'

Additional information

Used simplifier rules: ⊦ amove(AIOAut(startf, stepf))(s, [], s); (s) Used terms: as'

Proof Tree for normedfw-branchingfw-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