| ⊦ C_≡T_A(infguess(IOAut(startf, stepf)), IOAut(startf, stepf)) |
¬ C_≡T_A(infguess(IOAut(startf, stepf)), IOAut(startf, stepf)) ⊦
| ¬ C_≡T_A(infguess(IOAut(startf, stepf)), IOAut(startf, stepf)) ⊦ |
⊦ C_≤T_A(infguess(IOAut(startf, stepf)), IOAut(startf, stepf))
C_≤T_A(infguess(IOAut(startf, stepf)), IOAut(startf, stepf)), ¬ C_≡T_A(infguess(IOAut(startf, stepf)), IOAut(startf, stepf)) ⊦
Used terms: startf, stepf
| ⊦ C_≤T_A(infguess(IOAut(startf, stepf)), IOAut(startf, stepf)) |
| C_≤T_A(infguess(IOAut(startf, stepf)), IOAut(startf, stepf)), ¬ C_≡T_A(infguess(IOAut(startf, stepf)), IOAut(startf, stepf)) ⊦ |
⊦ infguess(IOAut(startf, stepf)) = EXIOAut (λ σα. exec(IOAut(startf, stepf))(σα.1, σα.2), λ σα, a, σα0. σα.1 ≠ [] ∧ σα.2 ≠ [] ∧ σα0.1 ≠ [] ∧ stepf(hd(σα.1), a, hd(σα0.1)) ∧ hd(σα.2) = a ∧ σα0 = tl(σα.1) × tl(σα.2))
C_≤T_A (EXIOAut (λ σα. exec(IOAut(startf, stepf))(σα.1, σα.2), λ σα, a, σα0. σα.1 ≠ [] ∧ σα.2 ≠ [] ∧ σα0.1 ≠ [] ∧ stepf(hd(σα.1), a, hd(σα0.1)) ∧ hd(σα.2) = a ∧ σα0 = tl(σα.1) × tl(σα.2)), IOAut(startf, stepf)), ¬ C_≡T_A (EXIOAut (λ σα. exec(IOAut(startf, stepf))(σα.1, σα.2), λ σα, a, σα0. σα.1 ≠ [] ∧ σα.2 ≠ [] ∧ σα0.1 ≠ [] ∧ stepf(hd(σα.1), a, hd(σα0.1)) ∧ hd(σα.2) = a ∧ σα0 = tl(σα.1) × tl(σα.2)), IOAut(startf, stepf)) ⊦
Used terms: stepf, startf
| ⊦ infguess(IOAut(startf, stepf)) = EXIOAut (λ σα. exec(IOAut(startf, stepf))(σα.1, σα.2), λ σα, a, σα0. σα.1 ≠ [] ∧ σα.2 ≠ [] ∧ σα0.1 ≠ [] ∧ stepf(hd(σα.1), a, hd(σα0.1)) ∧ hd(σα.2) = a ∧ σα0 = tl(σα.1) × tl(σα.2)) |
| C_≤T_A (EXIOAut (λ σα. exec(IOAut(startf, stepf))(σα.1, σα.2), λ σα, a, σα0. σα.1 ≠ [] ∧ σα.2 ≠ [] ∧ σα0.1 ≠ [] ∧ stepf(hd(σα.1), a, hd(σα0.1)) ∧ hd(σα.2) = a ∧ σα0 = tl(σα.1) × tl(σα.2)), IOAut(startf, stepf)), ¬ C_≡T_A (EXIOAut (λ σα. exec(IOAut(startf, stepf))(σα.1, σα.2), λ σα, a, σα0. σα.1 ≠ [] ∧ σα.2 ≠ [] ∧ σα0.1 ≠ [] ∧ stepf(hd(σα.1), a, hd(σα0.1)) ∧ hd(σα.2) = a ∧ σα0 = tl(σα.1) × tl(σα.2)), IOAut(startf, stepf)) ⊦ |
C_≤T_A (EXIOAut (λ σα. frag(IOAut(startf, stepf))(σα.1, σα.2) ∧ startf(σα.1[0]), λ σα, a, σα0. σα.1 ≠ [] ∧ σα.2 ≠ [] ∧ tl(σα.1) ≠ [] ∧ stepf(hd(σα.1), hd(σα.2), hd(tl(σα.1))) ∧ hd(σα.2) = a ∧ σα0 = tl(σα.1) × tl(σα.2)), IOAut(startf, stepf)), ¬ A_≤T_C (IOAut(startf, stepf), EXIOAut (λ σα. frag(IOAut(startf, stepf))(σα.1, σα.2) ∧ startf(σα.1[0]), λ σα, a, σα0. σα.1 ≠ [] ∧ σα.2 ≠ [] ∧ tl(σα.1) ≠ [] ∧ stepf(hd(σα.1), hd(σα.2), hd(tl(σα.1))) ∧ hd(σα.2) = a ∧ σα0 = tl(σα.1) × tl(σα.2))) ⊦
Used simplifier rules: ⊦ C_≡T_A(EXIOAut(cstartf, cstepf), IOAut(astartf, astepf)) ↔ C_≤T_A(EXIOAut(cstartf, cstepf), IOAut(astartf, astepf)) ∧ A_≤T_C(IOAut(astartf, astepf), EXIOAut(cstartf, cstepf)); (ws) ⊦ (σ × α).1 = σ; (s) ⊦ exec(IOAut(startf, stepf))(σ, β) ↔ frag(IOAut(startf, stepf))(σ, β) ∧ startf(σ[0]); (s)
| C_≤T_A (EXIOAut (λ σα. frag(IOAut(startf, stepf))(σα.1, σα.2) ∧ startf(σα.1[0]), λ σα, a, σα0. σα.1 ≠ [] ∧ σα.2 ≠ [] ∧ tl(σα.1) ≠ [] ∧ stepf(hd(σα.1), hd(σα.2), hd(tl(σα.1))) ∧ hd(σα.2) = a ∧ σα0 = tl(σα.1) × tl(σα.2)), IOAut(startf, stepf)), ¬ A_≤T_C (IOAut(startf, stepf), EXIOAut (λ σα. frag(IOAut(startf, stepf))(σα.1, σα.2) ∧ startf(σα.1[0]), λ σα, a, σα0. σα.1 ≠ [] ∧ σα.2 ≠ [] ∧ tl(σα.1) ≠ [] ∧ stepf(hd(σα.1), hd(σα.2), hd(tl(σα.1))) ∧ hd(σα.2) = a ∧ σα0 = tl(σα.1) × tl(σα.2))) ⊦ |
¬ A_≤T_C (IOAut(startf, stepf), EXIOAut (λ σα. frag(IOAut(startf, stepf))(σα.1, σα.2) ∧ startf(σα.1[0]), λ σα, a, σα0. σα.1 ≠ [] ∧ σα.2 ≠ [] ∧ tl(σα.1) ≠ [] ∧ stepf(hd(σα.1), hd(σα.2), hd(tl(σα.1))) ∧ hd(σα.2) = a ∧ σα0 = tl(σα.1) × tl(σα.2))) ⊦
| ¬ A_≤T_C (IOAut(startf, stepf), EXIOAut (λ σα. frag(IOAut(startf, stepf))(σα.1, σα.2) ∧ startf(σα.1[0]), λ σα, a, σα0. σα.1 ≠ [] ∧ σα.2 ≠ [] ∧ tl(σα.1) ≠ [] ∧ stepf(hd(σα.1), hd(σα.2), hd(tl(σα.1))) ∧ hd(σα.2) = a ∧ σα0 = tl(σα.1) × tl(σα.2))) ⊦ |
⊦ A_≤T_C(IOAut(astartf, astepf), EXIOAut(cstartf, cstepf)) ↔ (∀ α. trace(IOAut(astartf, astepf))(α) → extrace(EXIOAut(cstartf, cstepf))(α))
∃ α. ¬ ( trace(IOAut(startf, stepf))(α) → extrace (EXIOAut (λ σα. frag(IOAut(startf, stepf))(σα.1, σα.2) ∧ startf(σα.1[0]), λ σα, a, σα0. σα.1 ≠ [] ∧ σα.2 ≠ [] ∧ tl(σα.1) ≠ [] ∧ stepf(hd(σα.1), hd(σα.2), hd(tl(σα.1))) ∧ hd(σα.2) = a ∧ σα0 = tl(σα.1) × tl(σα.2))) (α)) ⊦
Used terms: λ σα, a, σα0. σα.1 ≠ [] ∧ σα.2 ≠ [] ∧ tl(σα.1) ≠ [] ∧ stepf(hd(σα.1), hd(σα.2), hd(tl(σα.1))) ∧ hd(σα.2) = a ∧ σα0 = tl(σα.1) × tl(σα.2), λ σα. frag(IOAut(startf, stepf))(σα.1, σα.2) ∧ startf(σα.1[0]), stepf, startf
| ⊦ A_≤T_C(IOAut(astartf, astepf), EXIOAut(cstartf, cstepf)) ↔ (∀ α. trace(IOAut(astartf, astepf))(α) → extrace(EXIOAut(cstartf, cstepf))(α)) |
| ∃ α. ¬ ( trace(IOAut(startf, stepf))(α) → extrace (EXIOAut (λ σα. frag(IOAut(startf, stepf))(σα.1, σα.2) ∧ startf(σα.1[0]), λ σα, a, σα0. σα.1 ≠ [] ∧ σα.2 ≠ [] ∧ tl(σα.1) ≠ [] ∧ stepf(hd(σα.1), hd(σα.2), hd(tl(σα.1))) ∧ hd(σα.2) = a ∧ σα0 = tl(σα.1) × tl(σα.2))) (α)) ⊦ |
trace(IOAut(startf, stepf))(α), ¬ extrace (EXIOAut (λ σα. frag(IOAut(startf, stepf))(σα.1, σα.2) ∧ startf(σα.1[0]), λ σα, a, σα0. σα.1 ≠ [] ∧ σα.2 ≠ [] ∧ tl(σα.1) ≠ [] ∧ stepf(hd(σα.1), hd(σα.2), hd(tl(σα.1))) ∧ hd(σα.2) = a ∧ σα0 = tl(σα.1) × tl(σα.2))) (α) ⊦
| trace(IOAut(startf, stepf))(α), ¬ extrace (EXIOAut (λ σα. frag(IOAut(startf, stepf))(σα.1, σα.2) ∧ startf(σα.1[0]), λ σα, a, σα0. σα.1 ≠ [] ∧ σα.2 ≠ [] ∧ tl(σα.1) ≠ [] ∧ stepf(hd(σα.1), hd(σα.2), hd(tl(σα.1))) ∧ hd(σα.2) = a ∧ σα0 = tl(σα.1) × tl(σα.2))) (α) ⊦ |
⊦ extrace(EXIOAut(startf, stepf))(α) ↔ (∃ σ, β. α = β ^ ∧ exexec(EXIOAut(startf, stepf))(σ, β))
trace(IOAut(startf, stepf))(α), ∀ _σ, β. ¬ ( α = β ^ ∧ exexec (EXIOAut (λ σα. frag(IOAut(startf, stepf))(σα.1, σα.2) ∧ startf(σα.1[0]), λ σα, a, σα0. σα.1 ≠ [] ∧ σα.2 ≠ [] ∧ tl(σα.1) ≠ [] ∧ stepf(hd(σα.1), hd(σα.2), hd(tl(σα.1))) ∧ hd(σα.2) = a ∧ σα0 = tl(σα.1) × tl(σα.2))) (_σ, β)) ⊦
Used terms: α, λ σα, a, σα0. σα.1 ≠ [] ∧ σα.2 ≠ [] ∧ tl(σα.1) ≠ [] ∧ stepf(hd(σα.1), hd(σα.2), hd(tl(σα.1))) ∧ hd(σα.2) = a ∧ σα0 = tl(σα.1) × tl(σα.2), λ σα. frag(IOAut(startf, stepf))(σα.1, σα.2) ∧ startf(σα.1[0])
| ⊦ extrace(EXIOAut(startf, stepf))(α) ↔ (∃ σ, β. α = β ^ ∧ exexec(EXIOAut(startf, stepf))(σ, β)) |
| trace(IOAut(startf, stepf))(α), ∀ _σ, β. ¬ ( α = β ^ ∧ exexec (EXIOAut (λ σα. frag(IOAut(startf, stepf))(σα.1, σα.2) ∧ startf(σα.1[0]), λ σα, a, σα0. σα.1 ≠ [] ∧ σα.2 ≠ [] ∧ tl(σα.1) ≠ [] ∧ stepf(hd(σα.1), hd(σα.2), hd(tl(σα.1))) ∧ hd(σα.2) = a ∧ σα0 = tl(σα.1) × tl(σα.2))) (_σ, β)) ⊦ |
trace(IOAut(startf, stepf))(α), ∀ _σ, β. α ≠ β ^ ∨ ¬ exfrag (EXIOAut (λ σα. frag(IOAut(startf, stepf))(σα.1, σα.2) ∧ startf(σα.1[0]), λ σα, a, σα0. σα.1 ≠ [] ∧ σα.2 ≠ [] ∧ tl(σα.1) ≠ [] ∧ stepf(hd(σα.1), hd(σα.2), hd(tl(σα.1))) ∧ hd(σα.2) = a ∧ σα0 = tl(σα.1) × tl(σα.2))) (_σ, β) ∨ ¬ frag(IOAut(startf, stepf))(_σ[0].1, _σ[0].2) ∨ ¬ startf(_σ[0].1[0]) ⊦
Used simplifier rules: ⊦ exexec(EXIOAut(startf, stepf))(σ, β) ↔ exfrag(EXIOAut(startf, stepf))(σ, β) ∧ startf(σ[0]); (s)
| trace(IOAut(startf, stepf))(α), ∀ _σ, β. α ≠ β ^ ∨ ¬ exfrag (EXIOAut (λ σα. frag(IOAut(startf, stepf))(σα.1, σα.2) ∧ startf(σα.1[0]), λ σα, a, σα0. σα.1 ≠ [] ∧ σα.2 ≠ [] ∧ tl(σα.1) ≠ [] ∧ stepf(hd(σα.1), hd(σα.2), hd(tl(σα.1))) ∧ hd(σα.2) = a ∧ σα0 = tl(σα.1) × tl(σα.2))) (_σ, β) ∨ ¬ frag(IOAut(startf, stepf))(_σ[0].1, _σ[0].2) ∨ ¬ startf(_σ[0].1[0]) ⊦ |
⊦ trace(IOAut(startf, stepf))(α) ↔ (∃ σ, β. α = β ^ ∧ exec(IOAut(startf, stepf))(σ, β))
∀ _σ, β. α ≠ β ^ ∨ ¬ exfrag (EXIOAut (λ σα. frag(IOAut(startf, stepf))(σα.1, σα.2) ∧ startf(σα.1[0]), λ σα, a, σα0. σα.1 ≠ [] ∧ σα.2 ≠ [] ∧ tl(σα.1) ≠ [] ∧ stepf(hd(σα.1), hd(σα.2), hd(tl(σα.1))) ∧ hd(σα.2) = a ∧ σα0 = tl(σα.1) × tl(σα.2))) (_σ, β) ∨ ¬ frag(IOAut(startf, stepf))(_σ[0].1, _σ[0].2) ∨ ¬ startf(_σ[0].1[0]), ∃ σ, β. α = β ^ ∧ exec(IOAut(startf, stepf))(σ, β) ⊦
Used terms: α, stepf, startf
| ⊦ trace(IOAut(startf, stepf))(α) ↔ (∃ σ, β. α = β ^ ∧ exec(IOAut(startf, stepf))(σ, β)) |
| ∀ _σ, β. α ≠ β ^ ∨ ¬ exfrag (EXIOAut (λ σα. frag(IOAut(startf, stepf))(σα.1, σα.2) ∧ startf(σα.1[0]), λ σα, a, σα0. σα.1 ≠ [] ∧ σα.2 ≠ [] ∧ tl(σα.1) ≠ [] ∧ stepf(hd(σα.1), hd(σα.2), hd(tl(σα.1))) ∧ hd(σα.2) = a ∧ σα0 = tl(σα.1) × tl(σα.2))) (_σ, β) ∨ ¬ frag(IOAut(startf, stepf))(_σ[0].1, _σ[0].2) ∨ ¬ startf(_σ[0].1[0]), ∃ σ, β. α = β ^ ∧ exec(IOAut(startf, stepf))(σ, β) ⊦ |
frag(IOAut(startf, stepf))(σ, α0), startf(σ[0]), ∀ _σ, β. α0 ^ ≠ β ^ ∨ ¬ exfrag (EXIOAut (λ σα. frag(IOAut(startf, stepf))(σα.1, σα.2) ∧ startf(σα.1[0]), λ σα, a, σα0. σα.1 ≠ [] ∧ σα.2 ≠ [] ∧ tl(σα.1) ≠ [] ∧ stepf(hd(σα.1), hd(σα.2), hd(tl(σα.1))) ∧ hd(σα.2) = a ∧ σα0 = tl(σα.1) × tl(σα.2))) (_σ, β) ∨ ¬ frag(IOAut(startf, stepf))(_σ[0].1, _σ[0].2) ∨ ¬ startf(_σ[0].1[0]) ⊦
Used simplifier rules: ⊦ exec(IOAut(startf, stepf))(σ, β) ↔ frag(IOAut(startf, stepf))(σ, β) ∧ startf(σ[0]); (s)
| frag(IOAut(startf, stepf))(σ, α0), startf(σ[0]), ∀ _σ, β. α0 ^ ≠ β ^ ∨ ¬ exfrag (EXIOAut (λ σα. frag(IOAut(startf, stepf))(σα.1, σα.2) ∧ startf(σα.1[0]), λ σα, a, σα0. σα.1 ≠ [] ∧ σα.2 ≠ [] ∧ tl(σα.1) ≠ [] ∧ stepf(hd(σα.1), hd(σα.2), hd(tl(σα.1))) ∧ hd(σα.2) = a ∧ σα0 = tl(σα.1) × tl(σα.2))) (_σ, β) ∨ ¬ frag(IOAut(startf, stepf))(_σ[0].1, _σ[0].2) ∨ ¬ startf(_σ[0].1[0]) ⊦ |
σ = ⌜sl0⌝ , frag(IOAut(startf, stepf))(σ, α0), startf(σ[0]), ∀ _σ, β. α0 ^ ≠ β ^ ∨ ¬ exfrag (EXIOAut (λ σα. frag(IOAut(startf, stepf))(σα.1, σα.2) ∧ startf(σα.1[0]), λ σα, a, σα0. σα.1 ≠ [] ∧ σα.2 ≠ [] ∧ tl(σα.1) ≠ [] ∧ stepf(hd(σα.1), hd(σα.2), hd(tl(σα.1))) ∧ hd(σα.2) = a ∧ σα0 = tl(σα.1) × tl(σα.2))) (_σ, β) ∨ ¬ frag(IOAut(startf, stepf))(_σ[0].1, _σ[0].2) ∨ ¬ startf(_σ[0].1[0]) ⊦
σ = ⌜sf0⌝ , frag(IOAut(startf, stepf))(σ, α0), startf(σ[0]), ∀ _σ, β. α0 ^ ≠ β ^ ∨ ¬ exfrag (EXIOAut (λ σα. frag(IOAut(startf, stepf))(σα.1, σα.2) ∧ startf(σα.1[0]), λ σα, a, σα0. σα.1 ≠ [] ∧ σα.2 ≠ [] ∧ tl(σα.1) ≠ [] ∧ stepf(hd(σα.1), hd(σα.2), hd(tl(σα.1))) ∧ hd(σα.2) = a ∧ σα0 = tl(σα.1) × tl(σα.2))) (_σ, β) ∨ ¬ frag(IOAut(startf, stepf))(_σ[0].1, _σ[0].2) ∨ ¬ startf(_σ[0].1[0]) ⊦
Used simplifier rules: statestream freely generated by ⌜ ⌝, ⌜ ⌝;;
| σ = ⌜sl0⌝ , frag(IOAut(startf, stepf))(σ, α0), startf(σ[0]), ∀ _σ, β. α0 ^ ≠ β ^ ∨ ¬ exfrag (EXIOAut (λ σα. frag(IOAut(startf, stepf))(σα.1, σα.2) ∧ startf(σα.1[0]), λ σα, a, σα0. σα.1 ≠ [] ∧ σα.2 ≠ [] ∧ tl(σα.1) ≠ [] ∧ stepf(hd(σα.1), hd(σα.2), hd(tl(σα.1))) ∧ hd(σα.2) = a ∧ σα0 = tl(σα.1) × tl(σα.2))) (_σ, β) ∨ ¬ frag(IOAut(startf, stepf))(_σ[0].1, _σ[0].2) ∨ ¬ startf(_σ[0].1[0]) ⊦ |
frag(IOAut(startf, stepf))(⌜sl0⌝ , α0), startf(sl0[0]), ∀ _σ, β. α0 ^ ≠ β ^ ∨ ¬ exfrag (EXIOAut (λ σα. frag(IOAut(startf, stepf))(σα.1, σα.2) ∧ startf(σα.1[0]), λ σα, a, σα0. σα.1 ≠ [] ∧ σα.2 ≠ [] ∧ tl(σα.1) ≠ [] ∧ stepf(hd(σα.1), hd(σα.2), hd(tl(σα.1))) ∧ hd(σα.2) = a ∧ σα0 = tl(σα.1) × tl(σα.2))) (_σ, β) ∨ ¬ frag(IOAut(startf, stepf))(_σ[0].1, _σ[0].2) ∨ ¬ startf(_σ[0].1[0]) ⊦
Used simplifier rules: ⊦ ⌜x⌝ [n] = x[n]; (s)
| frag(IOAut(startf, stepf))(⌜sl0⌝ , α0), startf(sl0[0]), ∀ _σ, β. α0 ^ ≠ β ^ ∨ ¬ exfrag (EXIOAut (λ σα. frag(IOAut(startf, stepf))(σα.1, σα.2) ∧ startf(σα.1[0]), λ σα, a, σα0. σα.1 ≠ [] ∧ σα.2 ≠ [] ∧ tl(σα.1) ≠ [] ∧ stepf(hd(σα.1), hd(σα.2), hd(tl(σα.1))) ∧ hd(σα.2) = a ∧ σα0 = tl(σα.1) × tl(σα.2))) (_σ, β) ∨ ¬ frag(IOAut(startf, stepf))(_σ[0].1, _σ[0].2) ∨ ¬ startf(_σ[0].1[0]) ⊦ |
frag(IOAut(startf, stepf))(⌜sl0⌝ , α0), startf(sl0[0]), α0 ^ ≠ α0 ^ ∨ ¬ exfrag (EXIOAut (λ σα. frag(IOAut(startf, stepf))(σα.1, σα.2) ∧ startf(σα.1[0]), λ σα, a, σα0. σα.1 ≠ [] ∧ σα.2 ≠ [] ∧ tl(σα.1) ≠ [] ∧ stepf(hd(σα.1), hd(σα.2), hd(tl(σα.1))) ∧ hd(σα.2) = a ∧ σα0 = tl(σα.1) × tl(σα.2))) (⌜λ n. (⌜sl0⌝ from n) × (α0 from n)⌝ to # sl0, α0) ∨ ¬ frag(IOAut(startf, stepf))((⌜λ n. (⌜sl0⌝ from n) × (α0 from n)⌝ to # sl0)[0].1, (⌜λ n. (⌜sl0⌝ from n) × (α0 from n)⌝ to # sl0)[0].2) ∨ ¬ startf((⌜λ n. (⌜sl0⌝ from n) × (α0 from n)⌝ to # sl0)[0].1[0]) ⊦
Used terms: ⌜λ n. (⌜sl0⌝ from n) × (α0 from n)⌝ to # sl0, α0
| frag(IOAut(startf, stepf))(⌜sl0⌝ , α0), startf(sl0[0]), α0 ^ ≠ α0 ^ ∨ ¬ exfrag (EXIOAut (λ σα. frag(IOAut(startf, stepf))(σα.1, σα.2) ∧ startf(σα.1[0]), λ σα, a, σα0. σα.1 ≠ [] ∧ σα.2 ≠ [] ∧ tl(σα.1) ≠ [] ∧ stepf(hd(σα.1), hd(σα.2), hd(tl(σα.1))) ∧ hd(σα.2) = a ∧ σα0 = tl(σα.1) × tl(σα.2))) (⌜λ n. (⌜sl0⌝ from n) × (α0 from n)⌝ to # sl0, α0) ∨ ¬ frag(IOAut(startf, stepf))((⌜λ n. (⌜sl0⌝ from n) × (α0 from n)⌝ to # sl0)[0].1, (⌜λ n. (⌜sl0⌝ from n) × (α0 from n)⌝ to # sl0)[0].2) ∨ ¬ startf((⌜λ n. (⌜sl0⌝ from n) × (α0 from n)⌝ to # sl0)[0].1[0]) ⊦ |
frag(IOAut(startf, stepf))(⌜sl0⌝ , α0), startf(sl0[0]), ¬ exfrag (EXIOAut (λ σα. frag(IOAut(startf, stepf))(σα.1, σα.2) ∧ startf(σα.1[0]), λ σα, a, σα0. σα.1 ≠ [] ∧ σα.2 ≠ [] ∧ tl(σα.1) ≠ [] ∧ stepf(hd(σα.1), hd(σα.2), hd(tl(σα.1))) ∧ hd(σα.2) = a ∧ σα0 = tl(σα.1) × tl(σα.2))) (⌜(λ n. ⌜sl0 from n⌝ × (α0 from n)) to # sl0⌝ , α0) ⊦
Used simplifier rules: ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ (σ × α).1 = σ; (s) ⊦ σ from 0 = σ; (s) ⊦ x from 0 = x; (s) m < n ⊦ (nf to n)[m] = nf(m); (s) ⊦ ¬ exfrag(EXIOAut(startf, stepf))([], α); (s) ⊦ ⌜[]⌝ = []; (s) ⊦ nf to 0 = []; (s) ⊦ # [] = 0; (s) ⊦ # x = 0 ↔ x = []; (s) ⊦ 0 < m ↔ m ≠ 0; (s) ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ ⌜nf⌝ to n = ⌜nf to n⌝ ; (s) ⊦ ⌜x⌝ from n = ⌜x from n⌝ ; (s) ⊦ (σ × α).2 = α; (s)
| frag(IOAut(startf, stepf))(⌜sl0⌝ , α0), startf(sl0[0]), ¬ exfrag (EXIOAut (λ σα. frag(IOAut(startf, stepf))(σα.1, σα.2) ∧ startf(σα.1[0]), λ σα, a, σα0. σα.1 ≠ [] ∧ σα.2 ≠ [] ∧ tl(σα.1) ≠ [] ∧ stepf(hd(σα.1), hd(σα.2), hd(tl(σα.1))) ∧ hd(σα.2) = a ∧ σα0 = tl(σα.1) × tl(σα.2))) (⌜(λ n. ⌜sl0 from n⌝ × (α0 from n)) to # sl0⌝ , α0) ⊦ |
⊦ exfrag(EXIOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1]))
frag(IOAut(startf, stepf))(⌜sl0⌝ , α0), startf(sl0[0]), # ⌜(λ n. ⌜sl0 from n⌝ × (α0 from n)) to # sl0⌝ ≠ # α0 + ⌜1⌝ ∨ (∃ n. ¬ ( ⌜n⌝ < # α0 → ⌜(λ n. ⌜sl0 from n⌝ × (α0 from n)) to # sl0⌝ [n].1 ≠ [] ∧ ⌜(λ n. ⌜sl0 from n⌝ × (α0 from n)) to # sl0⌝ [n].2 ≠ [] ∧ tl(⌜(λ n. ⌜sl0 from n⌝ × (α0 from n)) to # sl0⌝ [n].1) ≠ [] ∧ stepf (hd(⌜(λ n. ⌜sl0 from n⌝ × (α0 from n)) to # sl0⌝ [n].1), hd(⌜(λ n. ⌜sl0 from n⌝ × (α0 from n)) to # sl0⌝ [n].2), hd(tl(⌜(λ n. ⌜sl0 from n⌝ × (α0 from n)) to # sl0⌝ [n].1))) ∧ hd(⌜(λ n. ⌜sl0 from n⌝ × (α0 from n)) to # sl0⌝ [n].2) = α0[n] ∧ ⌜(λ n. ⌜sl0 from n⌝ × (α0 from n)) to # sl0⌝ [n +1] = tl(⌜(λ n. ⌜sl0 from n⌝ × (α0 from n)) to # sl0⌝ [n].1) × tl(⌜(λ n. ⌜sl0 from n⌝ × (α0 from n)) to # sl0⌝ [n].2))) ⊦
Used terms: α0, ⌜(λ n. ⌜sl0 from n⌝ × (α0 from n)) to # sl0⌝ , λ σα, a, σα0. σα.1 ≠ [] ∧ σα.2 ≠ [] ∧ tl(σα.1) ≠ [] ∧ stepf(hd(σα.1), hd(σα.2), hd(tl(σα.1))) ∧ hd(σα.2) = a ∧ σα0 = tl(σα.1) × tl(σα.2), λ σα. frag(IOAut(startf, stepf))(σα.1, σα.2) ∧ startf(σα.1[0])
| ⊦ exfrag(EXIOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1])) |
| frag(IOAut(startf, stepf))(⌜sl0⌝ , α0), startf(sl0[0]), # ⌜(λ n. ⌜sl0 from n⌝ × (α0 from n)) to # sl0⌝ ≠ # α0 + ⌜1⌝ ∨ (∃ n. ¬ ( ⌜n⌝ < # α0 → ⌜(λ n. ⌜sl0 from n⌝ × (α0 from n)) to # sl0⌝ [n].1 ≠ [] ∧ ⌜(λ n. ⌜sl0 from n⌝ × (α0 from n)) to # sl0⌝ [n].2 ≠ [] ∧ tl(⌜(λ n. ⌜sl0 from n⌝ × (α0 from n)) to # sl0⌝ [n].1) ≠ [] ∧ stepf (hd(⌜(λ n. ⌜sl0 from n⌝ × (α0 from n)) to # sl0⌝ [n].1), hd(⌜(λ n. ⌜sl0 from n⌝ × (α0 from n)) to # sl0⌝ [n].2), hd(tl(⌜(λ n. ⌜sl0 from n⌝ × (α0 from n)) to # sl0⌝ [n].1))) ∧ hd(⌜(λ n. ⌜sl0 from n⌝ × (α0 from n)) to # sl0⌝ [n].2) = α0[n] ∧ ⌜(λ n. ⌜sl0 from n⌝ × (α0 from n)) to # sl0⌝ [n +1] = tl(⌜(λ n. ⌜sl0 from n⌝ × (α0 from n)) to # sl0⌝ [n].1) × tl(⌜(λ n. ⌜sl0 from n⌝ × (α0 from n)) to # sl0⌝ [n].2))) ⊦ |
frag(IOAut(startf, stepf))(⌜sl0⌝ , α0), startf(sl0[0]), ⌜# sl0⌝ ≠ # α0 + ⌜1⌝ ∨ ¬ ( ⌜n⌝ < # α0 → ((λ n. ⌜sl0 from n⌝ × (α0 from n)) to # sl0)[n].1 ≠ [] ∧ ((λ n. ⌜sl0 from n⌝ × (α0 from n)) to # sl0)[n].2 ≠ [] ∧ tl(((λ n. ⌜sl0 from n⌝ × (α0 from n)) to # sl0)[n].1) ≠ [] ∧ stepf (hd(((λ n. ⌜sl0 from n⌝ × (α0 from n)) to # sl0)[n].1), hd(((λ n. ⌜sl0 from n⌝ × (α0 from n)) to # sl0)[n].2), hd(tl(((λ n. ⌜sl0 from n⌝ × (α0 from n)) to # sl0)[n].1))) ∧ hd(((λ n. ⌜sl0 from n⌝ × (α0 from n)) to # sl0)[n].2) = α0[n] ∧ ((λ n. ⌜sl0 from n⌝ × (α0 from n)) to # sl0)[n + 1] = tl(((λ n. ⌜sl0 from n⌝ × (α0 from n)) to # sl0)[n].1) × tl(((λ n. ⌜sl0 from n⌝ × (α0 from n)) to # sl0)[n].2)) ⊦
Used simplifier rules: ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ m +1 = m + 1; (s) ⊦ # ⌜nf to n⌝ = ⌜n⌝ ; (s)
| frag(IOAut(startf, stepf))(⌜sl0⌝ , α0), startf(sl0[0]), ⌜# sl0⌝ ≠ # α0 + ⌜1⌝ ∨ ¬ ( ⌜n⌝ < # α0 → ((λ n. ⌜sl0 from n⌝ × (α0 from n)) to # sl0)[n].1 ≠ [] ∧ ((λ n. ⌜sl0 from n⌝ × (α0 from n)) to # sl0)[n].2 ≠ [] ∧ tl(((λ n. ⌜sl0 from n⌝ × (α0 from n)) to # sl0)[n].1) ≠ [] ∧ stepf (hd(((λ n. ⌜sl0 from n⌝ × (α0 from n)) to # sl0)[n].1), hd(((λ n. ⌜sl0 from n⌝ × (α0 from n)) to # sl0)[n].2), hd(tl(((λ n. ⌜sl0 from n⌝ × (α0 from n)) to # sl0)[n].1))) ∧ hd(((λ n. ⌜sl0 from n⌝ × (α0 from n)) to # sl0)[n].2) = α0[n] ∧ ((λ n. ⌜sl0 from n⌝ × (α0 from n)) to # sl0)[n + 1] = tl(((λ n. ⌜sl0 from n⌝ × (α0 from n)) to # sl0)[n].1) × tl(((λ n. ⌜sl0 from n⌝ × (α0 from n)) to # sl0)[n].2)) ⊦ |
((λ n. ⌜sl0 from n⌝ × (α0 from n)) to # sl0)[n] = σ × α, frag(IOAut(startf, stepf))(⌜sl0⌝ , α0), startf(sl0[0]), ⌜# sl0⌝ ≠ # α0 + ⌜1⌝ ∨ ¬ ( ⌜n⌝ < # α0 → σ ≠ [] ∧ α ≠ [] ∧ tl(σ) ≠ [] ∧ stepf(hd(σ), hd(α), hd(tl(σ))) ∧ hd(α) = α0[n] ∧ ((λ n. ⌜sl0 from n⌝ × (α0 from n)) to # sl0)[n + 1] = tl(σ) × tl(α)) ⊦
Used simplifier rules: ⊦ σ = σα.1 ∧ α = σα.2 ↔ σα = σ × α; (elim) Used terms: ((λ n. ⌜sl0 from n⌝ × (α0 from n)) to # sl0)[n], σ, α
| ((λ n. ⌜sl0 from n⌝ × (α0 from n)) to # sl0)[n] = σ × α, frag(IOAut(startf, stepf))(⌜sl0⌝ , α0), startf(sl0[0]), ⌜# sl0⌝ ≠ # α0 + ⌜1⌝ ∨ ¬ ( ⌜n⌝ < # α0 → σ ≠ [] ∧ α ≠ [] ∧ tl(σ) ≠ [] ∧ stepf(hd(σ), hd(α), hd(tl(σ))) ∧ hd(α) = α0[n] ∧ ((λ n. ⌜sl0 from n⌝ × (α0 from n)) to # sl0)[n + 1] = tl(σ) × tl(α)) ⊦ |
((λ n. ⌜sl0 from n⌝ × (α0 from n)) to # sl0)[n] = σ × α, α0 = ⌜al0⌝ , frag(IOAut(startf, stepf))(⌜sl0⌝ , α0), startf(sl0[0]), ⌜# sl0⌝ ≠ # α0 + ⌜1⌝ ∨ ¬ ( ⌜n⌝ < # α0 → σ ≠ [] ∧ α ≠ [] ∧ tl(σ) ≠ [] ∧ stepf(hd(σ), hd(α), hd(tl(σ))) ∧ hd(α) = α0[n] ∧ ((λ n. ⌜sl0 from n⌝ × (α0 from n)) to # sl0)[n + 1] = tl(σ) × tl(α)) ⊦
Used simplifier rules: actionstream freely generated by ⌜ ⌝, ⌜ ⌝;; ⊦ ⌜nf⌝ from n = ⌜nf from n⌝ ; (s) ⊦ ¬ frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜af⌝ ); (s)
| ((λ n. ⌜sl0 from n⌝ × (α0 from n)) to # sl0)[n] = σ × α, α0 = ⌜al0⌝ , frag(IOAut(startf, stepf))(⌜sl0⌝ , α0), startf(sl0[0]), ⌜# sl0⌝ ≠ # α0 + ⌜1⌝ ∨ ¬ ( ⌜n⌝ < # α0 → σ ≠ [] ∧ α ≠ [] ∧ tl(σ) ≠ [] ∧ stepf(hd(σ), hd(α), hd(tl(σ))) ∧ hd(α) = α0[n] ∧ ((λ n. ⌜sl0 from n⌝ × (α0 from n)) to # sl0)[n + 1] = tl(σ) × tl(α)) ⊦ |
al0 ≠ [], n < # al0, frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al0⌝ ), startf(sl0[0]) ⊦ sl0 from n ≠ [] ∧ tl(⌜sl0 from n⌝ ) ≠ [] ∧ stepf(hd(⌜sl0 from n⌝ ), hd(⌜al0 from n⌝ ), hd(tl(⌜sl0 from n⌝ ))) ∧ hd(⌜al0 from n⌝ ) = al0[n] ∧ ⌜sl0 from n + 1⌝ × ⌜al0 from n + 1⌝ = tl(⌜sl0 from n⌝ ) × tl(⌜al0 from n⌝ )
Used simplifier rules: ⊦ n < # x → (x from n = [] ↔ false); (s) ⊦ ⌜x⌝ = [] ↔ x = []; (s) ⊦ ⌜x⌝ = [] ↔ x = []; (s) ⊦ # x = 0 ↔ x = []; (s) f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic ⊦ σ × α = σ0 × α0 ↔ σ = σ0 ∧ α = α0; (ws) m < n ⊦ (nf to n)[m] = nf(m); (s) ⊦ frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ) → (# sl < # al ↔ false); (s) fle-01: ⊦ m ≤ n ∧ n < n0 → m < n0; (forward) from specification nat ⊦ m < n ↔ ¬ n ≤ m; (ss) ⊦ frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ) → (# sl ≤ # al ↔ false); (as) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic le-one: ⊦ m ≤ n + 1 ∧ n < n0 → m ≤ n0; (forward) from specification nat ⊦ ⌜x⌝ from n = ⌜x from n⌝ ; (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 ⊦ frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ) → (# sl = # al + 1 ↔ true); (ss) ⊦ ⌜n⌝ + ⌜m⌝ = ⌜n0⌝ ↔ n + m = n0; (s)
| al0 ≠ [], n < # al0, frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al0⌝ ), startf(sl0[0]) ⊦ sl0 from n ≠ [] ∧ tl(⌜sl0 from n⌝ ) ≠ [] ∧ stepf(hd(⌜sl0 from n⌝ ), hd(⌜al0 from n⌝ ), hd(tl(⌜sl0 from n⌝ ))) ∧ hd(⌜al0 from n⌝ ) = al0[n] ∧ ⌜sl0 from n + 1⌝ × ⌜al0 from n + 1⌝ = tl(⌜sl0 from n⌝ ) × tl(⌜al0 from n⌝ ) |
⊦ frag(IOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1]))
# ⌜sl0⌝ = # ⌜al0⌝ + ⌜1⌝ , al0 ≠ [], n < # al0, startf(sl0[0]), ∀ n. ⌜n⌝ < # ⌜al0⌝ → stepf(⌜sl0⌝ [n], ⌜al0⌝ [n], ⌜sl0⌝ [n +1]) ⊦ sl0 from n ≠ [] ∧ tl(⌜sl0 from n⌝ ) ≠ [] ∧ stepf(hd(⌜sl0 from n⌝ ), hd(⌜al0 from n⌝ ), hd(tl(⌜sl0 from n⌝ ))) ∧ hd(⌜al0 from n⌝ ) = al0[n] ∧ ⌜sl0 from n + 1⌝ × ⌜al0 from n + 1⌝ = tl(⌜sl0 from n⌝ ) × tl(⌜al0 from n⌝ )
Used terms: ⌜al0⌝ , ⌜sl0⌝ , stepf, startf
| ⊦ frag(IOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1])) |
| # ⌜sl0⌝ = # ⌜al0⌝ + ⌜1⌝ , al0 ≠ [], n < # al0, startf(sl0[0]), ∀ n. ⌜n⌝ < # ⌜al0⌝ → stepf(⌜sl0⌝ [n], ⌜al0⌝ [n], ⌜sl0⌝ [n +1]) ⊦ sl0 from n ≠ [] ∧ tl(⌜sl0 from n⌝ ) ≠ [] ∧ stepf(hd(⌜sl0 from n⌝ ), hd(⌜al0 from n⌝ ), hd(tl(⌜sl0 from n⌝ ))) ∧ hd(⌜al0 from n⌝ ) = al0[n] ∧ ⌜sl0 from n + 1⌝ × ⌜al0 from n + 1⌝ = tl(⌜sl0 from n⌝ ) × tl(⌜al0 from n⌝ ) |
# al0 + 1 = # sl0, al0 ≠ [], n < # al0, startf(sl0[0]), ∀ n0. n0 < # al0 → stepf(sl0[n0], al0[n0], sl0[n0 + 1]) ⊦ sl0 from n ≠ [] ∧ tl(⌜sl0 from n⌝ ) ≠ [] ∧ stepf(hd(⌜sl0 from n⌝ ), hd(⌜al0 from n⌝ ), hd(tl(⌜sl0 from n⌝ ))) ∧ hd(⌜al0 from n⌝ ) = al0[n] ∧ ⌜sl0 from n + 1⌝ × ⌜al0 from n + 1⌝ = tl(⌜sl0 from n⌝ ) × tl(⌜al0 from n⌝ )
Used simplifier rules: ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ 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 ⊦ ⌜n⌝ + ⌜m⌝ = ⌜n0⌝ ↔ n + m = n0; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s)
| # al0 + 1 = # sl0, al0 ≠ [], n < # al0, startf(sl0[0]), ∀ n0. n0 < # al0 → stepf(sl0[n0], al0[n0], sl0[n0 + 1]) ⊦ sl0 from n ≠ [] ∧ tl(⌜sl0 from n⌝ ) ≠ [] ∧ stepf(hd(⌜sl0 from n⌝ ), hd(⌜al0 from n⌝ ), hd(tl(⌜sl0 from n⌝ ))) ∧ hd(⌜al0 from n⌝ ) = al0[n] ∧ ⌜sl0 from n + 1⌝ × ⌜al0 from n + 1⌝ = tl(⌜sl0 from n⌝ ) × tl(⌜al0 from n⌝ ) |
# al0 + 1 = # sl0, ⌜sl0 from n⌝ = [], al0 ≠ [], n < # al0, startf(sl0[0]), ∀ n0. n0 < # al0 → stepf(sl0[n0], al0[n0], sl0[n0 + 1]) ⊦ sl0 from n ≠ [] ∧ tl(⌜sl0 from n⌝ ) ≠ [] ∧ stepf(hd(⌜sl0 from n⌝ ), hd(⌜al0 from n⌝ ), hd(tl(⌜sl0 from n⌝ ))) ∧ hd(⌜al0 from n⌝ ) = al0[n] ∧ ⌜sl0 from n + 1⌝ × ⌜al0 from n + 1⌝ = tl(⌜sl0 from n⌝ ) × tl(⌜al0 from n⌝ )
# al0 + 1 = # sl0, ⌜sl0 from n⌝ = s + σ0, al0 ≠ [], ⌜sl0 from n⌝ ≠ [], n < # al0, startf(sl0[0]), ∀ n0. n0 < # al0 → stepf(sl0[n0], al0[n0], sl0[n0 + 1]) ⊦ sl0 from n ≠ [] ∧ σ0 ≠ [] ∧ stepf(s, hd(⌜al0 from n⌝ ), hd(σ0)) ∧ hd(⌜al0 from n⌝ ) = al0[n] ∧ ⌜sl0 from n + 1⌝ × ⌜al0 from n + 1⌝ = σ0 × tl(⌜al0 from n⌝ )
Used simplifier rules: ⊦ σ ≠ [] → (a = hd(σ) ∧ σ0 = tl(σ) ↔ σ = a + σ0); (elim) Used terms: ⌜sl0 from n⌝ , s, σ0
| # al0 + 1 = # sl0, ⌜sl0 from n⌝ = [], al0 ≠ [], n < # al0, startf(sl0[0]), ∀ n0. n0 < # al0 → stepf(sl0[n0], al0[n0], sl0[n0 + 1]) ⊦ sl0 from n ≠ [] ∧ tl(⌜sl0 from n⌝ ) ≠ [] ∧ stepf(hd(⌜sl0 from n⌝ ), hd(⌜al0 from n⌝ ), hd(tl(⌜sl0 from n⌝ ))) ∧ hd(⌜al0 from n⌝ ) = al0[n] ∧ ⌜sl0 from n + 1⌝ × ⌜al0 from n + 1⌝ = tl(⌜sl0 from n⌝ ) × tl(⌜al0 from n⌝ ) |
# al0 + 1 = # sl0, sl0 from n = [], al0 ≠ [], n < # al0, startf(sl0[0]), ∀ n0. n0 < # al0 → stepf(sl0[n0], al0[n0], sl0[n0 + 1]) ⊦
Used simplifier rules: ⊦ ⌜x⌝ = [] ↔ x = []; (s)
| # al0 + 1 = # sl0, sl0 from n = [], al0 ≠ [], n < # al0, startf(sl0[0]), ∀ n0. n0 < # al0 → stepf(sl0[n0], al0[n0], sl0[n0 + 1]) ⊦ |
⊦ n < # x → (x from n = [] ↔ false)
Used simplifier rules: ⊦ m < n ↔ ¬ n ≤ m; (ss) fle-01: ⊦ m ≤ n ∧ n < n0 → m < n0; (forward) from specification nat lf-02: ⊦ m < n ∧ m = n0 → n0 < n; (forward) from specification nat-basic ⊦ ¬ m + n < m; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic Used terms: n, sl0
| ⊦ n < # x → (x from n = [] ↔ false) |
| # al0 + 1 = # sl0, ⌜sl0 from n⌝ = s + σ0, al0 ≠ [], ⌜sl0 from n⌝ ≠ [], n < # al0, startf(sl0[0]), ∀ n0. n0 < # al0 → stepf(sl0[n0], al0[n0], sl0[n0 + 1]) ⊦ sl0 from n ≠ [] ∧ σ0 ≠ [] ∧ stepf(s, hd(⌜al0 from n⌝ ), hd(σ0)) ∧ hd(⌜al0 from n⌝ ) = al0[n] ∧ ⌜sl0 from n + 1⌝ × ⌜al0 from n + 1⌝ = σ0 × tl(⌜al0 from n⌝ ) |
# al0 + 1 = # sl0, ⌜sl0 from n⌝ = ⌜s '⌝ + σ0, al0 ≠ [], sl0 from n ≠ [], n < # al0, startf(sl0[0]), ∀ n0. n0 < # al0 → stepf(sl0[n0], al0[n0], sl0[n0 + 1]) ⊦ σ0 ≠ [] ∧ stepf(s, hd(⌜al0 from n⌝ ), hd(σ0)) ∧ hd(⌜al0 from n⌝ ) = al0[n] ∧ ⌜sl0 from n + 1⌝ × ⌜al0 from n + 1⌝ = σ0 × tl(⌜al0 from n⌝ )
Used simplifier rules: ⊦ ⌜x⌝ = [] ↔ x = []; (s) ⊦ a + σ = ⌜a '⌝ + σ; (s)
| # al0 + 1 = # sl0, ⌜sl0 from n⌝ = ⌜s '⌝ + σ0, al0 ≠ [], sl0 from n ≠ [], n < # al0, startf(sl0[0]), ∀ n0. n0 < # al0 → stepf(sl0[n0], al0[n0], sl0[n0 + 1]) ⊦ σ0 ≠ [] ∧ stepf(s, hd(⌜al0 from n⌝ ), hd(σ0)) ∧ hd(⌜al0 from n⌝ ) = al0[n] ∧ ⌜sl0 from n + 1⌝ × ⌜al0 from n + 1⌝ = σ0 × tl(⌜al0 from n⌝ ) |
# x0 = n, # al0 + 1 = # sl0, sl0 = x0 + x1, ⌜x1⌝ = ⌜s '⌝ + σ0, al0 ≠ [], x1 ≠ [], n < # al0, startf(sl0[0]), ¬ # sl0 < n, ∀ n0. n0 < # al0 → stepf(sl0[n0], al0[n0], sl0[n0 + 1]) ⊦ σ0 ≠ [] ∧ stepf(s, hd(⌜al0 from n⌝ ), hd(σ0)) ∧ hd(⌜al0 from n⌝ ) = al0[n] ∧ ⌜sl0 from n + 1⌝ × ⌜al0 from n + 1⌝ = σ0 × tl(⌜al0 from n⌝ )
Used simplifier rules: f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic ⊦ m < n → n ≠ 0; (s) lf: ⊦ m < n ∧ n < n0 → m +1 < n0; (forward) from specification nat-basic trans: ⊦ n < n0 ∧ n0 < n1 → n < n1; (forward) from specification nat-basic ⊦ m +1 = m + 1; (s) ⊦ m + m0 < n → ¬ n + n0 < m; (s) lf-02: ⊦ m < n ∧ m = n0 → n0 < n; (forward) from specification nat-basic ⊦ σ + [] = σ; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[IOstatestream] ⊦ ⌜x⌝ = ⌜x0⌝ ↔ x = x0; (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 ⊦ ¬ # x < n → (x0 = x to n ∧ x1 = x from n ↔ x = x0 + x1 ∧ # x0 = n); (elim) Used terms: sl0, n, sl, sl1
| # x0 = n, # al0 + 1 = # sl0, sl0 = x0 + x1, ⌜x1⌝ = ⌜s '⌝ + σ0, al0 ≠ [], x1 ≠ [], n < # al0, startf(sl0[0]), ¬ # sl0 < n, ∀ n0. n0 < # al0 → stepf(sl0[n0], al0[n0], sl0[n0 + 1]) ⊦ σ0 ≠ [] ∧ stepf(s, hd(⌜al0 from n⌝ ), hd(σ0)) ∧ hd(⌜al0 from n⌝ ) = al0[n] ∧ ⌜sl0 from n + 1⌝ × ⌜al0 from n + 1⌝ = σ0 × tl(⌜al0 from n⌝ ) |
# al0 + 1 = # x0 + # x1, ⌜x1⌝ = ⌜s '⌝ + σ0, al0 ≠ [], x1 ≠ [], # x0 < # al0, startf((x0 + x1)[0]), ∀ n0. n0 < # al0 → stepf((x0 + x1)[n0], al0[n0], (x0 + x1)[n0 + 1]) ⊦ σ0 ≠ [] ∧ stepf(s, hd(⌜al0 from # x0⌝ ), hd(σ0)) ∧ hd(⌜al0 from # x0⌝ ) = al0[# x0] ∧ ⌜x1 from 1⌝ × ⌜al0 from # x0 + 1⌝ = σ0 × tl(⌜al0 from # x0⌝ )
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[IOstatestream] c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ x1 + x0 from n + # x1 = x0 from n; (s) ⊦ ¬ m + n < m; (s) ⊦ #(x + y) = # x + # y; (s)
| # al0 + 1 = # x0 + # x1, ⌜x1⌝ = ⌜s '⌝ + σ0, al0 ≠ [], x1 ≠ [], # x0 < # al0, startf((x0 + x1)[0]), ∀ n0. n0 < # al0 → stepf((x0 + x1)[n0], al0[n0], (x0 + x1)[n0 + 1]) ⊦ σ0 ≠ [] ∧ stepf(s, hd(⌜al0 from # x0⌝ ), hd(σ0)) ∧ hd(⌜al0 from # x0⌝ ) = al0[# x0] ∧ ⌜x1 from 1⌝ × ⌜al0 from # x0 + 1⌝ = σ0 × tl(⌜al0 from # x0⌝ ) |
# al0 + 1 = # x0 + # x1, x1 = s0 + x, ⌜x1⌝ = ⌜s '⌝ + σ0, al0 ≠ [], x1 ≠ [], # x0 < # al0, startf((x0 + x1)[0]), ∀ n0. n0 < # al0 → stepf((x0 + x1)[n0], al0[n0], (x0 + x1)[n0 + 1]) ⊦ σ0 ≠ [] ∧ stepf(s, hd(⌜al0 from # x0⌝ ), hd(σ0)) ∧ hd(⌜al0 from # x0⌝ ) = al0[# x0] ∧ ⌜x1 from 1⌝ × ⌜al0 from # x0 + 1⌝ = σ0 × tl(⌜al0 from # x0⌝ )
Used simplifier rules: statelist freely generated by [], +;;
| # al0 + 1 = # x0 + # x1, x1 = s0 + x, ⌜x1⌝ = ⌜s '⌝ + σ0, al0 ≠ [], x1 ≠ [], # x0 < # al0, startf((x0 + x1)[0]), ∀ n0. n0 < # al0 → stepf((x0 + x1)[n0], al0[n0], (x0 + x1)[n0 + 1]) ⊦ σ0 ≠ [] ∧ stepf(s, hd(⌜al0 from # x0⌝ ), hd(σ0)) ∧ hd(⌜al0 from # x0⌝ ) = al0[# x0] ∧ ⌜x1 from 1⌝ × ⌜al0 from # x0 + 1⌝ = σ0 × tl(⌜al0 from # x0⌝ ) |
# al0 = # x0 + # x, al0 ≠ [], x ≠ [], # x0 < # al0, startf((x0 + s ' + x)[0]), ∀ n0. n0 < # al0 → stepf((x0 + s ' + x)[n0], al0[n0], (x0 + s ' + x)[n0 + 1]) ⊦ stepf(s, hd(⌜al0 from # x0⌝ ), hd(⌜x⌝ )) ∧ hd(⌜al0 from # x0⌝ ) = al0[# x0] ∧ ⌜al0 from # x0 + 1⌝ = tl(⌜al0 from # x0⌝ )
Used simplifier rules: ⊦ ⌜x⌝ = [] ↔ x = []; (s) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ # x = 0 ↔ x = []; (s) ⊦ m < m + n ↔ n ≠ 0; (s) lf-01: ⊦ m < n ∧ n = n0 → m < n0; (forward) from specification nat-basic ⊦ σ × α = σ0 × α0 ↔ σ = σ0 ∧ α = α0; (ws) a: ⊦ (x + y) + z = x + y + z; from specification list[IOstatestream] ⊦ a ' + x from 1 = x; (s) ⊦ a + x = a ' + x; (s) ⊦ a ' + x ≠ []; (s) ⊦ m + n = m + n0 ↔ n = n0; (s) ⊦ m +1 = m + 1; (s) ⊦ #(a ' + x) = (# x)+1; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[IOstatestream] ⊦ ⌜a '⌝ + σ = ⌜a0 '⌝ + σ0 ↔ a = a0 ∧ σ = σ0; (ws) ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s)
| # al0 = # x0 + # x, al0 ≠ [], x ≠ [], # x0 < # al0, startf((x0 + s ' + x)[0]), ∀ n0. n0 < # al0 → stepf((x0 + s ' + x)[n0], al0[n0], (x0 + s ' + x)[n0 + 1]) ⊦ stepf(s, hd(⌜al0 from # x0⌝ ), hd(⌜x⌝ )) ∧ hd(⌜al0 from # x0⌝ ) = al0[# x0] ∧ ⌜al0 from # x0 + 1⌝ = tl(⌜al0 from # x0⌝ ) |
# al0 = # x0 + # x, # al = # x0, al0 = al + al1, al0 ≠ [], x ≠ [], # x0 < # al0, startf((x0 + s ' + x)[0]), ¬ # al0 < # x0, ∀ n0. n0 < # al0 → stepf((x0 + s ' + x)[n0], al0[n0], (x0 + s ' + x)[n0 + 1]) ⊦ stepf(s, hd(⌜al1⌝ ), hd(⌜x⌝ )) ∧ hd(⌜al1⌝ ) = al0[# x0] ∧ ⌜al0 from # x0 + 1⌝ = tl(⌜al1⌝ )
Used simplifier rules: ⊦ m < n → ¬ n < m; (s) ⊦ ¬ # x < n → (x0 = x to n ∧ x1 = x from n ↔ x = x0 + x1 ∧ # x0 = n); (elim) Used terms: al0, # x0, al, al1
| # al0 = # x0 + # x, # al = # x0, al0 = al + al1, al0 ≠ [], x ≠ [], # x0 < # al0, startf((x0 + s ' + x)[0]), ¬ # al0 < # x0, ∀ n0. n0 < # al0 → stepf((x0 + s ' + x)[n0], al0[n0], (x0 + s ' + x)[n0 + 1]) ⊦ stepf(s, hd(⌜al1⌝ ), hd(⌜x⌝ )) ∧ hd(⌜al1⌝ ) = al0[# x0] ∧ ⌜al0 from # x0 + 1⌝ = tl(⌜al1⌝ ) |
# al1 = # x, # al = # x0, al + al1 ≠ [], al1 ≠ [], x ≠ [], startf((x0 + s ' + x)[0]), ∀ n0. n0 < # x0 + # x → stepf((x0 + s ' + x)[n0], (al + al1)[n0], (x0 + s ' + x)[n0 + 1]) ⊦ stepf(s, hd(⌜al1⌝ ), hd(⌜x⌝ )) ∧ hd(⌜al1⌝ ) = (al + al1)[# x0] ∧ ⌜al + al1 from # x0 + 1⌝ = tl(⌜al1⌝ )
Used simplifier rules: c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ # x = 0 ↔ x = []; (s) ⊦ m < m + n ↔ n ≠ 0; (s) ⊦ # x = 0 ↔ x = []; (s) ⊦ m < n → n ≠ 0; (s) ⊦ m + n = m + n0 ↔ n = n0; (s) lf-01: ⊦ m < n ∧ n = n0 → m < n0; (forward) from specification nat-basic lf-02: ⊦ m < n ∧ m = n0 → n0 < n; (forward) from specification nat-basic f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic a: ⊦ (x + y) + z = x + y + z; from specification list[actionstream] ⊦ #(x + y) = # x + # y; (s) ⊦ m < n → ¬ n < m; (s)
| # al1 = # x, # al = # x0, al + al1 ≠ [], al1 ≠ [], x ≠ [], startf((x0 + s ' + x)[0]), ∀ n0. n0 < # x0 + # x → stepf((x0 + s ' + x)[n0], (al + al1)[n0], (x0 + s ' + x)[n0 + 1]) ⊦ stepf(s, hd(⌜al1⌝ ), hd(⌜x⌝ )) ∧ hd(⌜al1⌝ ) = (al + al1)[# x0] ∧ ⌜al + al1 from # x0 + 1⌝ = tl(⌜al1⌝ ) |
⊦ # x < n → x + y from n = y from (n - # x)
# al = # x0, # al1 = # x, al + al1 ≠ [], al1 ≠ [], x ≠ [], # al < # x0 + 1, startf((x0 + s ' + x)[0]), ∀ n0. n0 < # x0 + # x → stepf((x0 + s ' + x)[n0], (al + al1)[n0], (x0 + s ' + x)[n0 + 1]) ⊦ stepf(s, hd(⌜al1⌝ ), hd(⌜x⌝ )) ∧ hd(⌜al1⌝ ) = (al + al1)[# x0] ∧ ⌜al1 from (# x0 + 1 - # al)⌝ = tl(⌜al1⌝ )
Used simplifier rules: ⊦ m < n + 1 ↔ ¬ n < m; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic ⊦ n < # x → (x + y)[n] = x[n]; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[actionstream] f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic lf-02: ⊦ m < n ∧ m = n0 → n0 < n; (forward) from specification nat-basic lf-01: ⊦ m < n ∧ n = n0 → m < n0; (forward) from specification nat-basic ⊦ # x = 0 ↔ x = []; (s) ⊦ m < n → ¬ n < m; (s) Used terms: # x0 + 1, al1, al
| ⊦ # x < n → x + y from n = y from (n - # x) |
| # al = # x0, # al1 = # x, al + al1 ≠ [], al1 ≠ [], x ≠ [], # al < # x0 + 1, startf((x0 + s ' + x)[0]), ∀ n0. n0 < # x0 + # x → stepf((x0 + s ' + x)[n0], (al + al1)[n0], (x0 + s ' + x)[n0 + 1]) ⊦ stepf(s, hd(⌜al1⌝ ), hd(⌜x⌝ )) ∧ hd(⌜al1⌝ ) = (al + al1)[# x0] ∧ ⌜al1 from (# x0 + 1 - # al)⌝ = tl(⌜al1⌝ ) |
# al = # x0, # al1 = # x, al + al1 ≠ [], al1 ≠ [], x ≠ [], startf((x0 + s ' + x)[0]), ∀ n0. n0 < # x0 + # x → stepf((x0 + s ' + x)[n0], (al + al1)[n0], (x0 + s ' + x)[n0 + 1]) ⊦ stepf(s, hd(⌜al1⌝ ), hd(⌜x⌝ )) ∧ hd(⌜al1⌝ ) = (al + al1)[# x0] ∧ ⌜al1 from 1⌝ = tl(⌜al1⌝ )
Used simplifier rules: c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ m - m = 0; (s) ⊦ m ≤ m; (s) ⊦ n ≤ m → m + n0 - n = (m - n) + n0; (s) ⊦ m < n ↔ ¬ n ≤ m; (ss) ⊦ m < n + 1 ↔ ¬ n < m; (s)
| # al = # x0, # al1 = # x, al + al1 ≠ [], al1 ≠ [], x ≠ [], startf((x0 + s ' + x)[0]), ∀ n0. n0 < # x0 + # x → stepf((x0 + s ' + x)[n0], (al + al1)[n0], (x0 + s ' + x)[n0 + 1]) ⊦ stepf(s, hd(⌜al1⌝ ), hd(⌜x⌝ )) ∧ hd(⌜al1⌝ ) = (al + al1)[# x0] ∧ ⌜al1 from 1⌝ = tl(⌜al1⌝ ) |
# al1 = # x, # al = # x0, ⌜al1⌝ = a + α, al + al1 ≠ [], al1 ≠ [], x ≠ [], ⌜al1⌝ ≠ [], startf((x0 + s ' + x)[0]), ∀ n0. n0 < # x0 + # x → stepf((x0 + s ' + x)[n0], (al + al1)[n0], (x0 + s ' + x)[n0 + 1]) ⊦ stepf(s, a, hd(⌜x⌝ )) ∧ a = (al + al1)[# x0] ∧ ⌜al1 from 1⌝ = α
Used simplifier rules: ⊦ ⌜x⌝ = [] ↔ x = []; (s) ⊦ σ ≠ [] → (a = hd(σ) ∧ σ0 = tl(σ) ↔ σ = a + σ0); (elim) Used terms: ⌜al1⌝ , a0, α0
| # al1 = # x, # al = # x0, ⌜al1⌝ = a + α, al + al1 ≠ [], al1 ≠ [], x ≠ [], ⌜al1⌝ ≠ [], startf((x0 + s ' + x)[0]), ∀ n0. n0 < # x0 + # x → stepf((x0 + s ' + x)[n0], (al + al1)[n0], (x0 + s ' + x)[n0 + 1]) ⊦ stepf(s, a, hd(⌜x⌝ )) ∧ a = (al + al1)[# x0] ∧ ⌜al1 from 1⌝ = α |
# al = # x0, # al1 = # x, ⌜al1⌝ = ⌜a '⌝ + α, al + al1 ≠ [], al1 ≠ [], x ≠ [], startf((x0 + s ' + x)[0]), ∀ n0. n0 < # x0 + # x → stepf((x0 + s ' + x)[n0], (al + al1)[n0], (x0 + s ' + x)[n0 + 1]) ⊦ stepf(s, (al + al1)[# x0], hd(⌜x⌝ )) ∧ a = (al + al1)[# x0] ∧ ⌜al1 from 1⌝ = α
Used simplifier rules: ⊦ ⌜x⌝ = [] ↔ x = []; (s) ⊦ a + σ = ⌜a '⌝ + σ; (s)
| # al = # x0, # al1 = # x, ⌜al1⌝ = ⌜a '⌝ + α, al + al1 ≠ [], al1 ≠ [], x ≠ [], startf((x0 + s ' + x)[0]), ∀ n0. n0 < # x0 + # x → stepf((x0 + s ' + x)[n0], (al + al1)[n0], (x0 + s ' + x)[n0 + 1]) ⊦ stepf(s, (al + al1)[# x0], hd(⌜x⌝ )) ∧ a = (al + al1)[# x0] ∧ ⌜al1 from 1⌝ = α |
# al1 = # x, # al = # x0, al1 = a0 + al0, ⌜al1⌝ = ⌜a '⌝ + α, al + al1 ≠ [], al1 ≠ [], x ≠ [], startf((x0 + s ' + x)[0]), ∀ n0. n0 < # x0 + # x → stepf((x0 + s ' + x)[n0], (al + al1)[n0], (x0 + s ' + x)[n0 + 1]) ⊦ stepf(s, (al + al1)[# x0], hd(⌜x⌝ )) ∧ a = (al + al1)[# x0] ∧ ⌜al1 from 1⌝ = α
Used simplifier rules: actionlist freely generated by [], +;;
| # al1 = # x, # al = # x0, al1 = a0 + al0, ⌜al1⌝ = ⌜a '⌝ + α, al + al1 ≠ [], al1 ≠ [], x ≠ [], startf((x0 + s ' + x)[0]), ∀ n0. n0 < # x0 + # x → stepf((x0 + s ' + x)[n0], (al + al1)[n0], (x0 + s ' + x)[n0 + 1]) ⊦ stepf(s, (al + al1)[# x0], hd(⌜x⌝ )) ∧ a = (al + al1)[# x0] ∧ ⌜al1 from 1⌝ = α |
# al = # x0, # al0 + 1 = # x, x ≠ [], startf((x0 + s ' + x)[0]), ∀ n0. n0 < # x0 + # x → stepf((x0 + s ' + x)[n0], (al + a ' + al0)[n0], (x0 + s ' + x)[n0 + 1]) ⊦ stepf(s, (al + a ' + al0)[# x0], hd(⌜x⌝ )) ∧ a = (al + a ' + al0)[# x0]
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[actionstream] ⊦ a ' + x from 1 = x; (s) ⊦ a + x = a ' + x; (s) ⊦ a ' + x ≠ []; (s) ⊦ x + a ' + y ≠ []; (s) ⊦ m +1 = m + 1; (s) ⊦ #(a ' + x) = (# x)+1; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ ⌜a '⌝ + σ = ⌜a0 '⌝ + σ0 ↔ a = a0 ∧ σ = σ0; (ws) ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s)
| # al = # x0, # al0 + 1 = # x, x ≠ [], startf((x0 + s ' + x)[0]), ∀ n0. n0 < # x0 + # x → stepf((x0 + s ' + x)[n0], (al + a ' + al0)[n0], (x0 + s ' + x)[n0 + 1]) ⊦ stepf(s, (al + a ' + al0)[# x0], hd(⌜x⌝ )) ∧ a = (al + a ' + al0)[# x0] |
# al = # x0, # al0 + 1 = # x, x = s0 + x1, x ≠ [], startf((x0 + s ' + x)[0]), ∀ n0. n0 < # x0 + # x → stepf((x0 + s ' + x)[n0], (al + a ' + al0)[n0], (x0 + s ' + x)[n0 + 1]) ⊦ stepf(s, (al + a ' + al0)[# x0], hd(⌜x⌝ )) ∧ a = (al + a ' + al0)[# x0]
Used simplifier rules: statelist freely generated by [], +;;
| # al = # x0, # al0 + 1 = # x, x = s0 + x1, x ≠ [], startf((x0 + s ' + x)[0]), ∀ n0. n0 < # x0 + # x → stepf((x0 + s ' + x)[n0], (al + a ' + al0)[n0], (x0 + s ' + x)[n0 + 1]) ⊦ stepf(s, (al + a ' + al0)[# x0], hd(⌜x⌝ )) ∧ a = (al + a ' + al0)[# x0] |
# al = # x0, # al0 = # x1, startf((x0 + s ' + s0 ' + x1)[0]), ∀ n0. ¬ # x0 + # x1 < n0 → stepf((x0 + s ' + s0 ' + x1)[n0], (al + a ' + al0)[n0], (x0 + s ' + s0 ' + x1)[n0 + 1]) ⊦ stepf(s, (al + a ' + al0)[# x0], s0) ∧ a = (al + a ' + al0)[# x0]
Used simplifier rules: append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[IOstatestream] ⊦ hd(⌜a '⌝ + ⌜x⌝ ) = a; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[IOstatestream] ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s) ⊦ a + x = a ' + x; (s) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ m < n + 1 ↔ ¬ n < m; (s) ⊦ m +1 = m + 1; (s) ⊦ #(a ' + x) = (# x)+1; (s) ⊦ a ' + x ≠ []; (s) ⊦ m + n = m + n0 ↔ n = n0; (s)
| # al = # x0, # al0 = # x1, startf((x0 + s ' + s0 ' + x1)[0]), ∀ n0. ¬ # x0 + # x1 < n0 → stepf((x0 + s ' + s0 ' + x1)[n0], (al + a ' + al0)[n0], (x0 + s ' + s0 ' + x1)[n0 + 1]) ⊦ stepf(s, (al + a ' + al0)[# x0], s0) ∧ a = (al + a ' + al0)[# x0] |
⊦ ¬ n < # x → (x + y)[n] = y[n - # x]
# al0 = # x1, # al = # x0, startf((x0 + s ' + s0 ' + x1)[0]), ¬ # x0 < # al, ∀ n0. ¬ # x0 + # x1 < n0 → stepf((x0 + s ' + s0 ' + x1)[n0], (al + a ' + al0)[n0], (x0 + s ' + s0 ' + x1)[n0 + 1]) ⊦ stepf(s, (a ' + al0)[# x0 - # al], s0) ∧ a = (a ' + al0)[# x0 - # al]
Used simplifier rules: ⊦ n < # x → (x + y)[n] = x[n]; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[actionstream] f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic lf-02: ⊦ m < n ∧ m = n0 → n0 < n; (forward) from specification nat-basic lf-01: ⊦ m < n ∧ n = n0 → m < n0; (forward) from specification nat-basic ⊦ # x = 0 ↔ x = []; (s) ⊦ m < n → ¬ n < m; (s) Used terms: # x0, a ' + al0, al
| ⊦ ¬ n < # x → (x + y)[n] = y[n - # x] |
| # al0 = # x1, # al = # x0, startf((x0 + s ' + s0 ' + x1)[0]), ¬ # x0 < # al, ∀ n0. ¬ # x0 + # x1 < n0 → stepf((x0 + s ' + s0 ' + x1)[n0], (al + a ' + al0)[n0], (x0 + s ' + s0 ' + x1)[n0 + 1]) ⊦ stepf(s, (a ' + al0)[# x0 - # al], s0) ∧ a = (a ' + al0)[# x0 - # al] |
# al0 = # x1, # al = # x0, startf((x0 + s ' + s0 ' + x1)[0]), ¬ stepf(s, a, s0), ∀ n0. ¬ # x0 + # x1 < n0 → stepf((x0 + s ' + s0 ' + x1)[n0], (al + a ' + al0)[n0], (x0 + s ' + s0 ' + x1)[n0 + 1]) ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[actionstream] ⊦ (a ' + x)[0] = a; (s) ⊦ m - m = 0; (s) ⊦ m ≤ m; (s) ⊦ m < n ↔ ¬ n ≤ m; (ss)
| # al0 = # x1, # al = # x0, startf((x0 + s ' + s0 ' + x1)[0]), ¬ stepf(s, a, s0), ∀ n0. ¬ # x0 + # x1 < n0 → stepf((x0 + s ' + s0 ' + x1)[n0], (al + a ' + al0)[n0], (x0 + s ' + s0 ' + x1)[n0 + 1]) ⊦ |
# al = # x0, # al0 = # x1, startf((x0 + s ' + s0 ' + x1)[0]), ¬ stepf(s, a, s0), ¬ # x0 + # x1 < # x0 → stepf((x0 + s ' + s0 ' + x1)[# x0], (al + a ' + al0)[# x0], (x0 + s ' + s0 ' + x1)[# x0 + 1]) ⊦
Used terms: # x0
| # al = # x0, # al0 = # x1, startf((x0 + s ' + s0 ' + x1)[0]), ¬ stepf(s, a, s0), ¬ # x0 + # x1 < # x0 → stepf((x0 + s ' + s0 ' + x1)[# x0], (al + a ' + al0)[# x0], (x0 + s ' + s0 ' + x1)[# x0 + 1]) ⊦ |
# al0 = # x1, # al = # x0, startf((x0 + s ' + s0 ' + x1)[0]), stepf(s, (al + a ' + al0)[# x0], s0), ¬ stepf(s, a, s0) ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[IOstatestream] c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ (a ' + x)[0] = a; (s) n ≠ 0 ⊦ (a ' + x)[(* n)] = x[n -1]; (s) ⊦ (x + y)[n + # x] = y[n]; (s) ⊦ (x + a ' + y)[# x] = a; (s) ⊦ ¬ m + n < m; (s)
| # al0 = # x1, # al = # x0, startf((x0 + s ' + s0 ' + x1)[0]), stepf(s, (al + a ' + al0)[# x0], s0), ¬ stepf(s, a, s0) ⊦ |
⊦ ¬ n < # x → (x + y)[n] = y[n - # x]
Used simplifier rules: ⊦ m < n ↔ ¬ n ≤ m; (ss) ⊦ m ≤ m; (s) ⊦ m - m = 0; (s) ⊦ (a ' + x)[0] = a; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[actionstream] ⊦ n < # x → (x + y)[n] = x[n]; (s) f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic lf-02: ⊦ m < n ∧ m = n0 → n0 < n; (forward) from specification nat-basic lf-01: ⊦ m < n ∧ n = n0 → m < n0; (forward) from specification nat-basic ⊦ # x = 0 ↔ x = []; (s) ⊦ m < n → ¬ n < m; (s) Used terms: # x0, a ' + al0, al
| ⊦ ¬ n < # x → (x + y)[n] = y[n - # x] |
| σ = ⌜sf0⌝ , frag(IOAut(startf, stepf))(σ, α0), startf(σ[0]), ∀ _σ, β. α0 ^ ≠ β ^ ∨ ¬ exfrag (EXIOAut (λ σα. frag(IOAut(startf, stepf))(σα.1, σα.2) ∧ startf(σα.1[0]), λ σα, a, σα0. σα.1 ≠ [] ∧ σα.2 ≠ [] ∧ tl(σα.1) ≠ [] ∧ stepf(hd(σα.1), hd(σα.2), hd(tl(σα.1))) ∧ hd(σα.2) = a ∧ σα0 = tl(σα.1) × tl(σα.2))) (_σ, β) ∨ ¬ frag(IOAut(startf, stepf))(_σ[0].1, _σ[0].2) ∨ ¬ startf(_σ[0].1[0]) ⊦ |
frag(IOAut(startf, stepf))(⌜sf0⌝ , α0), startf(sf0(0)), ∀ _σ, β. α0 ^ ≠ β ^ ∨ ¬ exfrag (EXIOAut (λ σα. frag(IOAut(startf, stepf))(σα.1, σα.2) ∧ startf(σα.1[0]), λ σα, a, σα0. σα.1 ≠ [] ∧ σα.2 ≠ [] ∧ tl(σα.1) ≠ [] ∧ stepf(hd(σα.1), hd(σα.2), hd(tl(σα.1))) ∧ hd(σα.2) = a ∧ σα0 = tl(σα.1) × tl(σα.2))) (_σ, β) ∨ ¬ frag(IOAut(startf, stepf))(_σ[0].1, _σ[0].2) ∨ ¬ startf(_σ[0].1[0]) ⊦
Used simplifier rules: ⊦ ⌜nf⌝ [n] = nf(n); (s)
| frag(IOAut(startf, stepf))(⌜sf0⌝ , α0), startf(sf0(0)), ∀ _σ, β. α0 ^ ≠ β ^ ∨ ¬ exfrag (EXIOAut (λ σα. frag(IOAut(startf, stepf))(σα.1, σα.2) ∧ startf(σα.1[0]), λ σα, a, σα0. σα.1 ≠ [] ∧ σα.2 ≠ [] ∧ tl(σα.1) ≠ [] ∧ stepf(hd(σα.1), hd(σα.2), hd(tl(σα.1))) ∧ hd(σα.2) = a ∧ σα0 = tl(σα.1) × tl(σα.2))) (_σ, β) ∨ ¬ frag(IOAut(startf, stepf))(_σ[0].1, _σ[0].2) ∨ ¬ startf(_σ[0].1[0]) ⊦ |
frag(IOAut(startf, stepf))(⌜sf0⌝ , α0), startf(sf0(0)), α0 ^ ≠ α0 ^ ∨ ¬ exfrag (EXIOAut (λ σα. frag(IOAut(startf, stepf))(σα.1, σα.2) ∧ startf(σα.1[0]), λ σα, a, σα0. σα.1 ≠ [] ∧ σα.2 ≠ [] ∧ tl(σα.1) ≠ [] ∧ stepf(hd(σα.1), hd(σα.2), hd(tl(σα.1))) ∧ hd(σα.2) = a ∧ σα0 = tl(σα.1) × tl(σα.2))) (⌜λ n. ⌜sf0 from n⌝ × (α0 from n)⌝ , α0) ∨ ¬ frag(IOAut(startf, stepf))(⌜λ n. ⌜sf0 from n⌝ × (α0 from n)⌝ [0].1, ⌜λ n. ⌜sf0 from n⌝ × (α0 from n)⌝ [0].2) ∨ ¬ startf(⌜λ n. ⌜sf0 from n⌝ × (α0 from n)⌝ [0].1[0]) ⊦
Used terms: ⌜λ n. ⌜sf0 from n⌝ × (α0 from n)⌝ , α0
| frag(IOAut(startf, stepf))(⌜sf0⌝ , α0), startf(sf0(0)), α0 ^ ≠ α0 ^ ∨ ¬ exfrag (EXIOAut (λ σα. frag(IOAut(startf, stepf))(σα.1, σα.2) ∧ startf(σα.1[0]), λ σα, a, σα0. σα.1 ≠ [] ∧ σα.2 ≠ [] ∧ tl(σα.1) ≠ [] ∧ stepf(hd(σα.1), hd(σα.2), hd(tl(σα.1))) ∧ hd(σα.2) = a ∧ σα0 = tl(σα.1) × tl(σα.2))) (⌜λ n. ⌜sf0 from n⌝ × (α0 from n)⌝ , α0) ∨ ¬ frag(IOAut(startf, stepf))(⌜λ n. ⌜sf0 from n⌝ × (α0 from n)⌝ [0].1, ⌜λ n. ⌜sf0 from n⌝ × (α0 from n)⌝ [0].2) ∨ ¬ startf(⌜λ n. ⌜sf0 from n⌝ × (α0 from n)⌝ [0].1[0]) ⊦ |
frag(IOAut(startf, stepf))(⌜sf0⌝ , α0), startf(sf0(0)), ¬ exfrag (EXIOAut (λ σα. frag(IOAut(startf, stepf))(σα.1, σα.2) ∧ startf(σα.1[0]), λ σα, a, σα0. σα.1 ≠ [] ∧ σα.2 ≠ [] ∧ tl(σα.1) ≠ [] ∧ stepf(hd(σα.1), hd(σα.2), hd(tl(σα.1))) ∧ hd(σα.2) = a ∧ σα0 = tl(σα.1) × tl(σα.2))) (⌜λ n. ⌜sf0 from n⌝ × (α0 from n)⌝ , α0) ⊦
Used simplifier rules: ⊦ ⌜nf⌝ [n] = nf(n); (s) ⊦ (σ × α).1 = σ; (s) ⊦ σ from 0 = σ; (s) ⊦ nf from 0 = nf; (s) ⊦ ⌜nf⌝ [n] = nf(n); (s) ⊦ (σ × α).2 = α; (s)
| frag(IOAut(startf, stepf))(⌜sf0⌝ , α0), startf(sf0(0)), ¬ exfrag (EXIOAut (λ σα. frag(IOAut(startf, stepf))(σα.1, σα.2) ∧ startf(σα.1[0]), λ σα, a, σα0. σα.1 ≠ [] ∧ σα.2 ≠ [] ∧ tl(σα.1) ≠ [] ∧ stepf(hd(σα.1), hd(σα.2), hd(tl(σα.1))) ∧ hd(σα.2) = a ∧ σα0 = tl(σα.1) × tl(σα.2))) (⌜λ n. ⌜sf0 from n⌝ × (α0 from n)⌝ , α0) ⊦ |
⊦ exfrag(EXIOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1]))
frag(IOAut(startf, stepf))(⌜sf0⌝ , α0), startf(sf0(0)), # ⌜λ n. ⌜sf0 from n⌝ × (α0 from n)⌝ ≠ # α0 + ⌜1⌝ ∨ (∃ n. ¬ ( ⌜n⌝ < # α0 → ⌜λ n. ⌜sf0 from n⌝ × (α0 from n)⌝ [n].1 ≠ [] ∧ ⌜λ n. ⌜sf0 from n⌝ × (α0 from n)⌝ [n].2 ≠ [] ∧ tl(⌜λ n. ⌜sf0 from n⌝ × (α0 from n)⌝ [n].1) ≠ [] ∧ stepf (hd(⌜λ n. ⌜sf0 from n⌝ × (α0 from n)⌝ [n].1), hd(⌜λ n. ⌜sf0 from n⌝ × (α0 from n)⌝ [n].2), hd(tl(⌜λ n. ⌜sf0 from n⌝ × (α0 from n)⌝ [n].1))) ∧ hd(⌜λ n. ⌜sf0 from n⌝ × (α0 from n)⌝ [n].2) = α0[n] ∧ ⌜λ n. ⌜sf0 from n⌝ × (α0 from n)⌝ [n +1] = tl(⌜λ n. ⌜sf0 from n⌝ × (α0 from n)⌝ [n].1) × tl(⌜λ n. ⌜sf0 from n⌝ × (α0 from n)⌝ [n].2))) ⊦
Used terms: α0, ⌜λ n. ⌜sf0 from n⌝ × (α0 from n)⌝ , λ σα, a, σα0. σα.1 ≠ [] ∧ σα.2 ≠ [] ∧ tl(σα.1) ≠ [] ∧ stepf(hd(σα.1), hd(σα.2), hd(tl(σα.1))) ∧ hd(σα.2) = a ∧ σα0 = tl(σα.1) × tl(σα.2), λ σα. frag(IOAut(startf, stepf))(σα.1, σα.2) ∧ startf(σα.1[0])
| ⊦ exfrag(EXIOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1])) |
| frag(IOAut(startf, stepf))(⌜sf0⌝ , α0), startf(sf0(0)), # ⌜λ n. ⌜sf0 from n⌝ × (α0 from n)⌝ ≠ # α0 + ⌜1⌝ ∨ (∃ n. ¬ ( ⌜n⌝ < # α0 → ⌜λ n. ⌜sf0 from n⌝ × (α0 from n)⌝ [n].1 ≠ [] ∧ ⌜λ n. ⌜sf0 from n⌝ × (α0 from n)⌝ [n].2 ≠ [] ∧ tl(⌜λ n. ⌜sf0 from n⌝ × (α0 from n)⌝ [n].1) ≠ [] ∧ stepf (hd(⌜λ n. ⌜sf0 from n⌝ × (α0 from n)⌝ [n].1), hd(⌜λ n. ⌜sf0 from n⌝ × (α0 from n)⌝ [n].2), hd(tl(⌜λ n. ⌜sf0 from n⌝ × (α0 from n)⌝ [n].1))) ∧ hd(⌜λ n. ⌜sf0 from n⌝ × (α0 from n)⌝ [n].2) = α0[n] ∧ ⌜λ n. ⌜sf0 from n⌝ × (α0 from n)⌝ [n +1] = tl(⌜λ n. ⌜sf0 from n⌝ × (α0 from n)⌝ [n].1) × tl(⌜λ n. ⌜sf0 from n⌝ × (α0 from n)⌝ [n].2))) ⊦ |
frag(IOAut(startf, stepf))(⌜sf0⌝ , α0), startf(sf0(0)), # α0 ≠ ∞ ∨ ¬ ( ⌜n⌝ < # α0 → stepf(sf0(n), hd(α0 from n), sf0(1 + n)) ∧ hd(α0 from n) = α0[n] ∧ ⌜sf0 from n + 1⌝ × (α0 from n + 1) = ⌜λ n0. sf0((n0 + 1) + n)⌝ × tl(α0 from n)) ⊦
Used simplifier rules: ⊦ (σ × α).2 = α; (s) ⊦ ⌜nf⌝ [n] = nf(n); (s) ⊦ ((nf from n))(m) = nf(m + n); (s) ⊦ m +1 = m + 1; (s) ⊦ tl(⌜nf⌝ ) = ⌜λ n. nf(n +1)⌝ ; (s) ⊦ (σ × α).1 = σ; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic ⊦ hd(⌜nf⌝ ) = nf(0); (s) ⊦ ((nf from n))(0) = nf(n); (s) ⊦ [] ≠ ⌜nf⌝ ; (s) ⊦ ⌜n⌝ < # σ → (σ from n = [] ↔ false); (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 ⊦ ⌜m⌝ + n∞ = ∞ ↔ n∞ = ∞; (s) ⊦ # ⌜nf⌝ = ∞; (s)
| frag(IOAut(startf, stepf))(⌜sf0⌝ , α0), startf(sf0(0)), # α0 ≠ ∞ ∨ ¬ ( ⌜n⌝ < # α0 → stepf(sf0(n), hd(α0 from n), sf0(1 + n)) ∧ hd(α0 from n) = α0[n] ∧ ⌜sf0 from n + 1⌝ × (α0 from n + 1) = ⌜λ n0. sf0((n0 + 1) + n)⌝ × tl(α0 from n)) ⊦ |
α0 = ⌜f_n->action⌝ , frag(IOAut(startf, stepf))(⌜sf0⌝ , α0), startf(sf0(0)), # α0 ≠ ∞ ∨ ¬ ( ⌜n⌝ < # α0 → stepf(sf0(n), hd(α0 from n), sf0(1 + n)) ∧ hd(α0 from n) = α0[n] ∧ ⌜sf0 from n + 1⌝ × (α0 from n + 1) = ⌜λ n0. sf0((n0 + 1) + n)⌝ × tl(α0 from n)) ⊦
Used simplifier rules: actionstream freely generated by ⌜ ⌝, ⌜ ⌝;; ⊦ ¬ frag(IOAut(startf, stepf))(⌜sf⌝ , ⌜al⌝ ); (s)
| α0 = ⌜f_n->action⌝ , frag(IOAut(startf, stepf))(⌜sf0⌝ , α0), startf(sf0(0)), # α0 ≠ ∞ ∨ ¬ ( ⌜n⌝ < # α0 → stepf(sf0(n), hd(α0 from n), sf0(1 + n)) ∧ hd(α0 from n) = α0[n] ∧ ⌜sf0 from n + 1⌝ × (α0 from n + 1) = ⌜λ n0. sf0((n0 + 1) + n)⌝ × tl(α0 from n)) ⊦ |
⌜sf0 from n + 1⌝ × ⌜f_n->action from n + 1⌝ ≠ ⌜λ n0. sf0((n0 + 1) + n)⌝ × ⌜λ n0. f_n->action((n0 + 1) + n)⌝ , frag(IOAut(startf, stepf))(⌜sf0⌝ , ⌜f_n->action⌝ ), startf(sf0(0)), stepf(sf0(n), f_n->action(n), sf0(1 + n)) ⊦
Used simplifier rules: ⊦ ¬ stepf(sf(n), af(n), sf(n + 1)) → (frag(IOAut(startf, stepf))(⌜sf⌝ , ⌜af⌝ ) ↔ false); (s) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ ((nf from n))(m) = nf(m + n); (s) ⊦ m +1 = m + 1; (s) ⊦ tl(⌜nf⌝ ) = ⌜λ n. nf(n +1)⌝ ; (s) ⊦ ⌜nf⌝ from n = ⌜nf from n⌝ ; (s) ⊦ ⌜nf⌝ [n] = nf(n); (s) ⊦ ((nf from n))(0) = nf(n); (s) ⊦ hd(⌜nf⌝ ) = nf(0); (s) ⊦ ⌜m⌝ < ∞; (s) ⊦ # ⌜nf⌝ = ∞; (s)
| ⌜sf0 from n + 1⌝ × ⌜f_n->action from n + 1⌝ ≠ ⌜λ n0. sf0((n0 + 1) + n)⌝ × ⌜λ n0. f_n->action((n0 + 1) + n)⌝ , frag(IOAut(startf, stepf))(⌜sf0⌝ , ⌜f_n->action⌝ ), startf(sf0(0)), stepf(sf0(n), f_n->action(n), sf0(1 + n)) ⊦ |
⊦ σ × α = σ0 × α0 ↔ σ = σ0 ∧ α = α0
Used simplifier rules: ⊦ ⌜nf⌝ = ⌜nf0⌝ ↔ nf = nf0; (s) ⊦ ((nf from n))(m) = nf(m + n); (s) ⊦ ⌜nf⌝ = ⌜nf0⌝ ↔ nf = nf0; (s) ⊦ ((nf from n))(m) = nf(m + n); (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic Used terms: ⌜λ n0. f_n->action((n0 + 1) + n)⌝ , ⌜λ n0. sf0((n0 + 1) + n)⌝ , ⌜f_n->action from n + 1⌝ , ⌜sf0 from n + 1⌝
| ⊦ σ × α = σ0 × α0 ↔ σ = σ0 ∧ α = α0 |
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.