[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 38 from proof NEWPARTS-example (previous step)

length_of_P = 2, P = pe(3, 5, 2) ', Pdone0 = pe(0, 0, 0) ', Pnew0 = pe(1, 2, 0) ', F = (∅)[0, 0][1, 0][2, 0][3, 1][4, 1][5, 1][1, 2, 2] ⊦ ⟨while P ≠ [] do let p = P.head in {P := P.tail; if p.count ≠ 0 ∧ p.first + p.count ≤ p.last then Pdone0 := Pdone0 + pe(p.first, p.first + (p.count - 1), 0) ', Pnew0 := Pnew0 + pe(p.first + p.count, p.last, 0) ', F := F[p.first + p.count, p.last, length_of_P + # Pnew0] else Pdone0 := Pdone0 + p '}⟩ ⟨P := Pdone0 + Pnew0⟩ ( P = pe(0, 0, 0) ' + pe(3, 4, 0) ' + pe(1, 2, 0) ' + pe(5, 5, 0) ' ∧ F = (∅)[0, 0][1, 2][2, 2][3, 1][4, 1][5, 3])

Heuristic unwind applied rule while unwind right

And obtained the following new goals

Proof step 37:
length_of_P = 2, P = pe(3, 5, 2) ', Pdone0 = pe(0, 0, 0) ', Pnew0 = pe(1, 2, 0) ', F = (∅)[0, 0][1, 0][2, 0][3, 1][4, 1][5, 1][1, 2, 2] ⊦ ⟨let p = P.head in {P := P.tail; if p.count ≠ 0 ∧ p.first + p.count ≤ p.last then Pdone0 := Pdone0 + pe(p.first, p.first + (p.count - 1), 0) ', Pnew0 := Pnew0 + pe(p.first + p.count, p.last, 0) ', F := F[p.first + p.count, p.last, length_of_P + # Pnew0] else Pdone0 := Pdone0 + p '}⟩ ⟨while P ≠ [] do let p = P.head in {P := P.tail; if p.count ≠ 0 ∧ p.first + p.count ≤ p.last then Pdone0 := Pdone0 + pe(p.first, p.first + (p.count - 1), 0) ', Pnew0 := Pnew0 + pe(p.first + p.count, p.last, 0) ', F := F[p.first + p.count, p.last, length_of_P + # Pnew0] else Pdone0 := Pdone0 + p '}⟩ ⟨P := Pdone0 + Pnew0⟩ ( P = pe(0, 0, 0) ' + pe(3, 4, 0) ' + pe(1, 2, 0) ' + pe(5, 5, 0) ' ∧ F = (∅)[0, 0][1, 2][2, 2][3, 1][4, 1][5, 3])

Rule argument

Additional information

[Concretesimprules((Csimpnamedseq(list,partition,e, ⊦ p ' ≠ [])))]