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

〈RED1(ks(n0); tn)〉 tn = tn0, ks(n0) .1 .1 = S, ap(ks(n0)), ap(ks(n0) .1), tn0 = none → n0 ≤ 1, tn0 ≠ none → ¬ n0 ≤ 1 ∧ tn0 = some(ks(n0 - 2)), ¬ (ks(n0) .1 = K ∧ value(ks(n0) .2)), ¬ (value(ks(n0) .1 .2) ∧ value(ks(n0) .2)) ⊦ 〈RED1(ks(n0); tn)〉〈if tn ≠ none then tn := some(tn .t _ K) else if value(ks(n0)) then { RED1(K; tn) ; if tn ≠ none then tn := some(ks(n0) _ tn .t) }〉 ((tn = none → n0 = 0) ∧ (tn ≠ none → n0 ≠ 0 ∧ tn = some(ks(n0 + 1 - 2))))

Heuristic contract and execute applied rule execute call

And obtained the following new goals

Proof step 41:
〈RED1(ks(n0); tn)〉 tn = tn1, ks(n0) .1 .1 = S, ap(ks(n0)), ap(ks(n0) .1), tn0 = none → n0 ≤ 1, tn0 ≠ none → ¬ n0 ≤ 1 ∧ tn0 = some(ks(n0 - 2)), ¬ (ks(n0) .1 = K ∧ value(ks(n0) .2)), ¬ (value(ks(n0) .1 .2) ∧ value(ks(n0) .2)), tn1 = tn0 ⊦ 〈if tn1 ≠ none then tn1 := some(tn1 .t _ K) else if value(ks(n0)) then { RED1(K; tn1) ; if tn1 ≠ none then tn1 := some(ks(n0) _ tn1 .t) }〉 ((tn1 = none → n0 = 0) ∧ (tn1 ≠ none → n0 ≠ 0 ∧ tn1 = some(ks(n0 + 1 - 2))))

Rule argument

[fmaposlist-arg: (pos: left 1, pos: right 1)]

Additional information

[[CONCRETESIMPRULES : ()]]