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

〈let v1 = (S _ t4 _ t3 _ t1) .1 .1 .2, v2 = (S _ t4 _ t3 _ t1) .1 .2, v3 = (S _ t4 _ t3 _ t1) .2 in if value(v1) ∧ value(v2) ∧ value(v3) then tn1 := some(v1 _ v3 _ (v2 _ v3)) else tn1 := none〉 tn1 = tn0, ∀ n0, t, tn1, tn0. n0 < m + 1 → (〈RED1(t; tn3): n0 〉 tn3 = tn1 ∧ 〈RED1(t; tn3)〉 tn3 = tn0 ∧ tn0 ≠ tn1 → false), tn0 ≠ some(t4 _ t1 _ (t3 _ t1)), m ≠ 0, tn0 ≠ none, value(t4), value(t3), value(t1) ⊦

Heuristic symbolic execution applied rule vardecls left

And obtained the following new goals

Proof step 267:
〈if value(v4) ∧ value(v0) ∧ value(v) then tn1 := some(v4 _ v _ (v0 _ v)) else tn1 := none〉 tn1 = tn0, ∀ n0, t, tn1, tn0. n0 < m + 1 → (〈RED1(t; tn3): n0 〉 tn3 = tn1 ∧ 〈RED1(t; tn3)〉 tn3 = tn0 ∧ tn0 ≠ tn1 → false), tn0 ≠ some(t4 _ t1 _ (t3 _ t1)), m ≠ 0, tn0 ≠ none, value(t4), value(t3), value(t1), v = (S _ t4 _ t3 _ t1) .2, v0 = (S _ t4 _ t3 _ t1) .1 .2, v4 = (S _ t4 _ t3 _ t1) .1 .1 .2 ⊦

Rule argument

[emptyarg]

Additional information

[[CONCRETESIMPRULES : ()]]