[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 18 from proof termination-RED1 (previous step)

∀ t0. #(t0) < #(t) → (¬ hasS(t0) → 〈RED1(t0; tn)〉 (tn ≠ none → ¬ hasS(tn) ∧ #(tn) < #(t0))), ¬ hasS(t), ¬ (ap(t) ∧ ap(t .1) ∧ t .1 .1 = K ∧ value(t .1 .2) ∧ value(t .2)), ap(t) ∧ ap(t .1) ∧ ap(t .1 .1) ∧ t .1 .1 .1 = S, v = t .2, v0 = t .1 .2, v4 = t .1 .1 .2, value(v4) ∧ value(v0) ∧ value(v), tn = some(v4 _ v _ (v0 _ v)) ⊦ 〈if tn = none ∧ ap(t) then { RED1(t .1; tn) ; if tn ≠ none then tn := some(tn .t _ t .2) else if value(t .1) then { RED1(t .2; tn) ; if tn ≠ none then tn := some(t .1 _ tn .t) } }〉 (tn ≠ none → ¬ hasS(tn) ∧ #(tn) < #(t))

Heuristic symbolic execution applied rule if negative right

And obtained the following new goals

Proof step 17:
∀ t0. #(t0) < #(t) → (¬ hasS(t0) → 〈RED1(t0; tn)〉 (tn ≠ none → ¬ hasS(tn) ∧ #(tn) < #(t0))), ¬ hasS(t), ¬ (ap(t) ∧ ap(t .1) ∧ t .1 .1 = K ∧ value(t .1 .2) ∧ value(t .2)), ap(t) ∧ ap(t .1) ∧ ap(t .1 .1) ∧ t .1 .1 .1 = S, v = t .2, v0 = t .1 .2, v4 = t .1 .1 .2, value(v4) ∧ value(v0) ∧ value(v), tn = some(v4 _ v _ (v0 _ v)) ⊦ 〈skip〉 (tn ≠ none → ¬ hasS(tn) ∧ #(tn) < #(t))

Rule argument

[fmapos-arg: pos: right 1]

Additional information

[[CONCRETESIMPRULES : ([CSIMPSEQ : ⊦ some(t) ≠ none])]]