32.21/23.02	WORST_CASE(Omega(n^3), O(n^3))
32.21/23.03	proof of /export/starexec/sandbox2/benchmark/theBenchmark.koat
32.21/23.03	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
32.21/23.03	
32.21/23.03	
32.21/23.03	The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(n^3, nat(2 * Arg_1 + 2 * Arg_2 + -2 * Arg_5) + nat(1 + -1 * Arg_0 + Arg_1) + nat(2 + -6 * Arg_0 + -8 * Arg_0 * Arg_1 + 8 * Arg_0 * Arg_1 * Arg_2 + -8 * Arg_0 * Arg_1 * Arg_3 + 6 * Arg_0 * Arg_2 + 8 * Arg_3 * Arg_0 * Arg_2 + -14 * Arg_0 * Arg_3 + -8 * Arg_3^2 * Arg_0 + 4 * Arg_0^2 + -4 * Arg_0^2 * Arg_2 + 4 * Arg_0^2 * Arg_3 + 6 * Arg_1 + -6 * Arg_1 * Arg_2 + -8 * Arg_3 * Arg_1 * Arg_2 + 14 * Arg_1 * Arg_3 + 8 * Arg_3^2 * Arg_1 + 4 * Arg_1^2 + -4 * Arg_1^2 * Arg_2 + 4 * Arg_1^2 * Arg_3 + -2 * Arg_2 + -4 * Arg_3 * Arg_2 + 6 * Arg_3 + 4 * Arg_3^2) + nat(1 + -2 * Arg_0 + 2 * Arg_1) + nat(6 + -12 * Arg_0 + 12 * Arg_0 * Arg_2 + -12 * Arg_0 * Arg_3 + 12 * Arg_1 + -12 * Arg_1 * Arg_2 + 12 * Arg_1 * Arg_3 + -6 * Arg_2 + 6 * Arg_3) + max(4, 5 + -2 * Arg_0 + 2 * Arg_1)).
32.21/23.03	
32.21/23.03	(0) CpxIntTrs
32.21/23.03	(1) Koat2 Proof [FINISHED, 5096 ms]
32.21/23.03	(2) BOUNDS(1, nat(2 * Arg_1 + 2 * Arg_2 + -2 * Arg_5) + nat(1 + -1 * Arg_0 + Arg_1) + nat(2 + -6 * Arg_0 + -8 * Arg_0 * Arg_1 + 8 * Arg_0 * Arg_1 * Arg_2 + -8 * Arg_0 * Arg_1 * Arg_3 + 6 * Arg_0 * Arg_2 + 8 * Arg_3 * Arg_0 * Arg_2 + -14 * Arg_0 * Arg_3 + -8 * Arg_3^2 * Arg_0 + 4 * Arg_0^2 + -4 * Arg_0^2 * Arg_2 + 4 * Arg_0^2 * Arg_3 + 6 * Arg_1 + -6 * Arg_1 * Arg_2 + -8 * Arg_3 * Arg_1 * Arg_2 + 14 * Arg_1 * Arg_3 + 8 * Arg_3^2 * Arg_1 + 4 * Arg_1^2 + -4 * Arg_1^2 * Arg_2 + 4 * Arg_1^2 * Arg_3 + -2 * Arg_2 + -4 * Arg_3 * Arg_2 + 6 * Arg_3 + 4 * Arg_3^2) + nat(1 + -2 * Arg_0 + 2 * Arg_1) + nat(6 + -12 * Arg_0 + 12 * Arg_0 * Arg_2 + -12 * Arg_0 * Arg_3 + 12 * Arg_1 + -12 * Arg_1 * Arg_2 + 12 * Arg_1 * Arg_3 + -6 * Arg_2 + 6 * Arg_3) + max(4, 5 + -2 * Arg_0 + 2 * Arg_1))
32.21/23.03	(3) Loat Proof [FINISHED, 21.5 s]
32.21/23.03	(4) BOUNDS(n^3, INF)
32.21/23.03	
32.21/23.03	
32.21/23.03	----------------------------------------
32.21/23.03	
32.21/23.03	(0)
32.21/23.03	Obligation:
32.21/23.03	Complexity Int TRS consisting of the following rules:
32.21/23.03	evalfstart(A, B, C, D, E, F) -> Com_1(evalfentryin(A, B, C, D, E, F)) :|: TRUE
32.21/23.03	evalfentryin(A, B, C, D, E, F) -> Com_1(evalfbb7in(B, C, D, A, E, F)) :|: TRUE
32.21/23.03	evalfbb7in(A, B, C, D, E, F) -> Com_1(evalfbb5in(A, B, C, D, B, F)) :|: A >= D
32.21/23.03	evalfbb7in(A, B, C, D, E, F) -> Com_1(evalfreturnin(A, B, C, D, E, F)) :|: D >= A + 1
32.21/23.03	evalfbb5in(A, B, C, D, E, F) -> Com_1(evalfbb1in(A, B, C, D, E, F)) :|: C >= E
32.21/23.03	evalfbb5in(A, B, C, D, E, F) -> Com_1(evalfbb6in(A, B, C, D, E, F)) :|: E >= C + 1
32.21/23.03	evalfbb1in(A, B, C, D, E, F) -> Com_1(evalfbb3in(A, B, C, D, E, D - E)) :|: TRUE
32.21/23.03	evalfbb3in(A, B, C, D, E, F) -> Com_1(evalfbb2in(A, B, C, D, E, F)) :|: D + E >= F
32.21/23.03	evalfbb3in(A, B, C, D, E, F) -> Com_1(evalfbb4in(A, B, C, D, E, F)) :|: F >= D + E + 1
32.21/23.03	evalfbb2in(A, B, C, D, E, F) -> Com_1(evalfbb3in(A, B, C, D, E, F + 1)) :|: TRUE
32.21/23.03	evalfbb4in(A, B, C, D, E, F) -> Com_1(evalfbb5in(A, B, C, D, E + 1, F)) :|: TRUE
32.21/23.03	evalfbb6in(A, B, C, D, E, F) -> Com_1(evalfbb7in(A, B, C, D + 1, E, F)) :|: TRUE
32.21/23.03	evalfreturnin(A, B, C, D, E, F) -> Com_1(evalfstop(A, B, C, D, E, F)) :|: TRUE
32.21/23.03	
32.21/23.03	The start-symbols are:[evalfstart_6]
32.21/23.03	
32.21/23.03	
32.21/23.03	----------------------------------------
32.21/23.03	
32.21/23.03	(1) Koat2 Proof (FINISHED)
32.21/23.03	YES( ?, 4+max([0, 1+2*Arg_1+-2*Arg_0])+max([0, Arg_1+Arg_2-Arg_5])+max([0, 1+Arg_1-Arg_0])+max([0, (1+Arg_1-Arg_0+2*Arg_3)*(1+2*Arg_1+-2*Arg_0)*(1+Arg_3-Arg_2)])+max([0, 1+2*Arg_1+-2*Arg_0])+max([0, (1+2*Arg_1+-2*Arg_0)*(1+Arg_3-Arg_2)])+max([0, (1+2*Arg_1+-2*Arg_0)*(1+Arg_3-Arg_2)])+max([0, (1+Arg_1-Arg_0+2*Arg_3)*(1+2*Arg_1+-2*Arg_0)*(1+Arg_3-Arg_2)])+max([0, (1+2*Arg_1+-2*Arg_0)*(1+Arg_3-Arg_2)])+max([0, Arg_1+Arg_2-Arg_5])+max([0, (1+2*Arg_1+-2*Arg_0)*(3+3*Arg_3+-3*Arg_2)]) {O(n^3)})
32.21/23.03	
32.21/23.03	
32.21/23.03	
32.21/23.03	Initial Complexity Problem:
32.21/23.03	
32.21/23.03	  Start:  evalfstart  
32.21/23.03	
32.21/23.03	  Program_Vars:  Arg_0, Arg_1, Arg_2, Arg_3, Arg_4, Arg_5  
32.21/23.03	
32.21/23.03	  Temp_Vars:    
32.21/23.03	
32.21/23.03	  Locations:  evalfbb1in, evalfbb2in, evalfbb3in, evalfbb4in, evalfbb5in, evalfbb6in, evalfbb7in, evalfentryin, evalfreturnin, evalfstart, evalfstop  
32.21/23.03	
32.21/23.03	  Transitions:
32.21/23.03	
32.21/23.03	  evalfbb1in(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5) -> evalfbb3in(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_3-Arg_4):|:Arg_4 <= Arg_2 && Arg_1 <= Arg_4 && Arg_3 <= Arg_0 && Arg_1 <= Arg_2
32.21/23.03	
32.21/23.03	  evalfbb2in(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5) -> evalfbb3in(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5+1):|:Arg_4 <= Arg_2 && Arg_1 <= Arg_4 && Arg_3 <= Arg_0 && Arg_1 <= Arg_2
32.21/23.03	
32.21/23.03	  evalfbb3in(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5) -> evalfbb2in(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5):|:Arg_4 <= Arg_2 && Arg_1 <= Arg_4 && Arg_3 <= Arg_0 && Arg_1 <= Arg_2 && Arg_5 <= Arg_3+Arg_4
32.21/23.03	
32.21/23.03	  evalfbb3in(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5) -> evalfbb4in(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5):|:Arg_4 <= Arg_2 && Arg_1 <= Arg_4 && Arg_3 <= Arg_0 && Arg_1 <= Arg_2 && Arg_3+Arg_4+1 <= Arg_5
32.21/23.03	
32.21/23.03	  evalfbb4in(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5) -> evalfbb5in(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4+1,Arg_5):|:Arg_4 <= Arg_2 && Arg_1 <= Arg_4 && Arg_3 <= Arg_0 && Arg_1 <= Arg_2
32.21/23.03	
32.21/23.03	  evalfbb5in(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5) -> evalfbb1in(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5):|:Arg_1 <= Arg_4 && Arg_3 <= Arg_0 && Arg_4 <= Arg_2
32.21/23.03	
32.21/23.03	  evalfbb5in(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5) -> evalfbb6in(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5):|:Arg_1 <= Arg_4 && Arg_3 <= Arg_0 && Arg_2+1 <= Arg_4
32.21/23.03	
32.21/23.03	  evalfbb6in(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5) -> evalfbb7in(Arg_0,Arg_1,Arg_2,Arg_3+1,Arg_4,Arg_5):|:1+Arg_2 <= Arg_4 && Arg_1 <= Arg_4 && Arg_3 <= Arg_0
32.21/23.03	
32.21/23.03	  evalfbb7in(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5) -> evalfbb5in(Arg_0,Arg_1,Arg_2,Arg_3,Arg_1,Arg_5):|:Arg_3 <= Arg_0
32.21/23.03	
32.21/23.03	  evalfbb7in(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5) -> evalfreturnin(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5):|:Arg_0+1 <= Arg_3
32.21/23.03	
32.21/23.03	  evalfentryin(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5) -> evalfbb7in(Arg_1,Arg_2,Arg_3,Arg_0,Arg_4,Arg_5):|:
32.21/23.03	
32.21/23.03	  evalfreturnin(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5) -> evalfstop(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5):|:1+Arg_0 <= Arg_3
32.21/23.03	
32.21/23.03	  evalfstart(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5) -> evalfentryin(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5):|:  
32.21/23.03	
32.21/23.03	
32.21/23.03	
32.21/23.03	Timebounds: 
32.21/23.03	
32.21/23.03	  Overall timebound: 4+max([0, 1+2*Arg_1+-2*Arg_0])+max([0, Arg_1+Arg_2-Arg_5])+max([0, 1+Arg_1-Arg_0])+max([0, (1+Arg_1-Arg_0+2*Arg_3)*(1+2*Arg_1+-2*Arg_0)*(1+Arg_3-Arg_2)])+max([0, 1+2*Arg_1+-2*Arg_0])+max([0, (1+2*Arg_1+-2*Arg_0)*(1+Arg_3-Arg_2)])+max([0, (1+2*Arg_1+-2*Arg_0)*(1+Arg_3-Arg_2)])+max([0, (1+Arg_1-Arg_0+2*Arg_3)*(1+2*Arg_1+-2*Arg_0)*(1+Arg_3-Arg_2)])+max([0, (1+2*Arg_1+-2*Arg_0)*(1+Arg_3-Arg_2)])+max([0, Arg_1+Arg_2-Arg_5])+max([0, (1+2*Arg_1+-2*Arg_0)*(3+3*Arg_3+-3*Arg_2)]) {O(n^3)}
32.21/23.03	
32.21/23.03	  6: evalfbb1in->evalfbb3in: max([0, (1+2*Arg_1+-2*Arg_0)*(1+Arg_3-Arg_2)]) {O(n^2)}
32.21/23.03	
32.21/23.03	  9: evalfbb2in->evalfbb3in: max([0, (1+Arg_1-Arg_0+2*Arg_3)*(1+2*Arg_1+-2*Arg_0)*(1+Arg_3-Arg_2)])+max([0, Arg_1+Arg_2-Arg_5]) {O(n^3)}
32.21/23.03	
32.21/23.03	  7: evalfbb3in->evalfbb2in: max([0, (1+Arg_1-Arg_0+2*Arg_3)*(1+2*Arg_1+-2*Arg_0)*(1+Arg_3-Arg_2)])+max([0, Arg_1+Arg_2-Arg_5]) {O(n^3)}
32.21/23.03	
32.21/23.03	  8: evalfbb3in->evalfbb4in: max([0, (1+2*Arg_1+-2*Arg_0)*(3+3*Arg_3+-3*Arg_2)]) {O(n^2)}
32.21/23.03	
32.21/23.03	  10: evalfbb4in->evalfbb5in: max([0, (1+2*Arg_1+-2*Arg_0)*(1+Arg_3-Arg_2)]) {O(n^2)}
32.21/23.03	
32.21/23.03	  4: evalfbb5in->evalfbb1in: max([0, (1+2*Arg_1+-2*Arg_0)*(1+Arg_3-Arg_2)]) {O(n^2)}
32.21/23.03	
32.21/23.03	  5: evalfbb5in->evalfbb6in: max([0, 1+2*Arg_1+-2*Arg_0]) {O(n)}
32.21/23.03	
32.21/23.03	  11: evalfbb6in->evalfbb7in: max([0, 1+Arg_1-Arg_0]) {O(n)}
32.21/23.03	
32.21/23.03	  2: evalfbb7in->evalfbb5in: max([0, 1+2*Arg_1+-2*Arg_0]) {O(n)}
32.21/23.03	
32.21/23.03	  3: evalfbb7in->evalfreturnin: 1 {O(1)}
32.21/23.03	
32.21/23.03	  1: evalfentryin->evalfbb7in: 1 {O(1)}
32.21/23.03	
32.21/23.03	  12: evalfreturnin->evalfstop: 1 {O(1)}
32.21/23.03	
32.21/23.03	  0: evalfstart->evalfentryin: 1 {O(1)}
32.21/23.03	
32.21/23.03	
32.21/23.03	
32.21/23.03	Costbounds:
32.21/23.03	
32.21/23.03	  Overall costbound: 4+max([0, 1+2*Arg_1+-2*Arg_0])+max([0, Arg_1+Arg_2-Arg_5])+max([0, 1+Arg_1-Arg_0])+max([0, (1+Arg_1-Arg_0+2*Arg_3)*(1+2*Arg_1+-2*Arg_0)*(1+Arg_3-Arg_2)])+max([0, 1+2*Arg_1+-2*Arg_0])+max([0, (1+2*Arg_1+-2*Arg_0)*(1+Arg_3-Arg_2)])+max([0, (1+2*Arg_1+-2*Arg_0)*(1+Arg_3-Arg_2)])+max([0, (1+Arg_1-Arg_0+2*Arg_3)*(1+2*Arg_1+-2*Arg_0)*(1+Arg_3-Arg_2)])+max([0, (1+2*Arg_1+-2*Arg_0)*(1+Arg_3-Arg_2)])+max([0, Arg_1+Arg_2-Arg_5])+max([0, (1+2*Arg_1+-2*Arg_0)*(3+3*Arg_3+-3*Arg_2)]) {O(n^3)}
32.21/23.03	
32.21/23.03	  6: evalfbb1in->evalfbb3in: max([0, (1+2*Arg_1+-2*Arg_0)*(1+Arg_3-Arg_2)]) {O(n^2)}
32.21/23.03	
32.21/23.03	  9: evalfbb2in->evalfbb3in: max([0, (1+Arg_1-Arg_0+2*Arg_3)*(1+2*Arg_1+-2*Arg_0)*(1+Arg_3-Arg_2)])+max([0, Arg_1+Arg_2-Arg_5]) {O(n^3)}
32.21/23.03	
32.21/23.03	  7: evalfbb3in->evalfbb2in: max([0, (1+Arg_1-Arg_0+2*Arg_3)*(1+2*Arg_1+-2*Arg_0)*(1+Arg_3-Arg_2)])+max([0, Arg_1+Arg_2-Arg_5]) {O(n^3)}
32.21/23.03	
32.21/23.03	  8: evalfbb3in->evalfbb4in: max([0, (1+2*Arg_1+-2*Arg_0)*(3+3*Arg_3+-3*Arg_2)]) {O(n^2)}
32.21/23.03	
32.21/23.03	  10: evalfbb4in->evalfbb5in: max([0, (1+2*Arg_1+-2*Arg_0)*(1+Arg_3-Arg_2)]) {O(n^2)}
32.21/23.03	
32.21/23.03	  4: evalfbb5in->evalfbb1in: max([0, (1+2*Arg_1+-2*Arg_0)*(1+Arg_3-Arg_2)]) {O(n^2)}
32.21/23.03	
32.21/23.03	  5: evalfbb5in->evalfbb6in: max([0, 1+2*Arg_1+-2*Arg_0]) {O(n)}
32.21/23.03	
32.21/23.03	  11: evalfbb6in->evalfbb7in: max([0, 1+Arg_1-Arg_0]) {O(n)}
32.21/23.03	
32.21/23.03	  2: evalfbb7in->evalfbb5in: max([0, 1+2*Arg_1+-2*Arg_0]) {O(n)}
32.21/23.03	
32.21/23.03	  3: evalfbb7in->evalfreturnin: 1 {O(1)}
32.21/23.03	
32.21/23.03	  1: evalfentryin->evalfbb7in: 1 {O(1)}
32.21/23.03	
32.21/23.03	  12: evalfreturnin->evalfstop: 1 {O(1)}
32.21/23.03	
32.21/23.03	  0: evalfstart->evalfentryin: 1 {O(1)}
32.21/23.03	
32.21/23.03	
32.21/23.03	
32.21/23.03	Sizebounds:
32.21/23.03	
32.21/23.03	`Lower:
32.21/23.03	
32.21/23.03	  6: evalfbb1in->evalfbb3in, Arg_0: Arg_1 {O(n)}
32.21/23.03	
32.21/23.03	  6: evalfbb1in->evalfbb3in, Arg_1: Arg_2 {O(n)}
32.21/23.03	
32.21/23.03	  6: evalfbb1in->evalfbb3in, Arg_2: Arg_3 {O(n)}
32.21/23.03	
32.21/23.03	  6: evalfbb1in->evalfbb3in, Arg_3: Arg_0 {O(n)}
32.21/23.03	
32.21/23.03	  6: evalfbb1in->evalfbb3in, Arg_4: Arg_2 {O(n)}
32.21/23.03	
32.21/23.03	  6: evalfbb1in->evalfbb3in, Arg_5: Arg_0+-(Arg_2)-max([0, (1+2*Arg_1+-2*Arg_0)*(1+Arg_3-Arg_2)]) {O(n^2)}
32.21/23.03	
32.21/23.03	  9: evalfbb2in->evalfbb3in, Arg_0: Arg_1 {O(n)}
32.21/23.03	
32.21/23.03	  9: evalfbb2in->evalfbb3in, Arg_1: Arg_2 {O(n)}
32.21/23.03	
32.21/23.03	  9: evalfbb2in->evalfbb3in, Arg_2: Arg_3 {O(n)}
32.21/23.03	
32.21/23.03	  9: evalfbb2in->evalfbb3in, Arg_3: Arg_0 {O(n)}
32.21/23.03	
32.21/23.03	  9: evalfbb2in->evalfbb3in, Arg_4: Arg_2 {O(n)}
32.21/23.03	
32.21/23.03	  9: evalfbb2in->evalfbb3in, Arg_5: Arg_0+-(Arg_2)-max([0, (1+2*Arg_1+-2*Arg_0)*(1+Arg_3-Arg_2)]) {O(n^2)}
32.21/23.03	
32.21/23.03	  7: evalfbb3in->evalfbb2in, Arg_0: Arg_1 {O(n)}
32.21/23.03	
32.21/23.03	  7: evalfbb3in->evalfbb2in, Arg_1: Arg_2 {O(n)}
32.21/23.03	
32.21/23.03	  7: evalfbb3in->evalfbb2in, Arg_2: Arg_3 {O(n)}
32.21/23.03	
32.21/23.03	  7: evalfbb3in->evalfbb2in, Arg_3: Arg_0 {O(n)}
32.21/23.03	
32.21/23.03	  7: evalfbb3in->evalfbb2in, Arg_4: Arg_2 {O(n)}
32.21/23.03	
32.21/23.03	  7: evalfbb3in->evalfbb2in, Arg_5: Arg_0+-(Arg_2)-max([0, (1+2*Arg_1+-2*Arg_0)*(1+Arg_3-Arg_2)]) {O(n^2)}
32.21/23.03	
32.21/23.03	  8: evalfbb3in->evalfbb4in, Arg_0: Arg_1 {O(n)}
32.21/23.03	
32.21/23.03	  8: evalfbb3in->evalfbb4in, Arg_1: Arg_2 {O(n)}
32.21/23.03	
32.21/23.03	  8: evalfbb3in->evalfbb4in, Arg_2: Arg_3 {O(n)}
32.21/23.03	
32.21/23.03	  8: evalfbb3in->evalfbb4in, Arg_3: Arg_0 {O(n)}
32.21/23.03	
32.21/23.03	  8: evalfbb3in->evalfbb4in, Arg_4: Arg_2 {O(n)}
32.21/23.03	
32.21/23.03	  8: evalfbb3in->evalfbb4in, Arg_5: Arg_0+-(Arg_2)-max([0, (1+2*Arg_1+-2*Arg_0)*(1+Arg_3-Arg_2)]) {O(n^2)}
32.21/23.03	
32.21/23.03	  10: evalfbb4in->evalfbb5in, Arg_0: Arg_1 {O(n)}
32.21/23.03	
32.21/23.03	  10: evalfbb4in->evalfbb5in, Arg_1: Arg_2 {O(n)}
32.21/23.03	
32.21/23.03	  10: evalfbb4in->evalfbb5in, Arg_2: Arg_3 {O(n)}
32.21/23.03	
32.21/23.03	  10: evalfbb4in->evalfbb5in, Arg_3: Arg_0 {O(n)}
32.21/23.03	
32.21/23.03	  10: evalfbb4in->evalfbb5in, Arg_4: Arg_2 {O(n)}
32.21/23.03	
32.21/23.03	  10: evalfbb4in->evalfbb5in, Arg_5: Arg_0+-(Arg_2)-max([0, (1+2*Arg_1+-2*Arg_0)*(1+Arg_3-Arg_2)]) {O(n^2)}
32.21/23.03	
32.21/23.03	  4: evalfbb5in->evalfbb1in, Arg_0: Arg_1 {O(n)}
32.21/23.03	
32.21/23.03	  4: evalfbb5in->evalfbb1in, Arg_1: Arg_2 {O(n)}
32.21/23.03	
32.21/23.03	  4: evalfbb5in->evalfbb1in, Arg_2: Arg_3 {O(n)}
32.21/23.03	
32.21/23.03	  4: evalfbb5in->evalfbb1in, Arg_3: Arg_0 {O(n)}
32.21/23.03	
32.21/23.03	  4: evalfbb5in->evalfbb1in, Arg_4: Arg_2 {O(n)}
32.21/23.03	
32.21/23.03	  4: evalfbb5in->evalfbb1in, Arg_5: min([Arg_5, -(Arg_2+-(Arg_0)+max([0, (1+2*Arg_1+-2*Arg_0)*(1+Arg_3-Arg_2)]))]) {O(n^2)}
32.21/23.03	
32.21/23.03	  5: evalfbb5in->evalfbb6in, Arg_0: Arg_1 {O(n)}
32.21/23.03	
32.21/23.03	  5: evalfbb5in->evalfbb6in, Arg_1: Arg_2 {O(n)}
32.21/23.03	
32.21/23.03	  5: evalfbb5in->evalfbb6in, Arg_2: Arg_3 {O(n)}
32.21/23.03	
32.21/23.03	  5: evalfbb5in->evalfbb6in, Arg_3: Arg_0 {O(n)}
32.21/23.03	
32.21/23.03	  5: evalfbb5in->evalfbb6in, Arg_4: Arg_2 {O(n)}
32.21/23.03	
32.21/23.03	  5: evalfbb5in->evalfbb6in, Arg_5: min([Arg_5, -(Arg_2+-(Arg_0)+max([0, (1+2*Arg_1+-2*Arg_0)*(1+Arg_3-Arg_2)]))]) {O(n^2)}
32.21/23.03	
32.21/23.03	  11: evalfbb6in->evalfbb7in, Arg_0: Arg_1 {O(n)}
32.21/23.03	
32.21/23.03	  11: evalfbb6in->evalfbb7in, Arg_1: Arg_2 {O(n)}
32.21/23.03	
32.21/23.03	  11: evalfbb6in->evalfbb7in, Arg_2: Arg_3 {O(n)}
32.21/23.03	
32.21/23.03	  11: evalfbb6in->evalfbb7in, Arg_3: Arg_0 {O(n)}
32.21/23.03	
32.21/23.03	  11: evalfbb6in->evalfbb7in, Arg_4: Arg_2 {O(n)}
32.21/23.03	
32.21/23.03	  11: evalfbb6in->evalfbb7in, Arg_5: min([Arg_5, -(Arg_2+-(Arg_0)+max([0, (1+2*Arg_1+-2*Arg_0)*(1+Arg_3-Arg_2)]))]) {O(n^2)}
32.21/23.03	
32.21/23.03	  2: evalfbb7in->evalfbb5in, Arg_0: Arg_1 {O(n)}
32.21/23.03	
32.21/23.03	  2: evalfbb7in->evalfbb5in, Arg_1: Arg_2 {O(n)}
32.21/23.03	
32.21/23.03	  2: evalfbb7in->evalfbb5in, Arg_2: Arg_3 {O(n)}
32.21/23.03	
32.21/23.03	  2: evalfbb7in->evalfbb5in, Arg_3: Arg_0 {O(n)}
32.21/23.03	
32.21/23.03	  2: evalfbb7in->evalfbb5in, Arg_4: Arg_2 {O(n)}
32.21/23.03	
32.21/23.03	  2: evalfbb7in->evalfbb5in, Arg_5: min([Arg_5, -(Arg_2+-(Arg_0)+max([0, (1+2*Arg_1+-2*Arg_0)*(1+Arg_3-Arg_2)]))]) {O(n^2)}
32.21/23.03	
32.21/23.03	  3: evalfbb7in->evalfreturnin, Arg_0: Arg_1 {O(n)}
32.21/23.03	
32.21/23.03	  3: evalfbb7in->evalfreturnin, Arg_1: Arg_2 {O(n)}
32.21/23.03	
32.21/23.03	  3: evalfbb7in->evalfreturnin, Arg_2: Arg_3 {O(n)}
32.21/23.03	
32.21/23.03	  3: evalfbb7in->evalfreturnin, Arg_3: Arg_0 {O(n)}
32.21/23.03	
32.21/23.03	  3: evalfbb7in->evalfreturnin, Arg_4: min([Arg_4, Arg_2]) {O(n)}
32.21/23.03	
32.21/23.03	  3: evalfbb7in->evalfreturnin, Arg_5: min([Arg_5, min([Arg_5, -(Arg_2+-(Arg_0)+max([0, (1+2*Arg_1+-2*Arg_0)*(1+Arg_3-Arg_2)]))])]) {O(n^2)}
32.21/23.03	
32.21/23.03	  1: evalfentryin->evalfbb7in, Arg_0: Arg_1 {O(n)}
32.21/23.03	
32.21/23.03	  1: evalfentryin->evalfbb7in, Arg_1: Arg_2 {O(n)}
32.21/23.03	
32.21/23.03	  1: evalfentryin->evalfbb7in, Arg_2: Arg_3 {O(n)}
32.21/23.03	
32.21/23.03	  1: evalfentryin->evalfbb7in, Arg_3: Arg_0 {O(n)}
32.21/23.03	
32.21/23.03	  1: evalfentryin->evalfbb7in, Arg_4: Arg_4 {O(n)}
32.21/23.03	
32.21/23.03	  1: evalfentryin->evalfbb7in, Arg_5: Arg_5 {O(n)}
32.21/23.03	
32.21/23.03	  12: evalfreturnin->evalfstop, Arg_0: Arg_1 {O(n)}
32.21/23.03	
32.21/23.03	  12: evalfreturnin->evalfstop, Arg_1: Arg_2 {O(n)}
32.21/23.03	
32.21/23.03	  12: evalfreturnin->evalfstop, Arg_2: Arg_3 {O(n)}
32.21/23.03	
32.21/23.03	  12: evalfreturnin->evalfstop, Arg_3: Arg_0 {O(n)}
32.21/23.03	
32.21/23.03	  12: evalfreturnin->evalfstop, Arg_4: min([Arg_4, Arg_2]) {O(n)}
32.21/23.03	
32.21/23.03	  12: evalfreturnin->evalfstop, Arg_5: min([Arg_5, min([Arg_5, -(Arg_2+-(Arg_0)+max([0, (1+2*Arg_1+-2*Arg_0)*(1+Arg_3-Arg_2)]))])]) {O(n^2)}
32.21/23.03	
32.21/23.03	  0: evalfstart->evalfentryin, Arg_0: Arg_0 {O(n)}
32.21/23.03	
32.21/23.03	  0: evalfstart->evalfentryin, Arg_1: Arg_1 {O(n)}
32.21/23.03	
32.21/23.03	  0: evalfstart->evalfentryin, Arg_2: Arg_2 {O(n)}
32.21/23.03	
32.21/23.03	  0: evalfstart->evalfentryin, Arg_3: Arg_3 {O(n)}
32.21/23.03	
32.21/23.03	  0: evalfstart->evalfentryin, Arg_4: Arg_4 {O(n)}
32.21/23.03	
32.21/23.03	  0: evalfstart->evalfentryin, Arg_5: Arg_5 {O(n)}
32.21/23.03	
32.21/23.03	`Upper:
32.21/23.03	
32.21/23.03	  6: evalfbb1in->evalfbb3in, Arg_0: Arg_1 {O(n)}
32.21/23.03	
32.21/23.03	  6: evalfbb1in->evalfbb3in, Arg_1: Arg_2 {O(n)}
32.21/23.03	
32.21/23.03	  6: evalfbb1in->evalfbb3in, Arg_2: Arg_3 {O(n)}
32.21/23.03	
32.21/23.03	  6: evalfbb1in->evalfbb3in, Arg_3: Arg_0+max([0, 1+Arg_1-Arg_0]) {O(n)}
32.21/23.03	
32.21/23.03	  6: evalfbb1in->evalfbb3in, Arg_4: Arg_2+max([0, (1+2*Arg_1+-2*Arg_0)*(1+Arg_3-Arg_2)]) {O(n^2)}
32.21/23.03	
32.21/23.03	  6: evalfbb1in->evalfbb3in, Arg_5: min([-(Arg_2+min([0, -(1+Arg_1-Arg_0)])-Arg_0), min([-(Arg_2+min([0, -(1+Arg_1-Arg_0)])-Arg_0), -(Arg_2+-(Arg_0)-max([0, 1+Arg_1-Arg_0]))])]) {O(n)}
32.21/23.03	
32.21/23.03	  9: evalfbb2in->evalfbb3in, Arg_0: Arg_1 {O(n)}
32.21/23.03	
32.21/23.03	  9: evalfbb2in->evalfbb3in, Arg_1: Arg_2 {O(n)}
32.21/23.03	
32.21/23.03	  9: evalfbb2in->evalfbb3in, Arg_2: Arg_3 {O(n)}
32.21/23.03	
32.21/23.03	  9: evalfbb2in->evalfbb3in, Arg_3: Arg_0+max([0, 1+Arg_1-Arg_0]) {O(n)}
32.21/23.03	
32.21/23.03	  9: evalfbb2in->evalfbb3in, Arg_4: Arg_2+max([0, (1+2*Arg_1+-2*Arg_0)*(1+Arg_3-Arg_2)]) {O(n^2)}
32.21/23.03	
32.21/23.03	  9: evalfbb2in->evalfbb3in, Arg_5: min([-(Arg_2+min([0, -(1+Arg_1-Arg_0)])-Arg_0), min([-(Arg_2+min([0, -(1+Arg_1-Arg_0)])-Arg_0), -(Arg_2+-(Arg_0)-max([0, 1+Arg_1-Arg_0]))])])+max([0, (1+Arg_1-Arg_0+2*Arg_3)*(1+2*Arg_1+-2*Arg_0)*(1+Arg_3-Arg_2)])+max([0, Arg_1+Arg_2-Arg_5]) {O(n^3)}
32.21/23.03	
32.21/23.03	  7: evalfbb3in->evalfbb2in, Arg_0: Arg_1 {O(n)}
32.21/23.03	
32.21/23.03	  7: evalfbb3in->evalfbb2in, Arg_1: Arg_2 {O(n)}
32.21/23.03	
32.21/23.03	  7: evalfbb3in->evalfbb2in, Arg_2: Arg_3 {O(n)}
32.21/23.03	
32.21/23.03	  7: evalfbb3in->evalfbb2in, Arg_3: Arg_0+max([0, 1+Arg_1-Arg_0]) {O(n)}
32.21/23.03	
32.21/23.03	  7: evalfbb3in->evalfbb2in, Arg_4: Arg_2+max([0, (1+2*Arg_1+-2*Arg_0)*(1+Arg_3-Arg_2)]) {O(n^2)}
32.21/23.03	
32.21/23.03	  7: evalfbb3in->evalfbb2in, Arg_5: min([-(Arg_2+min([0, -(1+Arg_1-Arg_0)])-Arg_0), min([-(Arg_2+min([0, -(1+Arg_1-Arg_0)])-Arg_0), -(Arg_2+-(Arg_0)-max([0, 1+Arg_1-Arg_0]))])])+max([0, (1+Arg_1-Arg_0+2*Arg_3)*(1+2*Arg_1+-2*Arg_0)*(1+Arg_3-Arg_2)])+max([0, Arg_1+Arg_2-Arg_5]) {O(n^3)}
32.21/23.03	
32.21/23.03	  8: evalfbb3in->evalfbb4in, Arg_0: Arg_1 {O(n)}
32.21/23.03	
32.21/23.03	  8: evalfbb3in->evalfbb4in, Arg_1: Arg_2 {O(n)}
32.21/23.03	
32.21/23.03	  8: evalfbb3in->evalfbb4in, Arg_2: Arg_3 {O(n)}
32.21/23.03	
32.21/23.03	  8: evalfbb3in->evalfbb4in, Arg_3: Arg_0+max([0, 1+Arg_1-Arg_0]) {O(n)}
32.21/23.03	
32.21/23.03	  8: evalfbb3in->evalfbb4in, Arg_4: Arg_2+max([0, (1+2*Arg_1+-2*Arg_0)*(1+Arg_3-Arg_2)]) {O(n^2)}
32.21/23.03	
32.21/23.03	  8: evalfbb3in->evalfbb4in, Arg_5: max([min([-(Arg_2+min([0, -(1+Arg_1-Arg_0)])-Arg_0), min([-(Arg_2+min([0, -(1+Arg_1-Arg_0)])-Arg_0), -(Arg_2+-(Arg_0)-max([0, 1+Arg_1-Arg_0]))])]), min([-(Arg_2+min([0, -(1+Arg_1-Arg_0)])-Arg_0), min([-(Arg_2+min([0, -(1+Arg_1-Arg_0)])-Arg_0), -(Arg_2+-(Arg_0)-max([0, 1+Arg_1-Arg_0]))])])+max([0, (1+Arg_1-Arg_0+2*Arg_3)*(1+2*Arg_1+-2*Arg_0)*(1+Arg_3-Arg_2)])+max([0, Arg_1+Arg_2-Arg_5])]) {O(n^3)}
32.21/23.03	
32.21/23.03	  10: evalfbb4in->evalfbb5in, Arg_0: Arg_1 {O(n)}
32.21/23.03	
32.21/23.03	  10: evalfbb4in->evalfbb5in, Arg_1: Arg_2 {O(n)}
32.21/23.03	
32.21/23.03	  10: evalfbb4in->evalfbb5in, Arg_2: Arg_3 {O(n)}
32.21/23.03	
32.21/23.03	  10: evalfbb4in->evalfbb5in, Arg_3: Arg_0+max([0, 1+Arg_1-Arg_0]) {O(n)}
32.21/23.03	
32.21/23.03	  10: evalfbb4in->evalfbb5in, Arg_4: Arg_2+max([0, (1+2*Arg_1+-2*Arg_0)*(1+Arg_3-Arg_2)]) {O(n^2)}
32.21/23.03	
32.21/23.03	  10: evalfbb4in->evalfbb5in, Arg_5: max([min([-(Arg_2+min([0, -(1+Arg_1-Arg_0)])-Arg_0), min([-(Arg_2+min([0, -(1+Arg_1-Arg_0)])-Arg_0), -(Arg_2+-(Arg_0)-max([0, 1+Arg_1-Arg_0]))])]), min([-(Arg_2+min([0, -(1+Arg_1-Arg_0)])-Arg_0), min([-(Arg_2+min([0, -(1+Arg_1-Arg_0)])-Arg_0), -(Arg_2+-(Arg_0)-max([0, 1+Arg_1-Arg_0]))])])+max([0, (1+Arg_1-Arg_0+2*Arg_3)*(1+2*Arg_1+-2*Arg_0)*(1+Arg_3-Arg_2)])+max([0, Arg_1+Arg_2-Arg_5])]) {O(n^3)}
32.21/23.03	
32.21/23.03	  4: evalfbb5in->evalfbb1in, Arg_0: Arg_1 {O(n)}
32.21/23.03	
32.21/23.03	  4: evalfbb5in->evalfbb1in, Arg_1: Arg_2 {O(n)}
32.21/23.03	
32.21/23.03	  4: evalfbb5in->evalfbb1in, Arg_2: Arg_3 {O(n)}
32.21/23.03	
32.21/23.03	  4: evalfbb5in->evalfbb1in, Arg_3: Arg_0+max([0, 1+Arg_1-Arg_0]) {O(n)}
32.21/23.03	
32.21/23.03	  4: evalfbb5in->evalfbb1in, Arg_4: Arg_2+max([0, (1+2*Arg_1+-2*Arg_0)*(1+Arg_3-Arg_2)]) {O(n^2)}
32.21/23.03	
32.21/23.03	  4: evalfbb5in->evalfbb1in, Arg_5: max([Arg_5, max([min([-(Arg_2+min([0, -(1+Arg_1-Arg_0)])-Arg_0), min([-(Arg_2+min([0, -(1+Arg_1-Arg_0)])-Arg_0), -(Arg_2+-(Arg_0)-max([0, 1+Arg_1-Arg_0]))])]), max([min([-(Arg_2+min([0, -(1+Arg_1-Arg_0)])-Arg_0), min([-(Arg_2+min([0, -(1+Arg_1-Arg_0)])-Arg_0), -(Arg_2+-(Arg_0)-max([0, 1+Arg_1-Arg_0]))])]), min([-(Arg_2+min([0, -(1+Arg_1-Arg_0)])-Arg_0), min([-(Arg_2+min([0, -(1+Arg_1-Arg_0)])-Arg_0), -(Arg_2+-(Arg_0)-max([0, 1+Arg_1-Arg_0]))])])+max([0, (1+Arg_1-Arg_0+2*Arg_3)*(1+2*Arg_1+-2*Arg_0)*(1+Arg_3-Arg_2)])+max([0, Arg_1+Arg_2-Arg_5])])])]) {O(n^3)}
32.21/23.03	
32.21/23.03	  5: evalfbb5in->evalfbb6in, Arg_0: Arg_1 {O(n)}
32.21/23.03	
32.21/23.03	  5: evalfbb5in->evalfbb6in, Arg_1: Arg_2 {O(n)}
32.21/23.03	
32.21/23.03	  5: evalfbb5in->evalfbb6in, Arg_2: Arg_3 {O(n)}
32.21/23.03	
32.21/23.03	  5: evalfbb5in->evalfbb6in, Arg_3: Arg_0+max([0, 1+Arg_1-Arg_0]) {O(n)}
32.21/23.03	
32.21/23.03	  5: evalfbb5in->evalfbb6in, Arg_4: max([Arg_2, Arg_2+max([0, (1+2*Arg_1+-2*Arg_0)*(1+Arg_3-Arg_2)])]) {O(n^2)}
32.21/23.03	
32.21/23.03	  5: evalfbb5in->evalfbb6in, Arg_5: max([Arg_5, max([min([-(Arg_2+min([0, -(1+Arg_1-Arg_0)])-Arg_0), min([-(Arg_2+min([0, -(1+Arg_1-Arg_0)])-Arg_0), -(Arg_2+-(Arg_0)-max([0, 1+Arg_1-Arg_0]))])]), min([-(Arg_2+min([0, -(1+Arg_1-Arg_0)])-Arg_0), min([-(Arg_2+min([0, -(1+Arg_1-Arg_0)])-Arg_0), -(Arg_2+-(Arg_0)-max([0, 1+Arg_1-Arg_0]))])])+max([0, (1+Arg_1-Arg_0+2*Arg_3)*(1+2*Arg_1+-2*Arg_0)*(1+Arg_3-Arg_2)])+max([0, Arg_1+Arg_2-Arg_5])])]) {O(n^3)}
32.21/23.03	
32.21/23.03	  11: evalfbb6in->evalfbb7in, Arg_0: Arg_1 {O(n)}
32.21/23.03	
32.21/23.03	  11: evalfbb6in->evalfbb7in, Arg_1: Arg_2 {O(n)}
32.21/23.03	
32.21/23.03	  11: evalfbb6in->evalfbb7in, Arg_2: Arg_3 {O(n)}
32.21/23.03	
32.21/23.03	  11: evalfbb6in->evalfbb7in, Arg_3: Arg_0+max([0, 1+Arg_1-Arg_0]) {O(n)}
32.21/23.03	
32.21/23.03	  11: evalfbb6in->evalfbb7in, Arg_4: max([Arg_2, Arg_2+max([0, (1+2*Arg_1+-2*Arg_0)*(1+Arg_3-Arg_2)])]) {O(n^2)}
32.21/23.03	
32.21/23.03	  11: evalfbb6in->evalfbb7in, Arg_5: max([Arg_5, max([min([-(Arg_2+min([0, -(1+Arg_1-Arg_0)])-Arg_0), min([-(Arg_2+min([0, -(1+Arg_1-Arg_0)])-Arg_0), -(Arg_2+-(Arg_0)-max([0, 1+Arg_1-Arg_0]))])]), min([-(Arg_2+min([0, -(1+Arg_1-Arg_0)])-Arg_0), min([-(Arg_2+min([0, -(1+Arg_1-Arg_0)])-Arg_0), -(Arg_2+-(Arg_0)-max([0, 1+Arg_1-Arg_0]))])])+max([0, (1+Arg_1-Arg_0+2*Arg_3)*(1+2*Arg_1+-2*Arg_0)*(1+Arg_3-Arg_2)])+max([0, Arg_1+Arg_2-Arg_5])])]) {O(n^3)}
32.21/23.03	
32.21/23.03	  2: evalfbb7in->evalfbb5in, Arg_0: Arg_1 {O(n)}
32.21/23.03	
32.21/23.03	  2: evalfbb7in->evalfbb5in, Arg_1: Arg_2 {O(n)}
32.21/23.03	
32.21/23.03	  2: evalfbb7in->evalfbb5in, Arg_2: Arg_3 {O(n)}
32.21/23.03	
32.21/23.03	  2: evalfbb7in->evalfbb5in, Arg_3: Arg_0+max([0, 1+Arg_1-Arg_0]) {O(n)}
32.21/23.03	
32.21/23.03	  2: evalfbb7in->evalfbb5in, Arg_4: Arg_2 {O(n)}
32.21/23.03	
32.21/23.03	  2: evalfbb7in->evalfbb5in, Arg_5: max([Arg_5, max([min([-(Arg_2+min([0, -(1+Arg_1-Arg_0)])-Arg_0), min([-(Arg_2+min([0, -(1+Arg_1-Arg_0)])-Arg_0), -(Arg_2+-(Arg_0)-max([0, 1+Arg_1-Arg_0]))])]), min([-(Arg_2+min([0, -(1+Arg_1-Arg_0)])-Arg_0), min([-(Arg_2+min([0, -(1+Arg_1-Arg_0)])-Arg_0), -(Arg_2+-(Arg_0)-max([0, 1+Arg_1-Arg_0]))])])+max([0, (1+Arg_1-Arg_0+2*Arg_3)*(1+2*Arg_1+-2*Arg_0)*(1+Arg_3-Arg_2)])+max([0, Arg_1+Arg_2-Arg_5])])]) {O(n^3)}
32.21/23.03	
32.21/23.03	  3: evalfbb7in->evalfreturnin, Arg_0: Arg_1 {O(n)}
32.21/23.03	
32.21/23.03	  3: evalfbb7in->evalfreturnin, Arg_1: Arg_2 {O(n)}
32.21/23.03	
32.21/23.03	  3: evalfbb7in->evalfreturnin, Arg_2: Arg_3 {O(n)}
32.21/23.03	
32.21/23.03	  3: evalfbb7in->evalfreturnin, Arg_3: max([Arg_0, Arg_0+max([0, 1+Arg_1-Arg_0])]) {O(n)}
32.21/23.03	
32.21/23.03	  3: evalfbb7in->evalfreturnin, Arg_4: max([Arg_4, max([Arg_2, Arg_2+max([0, (1+2*Arg_1+-2*Arg_0)*(1+Arg_3-Arg_2)])])]) {O(n^2)}
32.21/23.03	
32.21/23.03	  3: evalfbb7in->evalfreturnin, Arg_5: max([Arg_5, max([Arg_5, max([min([-(Arg_2+min([0, -(1+Arg_1-Arg_0)])-Arg_0), min([-(Arg_2+min([0, -(1+Arg_1-Arg_0)])-Arg_0), -(Arg_2+-(Arg_0)-max([0, 1+Arg_1-Arg_0]))])]), min([-(Arg_2+min([0, -(1+Arg_1-Arg_0)])-Arg_0), min([-(Arg_2+min([0, -(1+Arg_1-Arg_0)])-Arg_0), -(Arg_2+-(Arg_0)-max([0, 1+Arg_1-Arg_0]))])])+max([0, (1+Arg_1-Arg_0+2*Arg_3)*(1+2*Arg_1+-2*Arg_0)*(1+Arg_3-Arg_2)])+max([0, Arg_1+Arg_2-Arg_5])])])]) {O(n^3)}
32.21/23.03	
32.21/23.03	  1: evalfentryin->evalfbb7in, Arg_0: Arg_1 {O(n)}
32.21/23.03	
32.21/23.03	  1: evalfentryin->evalfbb7in, Arg_1: Arg_2 {O(n)}
32.21/23.03	
32.21/23.03	  1: evalfentryin->evalfbb7in, Arg_2: Arg_3 {O(n)}
32.21/23.03	
32.21/23.03	  1: evalfentryin->evalfbb7in, Arg_3: Arg_0 {O(n)}
32.21/23.03	
32.21/23.03	  1: evalfentryin->evalfbb7in, Arg_4: Arg_4 {O(n)}
32.21/23.03	
32.21/23.03	  1: evalfentryin->evalfbb7in, Arg_5: Arg_5 {O(n)}
32.21/23.03	
32.21/23.03	  12: evalfreturnin->evalfstop, Arg_0: Arg_1 {O(n)}
32.21/23.03	
32.21/23.03	  12: evalfreturnin->evalfstop, Arg_1: Arg_2 {O(n)}
32.21/23.03	
32.21/23.03	  12: evalfreturnin->evalfstop, Arg_2: Arg_3 {O(n)}
32.21/23.03	
32.21/23.03	  12: evalfreturnin->evalfstop, Arg_3: max([Arg_0, Arg_0+max([0, 1+Arg_1-Arg_0])]) {O(n)}
32.21/23.03	
32.21/23.03	  12: evalfreturnin->evalfstop, Arg_4: max([Arg_4, max([Arg_2, Arg_2+max([0, (1+2*Arg_1+-2*Arg_0)*(1+Arg_3-Arg_2)])])]) {O(n^2)}
32.21/23.03	
32.21/23.03	  12: evalfreturnin->evalfstop, Arg_5: max([Arg_5, max([Arg_5, max([min([-(Arg_2+min([0, -(1+Arg_1-Arg_0)])-Arg_0), min([-(Arg_2+min([0, -(1+Arg_1-Arg_0)])-Arg_0), -(Arg_2+-(Arg_0)-max([0, 1+Arg_1-Arg_0]))])]), min([-(Arg_2+min([0, -(1+Arg_1-Arg_0)])-Arg_0), min([-(Arg_2+min([0, -(1+Arg_1-Arg_0)])-Arg_0), -(Arg_2+-(Arg_0)-max([0, 1+Arg_1-Arg_0]))])])+max([0, (1+Arg_1-Arg_0+2*Arg_3)*(1+2*Arg_1+-2*Arg_0)*(1+Arg_3-Arg_2)])+max([0, Arg_1+Arg_2-Arg_5])])])]) {O(n^3)}
32.21/23.03	
32.21/23.03	  0: evalfstart->evalfentryin, Arg_0: Arg_0 {O(n)}
32.21/23.03	
32.21/23.03	  0: evalfstart->evalfentryin, Arg_1: Arg_1 {O(n)}
32.21/23.03	
32.21/23.03	  0: evalfstart->evalfentryin, Arg_2: Arg_2 {O(n)}
32.21/23.03	
32.21/23.03	  0: evalfstart->evalfentryin, Arg_3: Arg_3 {O(n)}
32.21/23.03	
32.21/23.03	  0: evalfstart->evalfentryin, Arg_4: Arg_4 {O(n)}
32.21/23.03	
32.21/23.03	  0: evalfstart->evalfentryin, Arg_5: Arg_5 {O(n)}
32.21/23.03	
32.21/23.03	
32.21/23.03	----------------------------------------
32.21/23.03	
32.21/23.03	(2)
32.21/23.03	BOUNDS(1, nat(2 * Arg_1 + 2 * Arg_2 + -2 * Arg_5) + nat(1 + -1 * Arg_0 + Arg_1) + nat(2 + -6 * Arg_0 + -8 * Arg_0 * Arg_1 + 8 * Arg_0 * Arg_1 * Arg_2 + -8 * Arg_0 * Arg_1 * Arg_3 + 6 * Arg_0 * Arg_2 + 8 * Arg_3 * Arg_0 * Arg_2 + -14 * Arg_0 * Arg_3 + -8 * Arg_3^2 * Arg_0 + 4 * Arg_0^2 + -4 * Arg_0^2 * Arg_2 + 4 * Arg_0^2 * Arg_3 + 6 * Arg_1 + -6 * Arg_1 * Arg_2 + -8 * Arg_3 * Arg_1 * Arg_2 + 14 * Arg_1 * Arg_3 + 8 * Arg_3^2 * Arg_1 + 4 * Arg_1^2 + -4 * Arg_1^2 * Arg_2 + 4 * Arg_1^2 * Arg_3 + -2 * Arg_2 + -4 * Arg_3 * Arg_2 + 6 * Arg_3 + 4 * Arg_3^2) + nat(1 + -2 * Arg_0 + 2 * Arg_1) + nat(6 + -12 * Arg_0 + 12 * Arg_0 * Arg_2 + -12 * Arg_0 * Arg_3 + 12 * Arg_1 + -12 * Arg_1 * Arg_2 + 12 * Arg_1 * Arg_3 + -6 * Arg_2 + 6 * Arg_3) + max(4, 5 + -2 * Arg_0 + 2 * Arg_1))
32.21/23.03	
32.21/23.03	----------------------------------------
32.21/23.03	
32.21/23.03	(3) Loat Proof (FINISHED)
32.21/23.03	
32.21/23.03	
32.21/23.03	### Pre-processing the ITS problem ###
32.21/23.03	
32.21/23.03	
32.21/23.03	
32.21/23.03	Initial linear ITS problem
32.21/23.03	
32.21/23.03	   Start location: evalfstart
32.21/23.03	
32.21/23.03	      0: evalfstart -> evalfentryin : [], cost: 1
32.21/23.03	
32.21/23.03	      1: evalfentryin -> evalfbb7in : A'=B, B'=C, C'=D, D'=A, [], cost: 1
32.21/23.03	
32.21/23.03	      2: evalfbb7in -> evalfbb5in : E'=B, [ A>=D ], cost: 1
32.21/23.03	
32.21/23.03	      3: evalfbb7in -> evalfreturnin : [ D>=1+A ], cost: 1
32.21/23.03	
32.21/23.03	      4: evalfbb5in -> evalfbb1in : [ C>=E ], cost: 1
32.21/23.03	
32.21/23.03	      5: evalfbb5in -> evalfbb6in : [ E>=1+C ], cost: 1
32.21/23.03	
32.21/23.03	      6: evalfbb1in -> evalfbb3in : F'=D-E, [], cost: 1
32.21/23.03	
32.21/23.03	      7: evalfbb3in -> evalfbb2in : [ D+E>=F ], cost: 1
32.21/23.03	
32.21/23.03	      8: evalfbb3in -> evalfbb4in : [ F>=1+D+E ], cost: 1
32.21/23.03	
32.21/23.03	      9: evalfbb2in -> evalfbb3in : F'=1+F, [], cost: 1
32.21/23.03	
32.21/23.03	     10: evalfbb4in -> evalfbb5in : E'=1+E, [], cost: 1
32.21/23.03	
32.21/23.03	     11: evalfbb6in -> evalfbb7in : D'=1+D, [], cost: 1
32.21/23.03	
32.21/23.03	     12: evalfreturnin -> evalfstop : [], cost: 1
32.21/23.03	
32.21/23.03	
32.21/23.03	
32.21/23.03	Removed unreachable and leaf rules:
32.21/23.03	
32.21/23.03	   Start location: evalfstart
32.21/23.03	
32.21/23.03	      0: evalfstart -> evalfentryin : [], cost: 1
32.21/23.03	
32.21/23.03	      1: evalfentryin -> evalfbb7in : A'=B, B'=C, C'=D, D'=A, [], cost: 1
32.21/23.03	
32.21/23.03	      2: evalfbb7in -> evalfbb5in : E'=B, [ A>=D ], cost: 1
32.21/23.03	
32.21/23.03	      4: evalfbb5in -> evalfbb1in : [ C>=E ], cost: 1
32.21/23.03	
32.21/23.03	      5: evalfbb5in -> evalfbb6in : [ E>=1+C ], cost: 1
32.21/23.03	
32.21/23.03	      6: evalfbb1in -> evalfbb3in : F'=D-E, [], cost: 1
32.21/23.03	
32.21/23.03	      7: evalfbb3in -> evalfbb2in : [ D+E>=F ], cost: 1
32.21/23.03	
32.21/23.03	      8: evalfbb3in -> evalfbb4in : [ F>=1+D+E ], cost: 1
32.21/23.03	
32.21/23.03	      9: evalfbb2in -> evalfbb3in : F'=1+F, [], cost: 1
32.21/23.03	
32.21/23.03	     10: evalfbb4in -> evalfbb5in : E'=1+E, [], cost: 1
32.21/23.03	
32.21/23.03	     11: evalfbb6in -> evalfbb7in : D'=1+D, [], cost: 1
32.21/23.03	
32.21/23.03	
32.21/23.03	
32.21/23.03	### Simplification by acceleration and chaining ###
32.21/23.03	
32.21/23.03	
32.21/23.03	
32.21/23.03	Eliminated locations (on linear paths):
32.21/23.03	
32.21/23.03	   Start location: evalfstart
32.21/23.03	
32.21/23.03	     13: evalfstart -> evalfbb7in : A'=B, B'=C, C'=D, D'=A, [], cost: 2
32.21/23.03	
32.21/23.03	      2: evalfbb7in -> evalfbb5in : E'=B, [ A>=D ], cost: 1
32.21/23.03	
32.21/23.03	     14: evalfbb5in -> evalfbb3in : F'=D-E, [ C>=E ], cost: 2
32.21/23.03	
32.21/23.03	     15: evalfbb5in -> evalfbb7in : D'=1+D, [ E>=1+C ], cost: 2
32.21/23.03	
32.21/23.03	     16: evalfbb3in -> evalfbb3in : F'=1+F, [ D+E>=F ], cost: 2
32.21/23.03	
32.21/23.03	     17: evalfbb3in -> evalfbb5in : E'=1+E, [ F>=1+D+E ], cost: 2
32.21/23.03	
32.21/23.03	
32.21/23.03	
32.21/23.03	Accelerating simple loops of location 5.
32.21/23.03	
32.21/23.03	   Accelerating the following rules:
32.21/23.03	
32.21/23.03	     16: evalfbb3in -> evalfbb3in : F'=1+F, [ D+E>=F ], cost: 2
32.21/23.03	
32.21/23.03	
32.21/23.03	
32.21/23.03	   Accelerated rule 16 with metering function 1-F+D+E, yielding the new rule 18.
32.21/23.03	
32.21/23.03	   Removing the simple loops: 16.
32.21/23.03	
32.21/23.03	
32.21/23.03	
32.21/23.03	Accelerated all simple loops using metering functions (where possible):
32.21/23.03	
32.21/23.03	   Start location: evalfstart
32.21/23.03	
32.21/23.03	     13: evalfstart -> evalfbb7in : A'=B, B'=C, C'=D, D'=A, [], cost: 2
32.21/23.03	
32.21/23.03	      2: evalfbb7in -> evalfbb5in : E'=B, [ A>=D ], cost: 1
32.21/23.03	
32.21/23.03	     14: evalfbb5in -> evalfbb3in : F'=D-E, [ C>=E ], cost: 2
32.21/23.03	
32.21/23.03	     15: evalfbb5in -> evalfbb7in : D'=1+D, [ E>=1+C ], cost: 2
32.21/23.03	
32.21/23.03	     17: evalfbb3in -> evalfbb5in : E'=1+E, [ F>=1+D+E ], cost: 2
32.21/23.03	
32.21/23.03	     18: evalfbb3in -> evalfbb3in : F'=1+D+E, [ D+E>=F ], cost: 2-2*F+2*D+2*E
32.21/23.03	
32.21/23.03	
32.21/23.03	
32.21/23.03	Chained accelerated rules (with incoming rules):
32.21/23.03	
32.21/23.03	   Start location: evalfstart
32.21/23.03	
32.21/23.03	     13: evalfstart -> evalfbb7in : A'=B, B'=C, C'=D, D'=A, [], cost: 2
32.21/23.03	
32.21/23.03	      2: evalfbb7in -> evalfbb5in : E'=B, [ A>=D ], cost: 1
32.21/23.03	
32.21/23.03	     14: evalfbb5in -> evalfbb3in : F'=D-E, [ C>=E ], cost: 2
32.21/23.03	
32.21/23.03	     15: evalfbb5in -> evalfbb7in : D'=1+D, [ E>=1+C ], cost: 2
32.21/23.03	
32.21/23.03	     19: evalfbb5in -> evalfbb3in : F'=1+D+E, [ C>=E && D+E>=D-E ], cost: 4+4*E
32.21/23.03	
32.21/23.03	     17: evalfbb3in -> evalfbb5in : E'=1+E, [ F>=1+D+E ], cost: 2
32.21/23.03	
32.21/23.03	
32.21/23.03	
32.21/23.03	Eliminated locations (on tree-shaped paths):
32.21/23.03	
32.21/23.03	   Start location: evalfstart
32.21/23.03	
32.21/23.03	     13: evalfstart -> evalfbb7in : A'=B, B'=C, C'=D, D'=A, [], cost: 2
32.21/23.03	
32.21/23.03	      2: evalfbb7in -> evalfbb5in : E'=B, [ A>=D ], cost: 1
32.21/23.03	
32.21/23.03	     15: evalfbb5in -> evalfbb7in : D'=1+D, [ E>=1+C ], cost: 2
32.21/23.03	
32.21/23.03	     20: evalfbb5in -> evalfbb5in : E'=1+E, F'=D-E, [ C>=E && D-E>=1+D+E ], cost: 4
32.21/23.03	
32.21/23.03	     21: evalfbb5in -> evalfbb5in : E'=1+E, F'=1+D+E, [ C>=E && D+E>=D-E ], cost: 6+4*E
32.21/23.03	
32.21/23.03	
32.21/23.03	
32.21/23.03	Accelerating simple loops of location 3.
32.21/23.03	
32.21/23.03	   Accelerating the following rules:
32.21/23.03	
32.21/23.03	     20: evalfbb5in -> evalfbb5in : E'=1+E, F'=D-E, [ C>=E && D-E>=1+D+E ], cost: 4
32.21/23.03	
32.21/23.03	     21: evalfbb5in -> evalfbb5in : E'=1+E, F'=1+D+E, [ C>=E && D+E>=D-E ], cost: 6+4*E
32.21/23.03	
32.21/23.03	
32.21/23.03	
32.21/23.03	   Accelerated rule 20 with backward acceleration, yielding the new rule 22.
32.21/23.03	
32.21/23.03	   Accelerated rule 21 with metering function 1+C-E, yielding the new rule 23.
32.21/23.03	
32.21/23.03	      During metering: Instantiating temporary variables by {k==1}
32.21/23.03	
32.21/23.03	   Removing the simple loops: 20 21.
32.21/23.03	
32.21/23.03	
32.21/23.03	
32.21/23.03	Accelerated all simple loops using metering functions (where possible):
32.21/23.03	
32.21/23.03	   Start location: evalfstart
32.21/23.03	
32.21/23.03	     13: evalfstart -> evalfbb7in : A'=B, B'=C, C'=D, D'=A, [], cost: 2
32.21/23.03	
32.21/23.03	      2: evalfbb7in -> evalfbb5in : E'=B, [ A>=D ], cost: 1
32.21/23.03	
32.21/23.03	     15: evalfbb5in -> evalfbb7in : D'=1+D, [ E>=1+C ], cost: 2
32.21/23.03	
32.21/23.03	     22: evalfbb5in -> evalfbb5in : E'=k+E, F'=1-k+D-E, [ C>=E && D-E>=1+D+E && k>0 && C>=-1+k+E && 1-k+D-E>=k+D+E ], cost: 4*k
32.21/23.03	
32.21/23.03	     23: evalfbb5in -> evalfbb5in : E'=1+C, F'=1+C+D, [ C>=E && D+E>=D-E ], cost: 4+2*(1+C-E)^2+4*C+4*(1+C-E)*E-4*E
32.21/23.03	
32.21/23.03	
32.21/23.03	
32.21/23.03	Chained accelerated rules (with incoming rules):
32.21/23.03	
32.21/23.03	   Start location: evalfstart
32.21/23.03	
32.21/23.03	     13: evalfstart -> evalfbb7in : A'=B, B'=C, C'=D, D'=A, [], cost: 2
32.21/23.03	
32.21/23.03	      2: evalfbb7in -> evalfbb5in : E'=B, [ A>=D ], cost: 1
32.21/23.03	
32.21/23.03	     24: evalfbb7in -> evalfbb5in : E'=k+B, F'=1-k+D-B, [ A>=D && C>=B && D-B>=1+D+B && k>0 && C>=-1+k+B && 1-k+D-B>=k+D+B ], cost: 1+4*k
32.21/23.03	
32.21/23.03	     25: evalfbb7in -> evalfbb5in : E'=1+C, F'=1+C+D, [ A>=D && C>=B && D+B>=D-B ], cost: 5+4*C+2*(1+C-B)^2+4*(1+C-B)*B-4*B
32.21/23.03	
32.21/23.03	     15: evalfbb5in -> evalfbb7in : D'=1+D, [ E>=1+C ], cost: 2
32.21/23.03	
32.21/23.03	
32.21/23.03	
32.21/23.03	Eliminated locations (on tree-shaped paths):
32.21/23.03	
32.21/23.03	   Start location: evalfstart
32.21/23.03	
32.21/23.03	     13: evalfstart -> evalfbb7in : A'=B, B'=C, C'=D, D'=A, [], cost: 2
32.21/23.03	
32.21/23.03	     26: evalfbb7in -> evalfbb7in : D'=1+D, E'=B, [ A>=D && B>=1+C ], cost: 3
32.21/23.03	
32.21/23.03	     27: evalfbb7in -> evalfbb7in : D'=1+D, E'=k+B, F'=1-k+D-B, [ A>=D && C>=B && D-B>=1+D+B && k>0 && C>=-1+k+B && 1-k+D-B>=k+D+B && k+B>=1+C ], cost: 3+4*k
32.21/23.03	
32.21/23.03	     28: evalfbb7in -> evalfbb7in : D'=1+D, E'=1+C, F'=1+C+D, [ A>=D && C>=B && D+B>=D-B ], cost: 7+4*C+2*(1+C-B)^2+4*(1+C-B)*B-4*B
32.21/23.03	
32.21/23.03	
32.21/23.03	
32.21/23.03	Accelerating simple loops of location 2.
32.21/23.03	
32.21/23.03	   Simplified some of the simple loops (and removed duplicate rules).
32.21/23.03	
32.21/23.03	   Accelerating the following rules:
32.21/23.03	
32.21/23.03	     26: evalfbb7in -> evalfbb7in : D'=1+D, E'=B, [ A>=D && B>=1+C ], cost: 3
32.21/23.03	
32.21/23.03	     27: evalfbb7in -> evalfbb7in : D'=1+D, E'=1+C, F'=-C+D, [ A>=D && C>=B && D-B>=1+D+B && -C+D>=1+C+D ], cost: 7+4*C-4*B
32.21/23.03	
32.21/23.03	     28: evalfbb7in -> evalfbb7in : D'=1+D, E'=1+C, F'=1+C+D, [ A>=D && C>=B && D+B>=D-B ], cost: 7+4*C+2*(1+C-B)^2+4*(1+C-B)*B-4*B
32.21/23.03	
32.21/23.03	
32.21/23.03	
32.21/23.03	   Accelerated rule 26 with metering function 1-D+A, yielding the new rule 29.
32.21/23.03	
32.21/23.03	   Accelerated rule 27 with metering function 1-D+A, yielding the new rule 30.
32.21/23.03	
32.21/23.03	   Accelerated rule 28 with metering function 1-D+A, yielding the new rule 31.
32.21/23.03	
32.21/23.03	   Removing the simple loops: 26 27 28.
32.21/23.03	
32.21/23.03	
32.21/23.03	
32.21/23.03	Accelerated all simple loops using metering functions (where possible):
32.21/23.03	
32.21/23.03	   Start location: evalfstart
32.21/23.03	
32.21/23.03	     13: evalfstart -> evalfbb7in : A'=B, B'=C, C'=D, D'=A, [], cost: 2
32.21/23.03	
32.21/23.03	     29: evalfbb7in -> evalfbb7in : D'=1+A, E'=B, [ A>=D && B>=1+C ], cost: 3-3*D+3*A
32.21/23.03	
32.21/23.03	     30: evalfbb7in -> evalfbb7in : D'=1+A, E'=1+C, F'=-C+A, [ A>=D && C>=B && D-B>=1+D+B && -C+D>=1+C+D ], cost: 7-4*(-1+D-A)*C+4*(-1+D-A)*B-7*D+7*A
32.21/23.03	
32.21/23.03	     31: evalfbb7in -> evalfbb7in : D'=1+A, E'=1+C, F'=1+C+A, [ A>=D && C>=B && D+B>=D-B ], cost: 9-8*(-1+D-A)*C+2*(-1+D-A)*B^2+4*(-1+D-A)*B-2*(-1+D-A)*C^2-9*D+9*A
32.21/23.03	
32.21/23.03	
32.21/23.03	
32.21/23.03	Chained accelerated rules (with incoming rules):
32.21/23.03	
32.21/23.03	   Start location: evalfstart
32.21/23.03	
32.21/23.03	     13: evalfstart -> evalfbb7in : A'=B, B'=C, C'=D, D'=A, [], cost: 2
32.21/23.03	
32.21/23.03	     32: evalfstart -> evalfbb7in : A'=B, B'=C, C'=D, D'=1+B, E'=C, [ B>=A && C>=1+D ], cost: 5-3*A+3*B
32.21/23.03	
32.21/23.03	     33: evalfstart -> evalfbb7in : A'=B, B'=C, C'=D, D'=1+B, E'=1+D, F'=-D+B, [ B>=A && D>=C && -C+A>=1+C+A && -D+A>=1+D+A ], cost: 9-4*(-1+A-B)*D+4*(-1+A-B)*C-7*A+7*B
32.21/23.03	
32.21/23.03	     34: evalfstart -> evalfbb7in : A'=B, B'=C, C'=D, D'=1+B, E'=1+D, F'=1+D+B, [ B>=A && D>=C && C+A>=-C+A ], cost: 11-8*(-1+A-B)*D-2*(-1+A-B)*D^2+4*(-1+A-B)*C-9*A+2*(-1+A-B)*C^2+9*B
32.21/23.03	
32.21/23.03	
32.21/23.03	
32.21/23.03	Removed unreachable locations (and leaf rules with constant cost):
32.21/23.03	
32.21/23.03	   Start location: evalfstart
32.21/23.03	
32.21/23.03	     32: evalfstart -> evalfbb7in : A'=B, B'=C, C'=D, D'=1+B, E'=C, [ B>=A && C>=1+D ], cost: 5-3*A+3*B
32.21/23.03	
32.21/23.03	     33: evalfstart -> evalfbb7in : A'=B, B'=C, C'=D, D'=1+B, E'=1+D, F'=-D+B, [ B>=A && D>=C && -C+A>=1+C+A && -D+A>=1+D+A ], cost: 9-4*(-1+A-B)*D+4*(-1+A-B)*C-7*A+7*B
32.21/23.03	
32.21/23.03	     34: evalfstart -> evalfbb7in : A'=B, B'=C, C'=D, D'=1+B, E'=1+D, F'=1+D+B, [ B>=A && D>=C && C+A>=-C+A ], cost: 11-8*(-1+A-B)*D-2*(-1+A-B)*D^2+4*(-1+A-B)*C-9*A+2*(-1+A-B)*C^2+9*B
32.21/23.03	
32.21/23.03	
32.21/23.03	
32.21/23.03	### Computing asymptotic complexity ###
32.21/23.03	
32.21/23.03	
32.21/23.03	
32.21/23.03	Fully simplified ITS problem
32.21/23.03	
32.21/23.03	   Start location: evalfstart
32.21/23.03	
32.21/23.03	     32: evalfstart -> evalfbb7in : A'=B, B'=C, C'=D, D'=1+B, E'=C, [ B>=A && C>=1+D ], cost: 5-3*A+3*B
32.21/23.03	
32.21/23.03	     33: evalfstart -> evalfbb7in : A'=B, B'=C, C'=D, D'=1+B, E'=1+D, F'=-D+B, [ B>=A && D>=C && -C+A>=1+C+A && -D+A>=1+D+A ], cost: 9-4*(-1+A-B)*D+4*(-1+A-B)*C-7*A+7*B
32.21/23.03	
32.21/23.03	     34: evalfstart -> evalfbb7in : A'=B, B'=C, C'=D, D'=1+B, E'=1+D, F'=1+D+B, [ B>=A && D>=C && C+A>=-C+A ], cost: 11-8*(-1+A-B)*D-2*(-1+A-B)*D^2+4*(-1+A-B)*C-9*A+2*(-1+A-B)*C^2+9*B
32.21/23.03	
32.21/23.03	
32.21/23.03	
32.21/23.03	Computing asymptotic complexity for rule 32
32.21/23.03	
32.21/23.03	   Solved the limit problem by the following transformations:
32.21/23.03	
32.21/23.03	      Created initial limit problem:
32.21/23.03	
32.21/23.03	      1-A+B (+/+!), C-D (+/+!), 5-3*A+3*B (+) [not solved]
32.21/23.03	
32.21/23.03	
32.21/23.03	
32.21/23.03	      removing all constraints (solved by SMT)
32.21/23.03	
32.21/23.03	      resulting limit problem: [solved]
32.21/23.03	
32.21/23.03	
32.21/23.03	
32.21/23.03	      applying transformation rule (C) using substitution {C==1,D==0,A==0,B==n}
32.21/23.03	
32.21/23.03	      resulting limit problem:
32.21/23.03	
32.21/23.03	      [solved]
32.21/23.03	
32.21/23.03	
32.21/23.03	
32.21/23.03	   Solution:
32.21/23.03	
32.21/23.03	      C / 1
32.21/23.03	
32.21/23.03	      D / 0
32.21/23.03	
32.21/23.03	      A / 0
32.21/23.03	
32.21/23.03	      B / n
32.21/23.03	
32.21/23.03	   Resulting cost 5+3*n has complexity: Poly(n^1)
32.21/23.03	
32.21/23.03	
32.21/23.03	
32.21/23.03	Found new complexity Poly(n^1).
32.21/23.03	
32.21/23.03	
32.21/23.03	
32.21/23.03	Computing asymptotic complexity for rule 33
32.21/23.03	
32.21/23.03	   Solved the limit problem by the following transformations:
32.21/23.03	
32.21/23.03	      Created initial limit problem:
32.21/23.03	
32.21/23.03	      -2*D (+/+!), 1-A+B (+/+!), 1-C+D (+/+!), -2*C (+/+!), 9+4*D*B-4*C-4*C*B+4*D-7*A-4*D*A+4*C*A+7*B (+) [not solved]
32.21/23.03	
32.21/23.03	
32.21/23.03	
32.21/23.03	      removing all constraints (solved by SMT)
32.21/23.03	
32.21/23.03	      resulting limit problem: [solved]
32.21/23.03	
32.21/23.03	
32.21/23.03	
32.21/23.03	      applying transformation rule (C) using substitution {C==-2*n,D==-n,A==0,B==n}
32.21/23.03	
32.21/23.03	      resulting limit problem:
32.21/23.03	
32.21/23.03	      [solved]
32.21/23.03	
32.21/23.03	
32.21/23.03	
32.21/23.03	   Solution:
32.21/23.03	
32.21/23.03	      C / -2*n
32.21/23.03	
32.21/23.03	      D / -n
32.21/23.03	
32.21/23.03	      A / 0
32.21/23.03	
32.21/23.03	      B / n
32.21/23.03	
32.21/23.03	   Resulting cost 9+4*n^2+11*n has complexity: Poly(n^2)
32.21/23.03	
32.21/23.03	
32.21/23.03	
32.21/23.03	Found new complexity Poly(n^2).
32.21/23.03	
32.21/23.03	
32.21/23.03	
32.21/23.03	Computing asymptotic complexity for rule 34
32.21/23.03	
32.21/23.03	   Solved the limit problem by the following transformations:
32.21/23.03	
32.21/23.03	      Created initial limit problem:
32.21/23.03	
32.21/23.03	      11+2*C^2*A-2*C^2+8*D*B-4*C-4*C*B-2*D^2*A+8*D-9*A-2*C^2*B+2*D^2-8*D*A+4*C*A+9*B+2*D^2*B (+), 1+2*C (+/+!), 1-A+B (+/+!), 1-C+D (+/+!) [not solved]
32.21/23.03	
32.21/23.03	
32.21/23.03	
32.21/23.03	      applying transformation rule (C) using substitution {B==A}
32.21/23.03	
32.21/23.03	      resulting limit problem:
32.21/23.03	
32.21/23.03	      1 (+/+!), 1+2*C (+/+!), 11-2*C^2-4*C+8*D+2*D^2 (+), 1-C+D (+/+!) [not solved]
32.21/23.03	
32.21/23.03	
32.21/23.03	
32.21/23.03	      applying transformation rule (C) using substitution {D==C}
32.21/23.03	
32.21/23.03	      resulting limit problem:
32.21/23.03	
32.21/23.03	      1 (+/+!), 1+2*C (+/+!), 11+4*C (+) [not solved]
32.21/23.03	
32.21/23.03	
32.21/23.03	
32.21/23.03	      applying transformation rule (B), deleting 1 (+/+!)
32.21/23.03	
32.21/23.03	      resulting limit problem:
32.21/23.03	
32.21/23.03	      1+2*C (+/+!), 11+4*C (+) [not solved]
32.21/23.03	
32.21/23.03	
32.21/23.03	
32.21/23.03	      removing all constraints (solved by SMT)
32.21/23.03	
32.21/23.03	      resulting limit problem: [solved]
32.21/23.03	
32.21/23.03	
32.21/23.03	
32.21/23.03	      applying transformation rule (C) using substitution {C==n}
32.21/23.03	
32.21/23.03	      resulting limit problem:
32.21/23.03	
32.21/23.03	      [solved]
32.21/23.03	
32.21/23.03	
32.21/23.03	
32.21/23.03	   Solved the limit problem by the following transformations:
32.21/23.03	
32.21/23.03	      Created initial limit problem:
32.21/23.03	
32.21/23.03	      11+2*C^2*A-2*C^2+8*D*B-4*C-4*C*B-2*D^2*A+8*D-9*A-2*C^2*B+2*D^2-8*D*A+4*C*A+9*B+2*D^2*B (+), 1+2*C (+/+!), 1-A+B (+/+!), 1-C+D (+/+!) [not solved]
32.21/23.03	
32.21/23.03	
32.21/23.03	
32.21/23.03	      removing all constraints (solved by SMT)
32.21/23.03	
32.21/23.03	      resulting limit problem: [solved]
32.21/23.03	
32.21/23.03	
32.21/23.03	
32.21/23.03	      applying transformation rule (C) using substitution {C==0,D==n,A==-n,B==0}
32.21/23.03	
32.21/23.03	      resulting limit problem:
32.21/23.03	
32.21/23.03	      [solved]
32.21/23.03	
32.21/23.03	
32.21/23.03	
32.21/23.03	   Solution:
32.21/23.03	
32.21/23.03	      C / 0
32.21/23.03	
32.21/23.03	      D / n
32.21/23.03	
32.21/23.03	      A / -n
32.21/23.03	
32.21/23.03	      B / 0
32.21/23.03	
32.21/23.03	   Resulting cost 11+2*n^3+10*n^2+17*n has complexity: Poly(n^3)
32.21/23.03	
32.21/23.03	
32.21/23.03	
32.21/23.03	Found new complexity Poly(n^3).
32.21/23.03	
32.21/23.03	
32.21/23.03	
32.21/23.03	Obtained the following overall complexity (w.r.t. the length of the input n):
32.21/23.03	
32.21/23.03	   Complexity:  Poly(n^3)
32.21/23.03	
32.21/23.03	   Cpx degree:  3
32.21/23.03	
32.21/23.03	   Solved cost: 11+2*n^3+10*n^2+17*n
32.21/23.03	
32.21/23.03	   Rule cost:   11-8*(-1+A-B)*D-2*(-1+A-B)*D^2+4*(-1+A-B)*C-9*A+2*(-1+A-B)*C^2+9*B
32.21/23.03	
32.21/23.03	   Rule guard:  [ B>=A && D>=C && C+A>=-C+A ]
32.21/23.03	
32.21/23.03	
32.21/23.03	
32.21/23.03	WORST_CASE(Omega(n^3),?)
32.21/23.03	
32.21/23.03	
32.21/23.03	----------------------------------------
32.21/23.03	
32.21/23.03	(4)
32.21/23.03	BOUNDS(n^3, INF)
32.21/23.04	EOF