103.82/95.62	WORST_CASE(Omega(n^1), O(n^2))
103.82/95.64	proof of /export/starexec/sandbox/benchmark/theBenchmark.koat
103.82/95.64	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
103.82/95.64	
103.82/95.64	
103.82/95.64	The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(n^1, max(2, 2 * Arg_0) + max(2, 2 * Arg_0) * nat(max(8, -4 + 4 * Arg_1, 4 * Arg_1) + max(-8, min(-8, 8 + -8 * Arg_0))) + 2 * max(2, 2 * Arg_0) * max(2 * Arg_1, 4, -2 + 2 * Arg_1) + max(2, 2 * Arg_0) * nat(max(min(2 + -2 * Arg_0, -2), -2) + max(2 * Arg_1, 4, -2 + 2 * Arg_1)) + max(2, 2 * Arg_0) * max(-1 + Arg_1, Arg_1, 0) + max(2, 2 * Arg_0) * max(5, -1 + 2 * Arg_1, 1 + 2 * Arg_1) + max(2, 2 * Arg_0) * nat(max(-1 + Arg_1, Arg_1) + max(min(2 + -2 * Arg_0, -2), -2)) + 2 * max(2, -2 + 2 * Arg_0) * max(2 * Arg_1, 4, -2 + 2 * Arg_1) + max(2, -2 + 2 * Arg_0) * nat(max(min(2 + -2 * Arg_0, -2), -2) + max(2 * Arg_1, 4, -2 + 2 * Arg_1)) + max(2, -2 + 2 * Arg_0) * max(-1 + Arg_1, Arg_1, 0) + max(2, -2 + 2 * Arg_0) * max(5, -1 + 2 * Arg_1, 1 + 2 * Arg_1) + max(2, -2 + 2 * Arg_0) * nat(max(-1 + Arg_1, Arg_1) + max(min(2 + -2 * Arg_0, -2), -2)) + max(2, -2 + 2 * Arg_0) + max(2, -2 + 2 * Arg_0) * nat(max(-8, min(-8, 8 + -8 * Arg_0)) + max(8, -4 + 4 * Arg_1, 4 * Arg_1)) + nat(1 + 2 * Arg_1) + nat(2 * Arg_1 + max(2 + -2 * Arg_0, -2)) + nat(4 * Arg_1) + nat(-1 + 2 * Arg_1) + nat(-1 + Arg_1 + max(-2 * Arg_0, -2)) + nat(-4 + 4 * Arg_1 + max(-8, -8 * Arg_0)) + nat(-2 + 2 * Arg_1 + max(-2 * Arg_0, -2)) + nat(-4 + 4 * Arg_1) + nat(Arg_1 + max(2 + -2 * Arg_0, -2)) + max(2 * Arg_1, 2) + nat(-1 + Arg_1) * max(-2 + Arg_1, -3 + Arg_1, 0) + nat(-1 + Arg_1) * max(-4 + 2 * Arg_1, -2 + 2 * Arg_1, 0) + nat(-1 + Arg_1) * max(-12 + 4 * Arg_1, -8 + 4 * Arg_1, 0) + nat(Arg_1) * max(-2 + Arg_1, -3 + Arg_1, 0) + nat(Arg_1) * max(-4 + 2 * Arg_1, -2 + 2 * Arg_1, 0) + nat(Arg_1) * max(-12 + 4 * Arg_1, -8 + 4 * Arg_1, 0) + nat(2 * Arg_1) + nat(4 * Arg_1 + max(-8, 8 + -8 * Arg_0))).
103.82/95.64	
103.82/95.64	(0) CpxIntTrs
103.82/95.64	(1) Koat2 Proof [FINISHED, 2727 ms]
103.82/95.64	(2) BOUNDS(1, max(2, 2 * Arg_0) + max(2, 2 * Arg_0) * nat(max(8, -4 + 4 * Arg_1, 4 * Arg_1) + max(-8, min(-8, 8 + -8 * Arg_0))) + 2 * max(2, 2 * Arg_0) * max(2 * Arg_1, 4, -2 + 2 * Arg_1) + max(2, 2 * Arg_0) * nat(max(min(2 + -2 * Arg_0, -2), -2) + max(2 * Arg_1, 4, -2 + 2 * Arg_1)) + max(2, 2 * Arg_0) * max(-1 + Arg_1, Arg_1, 0) + max(2, 2 * Arg_0) * max(5, -1 + 2 * Arg_1, 1 + 2 * Arg_1) + max(2, 2 * Arg_0) * nat(max(-1 + Arg_1, Arg_1) + max(min(2 + -2 * Arg_0, -2), -2)) + 2 * max(2, -2 + 2 * Arg_0) * max(2 * Arg_1, 4, -2 + 2 * Arg_1) + max(2, -2 + 2 * Arg_0) * nat(max(min(2 + -2 * Arg_0, -2), -2) + max(2 * Arg_1, 4, -2 + 2 * Arg_1)) + max(2, -2 + 2 * Arg_0) * max(-1 + Arg_1, Arg_1, 0) + max(2, -2 + 2 * Arg_0) * max(5, -1 + 2 * Arg_1, 1 + 2 * Arg_1) + max(2, -2 + 2 * Arg_0) * nat(max(-1 + Arg_1, Arg_1) + max(min(2 + -2 * Arg_0, -2), -2)) + max(2, -2 + 2 * Arg_0) + max(2, -2 + 2 * Arg_0) * nat(max(-8, min(-8, 8 + -8 * Arg_0)) + max(8, -4 + 4 * Arg_1, 4 * Arg_1)) + nat(1 + 2 * Arg_1) + nat(2 * Arg_1 + max(2 + -2 * Arg_0, -2)) + nat(4 * Arg_1) + nat(-1 + 2 * Arg_1) + nat(-1 + Arg_1 + max(-2 * Arg_0, -2)) + nat(-4 + 4 * Arg_1 + max(-8, -8 * Arg_0)) + nat(-2 + 2 * Arg_1 + max(-2 * Arg_0, -2)) + nat(-4 + 4 * Arg_1) + nat(Arg_1 + max(2 + -2 * Arg_0, -2)) + max(2 * Arg_1, 2) + nat(-1 + Arg_1) * max(-2 + Arg_1, -3 + Arg_1, 0) + nat(-1 + Arg_1) * max(-4 + 2 * Arg_1, -2 + 2 * Arg_1, 0) + nat(-1 + Arg_1) * max(-12 + 4 * Arg_1, -8 + 4 * Arg_1, 0) + nat(Arg_1) * max(-2 + Arg_1, -3 + Arg_1, 0) + nat(Arg_1) * max(-4 + 2 * Arg_1, -2 + 2 * Arg_1, 0) + nat(Arg_1) * max(-12 + 4 * Arg_1, -8 + 4 * Arg_1, 0) + nat(2 * Arg_1) + nat(4 * Arg_1 + max(-8, 8 + -8 * Arg_0)))
103.82/95.64	(3) Loat Proof [FINISHED, 94.1 s]
103.82/95.64	(4) BOUNDS(n^1, INF)
103.82/95.64	
103.82/95.64	
103.82/95.64	----------------------------------------
103.82/95.64	
103.82/95.64	(0)
103.82/95.64	Obligation:
103.82/95.64	Complexity Int TRS consisting of the following rules:
103.82/95.64	eval1(A, B, C, D) -> Com_1(eval2(A - 1, B, C, D)) :|: A >= 2
103.82/95.64	eval1(A, B, C, D) -> Com_1(eval2(A, B - 1, C, D)) :|: 1 >= A
103.82/95.64	eval2(A, B, C, D) -> Com_1(eval3(A, B, A, 2 * A)) :|: B >= 2
103.82/95.64	eval3(A, B, C, D) -> Com_1(eval4(A, B, C, D)) :|: B >= D && B >= 1 + D
103.82/95.64	eval3(A, B, C, D) -> Com_1(eval4(A, B, C, D + 1)) :|: B >= D && B >= 1 + D
103.82/95.64	eval3(A, B, C, D) -> Com_1(eval3(A, B, D, 2 * D)) :|: B >= D && B >= 1 + D && D >= 1
103.82/95.64	eval3(A, B, C, D) -> Com_1(eval3(A, B, D + 1, 2 * D + 2)) :|: B >= D && B >= 1 + D && D >= 1
103.82/95.64	eval3(A, B, C, D) -> Com_1(eval4(A, B, C, D)) :|: B >= D && B <= D
103.82/95.64	eval3(A, B, C, D) -> Com_1(eval3(A, B, D, 2 * D)) :|: D >= 1 && B >= D && B <= D
103.82/95.64	eval4(A, B, C, D) -> Com_1(eval2(A - 1, B, C, D)) :|: A >= 2 && A >= 1 && B >= 2
103.82/95.64	eval4(A, B, C, D) -> Com_1(eval2(A, B - 1, C, D)) :|: B >= 2 && A >= 1 && A <= 1
103.82/95.64	
103.82/95.64	The start-symbols are:[eval1_4]
103.82/95.64	
103.82/95.64	
103.82/95.64	----------------------------------------
103.82/95.64	
103.82/95.64	(1) Koat2 Proof (FINISHED)
103.82/95.64	YES( ?, 2+(max([0, -1+Arg_1])+max([0, Arg_1]))*max([0, -2+max([Arg_1, -1+Arg_1])])+max([0, 1+2*Arg_1])+(max([0, -1+Arg_1])+max([0, Arg_1]))*max([0, max([-4, -8+4*max([Arg_1, -1+Arg_1])])])+max([0, Arg_1+max([-2, -2*(-1+Arg_0)])])+(max([0, -1+Arg_1])+max([0, Arg_1]))*max([0, -2+2*max([Arg_1, -1+Arg_1])])+max([0, 4*Arg_1+max([-8, -8*(-1+Arg_0)])])+(max([2, 2*Arg_0])+max([2, 2*(-1+Arg_0)]))*max([4, 2*max([Arg_1, -1+Arg_1])])+max([0, 2*Arg_1+max([-2, -2*(-1+Arg_0)])])+(max([2, 2*Arg_0])+max([2, 2*(-1+Arg_0)]))*max([0, max([Arg_1, -1+Arg_1])])+max([0, 2*Arg_1])+(max([2, 2*Arg_0])+max([2, 2*(-1+Arg_0)]))*max([4, 2*max([Arg_1, -1+Arg_1])])+max([0, Arg_1])+max([2, 2*Arg_0])+max([0, 2*Arg_1])+max([0, -1+Arg_1])+max([2, 2*(-1+Arg_0)])+(max([2, 2*Arg_0])+max([2, 2*(-1+Arg_0)]))*max([5, 1+2*max([Arg_1, -1+Arg_1])])+(max([2, 2*Arg_0])+max([2, 2*(-1+Arg_0)]))*max([0, max([Arg_1, -1+Arg_1])+max([-2, -2*max([1, -1+Arg_0])])])+(max([2, 2*Arg_0])+max([2, 2*(-1+Arg_0)]))*max([0, max([-8, -8*max([1, -1+Arg_0])])+max([8, 4*max([Arg_1, -1+Arg_1])])])+(max([2, 2*Arg_0])+max([2, 2*(-1+Arg_0)]))*max([0, max([-2, -2*max([1, -1+Arg_0])])+max([4, 2*max([Arg_1, -1+Arg_1])])])+max([0, 1+2*(-1+Arg_1)])+max([0, -1+Arg_1+max([-2, -2*Arg_0])])+max([0, 4*(-1+Arg_1)+max([-8, -8*Arg_0])])+max([0, 2*(-1+Arg_1)+max([-2, -2*Arg_0])])+max([0, 2*(-1+Arg_1)])+max([0, -1+Arg_1])+max([0, 2*(-1+Arg_1)])+max([0, Arg_1]) {O(n^2)})
103.82/95.64	
103.82/95.64	
103.82/95.64	
103.82/95.64	Initial Complexity Problem:
103.82/95.64	
103.82/95.64	  Start:  eval1  
103.82/95.64	
103.82/95.64	  Program_Vars:  Arg_0, Arg_1, Arg_2, Arg_3  
103.82/95.64	
103.82/95.64	  Temp_Vars:    
103.82/95.64	
103.82/95.64	  Locations:  eval1, eval2, eval3, eval4  
103.82/95.64	
103.82/95.64	  Transitions:
103.82/95.64	
103.82/95.64	  eval1(Arg_0,Arg_1,Arg_2,Arg_3) -> eval2(Arg_0-1,Arg_1,Arg_2,Arg_3):|:2 <= Arg_0
103.82/95.64	
103.82/95.64	  eval1(Arg_0,Arg_1,Arg_2,Arg_3) -> eval2(Arg_0,Arg_1-1,Arg_2,Arg_3):|:Arg_0 <= 1
103.82/95.64	
103.82/95.64	  eval2(Arg_0,Arg_1,Arg_2,Arg_3) -> eval3(Arg_0,Arg_1,Arg_0,(2)*Arg_0):|:2 <= Arg_1
103.82/95.64	
103.82/95.64	  eval3(Arg_0,Arg_1,Arg_2,Arg_3) -> eval3(Arg_0,Arg_1,Arg_3,(2)*Arg_3):|:2 <= Arg_1 && Arg_3 <= Arg_1 && 1+Arg_3 <= Arg_1 && 1 <= Arg_3
103.82/95.64	
103.82/95.64	  eval3(Arg_0,Arg_1,Arg_2,Arg_3) -> eval3(Arg_0,Arg_1,Arg_3+1,(2)*Arg_3+2):|:2 <= Arg_1 && Arg_3 <= Arg_1 && 1+Arg_3 <= Arg_1 && 1 <= Arg_3
103.82/95.64	
103.82/95.64	  eval3(Arg_0,Arg_1,Arg_2,Arg_3) -> eval3(Arg_0,Arg_1,Arg_3,(2)*Arg_3):|:2 <= Arg_1 && 1 <= Arg_3 && Arg_1 <= Arg_3 && Arg_3 <= Arg_1
103.82/95.64	
103.82/95.64	  eval3(Arg_0,Arg_1,Arg_2,Arg_3) -> eval4(Arg_0,Arg_1,Arg_2,Arg_3):|:2 <= Arg_1 && Arg_3 <= Arg_1 && 1+Arg_3 <= Arg_1
103.82/95.64	
103.82/95.64	  eval3(Arg_0,Arg_1,Arg_2,Arg_3) -> eval4(Arg_0,Arg_1,Arg_2,Arg_3+1):|:2 <= Arg_1 && Arg_3 <= Arg_1 && 1+Arg_3 <= Arg_1
103.82/95.64	
103.82/95.64	  eval3(Arg_0,Arg_1,Arg_2,Arg_3) -> eval4(Arg_0,Arg_1,Arg_2,Arg_3):|:2 <= Arg_1 && Arg_1 <= Arg_3 && Arg_3 <= Arg_1
103.82/95.64	
103.82/95.64	  eval4(Arg_0,Arg_1,Arg_2,Arg_3) -> eval2(Arg_0-1,Arg_1,Arg_2,Arg_3):|:2 <= Arg_1 && 2 <= Arg_0 && 1 <= Arg_0 && 2 <= Arg_1
103.82/95.64	
103.82/95.64	  eval4(Arg_0,Arg_1,Arg_2,Arg_3) -> eval2(Arg_0,Arg_1-1,Arg_2,Arg_3):|:2 <= Arg_1 && 2 <= Arg_1 && Arg_0 <= 1 && 1 <= Arg_0  
103.82/95.64	
103.82/95.64	
103.82/95.64	
103.82/95.64	Timebounds: 
103.82/95.64	
103.82/95.64	  Overall timebound: 2+(max([0, -1+Arg_1])+max([0, Arg_1]))*max([0, -2+max([Arg_1, -1+Arg_1])])+max([0, 1+2*Arg_1])+(max([0, -1+Arg_1])+max([0, Arg_1]))*max([0, max([-4, -8+4*max([Arg_1, -1+Arg_1])])])+max([0, Arg_1+max([-2, -2*(-1+Arg_0)])])+(max([0, -1+Arg_1])+max([0, Arg_1]))*max([0, -2+2*max([Arg_1, -1+Arg_1])])+max([0, 4*Arg_1+max([-8, -8*(-1+Arg_0)])])+(max([2, 2*Arg_0])+max([2, 2*(-1+Arg_0)]))*max([4, 2*max([Arg_1, -1+Arg_1])])+max([0, 2*Arg_1+max([-2, -2*(-1+Arg_0)])])+(max([2, 2*Arg_0])+max([2, 2*(-1+Arg_0)]))*max([0, max([Arg_1, -1+Arg_1])])+max([0, 2*Arg_1])+(max([2, 2*Arg_0])+max([2, 2*(-1+Arg_0)]))*max([4, 2*max([Arg_1, -1+Arg_1])])+max([0, Arg_1])+max([2, 2*Arg_0])+max([0, 2*Arg_1])+max([0, -1+Arg_1])+max([2, 2*(-1+Arg_0)])+(max([2, 2*Arg_0])+max([2, 2*(-1+Arg_0)]))*max([5, 1+2*max([Arg_1, -1+Arg_1])])+(max([2, 2*Arg_0])+max([2, 2*(-1+Arg_0)]))*max([0, max([Arg_1, -1+Arg_1])+max([-2, -2*max([1, -1+Arg_0])])])+(max([2, 2*Arg_0])+max([2, 2*(-1+Arg_0)]))*max([0, max([-8, -8*max([1, -1+Arg_0])])+max([8, 4*max([Arg_1, -1+Arg_1])])])+(max([2, 2*Arg_0])+max([2, 2*(-1+Arg_0)]))*max([0, max([-2, -2*max([1, -1+Arg_0])])+max([4, 2*max([Arg_1, -1+Arg_1])])])+max([0, 1+2*(-1+Arg_1)])+max([0, -1+Arg_1+max([-2, -2*Arg_0])])+max([0, 4*(-1+Arg_1)+max([-8, -8*Arg_0])])+max([0, 2*(-1+Arg_1)+max([-2, -2*Arg_0])])+max([0, 2*(-1+Arg_1)])+max([0, -1+Arg_1])+max([0, 2*(-1+Arg_1)])+max([0, Arg_1]) {O(n^2)}
103.82/95.64	
103.82/95.64	  0: eval1->eval2: 1 {O(1)}
103.82/95.64	
103.82/95.64	  1: eval1->eval2: 1 {O(1)}
103.82/95.64	
103.82/95.64	  2: eval2->eval3: (max([2, 2*Arg_0])+max([2, 2*(-1+Arg_0)]))*max([5, 1+2*max([Arg_1, -1+Arg_1])])+max([0, 1+2*(-1+Arg_1)])+max([0, 1+2*Arg_1]) {O(n^2)}
103.82/95.64	
103.82/95.64	  3: eval3->eval4: (max([2, 2*Arg_0])+max([2, 2*(-1+Arg_0)]))*max([4, 2*max([Arg_1, -1+Arg_1])])+max([0, 2*(-1+Arg_1)])+max([0, 2*Arg_1]) {O(n^2)}
103.82/95.64	
103.82/95.64	  4: eval3->eval4: (max([2, 2*Arg_0])+max([2, 2*(-1+Arg_0)]))*max([0, max([Arg_1, -1+Arg_1])])+max([0, -1+Arg_1])+max([0, Arg_1]) {O(n^2)}
103.82/95.64	
103.82/95.64	  5: eval3->eval3: (max([0, -1+Arg_1])+max([0, Arg_1]))*max([0, -2+max([Arg_1, -1+Arg_1])])+(max([2, 2*Arg_0])+max([2, 2*(-1+Arg_0)]))*max([0, max([Arg_1, -1+Arg_1])+max([-2, -2*max([1, -1+Arg_0])])])+max([0, -1+Arg_1+max([-2, -2*Arg_0])])+max([0, Arg_1+max([-2, -2*(-1+Arg_0)])]) {O(n^2)}
103.82/95.64	
103.82/95.64	  6: eval3->eval3: (max([0, -1+Arg_1])+max([0, Arg_1]))*max([0, max([-4, -8+4*max([Arg_1, -1+Arg_1])])])+(max([2, 2*Arg_0])+max([2, 2*(-1+Arg_0)]))*max([0, max([-8, -8*max([1, -1+Arg_0])])+max([8, 4*max([Arg_1, -1+Arg_1])])])+max([0, 4*(-1+Arg_1)+max([-8, -8*Arg_0])])+max([0, 4*Arg_1+max([-8, -8*(-1+Arg_0)])]) {O(n^2)}
103.82/95.64	
103.82/95.64	  7: eval3->eval4: (max([2, 2*Arg_0])+max([2, 2*(-1+Arg_0)]))*max([4, 2*max([Arg_1, -1+Arg_1])])+max([0, 2*(-1+Arg_1)])+max([0, 2*Arg_1]) {O(n^2)}
103.82/95.64	
103.82/95.64	  8: eval3->eval3: (max([0, -1+Arg_1])+max([0, Arg_1]))*max([0, -2+2*max([Arg_1, -1+Arg_1])])+(max([2, 2*Arg_0])+max([2, 2*(-1+Arg_0)]))*max([0, max([-2, -2*max([1, -1+Arg_0])])+max([4, 2*max([Arg_1, -1+Arg_1])])])+max([0, 2*(-1+Arg_1)+max([-2, -2*Arg_0])])+max([0, 2*Arg_1+max([-2, -2*(-1+Arg_0)])]) {O(n^2)}
103.82/95.64	
103.82/95.64	  9: eval4->eval2: max([2, 2*Arg_0])+max([2, 2*(-1+Arg_0)]) {O(n)}
103.82/95.64	
103.82/95.64	  10: eval4->eval2: max([0, -1+Arg_1])+max([0, Arg_1]) {O(n)}
103.82/95.64	
103.82/95.64	
103.82/95.64	
103.82/95.64	Costbounds:
103.82/95.64	
103.82/95.64	  Overall costbound: 2+(max([0, -1+Arg_1])+max([0, Arg_1]))*max([0, -2+max([Arg_1, -1+Arg_1])])+max([0, 1+2*Arg_1])+(max([0, -1+Arg_1])+max([0, Arg_1]))*max([0, max([-4, -8+4*max([Arg_1, -1+Arg_1])])])+max([0, Arg_1+max([-2, -2*(-1+Arg_0)])])+(max([0, -1+Arg_1])+max([0, Arg_1]))*max([0, -2+2*max([Arg_1, -1+Arg_1])])+max([0, 4*Arg_1+max([-8, -8*(-1+Arg_0)])])+(max([2, 2*Arg_0])+max([2, 2*(-1+Arg_0)]))*max([4, 2*max([Arg_1, -1+Arg_1])])+max([0, 2*Arg_1+max([-2, -2*(-1+Arg_0)])])+(max([2, 2*Arg_0])+max([2, 2*(-1+Arg_0)]))*max([0, max([Arg_1, -1+Arg_1])])+max([0, 2*Arg_1])+(max([2, 2*Arg_0])+max([2, 2*(-1+Arg_0)]))*max([4, 2*max([Arg_1, -1+Arg_1])])+max([0, Arg_1])+max([2, 2*Arg_0])+max([0, 2*Arg_1])+max([0, -1+Arg_1])+max([2, 2*(-1+Arg_0)])+(max([2, 2*Arg_0])+max([2, 2*(-1+Arg_0)]))*max([5, 1+2*max([Arg_1, -1+Arg_1])])+(max([2, 2*Arg_0])+max([2, 2*(-1+Arg_0)]))*max([0, max([Arg_1, -1+Arg_1])+max([-2, -2*max([1, -1+Arg_0])])])+(max([2, 2*Arg_0])+max([2, 2*(-1+Arg_0)]))*max([0, max([-8, -8*max([1, -1+Arg_0])])+max([8, 4*max([Arg_1, -1+Arg_1])])])+(max([2, 2*Arg_0])+max([2, 2*(-1+Arg_0)]))*max([0, max([-2, -2*max([1, -1+Arg_0])])+max([4, 2*max([Arg_1, -1+Arg_1])])])+max([0, 1+2*(-1+Arg_1)])+max([0, -1+Arg_1+max([-2, -2*Arg_0])])+max([0, 4*(-1+Arg_1)+max([-8, -8*Arg_0])])+max([0, 2*(-1+Arg_1)+max([-2, -2*Arg_0])])+max([0, 2*(-1+Arg_1)])+max([0, -1+Arg_1])+max([0, 2*(-1+Arg_1)])+max([0, Arg_1]) {O(n^2)}
103.82/95.64	
103.82/95.64	  0: eval1->eval2: 1 {O(1)}
103.82/95.64	
103.82/95.64	  1: eval1->eval2: 1 {O(1)}
103.82/95.64	
103.82/95.64	  2: eval2->eval3: (max([2, 2*Arg_0])+max([2, 2*(-1+Arg_0)]))*max([5, 1+2*max([Arg_1, -1+Arg_1])])+max([0, 1+2*(-1+Arg_1)])+max([0, 1+2*Arg_1]) {O(n^2)}
103.82/95.64	
103.82/95.64	  3: eval3->eval4: (max([2, 2*Arg_0])+max([2, 2*(-1+Arg_0)]))*max([4, 2*max([Arg_1, -1+Arg_1])])+max([0, 2*(-1+Arg_1)])+max([0, 2*Arg_1]) {O(n^2)}
103.82/95.64	
103.82/95.64	  4: eval3->eval4: (max([2, 2*Arg_0])+max([2, 2*(-1+Arg_0)]))*max([0, max([Arg_1, -1+Arg_1])])+max([0, -1+Arg_1])+max([0, Arg_1]) {O(n^2)}
103.82/95.64	
103.82/95.64	  5: eval3->eval3: (max([0, -1+Arg_1])+max([0, Arg_1]))*max([0, -2+max([Arg_1, -1+Arg_1])])+(max([2, 2*Arg_0])+max([2, 2*(-1+Arg_0)]))*max([0, max([Arg_1, -1+Arg_1])+max([-2, -2*max([1, -1+Arg_0])])])+max([0, -1+Arg_1+max([-2, -2*Arg_0])])+max([0, Arg_1+max([-2, -2*(-1+Arg_0)])]) {O(n^2)}
103.82/95.64	
103.82/95.64	  6: eval3->eval3: (max([0, -1+Arg_1])+max([0, Arg_1]))*max([0, max([-4, -8+4*max([Arg_1, -1+Arg_1])])])+(max([2, 2*Arg_0])+max([2, 2*(-1+Arg_0)]))*max([0, max([-8, -8*max([1, -1+Arg_0])])+max([8, 4*max([Arg_1, -1+Arg_1])])])+max([0, 4*(-1+Arg_1)+max([-8, -8*Arg_0])])+max([0, 4*Arg_1+max([-8, -8*(-1+Arg_0)])]) {O(n^2)}
103.82/95.64	
103.82/95.64	  7: eval3->eval4: (max([2, 2*Arg_0])+max([2, 2*(-1+Arg_0)]))*max([4, 2*max([Arg_1, -1+Arg_1])])+max([0, 2*(-1+Arg_1)])+max([0, 2*Arg_1]) {O(n^2)}
103.82/95.64	
103.82/95.64	  8: eval3->eval3: (max([0, -1+Arg_1])+max([0, Arg_1]))*max([0, -2+2*max([Arg_1, -1+Arg_1])])+(max([2, 2*Arg_0])+max([2, 2*(-1+Arg_0)]))*max([0, max([-2, -2*max([1, -1+Arg_0])])+max([4, 2*max([Arg_1, -1+Arg_1])])])+max([0, 2*(-1+Arg_1)+max([-2, -2*Arg_0])])+max([0, 2*Arg_1+max([-2, -2*(-1+Arg_0)])]) {O(n^2)}
103.82/95.64	
103.82/95.64	  9: eval4->eval2: max([2, 2*Arg_0])+max([2, 2*(-1+Arg_0)]) {O(n)}
103.82/95.64	
103.82/95.64	  10: eval4->eval2: max([0, -1+Arg_1])+max([0, Arg_1]) {O(n)}
103.82/95.64	
103.82/95.64	
103.82/95.64	
103.82/95.64	Sizebounds:
103.82/95.64	
103.82/95.64	`Lower:
103.82/95.64	
103.82/95.64	  0: eval1->eval2, Arg_0: 1 {O(1)}
103.82/95.64	
103.82/95.64	  0: eval1->eval2, Arg_1: Arg_1 {O(n)}
103.82/95.64	
103.82/95.64	  0: eval1->eval2, Arg_2: Arg_2 {O(n)}
103.82/95.64	
103.82/95.64	  0: eval1->eval2, Arg_3: Arg_3 {O(n)}
103.82/95.64	
103.82/95.64	  1: eval1->eval2, Arg_0: Arg_0 {O(n)}
103.82/95.64	
103.82/95.64	  1: eval1->eval2, Arg_1: -1+Arg_1 {O(n)}
103.82/95.64	
103.82/95.64	  1: eval1->eval2, Arg_2: Arg_2 {O(n)}
103.82/95.64	
103.82/95.64	  1: eval1->eval2, Arg_3: Arg_3 {O(n)}
103.82/95.64	
103.82/95.64	  2: eval2->eval3, Arg_0: min([1, Arg_0]) {O(n)}
103.82/95.64	
103.82/95.64	  2: eval2->eval3, Arg_1: 2 {O(1)}
103.82/95.64	
103.82/95.64	  2: eval2->eval3, Arg_2: min([1, Arg_0]) {O(n)}
103.82/95.64	
103.82/95.64	  2: eval2->eval3, Arg_3: min([2, -(-2*Arg_0)]) {O(n)}
103.82/95.64	
103.82/95.64	  3: eval3->eval4, Arg_0: min([1, Arg_0]) {O(n)}
103.82/95.64	
103.82/95.64	  3: eval3->eval4, Arg_1: 2 {O(1)}
103.82/95.64	
103.82/95.64	  3: eval3->eval4, Arg_2: min([1, min([1, Arg_0])]) {O(n)}
103.82/95.64	
103.82/95.64	  3: eval3->eval4, Arg_3: min([2, min([2, -(-2*Arg_0)])]) {O(n)}
103.82/95.64	
103.82/95.64	  4: eval3->eval4, Arg_0: min([1, Arg_0]) {O(n)}
103.82/95.64	
103.82/95.64	  4: eval3->eval4, Arg_1: 2 {O(1)}
103.82/95.64	
103.82/95.64	  4: eval3->eval4, Arg_2: min([1, min([1, Arg_0])]) {O(n)}
103.82/95.64	
103.82/95.64	  4: eval3->eval4, Arg_3: min([3, min([3, -(-1+-2*Arg_0)])]) {O(n)}
103.82/95.64	
103.82/95.64	  5: eval3->eval3, Arg_0: min([1, Arg_0]) {O(n)}
103.82/95.64	
103.82/95.64	  5: eval3->eval3, Arg_1: 2 {O(1)}
103.82/95.64	
103.82/95.64	  5: eval3->eval3, Arg_2: 1 {O(1)}
103.82/95.64	
103.82/95.64	  5: eval3->eval3, Arg_3: 2 {O(1)}
103.82/95.64	
103.82/95.64	  6: eval3->eval3, Arg_0: min([1, Arg_0]) {O(n)}
103.82/95.64	
103.82/95.64	  6: eval3->eval3, Arg_1: 2 {O(1)}
103.82/95.64	
103.82/95.64	  6: eval3->eval3, Arg_2: 2 {O(1)}
103.82/95.64	
103.82/95.64	  6: eval3->eval3, Arg_3: 4 {O(1)}
103.82/95.64	
103.82/95.64	  7: eval3->eval4, Arg_0: min([1, Arg_0]) {O(n)}
103.82/95.64	
103.82/95.64	  7: eval3->eval4, Arg_1: 2 {O(1)}
103.82/95.64	
103.82/95.64	  7: eval3->eval4, Arg_2: min([1, min([1, Arg_0])]) {O(n)}
103.82/95.64	
103.82/95.64	  7: eval3->eval4, Arg_3: 2 {O(1)}
103.82/95.64	
103.82/95.64	  8: eval3->eval3, Arg_0: min([1, Arg_0]) {O(n)}
103.82/95.64	
103.82/95.64	  8: eval3->eval3, Arg_1: 2 {O(1)}
103.82/95.64	
103.82/95.64	  8: eval3->eval3, Arg_2: 2 {O(1)}
103.82/95.64	
103.82/95.64	  8: eval3->eval3, Arg_3: 4 {O(1)}
103.82/95.64	
103.82/95.64	  9: eval4->eval2, Arg_0: 1 {O(1)}
103.82/95.64	
103.82/95.64	  9: eval4->eval2, Arg_1: 2 {O(1)}
103.82/95.64	
103.82/95.64	  9: eval4->eval2, Arg_2: min([1, min([1, Arg_0])]) {O(n)}
103.82/95.64	
103.82/95.64	  9: eval4->eval2, Arg_3: min([2, min([2, min([3, min([3, min([2, min([-(-1+-2*Arg_0), -(-2*Arg_0)])])])])])]) {O(n)}
103.82/95.64	
103.82/95.64	  10: eval4->eval2, Arg_0: 1 {O(1)}
103.82/95.64	
103.82/95.64	  10: eval4->eval2, Arg_1: 1 {O(1)}
103.82/95.64	
103.82/95.64	  10: eval4->eval2, Arg_2: min([1, min([1, Arg_0])]) {O(n)}
103.82/95.64	
103.82/95.64	  10: eval4->eval2, Arg_3: min([2, min([2, min([3, min([3, min([2, min([-(-1+-2*Arg_0), -(-2*Arg_0)])])])])])]) {O(n)}
103.82/95.64	
103.82/95.64	`Upper:
103.82/95.64	
103.82/95.64	  0: eval1->eval2, Arg_0: -1+Arg_0 {O(n)}
103.82/95.64	
103.82/95.64	  0: eval1->eval2, Arg_1: Arg_1 {O(n)}
103.82/95.64	
103.82/95.64	  0: eval1->eval2, Arg_2: Arg_2 {O(n)}
103.82/95.64	
103.82/95.64	  0: eval1->eval2, Arg_3: Arg_3 {O(n)}
103.82/95.64	
103.82/95.64	  1: eval1->eval2, Arg_0: 1 {O(1)}
103.82/95.64	
103.82/95.64	  1: eval1->eval2, Arg_1: -1+Arg_1 {O(n)}
103.82/95.64	
103.82/95.64	  1: eval1->eval2, Arg_2: Arg_2 {O(n)}
103.82/95.64	
103.82/95.64	  1: eval1->eval2, Arg_3: Arg_3 {O(n)}
103.82/95.64	
103.82/95.64	  2: eval2->eval3, Arg_0: max([1, -1+Arg_0]) {O(n)}
103.82/95.64	
103.82/95.64	  2: eval2->eval3, Arg_1: max([Arg_1, -1+Arg_1]) {O(n)}
103.82/95.64	
103.82/95.64	  2: eval2->eval3, Arg_2: max([1, -1+Arg_0]) {O(n)}
103.82/95.64	
103.82/95.64	  2: eval2->eval3, Arg_3: max([2, max([2*(-1+Arg_0), 2*max([1, -1+Arg_0])])]) {O(n)}
103.82/95.64	
103.82/95.64	  3: eval3->eval4, Arg_0: max([1, -1+Arg_0]) {O(n)}
103.82/95.64	
103.82/95.64	  3: eval3->eval4, Arg_1: max([Arg_1, -1+Arg_1]) {O(n)}
103.82/95.64	
103.82/95.64	  3: eval3->eval4, Arg_2: max([1, max([3, max([2, max([1+2^((max([0, -1+Arg_1])+max([0, Arg_1]))*max([0, max([-4, -8+4*max([Arg_1, -1+Arg_1])])])+(max([2, 2*Arg_0])+max([2, 2*(-1+Arg_0)]))*max([0, max([-8, -8*max([1, -1+Arg_0])])+max([8, 4*max([Arg_1, -1+Arg_1])])])+max([0, 4*(-1+Arg_1)+max([-8, -8*Arg_0])])+max([0, 4*Arg_1+max([-8, -8*(-1+Arg_0)])]))*2^((max([0, -1+Arg_1])+max([0, Arg_1]))*max([0, -2+max([Arg_1, -1+Arg_1])])+(max([2, 2*Arg_0])+max([2, 2*(-1+Arg_0)]))*max([0, max([Arg_1, -1+Arg_1])+max([-2, -2*max([1, -1+Arg_0])])])+max([0, -1+Arg_1+max([-2, -2*Arg_0])])+max([0, Arg_1+max([-2, -2*(-1+Arg_0)])]))*((max([0, -1+Arg_1])+max([0, Arg_1]))*max([0, max([-4, -8+4*max([Arg_1, -1+Arg_1])])])+(max([2, 2*Arg_0])+max([2, 2*(-1+Arg_0)]))*max([0, max([-8, -8*max([1, -1+Arg_0])])+max([8, 4*max([Arg_1, -1+Arg_1])])])+max([2, max([2*(-1+Arg_0), 2*max([1, -1+Arg_0])])])+max([0, 4*Arg_1+max([-8, -8*(-1+Arg_0)])])+max([0, 4*(-1+Arg_1)+max([-8, -8*Arg_0])])), max([1+max([2*(-1+Arg_0), 2*max([1, -1+Arg_0])]), max([-1+Arg_0, max([2^((max([0, -1+Arg_1])+max([0, Arg_1]))*max([0, max([-4, -8+4*max([Arg_1, -1+Arg_1])])])+(max([2, 2*Arg_0])+max([2, 2*(-1+Arg_0)]))*max([0, max([-8, -8*max([1, -1+Arg_0])])+max([8, 4*max([Arg_1, -1+Arg_1])])])+max([0, 4*(-1+Arg_1)+max([-8, -8*Arg_0])])+max([0, 4*Arg_1+max([-8, -8*(-1+Arg_0)])]))*2^((max([0, -1+Arg_1])+max([0, Arg_1]))*max([0, -2+max([Arg_1, -1+Arg_1])])+(max([2, 2*Arg_0])+max([2, 2*(-1+Arg_0)]))*max([0, max([Arg_1, -1+Arg_1])+max([-2, -2*max([1, -1+Arg_0])])])+max([0, -1+Arg_1+max([-2, -2*Arg_0])])+max([0, Arg_1+max([-2, -2*(-1+Arg_0)])]))*((max([0, -1+Arg_1])+max([0, Arg_1]))*max([0, max([-4, -8+4*max([Arg_1, -1+Arg_1])])])+(max([2, 2*Arg_0])+max([2, 2*(-1+Arg_0)]))*max([0, max([-8, -8*max([1, -1+Arg_0])])+max([8, 4*max([Arg_1, -1+Arg_1])])])+max([2, max([2*(-1+Arg_0), 2*max([1, -1+Arg_0])])])+max([0, 4*Arg_1+max([-8, -8*(-1+Arg_0)])])+max([0, 4*(-1+Arg_1)+max([-8, -8*Arg_0])])), max([2*(-1+Arg_0), 2*max([1, -1+Arg_0])])])])])])])])]) {O(EXP)}
103.82/95.64	
103.82/95.64	  3: eval3->eval4, Arg_3: max([2, max([2^((max([0, -1+Arg_1])+max([0, Arg_1]))*max([0, max([-4, -8+4*max([Arg_1, -1+Arg_1])])])+(max([2, 2*Arg_0])+max([2, 2*(-1+Arg_0)]))*max([0, max([-8, -8*max([1, -1+Arg_0])])+max([8, 4*max([Arg_1, -1+Arg_1])])])+max([0, 4*(-1+Arg_1)+max([-8, -8*Arg_0])])+max([0, 4*Arg_1+max([-8, -8*(-1+Arg_0)])]))*2^((max([0, -1+Arg_1])+max([0, Arg_1]))*max([0, -2+max([Arg_1, -1+Arg_1])])+(max([2, 2*Arg_0])+max([2, 2*(-1+Arg_0)]))*max([0, max([Arg_1, -1+Arg_1])+max([-2, -2*max([1, -1+Arg_0])])])+max([0, -1+Arg_1+max([-2, -2*Arg_0])])+max([0, Arg_1+max([-2, -2*(-1+Arg_0)])]))*((max([0, -1+Arg_1])+max([0, Arg_1]))*max([0, max([-4, -8+4*max([Arg_1, -1+Arg_1])])])+(max([2, 2*Arg_0])+max([2, 2*(-1+Arg_0)]))*max([0, max([-8, -8*max([1, -1+Arg_0])])+max([8, 4*max([Arg_1, -1+Arg_1])])])+max([2, max([2*(-1+Arg_0), 2*max([1, -1+Arg_0])])])+max([0, 4*Arg_1+max([-8, -8*(-1+Arg_0)])])+max([0, 4*(-1+Arg_1)+max([-8, -8*Arg_0])])), max([2*(-1+Arg_0), 2*max([1, -1+Arg_0])])])]) {O(EXP)}
103.82/95.64	
103.82/95.64	  4: eval3->eval4, Arg_0: max([1, -1+Arg_0]) {O(n)}
103.82/95.64	
103.82/95.64	  4: eval3->eval4, Arg_1: max([Arg_1, -1+Arg_1]) {O(n)}
103.82/95.64	
103.82/95.64	  4: eval3->eval4, Arg_2: max([1, max([3, max([2, max([1+2^((max([0, -1+Arg_1])+max([0, Arg_1]))*max([0, max([-4, -8+4*max([Arg_1, -1+Arg_1])])])+(max([2, 2*Arg_0])+max([2, 2*(-1+Arg_0)]))*max([0, max([-8, -8*max([1, -1+Arg_0])])+max([8, 4*max([Arg_1, -1+Arg_1])])])+max([0, 4*(-1+Arg_1)+max([-8, -8*Arg_0])])+max([0, 4*Arg_1+max([-8, -8*(-1+Arg_0)])]))*2^((max([0, -1+Arg_1])+max([0, Arg_1]))*max([0, -2+max([Arg_1, -1+Arg_1])])+(max([2, 2*Arg_0])+max([2, 2*(-1+Arg_0)]))*max([0, max([Arg_1, -1+Arg_1])+max([-2, -2*max([1, -1+Arg_0])])])+max([0, -1+Arg_1+max([-2, -2*Arg_0])])+max([0, Arg_1+max([-2, -2*(-1+Arg_0)])]))*((max([0, -1+Arg_1])+max([0, Arg_1]))*max([0, max([-4, -8+4*max([Arg_1, -1+Arg_1])])])+(max([2, 2*Arg_0])+max([2, 2*(-1+Arg_0)]))*max([0, max([-8, -8*max([1, -1+Arg_0])])+max([8, 4*max([Arg_1, -1+Arg_1])])])+max([2, max([2*(-1+Arg_0), 2*max([1, -1+Arg_0])])])+max([0, 4*Arg_1+max([-8, -8*(-1+Arg_0)])])+max([0, 4*(-1+Arg_1)+max([-8, -8*Arg_0])])), max([1+max([2*(-1+Arg_0), 2*max([1, -1+Arg_0])]), max([-1+Arg_0, max([2^((max([0, -1+Arg_1])+max([0, Arg_1]))*max([0, max([-4, -8+4*max([Arg_1, -1+Arg_1])])])+(max([2, 2*Arg_0])+max([2, 2*(-1+Arg_0)]))*max([0, max([-8, -8*max([1, -1+Arg_0])])+max([8, 4*max([Arg_1, -1+Arg_1])])])+max([0, 4*(-1+Arg_1)+max([-8, -8*Arg_0])])+max([0, 4*Arg_1+max([-8, -8*(-1+Arg_0)])]))*2^((max([0, -1+Arg_1])+max([0, Arg_1]))*max([0, -2+max([Arg_1, -1+Arg_1])])+(max([2, 2*Arg_0])+max([2, 2*(-1+Arg_0)]))*max([0, max([Arg_1, -1+Arg_1])+max([-2, -2*max([1, -1+Arg_0])])])+max([0, -1+Arg_1+max([-2, -2*Arg_0])])+max([0, Arg_1+max([-2, -2*(-1+Arg_0)])]))*((max([0, -1+Arg_1])+max([0, Arg_1]))*max([0, max([-4, -8+4*max([Arg_1, -1+Arg_1])])])+(max([2, 2*Arg_0])+max([2, 2*(-1+Arg_0)]))*max([0, max([-8, -8*max([1, -1+Arg_0])])+max([8, 4*max([Arg_1, -1+Arg_1])])])+max([2, max([2*(-1+Arg_0), 2*max([1, -1+Arg_0])])])+max([0, 4*Arg_1+max([-8, -8*(-1+Arg_0)])])+max([0, 4*(-1+Arg_1)+max([-8, -8*Arg_0])])), max([2*(-1+Arg_0), 2*max([1, -1+Arg_0])])])])])])])])]) {O(EXP)}
103.82/95.64	
103.82/95.64	  4: eval3->eval4, Arg_3: max([3, max([1+2^((max([0, -1+Arg_1])+max([0, Arg_1]))*max([0, max([-4, -8+4*max([Arg_1, -1+Arg_1])])])+(max([2, 2*Arg_0])+max([2, 2*(-1+Arg_0)]))*max([0, max([-8, -8*max([1, -1+Arg_0])])+max([8, 4*max([Arg_1, -1+Arg_1])])])+max([0, 4*(-1+Arg_1)+max([-8, -8*Arg_0])])+max([0, 4*Arg_1+max([-8, -8*(-1+Arg_0)])]))*2^((max([0, -1+Arg_1])+max([0, Arg_1]))*max([0, -2+max([Arg_1, -1+Arg_1])])+(max([2, 2*Arg_0])+max([2, 2*(-1+Arg_0)]))*max([0, max([Arg_1, -1+Arg_1])+max([-2, -2*max([1, -1+Arg_0])])])+max([0, -1+Arg_1+max([-2, -2*Arg_0])])+max([0, Arg_1+max([-2, -2*(-1+Arg_0)])]))*((max([0, -1+Arg_1])+max([0, Arg_1]))*max([0, max([-4, -8+4*max([Arg_1, -1+Arg_1])])])+(max([2, 2*Arg_0])+max([2, 2*(-1+Arg_0)]))*max([0, max([-8, -8*max([1, -1+Arg_0])])+max([8, 4*max([Arg_1, -1+Arg_1])])])+max([2, max([2*(-1+Arg_0), 2*max([1, -1+Arg_0])])])+max([0, 4*Arg_1+max([-8, -8*(-1+Arg_0)])])+max([0, 4*(-1+Arg_1)+max([-8, -8*Arg_0])])), 1+max([2*(-1+Arg_0), 2*max([1, -1+Arg_0])])])]) {O(EXP)}
103.82/95.64	
103.82/95.64	  5: eval3->eval3, Arg_0: max([1, -1+Arg_0]) {O(n)}
103.82/95.64	
103.82/95.64	  5: eval3->eval3, Arg_1: max([Arg_1, -1+Arg_1]) {O(n)}
103.82/95.64	
103.82/95.64	  5: eval3->eval3, Arg_2: max([2, max([2^((max([0, -1+Arg_1])+max([0, Arg_1]))*max([0, max([-4, -8+4*max([Arg_1, -1+Arg_1])])])+(max([2, 2*Arg_0])+max([2, 2*(-1+Arg_0)]))*max([0, max([-8, -8*max([1, -1+Arg_0])])+max([8, 4*max([Arg_1, -1+Arg_1])])])+max([0, 4*(-1+Arg_1)+max([-8, -8*Arg_0])])+max([0, 4*Arg_1+max([-8, -8*(-1+Arg_0)])]))*2^((max([0, -1+Arg_1])+max([0, Arg_1]))*max([0, -2+max([Arg_1, -1+Arg_1])])+(max([2, 2*Arg_0])+max([2, 2*(-1+Arg_0)]))*max([0, max([Arg_1, -1+Arg_1])+max([-2, -2*max([1, -1+Arg_0])])])+max([0, -1+Arg_1+max([-2, -2*Arg_0])])+max([0, Arg_1+max([-2, -2*(-1+Arg_0)])]))*((max([0, -1+Arg_1])+max([0, Arg_1]))*max([0, max([-4, -8+4*max([Arg_1, -1+Arg_1])])])+(max([2, 2*Arg_0])+max([2, 2*(-1+Arg_0)]))*max([0, max([-8, -8*max([1, -1+Arg_0])])+max([8, 4*max([Arg_1, -1+Arg_1])])])+max([2, max([2*(-1+Arg_0), 2*max([1, -1+Arg_0])])])+max([0, 4*Arg_1+max([-8, -8*(-1+Arg_0)])])+max([0, 4*(-1+Arg_1)+max([-8, -8*Arg_0])])), max([2*(-1+Arg_0), 2*max([1, -1+Arg_0])])])]) {O(EXP)}
103.82/95.64	
103.82/95.64	  5: eval3->eval3, Arg_3: 2^((max([0, -1+Arg_1])+max([0, Arg_1]))*max([0, max([-4, -8+4*max([Arg_1, -1+Arg_1])])])+(max([2, 2*Arg_0])+max([2, 2*(-1+Arg_0)]))*max([0, max([-8, -8*max([1, -1+Arg_0])])+max([8, 4*max([Arg_1, -1+Arg_1])])])+max([0, 4*(-1+Arg_1)+max([-8, -8*Arg_0])])+max([0, 4*Arg_1+max([-8, -8*(-1+Arg_0)])]))*2^((max([0, -1+Arg_1])+max([0, Arg_1]))*max([0, -2+max([Arg_1, -1+Arg_1])])+(max([2, 2*Arg_0])+max([2, 2*(-1+Arg_0)]))*max([0, max([Arg_1, -1+Arg_1])+max([-2, -2*max([1, -1+Arg_0])])])+max([0, -1+Arg_1+max([-2, -2*Arg_0])])+max([0, Arg_1+max([-2, -2*(-1+Arg_0)])]))*((max([0, -1+Arg_1])+max([0, Arg_1]))*max([0, max([-4, -8+4*max([Arg_1, -1+Arg_1])])])+(max([2, 2*Arg_0])+max([2, 2*(-1+Arg_0)]))*max([0, max([-8, -8*max([1, -1+Arg_0])])+max([8, 4*max([Arg_1, -1+Arg_1])])])+max([2, max([2*(-1+Arg_0), 2*max([1, -1+Arg_0])])])+max([0, 4*Arg_1+max([-8, -8*(-1+Arg_0)])])+max([0, 4*(-1+Arg_1)+max([-8, -8*Arg_0])])) {O(EXP)}
103.82/95.64	
103.82/95.64	  6: eval3->eval3, Arg_0: max([1, -1+Arg_0]) {O(n)}
103.82/95.64	
103.82/95.64	  6: eval3->eval3, Arg_1: max([Arg_1, -1+Arg_1]) {O(n)}
103.82/95.64	
103.82/95.64	  6: eval3->eval3, Arg_2: max([3, max([1+2^((max([0, -1+Arg_1])+max([0, Arg_1]))*max([0, max([-4, -8+4*max([Arg_1, -1+Arg_1])])])+(max([2, 2*Arg_0])+max([2, 2*(-1+Arg_0)]))*max([0, max([-8, -8*max([1, -1+Arg_0])])+max([8, 4*max([Arg_1, -1+Arg_1])])])+max([0, 4*(-1+Arg_1)+max([-8, -8*Arg_0])])+max([0, 4*Arg_1+max([-8, -8*(-1+Arg_0)])]))*2^((max([0, -1+Arg_1])+max([0, Arg_1]))*max([0, -2+max([Arg_1, -1+Arg_1])])+(max([2, 2*Arg_0])+max([2, 2*(-1+Arg_0)]))*max([0, max([Arg_1, -1+Arg_1])+max([-2, -2*max([1, -1+Arg_0])])])+max([0, -1+Arg_1+max([-2, -2*Arg_0])])+max([0, Arg_1+max([-2, -2*(-1+Arg_0)])]))*((max([0, -1+Arg_1])+max([0, Arg_1]))*max([0, max([-4, -8+4*max([Arg_1, -1+Arg_1])])])+(max([2, 2*Arg_0])+max([2, 2*(-1+Arg_0)]))*max([0, max([-8, -8*max([1, -1+Arg_0])])+max([8, 4*max([Arg_1, -1+Arg_1])])])+max([2, max([2*(-1+Arg_0), 2*max([1, -1+Arg_0])])])+max([0, 4*Arg_1+max([-8, -8*(-1+Arg_0)])])+max([0, 4*(-1+Arg_1)+max([-8, -8*Arg_0])])), 1+max([2*(-1+Arg_0), 2*max([1, -1+Arg_0])])])]) {O(EXP)}
103.82/95.64	
103.82/95.64	  6: eval3->eval3, Arg_3: 2^((max([0, -1+Arg_1])+max([0, Arg_1]))*max([0, max([-4, -8+4*max([Arg_1, -1+Arg_1])])])+(max([2, 2*Arg_0])+max([2, 2*(-1+Arg_0)]))*max([0, max([-8, -8*max([1, -1+Arg_0])])+max([8, 4*max([Arg_1, -1+Arg_1])])])+max([0, 4*(-1+Arg_1)+max([-8, -8*Arg_0])])+max([0, 4*Arg_1+max([-8, -8*(-1+Arg_0)])]))*2^((max([0, -1+Arg_1])+max([0, Arg_1]))*max([0, -2+max([Arg_1, -1+Arg_1])])+(max([2, 2*Arg_0])+max([2, 2*(-1+Arg_0)]))*max([0, max([Arg_1, -1+Arg_1])+max([-2, -2*max([1, -1+Arg_0])])])+max([0, -1+Arg_1+max([-2, -2*Arg_0])])+max([0, Arg_1+max([-2, -2*(-1+Arg_0)])]))*((max([0, -1+Arg_1])+max([0, Arg_1]))*max([0, max([-4, -8+4*max([Arg_1, -1+Arg_1])])])+(max([2, 2*Arg_0])+max([2, 2*(-1+Arg_0)]))*max([0, max([-8, -8*max([1, -1+Arg_0])])+max([8, 4*max([Arg_1, -1+Arg_1])])])+max([2, max([2*(-1+Arg_0), 2*max([1, -1+Arg_0])])])+max([0, 4*Arg_1+max([-8, -8*(-1+Arg_0)])])+max([0, 4*(-1+Arg_1)+max([-8, -8*Arg_0])])) {O(EXP)}
103.82/95.64	
103.82/95.64	  7: eval3->eval4, Arg_0: max([1, -1+Arg_0]) {O(n)}
103.82/95.64	
103.82/95.64	  7: eval3->eval4, Arg_1: max([Arg_1, -1+Arg_1]) {O(n)}
103.82/95.64	
103.82/95.64	  7: eval3->eval4, Arg_2: max([1, max([3, max([2, max([1+2^((max([0, -1+Arg_1])+max([0, Arg_1]))*max([0, max([-4, -8+4*max([Arg_1, -1+Arg_1])])])+(max([2, 2*Arg_0])+max([2, 2*(-1+Arg_0)]))*max([0, max([-8, -8*max([1, -1+Arg_0])])+max([8, 4*max([Arg_1, -1+Arg_1])])])+max([0, 4*(-1+Arg_1)+max([-8, -8*Arg_0])])+max([0, 4*Arg_1+max([-8, -8*(-1+Arg_0)])]))*2^((max([0, -1+Arg_1])+max([0, Arg_1]))*max([0, -2+max([Arg_1, -1+Arg_1])])+(max([2, 2*Arg_0])+max([2, 2*(-1+Arg_0)]))*max([0, max([Arg_1, -1+Arg_1])+max([-2, -2*max([1, -1+Arg_0])])])+max([0, -1+Arg_1+max([-2, -2*Arg_0])])+max([0, Arg_1+max([-2, -2*(-1+Arg_0)])]))*((max([0, -1+Arg_1])+max([0, Arg_1]))*max([0, max([-4, -8+4*max([Arg_1, -1+Arg_1])])])+(max([2, 2*Arg_0])+max([2, 2*(-1+Arg_0)]))*max([0, max([-8, -8*max([1, -1+Arg_0])])+max([8, 4*max([Arg_1, -1+Arg_1])])])+max([2, max([2*(-1+Arg_0), 2*max([1, -1+Arg_0])])])+max([0, 4*Arg_1+max([-8, -8*(-1+Arg_0)])])+max([0, 4*(-1+Arg_1)+max([-8, -8*Arg_0])])), max([1+max([2*(-1+Arg_0), 2*max([1, -1+Arg_0])]), max([-1+Arg_0, max([2^((max([0, -1+Arg_1])+max([0, Arg_1]))*max([0, max([-4, -8+4*max([Arg_1, -1+Arg_1])])])+(max([2, 2*Arg_0])+max([2, 2*(-1+Arg_0)]))*max([0, max([-8, -8*max([1, -1+Arg_0])])+max([8, 4*max([Arg_1, -1+Arg_1])])])+max([0, 4*(-1+Arg_1)+max([-8, -8*Arg_0])])+max([0, 4*Arg_1+max([-8, -8*(-1+Arg_0)])]))*2^((max([0, -1+Arg_1])+max([0, Arg_1]))*max([0, -2+max([Arg_1, -1+Arg_1])])+(max([2, 2*Arg_0])+max([2, 2*(-1+Arg_0)]))*max([0, max([Arg_1, -1+Arg_1])+max([-2, -2*max([1, -1+Arg_0])])])+max([0, -1+Arg_1+max([-2, -2*Arg_0])])+max([0, Arg_1+max([-2, -2*(-1+Arg_0)])]))*((max([0, -1+Arg_1])+max([0, Arg_1]))*max([0, max([-4, -8+4*max([Arg_1, -1+Arg_1])])])+(max([2, 2*Arg_0])+max([2, 2*(-1+Arg_0)]))*max([0, max([-8, -8*max([1, -1+Arg_0])])+max([8, 4*max([Arg_1, -1+Arg_1])])])+max([2, max([2*(-1+Arg_0), 2*max([1, -1+Arg_0])])])+max([0, 4*Arg_1+max([-8, -8*(-1+Arg_0)])])+max([0, 4*(-1+Arg_1)+max([-8, -8*Arg_0])])), max([2*(-1+Arg_0), 2*max([1, -1+Arg_0])])])])])])])])]) {O(EXP)}
103.82/95.64	
103.82/95.64	  7: eval3->eval4, Arg_3: max([2, max([2^((max([0, -1+Arg_1])+max([0, Arg_1]))*max([0, max([-4, -8+4*max([Arg_1, -1+Arg_1])])])+(max([2, 2*Arg_0])+max([2, 2*(-1+Arg_0)]))*max([0, max([-8, -8*max([1, -1+Arg_0])])+max([8, 4*max([Arg_1, -1+Arg_1])])])+max([0, 4*(-1+Arg_1)+max([-8, -8*Arg_0])])+max([0, 4*Arg_1+max([-8, -8*(-1+Arg_0)])]))*2^((max([0, -1+Arg_1])+max([0, Arg_1]))*max([0, -2+max([Arg_1, -1+Arg_1])])+(max([2, 2*Arg_0])+max([2, 2*(-1+Arg_0)]))*max([0, max([Arg_1, -1+Arg_1])+max([-2, -2*max([1, -1+Arg_0])])])+max([0, -1+Arg_1+max([-2, -2*Arg_0])])+max([0, Arg_1+max([-2, -2*(-1+Arg_0)])]))*((max([0, -1+Arg_1])+max([0, Arg_1]))*max([0, max([-4, -8+4*max([Arg_1, -1+Arg_1])])])+(max([2, 2*Arg_0])+max([2, 2*(-1+Arg_0)]))*max([0, max([-8, -8*max([1, -1+Arg_0])])+max([8, 4*max([Arg_1, -1+Arg_1])])])+max([2, max([2*(-1+Arg_0), 2*max([1, -1+Arg_0])])])+max([0, 4*Arg_1+max([-8, -8*(-1+Arg_0)])])+max([0, 4*(-1+Arg_1)+max([-8, -8*Arg_0])])), max([2*(-1+Arg_0), 2*max([1, -1+Arg_0])])])]) {O(EXP)}
103.82/95.64	
103.82/95.64	  8: eval3->eval3, Arg_0: max([1, -1+Arg_0]) {O(n)}
103.82/95.64	
103.82/95.64	  8: eval3->eval3, Arg_1: max([Arg_1, -1+Arg_1]) {O(n)}
103.82/95.64	
103.82/95.64	  8: eval3->eval3, Arg_2: max([2, max([2^((max([0, -1+Arg_1])+max([0, Arg_1]))*max([0, max([-4, -8+4*max([Arg_1, -1+Arg_1])])])+(max([2, 2*Arg_0])+max([2, 2*(-1+Arg_0)]))*max([0, max([-8, -8*max([1, -1+Arg_0])])+max([8, 4*max([Arg_1, -1+Arg_1])])])+max([0, 4*(-1+Arg_1)+max([-8, -8*Arg_0])])+max([0, 4*Arg_1+max([-8, -8*(-1+Arg_0)])]))*2^((max([0, -1+Arg_1])+max([0, Arg_1]))*max([0, -2+max([Arg_1, -1+Arg_1])])+(max([2, 2*Arg_0])+max([2, 2*(-1+Arg_0)]))*max([0, max([Arg_1, -1+Arg_1])+max([-2, -2*max([1, -1+Arg_0])])])+max([0, -1+Arg_1+max([-2, -2*Arg_0])])+max([0, Arg_1+max([-2, -2*(-1+Arg_0)])]))*((max([0, -1+Arg_1])+max([0, Arg_1]))*max([0, max([-4, -8+4*max([Arg_1, -1+Arg_1])])])+(max([2, 2*Arg_0])+max([2, 2*(-1+Arg_0)]))*max([0, max([-8, -8*max([1, -1+Arg_0])])+max([8, 4*max([Arg_1, -1+Arg_1])])])+max([2, max([2*(-1+Arg_0), 2*max([1, -1+Arg_0])])])+max([0, 4*Arg_1+max([-8, -8*(-1+Arg_0)])])+max([0, 4*(-1+Arg_1)+max([-8, -8*Arg_0])])), max([2*(-1+Arg_0), 2*max([1, -1+Arg_0])])])]) {O(EXP)}
103.82/95.64	
103.82/95.64	  8: eval3->eval3, Arg_3: max([2*2^((max([0, -1+Arg_1])+max([0, Arg_1]))*max([0, max([-4, -8+4*max([Arg_1, -1+Arg_1])])])+(max([2, 2*Arg_0])+max([2, 2*(-1+Arg_0)]))*max([0, max([-8, -8*max([1, -1+Arg_0])])+max([8, 4*max([Arg_1, -1+Arg_1])])])+max([0, 4*(-1+Arg_1)+max([-8, -8*Arg_0])])+max([0, 4*Arg_1+max([-8, -8*(-1+Arg_0)])]))*2^((max([0, -1+Arg_1])+max([0, Arg_1]))*max([0, -2+max([Arg_1, -1+Arg_1])])+(max([2, 2*Arg_0])+max([2, 2*(-1+Arg_0)]))*max([0, max([Arg_1, -1+Arg_1])+max([-2, -2*max([1, -1+Arg_0])])])+max([0, -1+Arg_1+max([-2, -2*Arg_0])])+max([0, Arg_1+max([-2, -2*(-1+Arg_0)])]))*((max([0, -1+Arg_1])+max([0, Arg_1]))*max([0, max([-4, -8+4*max([Arg_1, -1+Arg_1])])])+(max([2, 2*Arg_0])+max([2, 2*(-1+Arg_0)]))*max([0, max([-8, -8*max([1, -1+Arg_0])])+max([8, 4*max([Arg_1, -1+Arg_1])])])+max([2, max([2*(-1+Arg_0), 2*max([1, -1+Arg_0])])])+max([0, 4*Arg_1+max([-8, -8*(-1+Arg_0)])])+max([0, 4*(-1+Arg_1)+max([-8, -8*Arg_0])])), 2*max([2, max([2*(-1+Arg_0), 2*max([1, -1+Arg_0])])])]) {O(EXP)}
103.82/95.64	
103.82/95.64	  9: eval4->eval2, Arg_0: max([1, -1+Arg_0]) {O(n)}
103.82/95.64	
103.82/95.64	  9: eval4->eval2, Arg_1: max([Arg_1, -1+Arg_1]) {O(n)}
103.82/95.64	
103.82/95.64	  9: eval4->eval2, Arg_2: max([1, max([3, max([2, max([1+2^((max([0, -1+Arg_1])+max([0, Arg_1]))*max([0, max([-4, -8+4*max([Arg_1, -1+Arg_1])])])+(max([2, 2*Arg_0])+max([2, 2*(-1+Arg_0)]))*max([0, max([-8, -8*max([1, -1+Arg_0])])+max([8, 4*max([Arg_1, -1+Arg_1])])])+max([0, 4*(-1+Arg_1)+max([-8, -8*Arg_0])])+max([0, 4*Arg_1+max([-8, -8*(-1+Arg_0)])]))*2^((max([0, -1+Arg_1])+max([0, Arg_1]))*max([0, -2+max([Arg_1, -1+Arg_1])])+(max([2, 2*Arg_0])+max([2, 2*(-1+Arg_0)]))*max([0, max([Arg_1, -1+Arg_1])+max([-2, -2*max([1, -1+Arg_0])])])+max([0, -1+Arg_1+max([-2, -2*Arg_0])])+max([0, Arg_1+max([-2, -2*(-1+Arg_0)])]))*((max([0, -1+Arg_1])+max([0, Arg_1]))*max([0, max([-4, -8+4*max([Arg_1, -1+Arg_1])])])+(max([2, 2*Arg_0])+max([2, 2*(-1+Arg_0)]))*max([0, max([-8, -8*max([1, -1+Arg_0])])+max([8, 4*max([Arg_1, -1+Arg_1])])])+max([2, max([2*(-1+Arg_0), 2*max([1, -1+Arg_0])])])+max([0, 4*Arg_1+max([-8, -8*(-1+Arg_0)])])+max([0, 4*(-1+Arg_1)+max([-8, -8*Arg_0])])), max([1+max([2*(-1+Arg_0), 2*max([1, -1+Arg_0])]), max([-1+Arg_0, max([2^((max([0, -1+Arg_1])+max([0, Arg_1]))*max([0, max([-4, -8+4*max([Arg_1, -1+Arg_1])])])+(max([2, 2*Arg_0])+max([2, 2*(-1+Arg_0)]))*max([0, max([-8, -8*max([1, -1+Arg_0])])+max([8, 4*max([Arg_1, -1+Arg_1])])])+max([0, 4*(-1+Arg_1)+max([-8, -8*Arg_0])])+max([0, 4*Arg_1+max([-8, -8*(-1+Arg_0)])]))*2^((max([0, -1+Arg_1])+max([0, Arg_1]))*max([0, -2+max([Arg_1, -1+Arg_1])])+(max([2, 2*Arg_0])+max([2, 2*(-1+Arg_0)]))*max([0, max([Arg_1, -1+Arg_1])+max([-2, -2*max([1, -1+Arg_0])])])+max([0, -1+Arg_1+max([-2, -2*Arg_0])])+max([0, Arg_1+max([-2, -2*(-1+Arg_0)])]))*((max([0, -1+Arg_1])+max([0, Arg_1]))*max([0, max([-4, -8+4*max([Arg_1, -1+Arg_1])])])+(max([2, 2*Arg_0])+max([2, 2*(-1+Arg_0)]))*max([0, max([-8, -8*max([1, -1+Arg_0])])+max([8, 4*max([Arg_1, -1+Arg_1])])])+max([2, max([2*(-1+Arg_0), 2*max([1, -1+Arg_0])])])+max([0, 4*Arg_1+max([-8, -8*(-1+Arg_0)])])+max([0, 4*(-1+Arg_1)+max([-8, -8*Arg_0])])), max([2*(-1+Arg_0), 2*max([1, -1+Arg_0])])])])])])])])]) {O(EXP)}
103.82/95.64	
103.82/95.64	  9: eval4->eval2, Arg_3: max([2, max([2, max([3, max([1+2^((max([0, -1+Arg_1])+max([0, Arg_1]))*max([0, max([-4, -8+4*max([Arg_1, -1+Arg_1])])])+(max([2, 2*Arg_0])+max([2, 2*(-1+Arg_0)]))*max([0, max([-8, -8*max([1, -1+Arg_0])])+max([8, 4*max([Arg_1, -1+Arg_1])])])+max([0, 4*(-1+Arg_1)+max([-8, -8*Arg_0])])+max([0, 4*Arg_1+max([-8, -8*(-1+Arg_0)])]))*2^((max([0, -1+Arg_1])+max([0, Arg_1]))*max([0, -2+max([Arg_1, -1+Arg_1])])+(max([2, 2*Arg_0])+max([2, 2*(-1+Arg_0)]))*max([0, max([Arg_1, -1+Arg_1])+max([-2, -2*max([1, -1+Arg_0])])])+max([0, -1+Arg_1+max([-2, -2*Arg_0])])+max([0, Arg_1+max([-2, -2*(-1+Arg_0)])]))*((max([0, -1+Arg_1])+max([0, Arg_1]))*max([0, max([-4, -8+4*max([Arg_1, -1+Arg_1])])])+(max([2, 2*Arg_0])+max([2, 2*(-1+Arg_0)]))*max([0, max([-8, -8*max([1, -1+Arg_0])])+max([8, 4*max([Arg_1, -1+Arg_1])])])+max([2, max([2*(-1+Arg_0), 2*max([1, -1+Arg_0])])])+max([0, 4*Arg_1+max([-8, -8*(-1+Arg_0)])])+max([0, 4*(-1+Arg_1)+max([-8, -8*Arg_0])])), max([1+max([2*(-1+Arg_0), 2*max([1, -1+Arg_0])]), max([2^((max([0, -1+Arg_1])+max([0, Arg_1]))*max([0, max([-4, -8+4*max([Arg_1, -1+Arg_1])])])+(max([2, 2*Arg_0])+max([2, 2*(-1+Arg_0)]))*max([0, max([-8, -8*max([1, -1+Arg_0])])+max([8, 4*max([Arg_1, -1+Arg_1])])])+max([0, 4*(-1+Arg_1)+max([-8, -8*Arg_0])])+max([0, 4*Arg_1+max([-8, -8*(-1+Arg_0)])]))*2^((max([0, -1+Arg_1])+max([0, Arg_1]))*max([0, -2+max([Arg_1, -1+Arg_1])])+(max([2, 2*Arg_0])+max([2, 2*(-1+Arg_0)]))*max([0, max([Arg_1, -1+Arg_1])+max([-2, -2*max([1, -1+Arg_0])])])+max([0, -1+Arg_1+max([-2, -2*Arg_0])])+max([0, Arg_1+max([-2, -2*(-1+Arg_0)])]))*((max([0, -1+Arg_1])+max([0, Arg_1]))*max([0, max([-4, -8+4*max([Arg_1, -1+Arg_1])])])+(max([2, 2*Arg_0])+max([2, 2*(-1+Arg_0)]))*max([0, max([-8, -8*max([1, -1+Arg_0])])+max([8, 4*max([Arg_1, -1+Arg_1])])])+max([2, max([2*(-1+Arg_0), 2*max([1, -1+Arg_0])])])+max([0, 4*Arg_1+max([-8, -8*(-1+Arg_0)])])+max([0, 4*(-1+Arg_1)+max([-8, -8*Arg_0])])), max([2*(-1+Arg_0), max([2^((max([0, -1+Arg_1])+max([0, Arg_1]))*max([0, max([-4, -8+4*max([Arg_1, -1+Arg_1])])])+(max([2, 2*Arg_0])+max([2, 2*(-1+Arg_0)]))*max([0, max([-8, -8*max([1, -1+Arg_0])])+max([8, 4*max([Arg_1, -1+Arg_1])])])+max([0, 4*(-1+Arg_1)+max([-8, -8*Arg_0])])+max([0, 4*Arg_1+max([-8, -8*(-1+Arg_0)])]))*2^((max([0, -1+Arg_1])+max([0, Arg_1]))*max([0, -2+max([Arg_1, -1+Arg_1])])+(max([2, 2*Arg_0])+max([2, 2*(-1+Arg_0)]))*max([0, max([Arg_1, -1+Arg_1])+max([-2, -2*max([1, -1+Arg_0])])])+max([0, -1+Arg_1+max([-2, -2*Arg_0])])+max([0, Arg_1+max([-2, -2*(-1+Arg_0)])]))*((max([0, -1+Arg_1])+max([0, Arg_1]))*max([0, max([-4, -8+4*max([Arg_1, -1+Arg_1])])])+(max([2, 2*Arg_0])+max([2, 2*(-1+Arg_0)]))*max([0, max([-8, -8*max([1, -1+Arg_0])])+max([8, 4*max([Arg_1, -1+Arg_1])])])+max([2, max([2*(-1+Arg_0), 2*max([1, -1+Arg_0])])])+max([0, 4*Arg_1+max([-8, -8*(-1+Arg_0)])])+max([0, 4*(-1+Arg_1)+max([-8, -8*Arg_0])])), max([2*(-1+Arg_0), 2*max([1, -1+Arg_0])])])])])])])])])]) {O(EXP)}
103.82/95.64	
103.82/95.64	  10: eval4->eval2, Arg_0: 1 {O(1)}
103.82/95.64	
103.82/95.64	  10: eval4->eval2, Arg_1: max([Arg_1, -1+Arg_1]) {O(n)}
103.82/95.64	
103.82/95.64	  10: eval4->eval2, Arg_2: max([1, max([3, max([2, max([1+2^((max([0, -1+Arg_1])+max([0, Arg_1]))*max([0, max([-4, -8+4*max([Arg_1, -1+Arg_1])])])+(max([2, 2*Arg_0])+max([2, 2*(-1+Arg_0)]))*max([0, max([-8, -8*max([1, -1+Arg_0])])+max([8, 4*max([Arg_1, -1+Arg_1])])])+max([0, 4*(-1+Arg_1)+max([-8, -8*Arg_0])])+max([0, 4*Arg_1+max([-8, -8*(-1+Arg_0)])]))*2^((max([0, -1+Arg_1])+max([0, Arg_1]))*max([0, -2+max([Arg_1, -1+Arg_1])])+(max([2, 2*Arg_0])+max([2, 2*(-1+Arg_0)]))*max([0, max([Arg_1, -1+Arg_1])+max([-2, -2*max([1, -1+Arg_0])])])+max([0, -1+Arg_1+max([-2, -2*Arg_0])])+max([0, Arg_1+max([-2, -2*(-1+Arg_0)])]))*((max([0, -1+Arg_1])+max([0, Arg_1]))*max([0, max([-4, -8+4*max([Arg_1, -1+Arg_1])])])+(max([2, 2*Arg_0])+max([2, 2*(-1+Arg_0)]))*max([0, max([-8, -8*max([1, -1+Arg_0])])+max([8, 4*max([Arg_1, -1+Arg_1])])])+max([2, max([2*(-1+Arg_0), 2*max([1, -1+Arg_0])])])+max([0, 4*Arg_1+max([-8, -8*(-1+Arg_0)])])+max([0, 4*(-1+Arg_1)+max([-8, -8*Arg_0])])), max([1+max([2*(-1+Arg_0), 2*max([1, -1+Arg_0])]), max([-1+Arg_0, max([2^((max([0, -1+Arg_1])+max([0, Arg_1]))*max([0, max([-4, -8+4*max([Arg_1, -1+Arg_1])])])+(max([2, 2*Arg_0])+max([2, 2*(-1+Arg_0)]))*max([0, max([-8, -8*max([1, -1+Arg_0])])+max([8, 4*max([Arg_1, -1+Arg_1])])])+max([0, 4*(-1+Arg_1)+max([-8, -8*Arg_0])])+max([0, 4*Arg_1+max([-8, -8*(-1+Arg_0)])]))*2^((max([0, -1+Arg_1])+max([0, Arg_1]))*max([0, -2+max([Arg_1, -1+Arg_1])])+(max([2, 2*Arg_0])+max([2, 2*(-1+Arg_0)]))*max([0, max([Arg_1, -1+Arg_1])+max([-2, -2*max([1, -1+Arg_0])])])+max([0, -1+Arg_1+max([-2, -2*Arg_0])])+max([0, Arg_1+max([-2, -2*(-1+Arg_0)])]))*((max([0, -1+Arg_1])+max([0, Arg_1]))*max([0, max([-4, -8+4*max([Arg_1, -1+Arg_1])])])+(max([2, 2*Arg_0])+max([2, 2*(-1+Arg_0)]))*max([0, max([-8, -8*max([1, -1+Arg_0])])+max([8, 4*max([Arg_1, -1+Arg_1])])])+max([2, max([2*(-1+Arg_0), 2*max([1, -1+Arg_0])])])+max([0, 4*Arg_1+max([-8, -8*(-1+Arg_0)])])+max([0, 4*(-1+Arg_1)+max([-8, -8*Arg_0])])), max([2*(-1+Arg_0), 2*max([1, -1+Arg_0])])])])])])])])]) {O(EXP)}
103.82/95.64	
103.82/95.64	  10: eval4->eval2, Arg_3: max([2, max([2, max([3, max([1+2^((max([0, -1+Arg_1])+max([0, Arg_1]))*max([0, max([-4, -8+4*max([Arg_1, -1+Arg_1])])])+(max([2, 2*Arg_0])+max([2, 2*(-1+Arg_0)]))*max([0, max([-8, -8*max([1, -1+Arg_0])])+max([8, 4*max([Arg_1, -1+Arg_1])])])+max([0, 4*(-1+Arg_1)+max([-8, -8*Arg_0])])+max([0, 4*Arg_1+max([-8, -8*(-1+Arg_0)])]))*2^((max([0, -1+Arg_1])+max([0, Arg_1]))*max([0, -2+max([Arg_1, -1+Arg_1])])+(max([2, 2*Arg_0])+max([2, 2*(-1+Arg_0)]))*max([0, max([Arg_1, -1+Arg_1])+max([-2, -2*max([1, -1+Arg_0])])])+max([0, -1+Arg_1+max([-2, -2*Arg_0])])+max([0, Arg_1+max([-2, -2*(-1+Arg_0)])]))*((max([0, -1+Arg_1])+max([0, Arg_1]))*max([0, max([-4, -8+4*max([Arg_1, -1+Arg_1])])])+(max([2, 2*Arg_0])+max([2, 2*(-1+Arg_0)]))*max([0, max([-8, -8*max([1, -1+Arg_0])])+max([8, 4*max([Arg_1, -1+Arg_1])])])+max([2, max([2*(-1+Arg_0), 2*max([1, -1+Arg_0])])])+max([0, 4*Arg_1+max([-8, -8*(-1+Arg_0)])])+max([0, 4*(-1+Arg_1)+max([-8, -8*Arg_0])])), max([1+max([2*(-1+Arg_0), 2*max([1, -1+Arg_0])]), max([2^((max([0, -1+Arg_1])+max([0, Arg_1]))*max([0, max([-4, -8+4*max([Arg_1, -1+Arg_1])])])+(max([2, 2*Arg_0])+max([2, 2*(-1+Arg_0)]))*max([0, max([-8, -8*max([1, -1+Arg_0])])+max([8, 4*max([Arg_1, -1+Arg_1])])])+max([0, 4*(-1+Arg_1)+max([-8, -8*Arg_0])])+max([0, 4*Arg_1+max([-8, -8*(-1+Arg_0)])]))*2^((max([0, -1+Arg_1])+max([0, Arg_1]))*max([0, -2+max([Arg_1, -1+Arg_1])])+(max([2, 2*Arg_0])+max([2, 2*(-1+Arg_0)]))*max([0, max([Arg_1, -1+Arg_1])+max([-2, -2*max([1, -1+Arg_0])])])+max([0, -1+Arg_1+max([-2, -2*Arg_0])])+max([0, Arg_1+max([-2, -2*(-1+Arg_0)])]))*((max([0, -1+Arg_1])+max([0, Arg_1]))*max([0, max([-4, -8+4*max([Arg_1, -1+Arg_1])])])+(max([2, 2*Arg_0])+max([2, 2*(-1+Arg_0)]))*max([0, max([-8, -8*max([1, -1+Arg_0])])+max([8, 4*max([Arg_1, -1+Arg_1])])])+max([2, max([2*(-1+Arg_0), 2*max([1, -1+Arg_0])])])+max([0, 4*Arg_1+max([-8, -8*(-1+Arg_0)])])+max([0, 4*(-1+Arg_1)+max([-8, -8*Arg_0])])), max([2*(-1+Arg_0), max([2^((max([0, -1+Arg_1])+max([0, Arg_1]))*max([0, max([-4, -8+4*max([Arg_1, -1+Arg_1])])])+(max([2, 2*Arg_0])+max([2, 2*(-1+Arg_0)]))*max([0, max([-8, -8*max([1, -1+Arg_0])])+max([8, 4*max([Arg_1, -1+Arg_1])])])+max([0, 4*(-1+Arg_1)+max([-8, -8*Arg_0])])+max([0, 4*Arg_1+max([-8, -8*(-1+Arg_0)])]))*2^((max([0, -1+Arg_1])+max([0, Arg_1]))*max([0, -2+max([Arg_1, -1+Arg_1])])+(max([2, 2*Arg_0])+max([2, 2*(-1+Arg_0)]))*max([0, max([Arg_1, -1+Arg_1])+max([-2, -2*max([1, -1+Arg_0])])])+max([0, -1+Arg_1+max([-2, -2*Arg_0])])+max([0, Arg_1+max([-2, -2*(-1+Arg_0)])]))*((max([0, -1+Arg_1])+max([0, Arg_1]))*max([0, max([-4, -8+4*max([Arg_1, -1+Arg_1])])])+(max([2, 2*Arg_0])+max([2, 2*(-1+Arg_0)]))*max([0, max([-8, -8*max([1, -1+Arg_0])])+max([8, 4*max([Arg_1, -1+Arg_1])])])+max([2, max([2*(-1+Arg_0), 2*max([1, -1+Arg_0])])])+max([0, 4*Arg_1+max([-8, -8*(-1+Arg_0)])])+max([0, 4*(-1+Arg_1)+max([-8, -8*Arg_0])])), max([2*(-1+Arg_0), 2*max([1, -1+Arg_0])])])])])])])])])]) {O(EXP)}
103.82/95.64	
103.82/95.64	
103.82/95.64	----------------------------------------
103.82/95.64	
103.82/95.64	(2)
103.82/95.64	BOUNDS(1, max(2, 2 * Arg_0) + max(2, 2 * Arg_0) * nat(max(8, -4 + 4 * Arg_1, 4 * Arg_1) + max(-8, min(-8, 8 + -8 * Arg_0))) + 2 * max(2, 2 * Arg_0) * max(2 * Arg_1, 4, -2 + 2 * Arg_1) + max(2, 2 * Arg_0) * nat(max(min(2 + -2 * Arg_0, -2), -2) + max(2 * Arg_1, 4, -2 + 2 * Arg_1)) + max(2, 2 * Arg_0) * max(-1 + Arg_1, Arg_1, 0) + max(2, 2 * Arg_0) * max(5, -1 + 2 * Arg_1, 1 + 2 * Arg_1) + max(2, 2 * Arg_0) * nat(max(-1 + Arg_1, Arg_1) + max(min(2 + -2 * Arg_0, -2), -2)) + 2 * max(2, -2 + 2 * Arg_0) * max(2 * Arg_1, 4, -2 + 2 * Arg_1) + max(2, -2 + 2 * Arg_0) * nat(max(min(2 + -2 * Arg_0, -2), -2) + max(2 * Arg_1, 4, -2 + 2 * Arg_1)) + max(2, -2 + 2 * Arg_0) * max(-1 + Arg_1, Arg_1, 0) + max(2, -2 + 2 * Arg_0) * max(5, -1 + 2 * Arg_1, 1 + 2 * Arg_1) + max(2, -2 + 2 * Arg_0) * nat(max(-1 + Arg_1, Arg_1) + max(min(2 + -2 * Arg_0, -2), -2)) + max(2, -2 + 2 * Arg_0) + max(2, -2 + 2 * Arg_0) * nat(max(-8, min(-8, 8 + -8 * Arg_0)) + max(8, -4 + 4 * Arg_1, 4 * Arg_1)) + nat(1 + 2 * Arg_1) + nat(2 * Arg_1 + max(2 + -2 * Arg_0, -2)) + nat(4 * Arg_1) + nat(-1 + 2 * Arg_1) + nat(-1 + Arg_1 + max(-2 * Arg_0, -2)) + nat(-4 + 4 * Arg_1 + max(-8, -8 * Arg_0)) + nat(-2 + 2 * Arg_1 + max(-2 * Arg_0, -2)) + nat(-4 + 4 * Arg_1) + nat(Arg_1 + max(2 + -2 * Arg_0, -2)) + max(2 * Arg_1, 2) + nat(-1 + Arg_1) * max(-2 + Arg_1, -3 + Arg_1, 0) + nat(-1 + Arg_1) * max(-4 + 2 * Arg_1, -2 + 2 * Arg_1, 0) + nat(-1 + Arg_1) * max(-12 + 4 * Arg_1, -8 + 4 * Arg_1, 0) + nat(Arg_1) * max(-2 + Arg_1, -3 + Arg_1, 0) + nat(Arg_1) * max(-4 + 2 * Arg_1, -2 + 2 * Arg_1, 0) + nat(Arg_1) * max(-12 + 4 * Arg_1, -8 + 4 * Arg_1, 0) + nat(2 * Arg_1) + nat(4 * Arg_1 + max(-8, 8 + -8 * Arg_0)))
103.82/95.64	
103.82/95.64	----------------------------------------
103.82/95.64	
103.82/95.64	(3) Loat Proof (FINISHED)
103.82/95.64	
103.82/95.64	
103.82/95.64	### Pre-processing the ITS problem ###
103.82/95.64	
103.82/95.64	
103.82/95.64	
103.82/95.64	Initial linear ITS problem
103.82/95.64	
103.82/95.64	   Start location: eval1
103.82/95.64	
103.82/95.64	      0: eval1 -> eval2 : A'=-1+A, [ A>=2 ], cost: 1
103.82/95.64	
103.82/95.64	      1: eval1 -> eval2 : B'=-1+B, [ 1>=A ], cost: 1
103.82/95.64	
103.82/95.64	      2: eval2 -> eval3 : C'=A, D'=2*A, [ B>=2 ], cost: 1
103.82/95.64	
103.82/95.64	      3: eval3 -> eval4 : [ B>=D && B>=1+D ], cost: 1
103.82/95.64	
103.82/95.64	      4: eval3 -> eval4 : D'=1+D, [ B>=D && B>=1+D ], cost: 1
103.82/95.64	
103.82/95.64	      5: eval3 -> eval3 : C'=D, D'=2*D, [ B>=D && B>=1+D && D>=1 ], cost: 1
103.82/95.64	
103.82/95.64	      6: eval3 -> eval3 : C'=1+D, D'=2+2*D, [ B>=D && B>=1+D && D>=1 ], cost: 1
103.82/95.64	
103.82/95.64	      7: eval3 -> eval4 : [ B==D ], cost: 1
103.82/95.64	
103.82/95.64	      8: eval3 -> eval3 : C'=D, D'=2*D, [ D>=1 && B==D ], cost: 1
103.82/95.64	
103.82/95.64	      9: eval4 -> eval2 : A'=-1+A, [ A>=2 && A>=1 && B>=2 ], cost: 1
103.82/95.64	
103.82/95.64	     10: eval4 -> eval2 : B'=-1+B, [ B>=2 && A==1 ], cost: 1
103.82/95.64	
103.82/95.64	
103.82/95.64	
103.82/95.64	Simplified all rules, resulting in:
103.82/95.64	
103.82/95.64	   Start location: eval1
103.82/95.64	
103.82/95.64	      0: eval1 -> eval2 : A'=-1+A, [ A>=2 ], cost: 1
103.82/95.64	
103.82/95.64	      1: eval1 -> eval2 : B'=-1+B, [ 1>=A ], cost: 1
103.82/95.64	
103.82/95.64	      2: eval2 -> eval3 : C'=A, D'=2*A, [ B>=2 ], cost: 1
103.82/95.64	
103.82/95.64	      3: eval3 -> eval4 : [ B>=1+D ], cost: 1
103.82/95.64	
103.82/95.64	      4: eval3 -> eval4 : D'=1+D, [ B>=1+D ], cost: 1
103.82/95.64	
103.82/95.64	      5: eval3 -> eval3 : C'=D, D'=2*D, [ B>=1+D && D>=1 ], cost: 1
103.82/95.64	
103.82/95.64	      6: eval3 -> eval3 : C'=1+D, D'=2+2*D, [ B>=1+D && D>=1 ], cost: 1
103.82/95.64	
103.82/95.64	      7: eval3 -> eval4 : [ B==D ], cost: 1
103.82/95.64	
103.82/95.64	      8: eval3 -> eval3 : C'=D, D'=2*D, [ D>=1 && B==D ], cost: 1
103.82/95.64	
103.82/95.64	      9: eval4 -> eval2 : A'=-1+A, [ A>=2 && B>=2 ], cost: 1
103.82/95.64	
103.82/95.64	     10: eval4 -> eval2 : B'=-1+B, [ B>=2 && A==1 ], cost: 1
103.82/95.64	
103.82/95.64	
103.82/95.64	
103.82/95.64	### Simplification by acceleration and chaining ###
103.82/95.64	
103.82/95.64	
103.82/95.64	
103.82/95.64	Accelerating simple loops of location 2.
103.82/95.64	
103.82/95.64	   Accelerating the following rules:
103.82/95.64	
103.82/95.64	      5: eval3 -> eval3 : C'=D, D'=2*D, [ B>=1+D && D>=1 ], cost: 1
103.82/95.64	
103.82/95.64	      6: eval3 -> eval3 : C'=1+D, D'=2+2*D, [ B>=1+D && D>=1 ], cost: 1
103.82/95.64	
103.82/95.64	      8: eval3 -> eval3 : C'=D, D'=2*D, [ D>=1 && B==D ], cost: 1
103.82/95.64	
103.82/95.64	
103.82/95.64	
103.82/95.64	   Accelerated rule 5 with backward acceleration, yielding the new rule 11.
103.82/95.64	
103.82/95.64	   Accelerated rule 6 with backward acceleration, yielding the new rule 12.
103.82/95.64	
103.82/95.64	   Found no metering function for rule 8.
103.82/95.64	
103.82/95.64	   Removing the simple loops: 5 6.
103.82/95.64	
103.82/95.64	
103.82/95.64	
103.82/95.64	Accelerated all simple loops using metering functions (where possible):
103.82/95.64	
103.82/95.64	   Start location: eval1
103.82/95.64	
103.82/95.64	      0: eval1 -> eval2 : A'=-1+A, [ A>=2 ], cost: 1
103.82/95.64	
103.82/95.64	      1: eval1 -> eval2 : B'=-1+B, [ 1>=A ], cost: 1
103.82/95.64	
103.82/95.64	      2: eval2 -> eval3 : C'=A, D'=2*A, [ B>=2 ], cost: 1
103.82/95.64	
103.82/95.64	      3: eval3 -> eval4 : [ B>=1+D ], cost: 1
103.82/95.64	
103.82/95.64	      4: eval3 -> eval4 : D'=1+D, [ B>=1+D ], cost: 1
103.82/95.64	
103.82/95.64	      7: eval3 -> eval4 : [ B==D ], cost: 1
103.82/95.64	
103.82/95.64	      8: eval3 -> eval3 : C'=D, D'=2*D, [ D>=1 && B==D ], cost: 1
103.82/95.64	
103.82/95.64	     11: eval3 -> eval3 : C'=1/2*2^k*D, D'=2^k*D, [ B>=1+D && D>=1 && k>0 && B>=1+2^(-1+k)*D && 2^(-1+k)*D>=1 ], cost: k
103.82/95.64	
103.82/95.64	     12: eval3 -> eval3 : C'=-1+2^k_1+1/2*2^k_1*D, D'=-2+2^k_1*D+2^(1+k_1), [ B>=1+D && D>=1 && k_1>0 && B>=-1+2^(-1+k_1)*D+2^k_1 && -2+2^(-1+k_1)*D+2^k_1>=1 ], cost: k_1
103.82/95.64	
103.82/95.64	      9: eval4 -> eval2 : A'=-1+A, [ A>=2 && B>=2 ], cost: 1
103.82/95.64	
103.82/95.64	     10: eval4 -> eval2 : B'=-1+B, [ B>=2 && A==1 ], cost: 1
103.82/95.64	
103.82/95.64	
103.82/95.64	
103.82/95.64	Chained accelerated rules (with incoming rules):
103.82/95.64	
103.82/95.64	   Start location: eval1
103.82/95.64	
103.82/95.64	      0: eval1 -> eval2 : A'=-1+A, [ A>=2 ], cost: 1
103.82/95.64	
103.82/95.64	      1: eval1 -> eval2 : B'=-1+B, [ 1>=A ], cost: 1
103.82/95.64	
103.82/95.64	      2: eval2 -> eval3 : C'=A, D'=2*A, [ B>=2 ], cost: 1
103.82/95.64	
103.82/95.64	     13: eval2 -> eval3 : C'=2*A, D'=4*A, [ B>=2 && 2*A>=1 && B==2*A ], cost: 2
103.82/95.64	
103.82/95.64	     14: eval2 -> eval3 : C'=2^k*A, D'=2*2^k*A, [ B>=2 && B>=1+2*A && 2*A>=1 && k>0 && B>=1+2*2^(-1+k)*A && 2*2^(-1+k)*A>=1 ], cost: 1+k
103.82/95.64	
103.82/95.64	     15: eval2 -> eval3 : C'=-1+2^k_1+2^k_1*A, D'=-2+2*2^k_1*A+2^(1+k_1), [ B>=2 && B>=1+2*A && 2*A>=1 && k_1>0 && B>=-1+2*2^(-1+k_1)*A+2^k_1 && -2+2*2^(-1+k_1)*A+2^k_1>=1 ], cost: 1+k_1
103.82/95.64	
103.82/95.64	      3: eval3 -> eval4 : [ B>=1+D ], cost: 1
103.82/95.64	
103.82/95.64	      4: eval3 -> eval4 : D'=1+D, [ B>=1+D ], cost: 1
103.82/95.64	
103.82/95.64	      7: eval3 -> eval4 : [ B==D ], cost: 1
103.82/95.64	
103.82/95.64	      9: eval4 -> eval2 : A'=-1+A, [ A>=2 && B>=2 ], cost: 1
103.82/95.64	
103.82/95.64	     10: eval4 -> eval2 : B'=-1+B, [ B>=2 && A==1 ], cost: 1
103.82/95.64	
103.82/95.64	
103.82/95.64	
103.82/95.64	Eliminated locations (on tree-shaped paths):
103.82/95.64	
103.82/95.64	   Start location: eval1
103.82/95.64	
103.82/95.64	      0: eval1 -> eval2 : A'=-1+A, [ A>=2 ], cost: 1
103.82/95.64	
103.82/95.64	      1: eval1 -> eval2 : B'=-1+B, [ 1>=A ], cost: 1
103.82/95.64	
103.82/95.64	     16: eval2 -> eval4 : C'=A, D'=2*A, [ B>=2 && B>=1+2*A ], cost: 2
103.82/95.64	
103.82/95.64	     17: eval2 -> eval4 : C'=A, D'=1+2*A, [ B>=2 && B>=1+2*A ], cost: 2
103.82/95.64	
103.82/95.64	     18: eval2 -> eval4 : C'=A, D'=2*A, [ B>=2 && B==2*A ], cost: 2
103.82/95.64	
103.82/95.64	     19: eval2 -> eval4 : C'=2^k*A, D'=2*2^k*A, [ B>=2 && B>=1+2*A && 2*A>=1 && k>0 && B>=1+2*2^(-1+k)*A && 2*2^(-1+k)*A>=1 && B>=1+2*2^k*A ], cost: 2+k
103.82/95.64	
103.82/95.64	     20: eval2 -> eval4 : C'=2^k*A, D'=1+2*2^k*A, [ B>=2 && B>=1+2*A && 2*A>=1 && k>0 && B>=1+2*2^(-1+k)*A && 2*2^(-1+k)*A>=1 && B>=1+2*2^k*A ], cost: 2+k
103.82/95.64	
103.82/95.64	     21: eval2 -> eval4 : C'=2^k*A, D'=2*2^k*A, [ B>=2 && B>=1+2*A && 2*A>=1 && k>0 && B>=1+2*2^(-1+k)*A && 2*2^(-1+k)*A>=1 && B==2*2^k*A ], cost: 2+k
103.82/95.64	
103.82/95.64	     22: eval2 -> eval4 : C'=-1+2^k_1+2^k_1*A, D'=-2+2*2^k_1*A+2^(1+k_1), [ B>=2 && B>=1+2*A && 2*A>=1 && k_1>0 && B>=-1+2*2^(-1+k_1)*A+2^k_1 && -2+2*2^(-1+k_1)*A+2^k_1>=1 && B>=-1+2*2^k_1*A+2^(1+k_1) ], cost: 2+k_1
103.82/95.64	
103.82/95.64	     23: eval2 -> eval4 : C'=-1+2^k_1+2^k_1*A, D'=-1+2*2^k_1*A+2^(1+k_1), [ B>=2 && B>=1+2*A && 2*A>=1 && k_1>0 && B>=-1+2*2^(-1+k_1)*A+2^k_1 && -2+2*2^(-1+k_1)*A+2^k_1>=1 && B>=-1+2*2^k_1*A+2^(1+k_1) ], cost: 2+k_1
103.82/95.64	
103.82/95.64	     24: eval2 -> eval4 : C'=-1+2^k_1+2^k_1*A, D'=-2+2*2^k_1*A+2^(1+k_1), [ B>=2 && B>=1+2*A && 2*A>=1 && k_1>0 && B>=-1+2*2^(-1+k_1)*A+2^k_1 && -2+2*2^(-1+k_1)*A+2^k_1>=1 && B==-2+2*2^k_1*A+2^(1+k_1) ], cost: 2+k_1
103.82/95.64	
103.82/95.64	      9: eval4 -> eval2 : A'=-1+A, [ A>=2 && B>=2 ], cost: 1
103.82/95.64	
103.82/95.64	     10: eval4 -> eval2 : B'=-1+B, [ B>=2 && A==1 ], cost: 1
103.82/95.64	
103.82/95.64	
103.82/95.64	
103.82/95.64	Applied pruning (of leafs and parallel rules):
103.82/95.64	
103.82/95.64	   Start location: eval1
103.82/95.64	
103.82/95.64	      0: eval1 -> eval2 : A'=-1+A, [ A>=2 ], cost: 1
103.82/95.64	
103.82/95.64	      1: eval1 -> eval2 : B'=-1+B, [ 1>=A ], cost: 1
103.82/95.64	
103.82/95.64	     16: eval2 -> eval4 : C'=A, D'=2*A, [ B>=2 && B>=1+2*A ], cost: 2
103.82/95.64	
103.82/95.64	     17: eval2 -> eval4 : C'=A, D'=1+2*A, [ B>=2 && B>=1+2*A ], cost: 2
103.82/95.64	
103.82/95.64	     19: eval2 -> eval4 : C'=2^k*A, D'=2*2^k*A, [ B>=2 && B>=1+2*A && 2*A>=1 && k>0 && B>=1+2*2^(-1+k)*A && 2*2^(-1+k)*A>=1 && B>=1+2*2^k*A ], cost: 2+k
103.82/95.64	
103.82/95.64	     20: eval2 -> eval4 : C'=2^k*A, D'=1+2*2^k*A, [ B>=2 && B>=1+2*A && 2*A>=1 && k>0 && B>=1+2*2^(-1+k)*A && 2*2^(-1+k)*A>=1 && B>=1+2*2^k*A ], cost: 2+k
103.82/95.64	
103.82/95.64	     22: eval2 -> eval4 : C'=-1+2^k_1+2^k_1*A, D'=-2+2*2^k_1*A+2^(1+k_1), [ B>=2 && B>=1+2*A && 2*A>=1 && k_1>0 && B>=-1+2*2^(-1+k_1)*A+2^k_1 && -2+2*2^(-1+k_1)*A+2^k_1>=1 && B>=-1+2*2^k_1*A+2^(1+k_1) ], cost: 2+k_1
103.82/95.64	
103.82/95.64	      9: eval4 -> eval2 : A'=-1+A, [ A>=2 && B>=2 ], cost: 1
103.82/95.64	
103.82/95.64	     10: eval4 -> eval2 : B'=-1+B, [ B>=2 && A==1 ], cost: 1
103.82/95.64	
103.82/95.64	
103.82/95.64	
103.82/95.64	Eliminated locations (on tree-shaped paths):
103.82/95.64	
103.82/95.64	   Start location: eval1
103.82/95.64	
103.82/95.64	      0: eval1 -> eval2 : A'=-1+A, [ A>=2 ], cost: 1
103.82/95.64	
103.82/95.64	      1: eval1 -> eval2 : B'=-1+B, [ 1>=A ], cost: 1
103.82/95.64	
103.82/95.64	     25: eval2 -> eval2 : A'=-1+A, C'=A, D'=2*A, [ B>=2 && B>=1+2*A && A>=2 ], cost: 3
103.82/95.64	
103.82/95.64	     26: eval2 -> eval2 : B'=-1+B, C'=A, D'=2*A, [ B>=2 && B>=1+2*A && A==1 ], cost: 3
103.82/95.64	
103.82/95.64	     27: eval2 -> eval2 : A'=-1+A, C'=A, D'=1+2*A, [ B>=2 && B>=1+2*A && A>=2 ], cost: 3
103.82/95.64	
103.82/95.64	     28: eval2 -> eval2 : B'=-1+B, C'=A, D'=1+2*A, [ B>=2 && B>=1+2*A && A==1 ], cost: 3
103.82/95.64	
103.82/95.64	     29: eval2 -> eval2 : A'=-1+A, C'=2^k*A, D'=2*2^k*A, [ B>=2 && B>=1+2*A && 2*A>=1 && k>0 && B>=1+2*2^(-1+k)*A && 2*2^(-1+k)*A>=1 && B>=1+2*2^k*A && A>=2 ], cost: 3+k
103.82/95.64	
103.82/95.64	     30: eval2 -> eval2 : B'=-1+B, C'=2^k*A, D'=2*2^k*A, [ B>=2 && B>=1+2*A && 2*A>=1 && k>0 && B>=1+2*2^(-1+k)*A && 2*2^(-1+k)*A>=1 && B>=1+2*2^k*A && A==1 ], cost: 3+k
103.82/95.64	
103.82/95.64	     31: eval2 -> eval2 : A'=-1+A, C'=2^k*A, D'=1+2*2^k*A, [ B>=2 && B>=1+2*A && 2*A>=1 && k>0 && B>=1+2*2^(-1+k)*A && 2*2^(-1+k)*A>=1 && B>=1+2*2^k*A && A>=2 ], cost: 3+k
103.82/95.64	
103.82/95.64	     32: eval2 -> eval2 : B'=-1+B, C'=2^k*A, D'=1+2*2^k*A, [ B>=2 && B>=1+2*A && 2*A>=1 && k>0 && B>=1+2*2^(-1+k)*A && 2*2^(-1+k)*A>=1 && B>=1+2*2^k*A && A==1 ], cost: 3+k
103.82/95.64	
103.82/95.64	     33: eval2 -> eval2 : A'=-1+A, C'=-1+2^k_1+2^k_1*A, D'=-2+2*2^k_1*A+2^(1+k_1), [ B>=2 && B>=1+2*A && 2*A>=1 && k_1>0 && B>=-1+2*2^(-1+k_1)*A+2^k_1 && -2+2*2^(-1+k_1)*A+2^k_1>=1 && B>=-1+2*2^k_1*A+2^(1+k_1) && A>=2 ], cost: 3+k_1
103.82/95.64	
103.82/95.64	     34: eval2 -> eval2 : B'=-1+B, C'=-1+2^k_1+2^k_1*A, D'=-2+2*2^k_1*A+2^(1+k_1), [ B>=2 && B>=1+2*A && 2*A>=1 && k_1>0 && B>=-1+2*2^(-1+k_1)*A+2^k_1 && -2+2*2^(-1+k_1)*A+2^k_1>=1 && B>=-1+2*2^k_1*A+2^(1+k_1) && A==1 ], cost: 3+k_1
103.82/95.64	
103.82/95.64	
103.82/95.64	
103.82/95.64	Applied pruning (of leafs and parallel rules):
103.82/95.64	
103.82/95.64	   Start location: eval1
103.82/95.64	
103.82/95.64	      0: eval1 -> eval2 : A'=-1+A, [ A>=2 ], cost: 1
103.82/95.64	
103.82/95.64	      1: eval1 -> eval2 : B'=-1+B, [ 1>=A ], cost: 1
103.82/95.64	
103.82/95.64	     25: eval2 -> eval2 : A'=-1+A, C'=A, D'=2*A, [ B>=2 && B>=1+2*A && A>=2 ], cost: 3
103.82/95.64	
103.82/95.64	     26: eval2 -> eval2 : B'=-1+B, C'=A, D'=2*A, [ B>=2 && B>=1+2*A && A==1 ], cost: 3
103.82/95.64	
103.82/95.64	     28: eval2 -> eval2 : B'=-1+B, C'=A, D'=1+2*A, [ B>=2 && B>=1+2*A && A==1 ], cost: 3
103.82/95.64	
103.82/95.64	     29: eval2 -> eval2 : A'=-1+A, C'=2^k*A, D'=2*2^k*A, [ B>=2 && B>=1+2*A && 2*A>=1 && k>0 && B>=1+2*2^(-1+k)*A && 2*2^(-1+k)*A>=1 && B>=1+2*2^k*A && A>=2 ], cost: 3+k
103.82/95.64	
103.82/95.64	     30: eval2 -> eval2 : B'=-1+B, C'=2^k*A, D'=2*2^k*A, [ B>=2 && B>=1+2*A && 2*A>=1 && k>0 && B>=1+2*2^(-1+k)*A && 2*2^(-1+k)*A>=1 && B>=1+2*2^k*A && A==1 ], cost: 3+k
103.82/95.64	
103.82/95.64	
103.82/95.64	
103.82/95.64	Accelerating simple loops of location 1.
103.82/95.64	
103.82/95.64	   Accelerating the following rules:
103.82/95.64	
103.82/95.64	     25: eval2 -> eval2 : A'=-1+A, C'=A, D'=2*A, [ B>=2 && B>=1+2*A && A>=2 ], cost: 3
103.82/95.64	
103.82/95.64	     26: eval2 -> eval2 : B'=-1+B, C'=A, D'=2*A, [ B>=2 && B>=1+2*A && A==1 ], cost: 3
103.82/95.64	
103.82/95.64	     28: eval2 -> eval2 : B'=-1+B, C'=A, D'=1+2*A, [ B>=2 && B>=1+2*A && A==1 ], cost: 3
103.82/95.64	
103.82/95.64	     29: eval2 -> eval2 : A'=-1+A, C'=2^k*A, D'=2*2^k*A, [ B>=2 && B>=1+2*A && 2*A>=1 && k>0 && B>=1+2*2^(-1+k)*A && 2*2^(-1+k)*A>=1 && B>=1+2*2^k*A && A>=2 ], cost: 3+k
103.82/95.64	
103.82/95.64	     30: eval2 -> eval2 : B'=-1+B, C'=2^k*A, D'=2*2^k*A, [ B>=2 && B>=1+2*A && 2*A>=1 && k>0 && B>=1+2*2^(-1+k)*A && 2*2^(-1+k)*A>=1 && B>=1+2*2^k*A && A==1 ], cost: 3+k
103.82/95.64	
103.82/95.64	
103.82/95.64	
103.82/95.64	   Accelerated rule 25 with metering function -1+A, yielding the new rule 35.
103.82/95.64	
103.82/95.64	   Accelerated rule 26 with metering function -2*A+B, yielding the new rule 36.
103.82/95.64	
103.82/95.64	   Accelerated rule 28 with metering function -2*A+B, yielding the new rule 37.
103.82/95.64	
103.82/95.64	   Accelerated rule 29 with backward acceleration, yielding the new rule 38.
103.82/95.64	
103.82/95.64	   Accelerated rule 30 with backward acceleration, yielding the new rule 39.
103.82/95.64	
103.82/95.64	   Removing the simple loops: 25 26 28 29 30.
103.82/95.64	
103.82/95.64	
103.82/95.64	
103.82/95.64	Accelerated all simple loops using metering functions (where possible):
103.82/95.64	
103.82/95.64	   Start location: eval1
103.82/95.64	
103.82/95.64	      0: eval1 -> eval2 : A'=-1+A, [ A>=2 ], cost: 1
103.82/95.64	
103.82/95.64	      1: eval1 -> eval2 : B'=-1+B, [ 1>=A ], cost: 1
103.82/95.64	
103.82/95.64	     35: eval2 -> eval2 : A'=1, C'=2, D'=4, [ B>=2 && B>=1+2*A && A>=2 ], cost: -3+3*A
103.82/95.64	
103.82/95.64	     36: eval2 -> eval2 : B'=2*A, C'=A, D'=2*A, [ B>=2 && B>=1+2*A && A==1 ], cost: -6*A+3*B
103.82/95.64	
103.82/95.64	     37: eval2 -> eval2 : B'=2*A, C'=A, D'=1+2*A, [ B>=2 && B>=1+2*A && A==1 ], cost: -6*A+3*B
103.82/95.64	
103.82/95.64	     38: eval2 -> eval2 : A'=-k_2+A, C'=2^k+2^k*A-2^k*k_2, D'=2*2^k+2*2^k*A-2*2^k*k_2, [ B>=2 && B>=1+2*A && 2*A>=1 && k>0 && B>=1+2*2^(-1+k)*A && 2*2^(-1+k)*A>=1 && B>=1+2*2^k*A && A>=2 && k_2>0 && B>=3-2*k_2+2*A && 2-2*k_2+2*A>=1 && B>=1-2*2^(-1+k)*(-1+k_2-A) && -2*2^(-1+k)*(-1+k_2-A)>=1 && B>=1-2*2^k*(-1+k_2-A) && 1-k_2+A>=2 ], cost: 3*k_2+k_2*k
103.82/95.64	
103.82/95.64	     39: eval2 -> eval2 : B'=-k_3+B, C'=2^k*A, D'=2*2^k*A, [ B>=2 && B>=1+2*A && 2*A>=1 && k>0 && B>=1+2*2^(-1+k)*A && 2*2^(-1+k)*A>=1 && B>=1+2*2^k*A && A==1 && k_3>0 && 1-k_3+B>=2 && 1-k_3+B>=1+2*A && 1-k_3+B>=1+2*2^(-1+k)*A && 1-k_3+B>=1+2*2^k*A ], cost: 3*k_3+k_3*k
103.82/95.64	
103.82/95.64	
103.82/95.64	
103.82/95.64	Chained accelerated rules (with incoming rules):
103.82/95.64	
103.82/95.64	   Start location: eval1
103.82/95.64	
103.82/95.64	      0: eval1 -> eval2 : A'=-1+A, [ A>=2 ], cost: 1
103.82/95.64	
103.82/95.64	      1: eval1 -> eval2 : B'=-1+B, [ 1>=A ], cost: 1
103.82/95.64	
103.82/95.64	     40: eval1 -> eval2 : A'=1, C'=2, D'=4, [ B>=2 && B>=-1+2*A && -1+A>=2 ], cost: -5+3*A
103.82/95.64	
103.82/95.64	     41: eval1 -> eval2 : A'=-1+A, B'=-2+2*A, C'=-1+A, D'=-2+2*A, [ B>=2 && B>=-1+2*A && -1+A==1 ], cost: 7-6*A+3*B
103.82/95.64	
103.82/95.64	     42: eval1 -> eval2 : B'=2*A, C'=A, D'=2*A, [ -1+B>=2 && -1+B>=1+2*A && A==1 ], cost: -2-6*A+3*B
103.82/95.64	
103.82/95.64	     43: eval1 -> eval2 : A'=-1+A, B'=-2+2*A, C'=-1+A, D'=-1+2*A, [ B>=2 && B>=-1+2*A && -1+A==1 ], cost: 7-6*A+3*B
103.82/95.64	
103.82/95.64	     44: eval1 -> eval2 : B'=2*A, C'=A, D'=1+2*A, [ -1+B>=2 && -1+B>=1+2*A && A==1 ], cost: -2-6*A+3*B
103.82/95.64	
103.82/95.64	     45: eval1 -> eval2 : A'=-1-k_2+A, C'=2^k+2^k*(-1+A)-2^k*k_2, D'=2*2^k+2*2^k*(-1+A)-2*2^k*k_2, [ B>=2 && B>=-1+2*A && -2+2*A>=1 && k>0 && B>=1+2*2^(-1+k)*(-1+A) && 2*2^(-1+k)*(-1+A)>=1 && B>=1+2*2^k*(-1+A) && -1+A>=2 && k_2>0 && B>=1-2*k_2+2*A && -2*k_2+2*A>=1 && B>=1-2*2^(-1+k)*(k_2-A) && -2*2^(-1+k)*(k_2-A)>=1 && B>=1-2*2^k*(k_2-A) && -k_2+A>=2 ], cost: 1+3*k_2+k_2*k
103.82/95.64	
103.82/95.64	     46: eval1 -> eval2 : A'=-1+A, B'=-k_3+B, C'=2^k*(-1+A), D'=2*2^k*(-1+A), [ B>=2 && B>=-1+2*A && -2+2*A>=1 && k>0 && B>=1+2*2^(-1+k)*(-1+A) && 2*2^(-1+k)*(-1+A)>=1 && B>=1+2*2^k*(-1+A) && -1+A==1 && k_3>0 && 1-k_3+B>=2 && 1-k_3+B>=-1+2*A && 1-k_3+B>=1+2*2^(-1+k)*(-1+A) && 1-k_3+B>=1+2*2^k*(-1+A) ], cost: 1+3*k_3+k_3*k
103.82/95.64	
103.82/95.64	     47: eval1 -> eval2 : B'=-1-k_3+B, C'=2^k*A, D'=2*2^k*A, [ -1+B>=2 && -1+B>=1+2*A && 2*A>=1 && k>0 && -1+B>=1+2*2^(-1+k)*A && 2*2^(-1+k)*A>=1 && -1+B>=1+2*2^k*A && A==1 && k_3>0 && -k_3+B>=2 && -k_3+B>=1+2*A && -k_3+B>=1+2*2^(-1+k)*A && -k_3+B>=1+2*2^k*A ], cost: 1+3*k_3+k_3*k
103.82/95.64	
103.82/95.64	
103.82/95.64	
103.82/95.64	Removed unreachable locations (and leaf rules with constant cost):
103.82/95.64	
103.82/95.64	   Start location: eval1
103.82/95.64	
103.82/95.64	     40: eval1 -> eval2 : A'=1, C'=2, D'=4, [ B>=2 && B>=-1+2*A && -1+A>=2 ], cost: -5+3*A
103.82/95.64	
103.82/95.64	     41: eval1 -> eval2 : A'=-1+A, B'=-2+2*A, C'=-1+A, D'=-2+2*A, [ B>=2 && B>=-1+2*A && -1+A==1 ], cost: 7-6*A+3*B
103.82/95.64	
103.82/95.64	     42: eval1 -> eval2 : B'=2*A, C'=A, D'=2*A, [ -1+B>=2 && -1+B>=1+2*A && A==1 ], cost: -2-6*A+3*B
103.82/95.64	
103.82/95.64	     43: eval1 -> eval2 : A'=-1+A, B'=-2+2*A, C'=-1+A, D'=-1+2*A, [ B>=2 && B>=-1+2*A && -1+A==1 ], cost: 7-6*A+3*B
103.82/95.64	
103.82/95.64	     44: eval1 -> eval2 : B'=2*A, C'=A, D'=1+2*A, [ -1+B>=2 && -1+B>=1+2*A && A==1 ], cost: -2-6*A+3*B
103.82/95.64	
103.82/95.64	     45: eval1 -> eval2 : A'=-1-k_2+A, C'=2^k+2^k*(-1+A)-2^k*k_2, D'=2*2^k+2*2^k*(-1+A)-2*2^k*k_2, [ B>=2 && B>=-1+2*A && -2+2*A>=1 && k>0 && B>=1+2*2^(-1+k)*(-1+A) && 2*2^(-1+k)*(-1+A)>=1 && B>=1+2*2^k*(-1+A) && -1+A>=2 && k_2>0 && B>=1-2*k_2+2*A && -2*k_2+2*A>=1 && B>=1-2*2^(-1+k)*(k_2-A) && -2*2^(-1+k)*(k_2-A)>=1 && B>=1-2*2^k*(k_2-A) && -k_2+A>=2 ], cost: 1+3*k_2+k_2*k
103.82/95.64	
103.82/95.64	     46: eval1 -> eval2 : A'=-1+A, B'=-k_3+B, C'=2^k*(-1+A), D'=2*2^k*(-1+A), [ B>=2 && B>=-1+2*A && -2+2*A>=1 && k>0 && B>=1+2*2^(-1+k)*(-1+A) && 2*2^(-1+k)*(-1+A)>=1 && B>=1+2*2^k*(-1+A) && -1+A==1 && k_3>0 && 1-k_3+B>=2 && 1-k_3+B>=-1+2*A && 1-k_3+B>=1+2*2^(-1+k)*(-1+A) && 1-k_3+B>=1+2*2^k*(-1+A) ], cost: 1+3*k_3+k_3*k
103.82/95.64	
103.82/95.64	     47: eval1 -> eval2 : B'=-1-k_3+B, C'=2^k*A, D'=2*2^k*A, [ -1+B>=2 && -1+B>=1+2*A && 2*A>=1 && k>0 && -1+B>=1+2*2^(-1+k)*A && 2*2^(-1+k)*A>=1 && -1+B>=1+2*2^k*A && A==1 && k_3>0 && -k_3+B>=2 && -k_3+B>=1+2*A && -k_3+B>=1+2*2^(-1+k)*A && -k_3+B>=1+2*2^k*A ], cost: 1+3*k_3+k_3*k
103.82/95.64	
103.82/95.64	
103.82/95.64	
103.82/95.64	### Computing asymptotic complexity ###
103.82/95.64	
103.82/95.64	
103.82/95.64	
103.82/95.64	Fully simplified ITS problem
103.82/95.64	
103.82/95.64	   Start location: eval1
103.82/95.64	
103.82/95.64	     40: eval1 -> eval2 : A'=1, C'=2, D'=4, [ B>=2 && B>=-1+2*A && -1+A>=2 ], cost: -5+3*A
103.82/95.64	
103.82/95.64	     43: eval1 -> eval2 : A'=-1+A, B'=-2+2*A, C'=-1+A, D'=-1+2*A, [ B>=2 && B>=-1+2*A && -1+A==1 ], cost: 7-6*A+3*B
103.82/95.64	
103.82/95.64	     44: eval1 -> eval2 : B'=2*A, C'=A, D'=1+2*A, [ -1+B>=2 && -1+B>=1+2*A && A==1 ], cost: -2-6*A+3*B
103.82/95.64	
103.82/95.64	     45: eval1 -> eval2 : A'=-1-k_2+A, C'=2^k+2^k*(-1+A)-2^k*k_2, D'=2*2^k+2*2^k*(-1+A)-2*2^k*k_2, [ B>=2 && B>=-1+2*A && -2+2*A>=1 && k>0 && B>=1+2*2^(-1+k)*(-1+A) && 2*2^(-1+k)*(-1+A)>=1 && B>=1+2*2^k*(-1+A) && -1+A>=2 && k_2>0 && B>=1-2*k_2+2*A && -2*k_2+2*A>=1 && B>=1-2*2^(-1+k)*(k_2-A) && -2*2^(-1+k)*(k_2-A)>=1 && B>=1-2*2^k*(k_2-A) && -k_2+A>=2 ], cost: 1+3*k_2+k_2*k
103.82/95.64	
103.82/95.64	     46: eval1 -> eval2 : A'=-1+A, B'=-k_3+B, C'=2^k*(-1+A), D'=2*2^k*(-1+A), [ B>=2 && B>=-1+2*A && -2+2*A>=1 && k>0 && B>=1+2*2^(-1+k)*(-1+A) && 2*2^(-1+k)*(-1+A)>=1 && B>=1+2*2^k*(-1+A) && -1+A==1 && k_3>0 && 1-k_3+B>=2 && 1-k_3+B>=-1+2*A && 1-k_3+B>=1+2*2^(-1+k)*(-1+A) && 1-k_3+B>=1+2*2^k*(-1+A) ], cost: 1+3*k_3+k_3*k
103.82/95.64	
103.82/95.64	     47: eval1 -> eval2 : B'=-1-k_3+B, C'=2^k*A, D'=2*2^k*A, [ -1+B>=2 && -1+B>=1+2*A && 2*A>=1 && k>0 && -1+B>=1+2*2^(-1+k)*A && 2*2^(-1+k)*A>=1 && -1+B>=1+2*2^k*A && A==1 && k_3>0 && -k_3+B>=2 && -k_3+B>=1+2*A && -k_3+B>=1+2*2^(-1+k)*A && -k_3+B>=1+2*2^k*A ], cost: 1+3*k_3+k_3*k
103.82/95.64	
103.82/95.64	
103.82/95.64	
103.82/95.64	Computing asymptotic complexity for rule 40
103.82/95.64	
103.82/95.64	   Simplified the guard:
103.82/95.64	
103.82/95.64	     40: eval1 -> eval2 : A'=1, C'=2, D'=4, [ B>=-1+2*A && -1+A>=2 ], cost: -5+3*A
103.82/95.64	
103.82/95.64	   Solved the limit problem by the following transformations:
103.82/95.64	
103.82/95.64	      Created initial limit problem:
103.82/95.64	
103.82/95.64	      2-2*A+B (+/+!), -2+A (+/+!), -5+3*A (+) [not solved]
103.82/95.64	
103.82/95.64	
103.82/95.64	
103.82/95.64	      applying transformation rule (C) using substitution {B==-1+2*A}
103.82/95.64	
103.82/95.64	      resulting limit problem:
103.82/95.64	
103.82/95.64	      1 (+/+!), -2+A (+/+!), -5+3*A (+) [not solved]
103.82/95.64	
103.82/95.64	
103.82/95.64	
103.82/95.64	      applying transformation rule (B), deleting 1 (+/+!)
103.82/95.64	
103.82/95.64	      resulting limit problem:
103.82/95.64	
103.82/95.64	      -2+A (+/+!), -5+3*A (+) [not solved]
103.82/95.64	
103.82/95.64	
103.82/95.64	
103.82/95.64	      removing all constraints (solved by SMT)
103.82/95.64	
103.82/95.64	      resulting limit problem: [solved]
103.82/95.64	
103.82/95.64	
103.82/95.64	
103.82/95.64	      applying transformation rule (C) using substitution {A==n}
103.82/95.64	
103.82/95.64	      resulting limit problem:
103.82/95.64	
103.82/95.64	      [solved]
103.82/95.64	
103.82/95.64	
103.82/95.64	
103.82/95.64	   Solution:
103.82/95.64	
103.82/95.64	      A / n
103.82/95.64	
103.82/95.64	      B / -1+2*n
103.82/95.64	
103.82/95.64	   Resulting cost -5+3*n has complexity: Poly(n^1)
103.82/95.64	
103.82/95.64	
103.82/95.64	
103.82/95.64	Found new complexity Poly(n^1).
103.82/95.64	
103.82/95.64	
103.82/95.64	
103.82/95.64	Computing asymptotic complexity for rule 45
103.82/95.64	
103.82/95.64	   Simplified the guard:
103.82/95.64	
103.82/95.64	     45: eval1 -> eval2 : A'=-1-k_2+A, C'=2^k+2^k*(-1+A)-2^k*k_2, D'=2*2^k+2*2^k*(-1+A)-2*2^k*k_2, [ B>=-1+2*A && k>0 && B>=1+2*2^(-1+k)*(-1+A) && 2*2^(-1+k)*(-1+A)>=1 && B>=1+2*2^k*(-1+A) && k_2>0 && -k_2+A>=2 ], cost: 1+3*k_2+k_2*k
103.82/95.64	
103.82/95.64	   Solved the limit problem by the following transformations:
103.82/95.64	
103.82/95.64	      Created initial limit problem:
103.82/95.64	
103.82/95.64	      k_2 (+/+!), -1-k_2+A (+/+!), k (+/+!), 2*2^(-1+k)*(-1+A) (+/+!), 2-2*A+B (+/+!), 1+3*k_2+k_2*k (+), -2*2^k*(-1+A)+B (+/+!), -2*2^(-1+k)*(-1+A)+B (+/+!) [not solved]
103.82/95.64	
103.82/95.64	
103.82/95.64	
103.82/95.64	      applying transformation rule (C) using substitution {k==1}
103.82/95.64	
103.82/95.64	      resulting limit problem:
103.82/95.64	
103.82/95.64	      1 (+/+!), k_2 (+/+!), -1-k_2+A (+/+!), 1+4*k_2 (+), 2-2*A+B (+/+!), 4-4*A+B (+/+!), -2+2*A (+/+!) [not solved]
103.82/95.64	
103.82/95.64	
103.82/95.64	
103.82/95.64	      applying transformation rule (B), deleting 1 (+/+!)
103.82/95.64	
103.82/95.64	      resulting limit problem:
103.82/95.64	
103.82/95.64	      k_2 (+/+!), -1-k_2+A (+/+!), 1+4*k_2 (+), 2-2*A+B (+/+!), 4-4*A+B (+/+!), -2+2*A (+/+!) [not solved]
103.82/95.64	
103.82/95.64	
103.82/95.64	
103.82/95.64	      removing all constraints (solved by SMT)
103.82/95.64	
103.82/95.64	      resulting limit problem: [solved]
103.82/95.64	
103.82/95.64	
103.82/95.64	
103.82/95.64	      applying transformation rule (C) using substitution {k_2==n,A==2+n,B==5+4*n}
103.82/95.64	
103.82/95.64	      resulting limit problem:
103.82/95.64	
103.82/95.64	      [solved]
103.82/95.64	
103.82/95.64	
103.82/95.64	
103.82/95.64	   Solution:
103.82/95.64	
103.82/95.64	      k_2 / n
103.82/95.64	
103.82/95.64	      k / 1
103.82/95.64	
103.82/95.64	      A / 2+n
103.82/95.64	
103.82/95.64	      B / 5+4*n
103.82/95.64	
103.82/95.64	   Resulting cost 1+4*n has complexity: Poly(n^1)
103.82/95.64	
103.82/95.64	
103.82/95.64	
103.82/95.64	Computing asymptotic complexity for rule 46
103.82/95.64	
103.82/95.64	   Simplified the guard:
103.82/95.64	
103.82/95.64	     46: eval1 -> eval2 : A'=-1+A, B'=-k_3+B, C'=2^k*(-1+A), D'=2*2^k*(-1+A), [ k>0 && 2*2^(-1+k)*(-1+A)>=1 && -1+A==1 && k_3>0 && 1-k_3+B>=2 && 1-k_3+B>=-1+2*A && 1-k_3+B>=1+2*2^(-1+k)*(-1+A) && 1-k_3+B>=1+2*2^k*(-1+A) ], cost: 1+3*k_3+k_3*k
103.82/95.64	
103.82/95.64	   Solved the limit problem by the following transformations:
103.82/95.64	
103.82/95.64	      Created initial limit problem:
103.82/95.64	
103.82/95.64	      k_3 (+/+!), k (+/+!), 2*2^(-1+k)*(-1+A) (+/+!), -1+A (+/+!), 3-A (+/+!), 3-k_3-2*A+B (+/+!), -k_3+B (+/+!), 1-k_3-2*2^(-1+k)*(-1+A)+B (+/+!), 1+3*k_3+k_3*k (+), 1-k_3-2*2^k*(-1+A)+B (+/+!) [not solved]
103.82/95.64	
103.82/95.64	
103.82/95.64	
103.82/95.64	      applying transformation rule (C) using substitution {A==2}
103.82/95.64	
103.82/95.64	      resulting limit problem:
103.82/95.64	
103.82/95.64	      1 (+/+!), k_3 (+/+!), k (+/+!), 1-k_3-2*2^(-1+k)+B (+/+!), 2*2^(-1+k) (+/+!), -k_3+B (+/+!), -1-k_3+B (+/+!), 1+3*k_3+k_3*k (+), 1-k_3-2*2^k+B (+/+!) [not solved]
103.82/95.64	
103.82/95.64	
103.82/95.64	
103.82/95.64	      applying transformation rule (C) using substitution {k==1}
103.82/95.64	
103.82/95.64	      resulting limit problem:
103.82/95.64	
103.82/95.64	      1 (+/+!), k_3 (+/+!), 1+4*k_3 (+), 2 (+/+!), -3-k_3+B (+/+!), -k_3+B (+/+!), -1-k_3+B (+/+!) [not solved]
103.82/95.64	
103.82/95.64	
103.82/95.64	
103.82/95.64	      applying transformation rule (B), deleting 1 (+/+!)
103.82/95.64	
103.82/95.64	      resulting limit problem:
103.82/95.64	
103.82/95.64	      k_3 (+/+!), 1+4*k_3 (+), 2 (+/+!), -3-k_3+B (+/+!), -k_3+B (+/+!), -1-k_3+B (+/+!) [not solved]
103.82/95.64	
103.82/95.64	
103.82/95.64	
103.82/95.64	      applying transformation rule (B), deleting 2 (+/+!)
103.82/95.64	
103.82/95.64	      resulting limit problem:
103.82/95.64	
103.82/95.64	      k_3 (+/+!), 1+4*k_3 (+), -3-k_3+B (+/+!), -k_3+B (+/+!), -1-k_3+B (+/+!) [not solved]
103.82/95.64	
103.82/95.64	
103.82/95.64	
103.82/95.64	      removing all constraints (solved by SMT)
103.82/95.64	
103.82/95.64	      resulting limit problem: [solved]
103.82/95.64	
103.82/95.64	
103.82/95.64	
103.82/95.64	      applying transformation rule (C) using substitution {k_3==n,B==2*n}
103.82/95.64	
103.82/95.64	      resulting limit problem:
103.82/95.64	
103.82/95.64	      [solved]
103.82/95.64	
103.82/95.64	
103.82/95.64	
103.82/95.64	   Solution:
103.82/95.64	
103.82/95.64	      k_3 / n
103.82/95.64	
103.82/95.64	      k / 1
103.82/95.64	
103.82/95.64	      A / 2
103.82/95.64	
103.82/95.64	      B / 2*n
103.82/95.64	
103.82/95.64	   Resulting cost 1+4*n has complexity: Poly(n^1)
103.82/95.64	
103.82/95.64	
103.82/95.64	
103.82/95.64	Computing asymptotic complexity for rule 47
103.82/95.64	
103.82/95.64	   Simplified the guard:
103.82/95.64	
103.82/95.64	     47: eval1 -> eval2 : B'=-1-k_3+B, C'=2^k*A, D'=2*2^k*A, [ k>0 && 2*2^(-1+k)*A>=1 && A==1 && k_3>0 && -k_3+B>=2 && -k_3+B>=1+2*A && -k_3+B>=1+2*2^(-1+k)*A && -k_3+B>=1+2*2^k*A ], cost: 1+3*k_3+k_3*k
103.82/95.64	
103.82/95.64	   Solved the limit problem by the following transformations:
103.82/95.64	
103.82/95.64	      Created initial limit problem:
103.82/95.64	
103.82/95.64	      -k_3-2*2^(-1+k)*A+B (+/+!), 2*2^(-1+k)*A (+/+!), k_3 (+/+!), k (+/+!), -k_3-2*A+B (+/+!), 2-A (+/+!), -k_3-2*2^k*A+B (+/+!), A (+/+!), -1-k_3+B (+/+!), 1+3*k_3+k_3*k (+) [not solved]
103.82/95.64	
103.82/95.64	
103.82/95.64	
103.82/95.64	      applying transformation rule (C) using substitution {A==1}
103.82/95.64	
103.82/95.64	      resulting limit problem:
103.82/95.64	
103.82/95.64	      1 (+/+!), k_3 (+/+!), -k_3-2*2^(-1+k)+B (+/+!), k (+/+!), -2-k_3+B (+/+!), 2*2^(-1+k) (+/+!), -1-k_3+B (+/+!), 1+3*k_3+k_3*k (+), -k_3-2*2^k+B (+/+!) [not solved]
103.82/95.64	
103.82/95.64	
103.82/95.64	
103.82/95.64	      applying transformation rule (C) using substitution {k==1}
103.82/95.64	
103.82/95.64	      resulting limit problem:
103.82/95.64	
103.82/95.64	      -4-k_3+B (+/+!), 1 (+/+!), k_3 (+/+!), 1+4*k_3 (+), -2-k_3+B (+/+!), 2 (+/+!), -1-k_3+B (+/+!) [not solved]
103.82/95.64	
103.82/95.64	
103.82/95.64	
103.82/95.64	      applying transformation rule (B), deleting 1 (+/+!)
103.82/95.64	
103.82/95.64	      resulting limit problem:
103.82/95.64	
103.82/95.64	      -4-k_3+B (+/+!), k_3 (+/+!), 1+4*k_3 (+), -2-k_3+B (+/+!), 2 (+/+!), -1-k_3+B (+/+!) [not solved]
103.82/95.64	
103.82/95.64	
103.82/95.64	
103.82/95.64	      applying transformation rule (B), deleting 2 (+/+!)
103.82/95.64	
103.82/95.64	      resulting limit problem:
103.82/95.64	
103.82/95.64	      -4-k_3+B (+/+!), k_3 (+/+!), 1+4*k_3 (+), -2-k_3+B (+/+!), -1-k_3+B (+/+!) [not solved]
103.82/95.64	
103.82/95.64	
103.82/95.64	
103.82/95.64	      removing all constraints (solved by SMT)
103.82/95.64	
103.82/95.64	      resulting limit problem: [solved]
103.82/95.64	
103.82/95.64	
103.82/95.64	
103.82/95.64	      applying transformation rule (C) using substitution {k_3==n,B==5+n}
103.82/95.64	
103.82/95.64	      resulting limit problem:
103.82/95.64	
103.82/95.64	      [solved]
103.82/95.64	
103.82/95.64	
103.82/95.64	
103.82/95.64	   Solution:
103.82/95.64	
103.82/95.64	      k_3 / n
103.82/95.64	
103.82/95.64	      k / 1
103.82/95.64	
103.82/95.64	      A / 1
103.82/95.64	
103.82/95.64	      B / 5+n
103.82/95.64	
103.82/95.64	   Resulting cost 1+4*n has complexity: Poly(n^1)
103.82/95.64	
103.82/95.64	
103.82/95.64	
103.82/95.64	Obtained the following overall complexity (w.r.t. the length of the input n):
103.82/95.64	
103.82/95.64	   Complexity:  Poly(n^1)
103.82/95.64	
103.82/95.64	   Cpx degree:  1
103.82/95.64	
103.82/95.64	   Solved cost: -5+3*n
103.82/95.64	
103.82/95.64	   Rule cost:   -5+3*A
103.82/95.64	
103.82/95.64	   Rule guard:  [ B>=-1+2*A && -1+A>=2 ]
103.82/95.64	
103.82/95.64	
103.82/95.64	
103.82/95.64	WORST_CASE(Omega(n^1),?)
103.82/95.64	
103.82/95.64	
103.82/95.64	----------------------------------------
103.82/95.64	
103.82/95.64	(4)
103.82/95.64	BOUNDS(n^1, INF)
103.82/95.67	EOF