YES(?,POLY) * Step 1: UnsatPaths WORST_CASE(?,POLY) + Considered Problem: Rules: 0. evalinsertsortstart(A,B,C,D) -> evalinsertsortentryin(A,B,C,D) True (1,1) 1. evalinsertsortentryin(A,B,C,D) -> evalinsertsortbb5in(1,B,C,D) True (?,1) 2. evalinsertsortbb5in(A,B,C,D) -> evalinsertsortbbin(A,B,C,D) [-1 + A >= 0 && B >= 1 + A] (?,1) 3. evalinsertsortbb5in(A,B,C,D) -> evalinsertsortreturnin(A,B,C,D) [-1 + A >= 0 && A >= B] (?,1) 4. evalinsertsortbbin(A,B,C,D) -> evalinsertsortbb2in(A,B,E,-1 + A) [-2 + B >= 0 && -3 + A + B >= 0 && -1 + -1*A + B >= 0 && -1 + A >= 0] (?,1) 5. evalinsertsortbb2in(A,B,C,D) -> evalinsertsortbb4in(A,B,C,D) [-2 + B + -1*D >= 0 (?,1) && -1 + A + -1*D >= 0 && -2 + B >= 0 && -3 + A + B >= 0 && -1 + -1*A + B >= 0 && -1 + A >= 0 && 0 >= 1 + D] 6. evalinsertsortbb2in(A,B,C,D) -> evalinsertsortbb3in(A,B,C,D) [-2 + B + -1*D >= 0 (?,1) && -1 + A + -1*D >= 0 && -2 + B >= 0 && -3 + A + B >= 0 && -1 + -1*A + B >= 0 && -1 + A >= 0 && D >= 0] 7. evalinsertsortbb3in(A,B,C,D) -> evalinsertsortbb1in(A,B,C,D) [-2 + B + -1*D >= 0 (?,1) && -1 + A + -1*D >= 0 && D >= 0 && -2 + B + D >= 0 && -1 + A + D >= 0 && -2 + B >= 0 && -3 + A + B >= 0 && -1 + -1*A + B >= 0 && -1 + A >= 0 && E >= 1 + C] 8. evalinsertsortbb3in(A,B,C,D) -> evalinsertsortbb4in(A,B,C,D) [-2 + B + -1*D >= 0 (?,1) && -1 + A + -1*D >= 0 && D >= 0 && -2 + B + D >= 0 && -1 + A + D >= 0 && -2 + B >= 0 && -3 + A + B >= 0 && -1 + -1*A + B >= 0 && -1 + A >= 0 && C >= E] 9. evalinsertsortbb1in(A,B,C,D) -> evalinsertsortbb2in(A,B,C,-1 + D) [-2 + B + -1*D >= 0 (?,1) && -1 + A + -1*D >= 0 && D >= 0 && -2 + B + D >= 0 && -1 + A + D >= 0 && -2 + B >= 0 && -3 + A + B >= 0 && -1 + -1*A + B >= 0 && -1 + A >= 0] 10. evalinsertsortbb4in(A,B,C,D) -> evalinsertsortbb5in(1 + A,B,C,D) [-2 + B + -1*D >= 0 (?,1) && -1 + A + -1*D >= 0 && -2 + B >= 0 && -3 + A + B >= 0 && -1 + -1*A + B >= 0 && -1 + A >= 0] 11. evalinsertsortreturnin(A,B,C,D) -> evalinsertsortstop(A,B,C,D) [A + -1*B >= 0 && -1 + A >= 0] (?,1) Signature: {(evalinsertsortbb1in,4) ;(evalinsertsortbb2in,4) ;(evalinsertsortbb3in,4) ;(evalinsertsortbb4in,4) ;(evalinsertsortbb5in,4) ;(evalinsertsortbbin,4) ;(evalinsertsortentryin,4) ;(evalinsertsortreturnin,4) ;(evalinsertsortstart,4) ;(evalinsertsortstop,4)} Flow Graph: [0->{1},1->{2,3},2->{4},3->{11},4->{5,6},5->{10},6->{7,8},7->{9},8->{10},9->{5,6},10->{2,3},11->{}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(4,5)] * Step 2: FromIts WORST_CASE(?,POLY) + Considered Problem: Rules: 0. evalinsertsortstart(A,B,C,D) -> evalinsertsortentryin(A,B,C,D) True (1,1) 1. evalinsertsortentryin(A,B,C,D) -> evalinsertsortbb5in(1,B,C,D) True (?,1) 2. evalinsertsortbb5in(A,B,C,D) -> evalinsertsortbbin(A,B,C,D) [-1 + A >= 0 && B >= 1 + A] (?,1) 3. evalinsertsortbb5in(A,B,C,D) -> evalinsertsortreturnin(A,B,C,D) [-1 + A >= 0 && A >= B] (?,1) 4. evalinsertsortbbin(A,B,C,D) -> evalinsertsortbb2in(A,B,E,-1 + A) [-2 + B >= 0 && -3 + A + B >= 0 && -1 + -1*A + B >= 0 && -1 + A >= 0] (?,1) 5. evalinsertsortbb2in(A,B,C,D) -> evalinsertsortbb4in(A,B,C,D) [-2 + B + -1*D >= 0 (?,1) && -1 + A + -1*D >= 0 && -2 + B >= 0 && -3 + A + B >= 0 && -1 + -1*A + B >= 0 && -1 + A >= 0 && 0 >= 1 + D] 6. evalinsertsortbb2in(A,B,C,D) -> evalinsertsortbb3in(A,B,C,D) [-2 + B + -1*D >= 0 (?,1) && -1 + A + -1*D >= 0 && -2 + B >= 0 && -3 + A + B >= 0 && -1 + -1*A + B >= 0 && -1 + A >= 0 && D >= 0] 7. evalinsertsortbb3in(A,B,C,D) -> evalinsertsortbb1in(A,B,C,D) [-2 + B + -1*D >= 0 (?,1) && -1 + A + -1*D >= 0 && D >= 0 && -2 + B + D >= 0 && -1 + A + D >= 0 && -2 + B >= 0 && -3 + A + B >= 0 && -1 + -1*A + B >= 0 && -1 + A >= 0 && E >= 1 + C] 8. evalinsertsortbb3in(A,B,C,D) -> evalinsertsortbb4in(A,B,C,D) [-2 + B + -1*D >= 0 (?,1) && -1 + A + -1*D >= 0 && D >= 0 && -2 + B + D >= 0 && -1 + A + D >= 0 && -2 + B >= 0 && -3 + A + B >= 0 && -1 + -1*A + B >= 0 && -1 + A >= 0 && C >= E] 9. evalinsertsortbb1in(A,B,C,D) -> evalinsertsortbb2in(A,B,C,-1 + D) [-2 + B + -1*D >= 0 (?,1) && -1 + A + -1*D >= 0 && D >= 0 && -2 + B + D >= 0 && -1 + A + D >= 0 && -2 + B >= 0 && -3 + A + B >= 0 && -1 + -1*A + B >= 0 && -1 + A >= 0] 10. evalinsertsortbb4in(A,B,C,D) -> evalinsertsortbb5in(1 + A,B,C,D) [-2 + B + -1*D >= 0 (?,1) && -1 + A + -1*D >= 0 && -2 + B >= 0 && -3 + A + B >= 0 && -1 + -1*A + B >= 0 && -1 + A >= 0] 11. evalinsertsortreturnin(A,B,C,D) -> evalinsertsortstop(A,B,C,D) [A + -1*B >= 0 && -1 + A >= 0] (?,1) Signature: {(evalinsertsortbb1in,4) ;(evalinsertsortbb2in,4) ;(evalinsertsortbb3in,4) ;(evalinsertsortbb4in,4) ;(evalinsertsortbb5in,4) ;(evalinsertsortbbin,4) ;(evalinsertsortentryin,4) ;(evalinsertsortreturnin,4) ;(evalinsertsortstart,4) ;(evalinsertsortstop,4)} Flow Graph: [0->{1},1->{2,3},2->{4},3->{11},4->{6},5->{10},6->{7,8},7->{9},8->{10},9->{5,6},10->{2,3},11->{}] + Applied Processor: FromIts + Details: () * Step 3: AddSinks WORST_CASE(?,POLY) + Considered Problem: Rules: evalinsertsortstart(A,B,C,D) -> evalinsertsortentryin(A,B,C,D) True evalinsertsortentryin(A,B,C,D) -> evalinsertsortbb5in(1,B,C,D) True evalinsertsortbb5in(A,B,C,D) -> evalinsertsortbbin(A,B,C,D) [-1 + A >= 0 && B >= 1 + A] evalinsertsortbb5in(A,B,C,D) -> evalinsertsortreturnin(A,B,C,D) [-1 + A >= 0 && A >= B] evalinsertsortbbin(A,B,C,D) -> evalinsertsortbb2in(A,B,E,-1 + A) [-2 + B >= 0 && -3 + A + B >= 0 && -1 + -1*A + B >= 0 && -1 + A >= 0] evalinsertsortbb2in(A,B,C,D) -> evalinsertsortbb4in(A,B,C,D) [-2 + B + -1*D >= 0 && -1 + A + -1*D >= 0 && -2 + B >= 0 && -3 + A + B >= 0 && -1 + -1*A + B >= 0 && -1 + A >= 0 && 0 >= 1 + D] evalinsertsortbb2in(A,B,C,D) -> evalinsertsortbb3in(A,B,C,D) [-2 + B + -1*D >= 0 && -1 + A + -1*D >= 0 && -2 + B >= 0 && -3 + A + B >= 0 && -1 + -1*A + B >= 0 && -1 + A >= 0 && D >= 0] evalinsertsortbb3in(A,B,C,D) -> evalinsertsortbb1in(A,B,C,D) [-2 + B + -1*D >= 0 && -1 + A + -1*D >= 0 && D >= 0 && -2 + B + D >= 0 && -1 + A + D >= 0 && -2 + B >= 0 && -3 + A + B >= 0 && -1 + -1*A + B >= 0 && -1 + A >= 0 && E >= 1 + C] evalinsertsortbb3in(A,B,C,D) -> evalinsertsortbb4in(A,B,C,D) [-2 + B + -1*D >= 0 && -1 + A + -1*D >= 0 && D >= 0 && -2 + B + D >= 0 && -1 + A + D >= 0 && -2 + B >= 0 && -3 + A + B >= 0 && -1 + -1*A + B >= 0 && -1 + A >= 0 && C >= E] evalinsertsortbb1in(A,B,C,D) -> evalinsertsortbb2in(A,B,C,-1 + D) [-2 + B + -1*D >= 0 && -1 + A + -1*D >= 0 && D >= 0 && -2 + B + D >= 0 && -1 + A + D >= 0 && -2 + B >= 0 && -3 + A + B >= 0 && -1 + -1*A + B >= 0 && -1 + A >= 0] evalinsertsortbb4in(A,B,C,D) -> evalinsertsortbb5in(1 + A,B,C,D) [-2 + B + -1*D >= 0 && -1 + A + -1*D >= 0 && -2 + B >= 0 && -3 + A + B >= 0 && -1 + -1*A + B >= 0 && -1 + A >= 0] evalinsertsortreturnin(A,B,C,D) -> evalinsertsortstop(A,B,C,D) [A + -1*B >= 0 && -1 + A >= 0] Signature: {(evalinsertsortbb1in,4) ;(evalinsertsortbb2in,4) ;(evalinsertsortbb3in,4) ;(evalinsertsortbb4in,4) ;(evalinsertsortbb5in,4) ;(evalinsertsortbbin,4) ;(evalinsertsortentryin,4) ;(evalinsertsortreturnin,4) ;(evalinsertsortstart,4) ;(evalinsertsortstop,4)} Rule Graph: [0->{1},1->{2,3},2->{4},3->{11},4->{6},5->{10},6->{7,8},7->{9},8->{10},9->{5,6},10->{2,3},11->{}] + Applied Processor: AddSinks + Details: () * Step 4: Decompose WORST_CASE(?,POLY) + Considered Problem: Rules: evalinsertsortstart(A,B,C,D) -> evalinsertsortentryin(A,B,C,D) True evalinsertsortentryin(A,B,C,D) -> evalinsertsortbb5in(1,B,C,D) True evalinsertsortbb5in(A,B,C,D) -> evalinsertsortbbin(A,B,C,D) [-1 + A >= 0 && B >= 1 + A] evalinsertsortbb5in(A,B,C,D) -> evalinsertsortreturnin(A,B,C,D) [-1 + A >= 0 && A >= B] evalinsertsortbbin(A,B,C,D) -> evalinsertsortbb2in(A,B,E,-1 + A) [-2 + B >= 0 && -3 + A + B >= 0 && -1 + -1*A + B >= 0 && -1 + A >= 0] evalinsertsortbb2in(A,B,C,D) -> evalinsertsortbb4in(A,B,C,D) [-2 + B + -1*D >= 0 && -1 + A + -1*D >= 0 && -2 + B >= 0 && -3 + A + B >= 0 && -1 + -1*A + B >= 0 && -1 + A >= 0 && 0 >= 1 + D] evalinsertsortbb2in(A,B,C,D) -> evalinsertsortbb3in(A,B,C,D) [-2 + B + -1*D >= 0 && -1 + A + -1*D >= 0 && -2 + B >= 0 && -3 + A + B >= 0 && -1 + -1*A + B >= 0 && -1 + A >= 0 && D >= 0] evalinsertsortbb3in(A,B,C,D) -> evalinsertsortbb1in(A,B,C,D) [-2 + B + -1*D >= 0 && -1 + A + -1*D >= 0 && D >= 0 && -2 + B + D >= 0 && -1 + A + D >= 0 && -2 + B >= 0 && -3 + A + B >= 0 && -1 + -1*A + B >= 0 && -1 + A >= 0 && E >= 1 + C] evalinsertsortbb3in(A,B,C,D) -> evalinsertsortbb4in(A,B,C,D) [-2 + B + -1*D >= 0 && -1 + A + -1*D >= 0 && D >= 0 && -2 + B + D >= 0 && -1 + A + D >= 0 && -2 + B >= 0 && -3 + A + B >= 0 && -1 + -1*A + B >= 0 && -1 + A >= 0 && C >= E] evalinsertsortbb1in(A,B,C,D) -> evalinsertsortbb2in(A,B,C,-1 + D) [-2 + B + -1*D >= 0 && -1 + A + -1*D >= 0 && D >= 0 && -2 + B + D >= 0 && -1 + A + D >= 0 && -2 + B >= 0 && -3 + A + B >= 0 && -1 + -1*A + B >= 0 && -1 + A >= 0] evalinsertsortbb4in(A,B,C,D) -> evalinsertsortbb5in(1 + A,B,C,D) [-2 + B + -1*D >= 0 && -1 + A + -1*D >= 0 && -2 + B >= 0 && -3 + A + B >= 0 && -1 + -1*A + B >= 0 && -1 + A >= 0] evalinsertsortreturnin(A,B,C,D) -> evalinsertsortstop(A,B,C,D) [A + -1*B >= 0 && -1 + A >= 0] evalinsertsortstop(A,B,C,D) -> exitus616(A,B,C,D) True Signature: {(evalinsertsortbb1in,4) ;(evalinsertsortbb2in,4) ;(evalinsertsortbb3in,4) ;(evalinsertsortbb4in,4) ;(evalinsertsortbb5in,4) ;(evalinsertsortbbin,4) ;(evalinsertsortentryin,4) ;(evalinsertsortreturnin,4) ;(evalinsertsortstart,4) ;(evalinsertsortstop,4) ;(exitus616,4)} Rule Graph: [0->{1},1->{2,3},2->{4},3->{11},4->{6},5->{10},6->{7,8},7->{9},8->{10},9->{5,6},10->{2,3},11->{12}] + Applied Processor: Decompose Greedy + Details: We construct a looptree: P: [0,1,2,3,4,5,6,7,8,9,10,11,12] | `- p:[2,10,5,9,7,6,4,8] c: [2,4,5,8,10] | `- p:[6,9,7] c: [6,7,9] * Step 5: AbstractSize WORST_CASE(?,POLY) + Considered Problem: (Rules: evalinsertsortstart(A,B,C,D) -> evalinsertsortentryin(A,B,C,D) True evalinsertsortentryin(A,B,C,D) -> evalinsertsortbb5in(1,B,C,D) True evalinsertsortbb5in(A,B,C,D) -> evalinsertsortbbin(A,B,C,D) [-1 + A >= 0 && B >= 1 + A] evalinsertsortbb5in(A,B,C,D) -> evalinsertsortreturnin(A,B,C,D) [-1 + A >= 0 && A >= B] evalinsertsortbbin(A,B,C,D) -> evalinsertsortbb2in(A,B,E,-1 + A) [-2 + B >= 0 && -3 + A + B >= 0 && -1 + -1*A + B >= 0 && -1 + A >= 0] evalinsertsortbb2in(A,B,C,D) -> evalinsertsortbb4in(A,B,C,D) [-2 + B + -1*D >= 0 && -1 + A + -1*D >= 0 && -2 + B >= 0 && -3 + A + B >= 0 && -1 + -1*A + B >= 0 && -1 + A >= 0 && 0 >= 1 + D] evalinsertsortbb2in(A,B,C,D) -> evalinsertsortbb3in(A,B,C,D) [-2 + B + -1*D >= 0 && -1 + A + -1*D >= 0 && -2 + B >= 0 && -3 + A + B >= 0 && -1 + -1*A + B >= 0 && -1 + A >= 0 && D >= 0] evalinsertsortbb3in(A,B,C,D) -> evalinsertsortbb1in(A,B,C,D) [-2 + B + -1*D >= 0 && -1 + A + -1*D >= 0 && D >= 0 && -2 + B + D >= 0 && -1 + A + D >= 0 && -2 + B >= 0 && -3 + A + B >= 0 && -1 + -1*A + B >= 0 && -1 + A >= 0 && E >= 1 + C] evalinsertsortbb3in(A,B,C,D) -> evalinsertsortbb4in(A,B,C,D) [-2 + B + -1*D >= 0 && -1 + A + -1*D >= 0 && D >= 0 && -2 + B + D >= 0 && -1 + A + D >= 0 && -2 + B >= 0 && -3 + A + B >= 0 && -1 + -1*A + B >= 0 && -1 + A >= 0 && C >= E] evalinsertsortbb1in(A,B,C,D) -> evalinsertsortbb2in(A,B,C,-1 + D) [-2 + B + -1*D >= 0 && -1 + A + -1*D >= 0 && D >= 0 && -2 + B + D >= 0 && -1 + A + D >= 0 && -2 + B >= 0 && -3 + A + B >= 0 && -1 + -1*A + B >= 0 && -1 + A >= 0] evalinsertsortbb4in(A,B,C,D) -> evalinsertsortbb5in(1 + A,B,C,D) [-2 + B + -1*D >= 0 && -1 + A + -1*D >= 0 && -2 + B >= 0 && -3 + A + B >= 0 && -1 + -1*A + B >= 0 && -1 + A >= 0] evalinsertsortreturnin(A,B,C,D) -> evalinsertsortstop(A,B,C,D) [A + -1*B >= 0 && -1 + A >= 0] evalinsertsortstop(A,B,C,D) -> exitus616(A,B,C,D) True Signature: {(evalinsertsortbb1in,4) ;(evalinsertsortbb2in,4) ;(evalinsertsortbb3in,4) ;(evalinsertsortbb4in,4) ;(evalinsertsortbb5in,4) ;(evalinsertsortbbin,4) ;(evalinsertsortentryin,4) ;(evalinsertsortreturnin,4) ;(evalinsertsortstart,4) ;(evalinsertsortstop,4) ;(exitus616,4)} Rule Graph: [0->{1},1->{2,3},2->{4},3->{11},4->{6},5->{10},6->{7,8},7->{9},8->{10},9->{5,6},10->{2,3},11->{12}] ,We construct a looptree: P: [0,1,2,3,4,5,6,7,8,9,10,11,12] | `- p:[2,10,5,9,7,6,4,8] c: [2,4,5,8,10] | `- p:[6,9,7] c: [6,7,9]) + Applied Processor: AbstractSize Minimize + Details: () * Step 6: AbstractFlow WORST_CASE(?,POLY) + Considered Problem: Program: Domain: [A,B,C,D,0.0,0.0.0] evalinsertsortstart ~> evalinsertsortentryin [A <= A, B <= B, C <= C, D <= D] evalinsertsortentryin ~> evalinsertsortbb5in [A <= K, B <= B, C <= C, D <= D] evalinsertsortbb5in ~> evalinsertsortbbin [A <= A, B <= B, C <= C, D <= D] evalinsertsortbb5in ~> evalinsertsortreturnin [A <= A, B <= B, C <= C, D <= D] evalinsertsortbbin ~> evalinsertsortbb2in [A <= A, B <= B, C <= unknown, D <= B] evalinsertsortbb2in ~> evalinsertsortbb4in [A <= A, B <= B, C <= C, D <= D] evalinsertsortbb2in ~> evalinsertsortbb3in [A <= A, B <= B, C <= C, D <= D] evalinsertsortbb3in ~> evalinsertsortbb1in [A <= A, B <= B, C <= C, D <= D] evalinsertsortbb3in ~> evalinsertsortbb4in [A <= A, B <= B, C <= C, D <= D] evalinsertsortbb1in ~> evalinsertsortbb2in [A <= A, B <= B, C <= C, D <= B] evalinsertsortbb4in ~> evalinsertsortbb5in [A <= B, B <= B, C <= C, D <= D] evalinsertsortreturnin ~> evalinsertsortstop [A <= A, B <= B, C <= C, D <= D] evalinsertsortstop ~> exitus616 [A <= A, B <= B, C <= C, D <= D] + Loop: [0.0 <= A + B] evalinsertsortbb5in ~> evalinsertsortbbin [A <= A, B <= B, C <= C, D <= D] evalinsertsortbb4in ~> evalinsertsortbb5in [A <= B, B <= B, C <= C, D <= D] evalinsertsortbb2in ~> evalinsertsortbb4in [A <= A, B <= B, C <= C, D <= D] evalinsertsortbb1in ~> evalinsertsortbb2in [A <= A, B <= B, C <= C, D <= B] evalinsertsortbb3in ~> evalinsertsortbb1in [A <= A, B <= B, C <= C, D <= D] evalinsertsortbb2in ~> evalinsertsortbb3in [A <= A, B <= B, C <= C, D <= D] evalinsertsortbbin ~> evalinsertsortbb2in [A <= A, B <= B, C <= unknown, D <= B] evalinsertsortbb3in ~> evalinsertsortbb4in [A <= A, B <= B, C <= C, D <= D] + Loop: [0.0.0 <= D] evalinsertsortbb2in ~> evalinsertsortbb3in [A <= A, B <= B, C <= C, D <= D] evalinsertsortbb1in ~> evalinsertsortbb2in [A <= A, B <= B, C <= C, D <= B] evalinsertsortbb3in ~> evalinsertsortbb1in [A <= A, B <= B, C <= C, D <= D] + Applied Processor: AbstractFlow + Details: () * Step 7: Lare WORST_CASE(?,POLY) + Considered Problem: Program: Domain: [tick,huge,K,A,B,C,D,0.0,0.0.0] evalinsertsortstart ~> evalinsertsortentryin [] evalinsertsortentryin ~> evalinsertsortbb5in [K ~=> A] evalinsertsortbb5in ~> evalinsertsortbbin [] evalinsertsortbb5in ~> evalinsertsortreturnin [] evalinsertsortbbin ~> evalinsertsortbb2in [B ~=> D,huge ~=> C] evalinsertsortbb2in ~> evalinsertsortbb4in [] evalinsertsortbb2in ~> evalinsertsortbb3in [] evalinsertsortbb3in ~> evalinsertsortbb1in [] evalinsertsortbb3in ~> evalinsertsortbb4in [] evalinsertsortbb1in ~> evalinsertsortbb2in [B ~=> D] evalinsertsortbb4in ~> evalinsertsortbb5in [B ~=> A] evalinsertsortreturnin ~> evalinsertsortstop [] evalinsertsortstop ~> exitus616 [] + Loop: [A ~+> 0.0,B ~+> 0.0] evalinsertsortbb5in ~> evalinsertsortbbin [] evalinsertsortbb4in ~> evalinsertsortbb5in [B ~=> A] evalinsertsortbb2in ~> evalinsertsortbb4in [] evalinsertsortbb1in ~> evalinsertsortbb2in [B ~=> D] evalinsertsortbb3in ~> evalinsertsortbb1in [] evalinsertsortbb2in ~> evalinsertsortbb3in [] evalinsertsortbbin ~> evalinsertsortbb2in [B ~=> D,huge ~=> C] evalinsertsortbb3in ~> evalinsertsortbb4in [] + Loop: [D ~=> 0.0.0] evalinsertsortbb2in ~> evalinsertsortbb3in [] evalinsertsortbb1in ~> evalinsertsortbb2in [B ~=> D] evalinsertsortbb3in ~> evalinsertsortbb1in [] + Applied Processor: Lare + Details: evalinsertsortstart ~> exitus616 [B ~=> A ,B ~=> D ,B ~=> 0.0.0 ,K ~=> A ,huge ~=> C ,B ~+> 0.0 ,B ~+> tick ,tick ~+> tick ,K ~+> 0.0 ,K ~+> tick ,B ~*> tick ,K ~*> tick] + evalinsertsortbb5in> [B ~=> A ,B ~=> D ,B ~=> 0.0.0 ,huge ~=> C ,A ~+> 0.0 ,A ~+> tick ,B ~+> 0.0 ,B ~+> tick ,tick ~+> tick ,A ~*> tick ,B ~*> tick] + evalinsertsortbb3in> [B ~=> D,D ~=> 0.0.0,D ~+> tick,tick ~+> tick] evalinsertsortbb2in> [B ~=> D,D ~=> 0.0.0,D ~+> tick,tick ~+> tick] YES(?,POLY)