details

property	value
status	complete
benchmark	ex14.koat
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n005.star.cs.uiowa.edu
space	ABC

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	11.1993 seconds
cpu usage	15.9306
user time	15.433
system time	0.497615
max virtual memory	1.8674872E7
max residence set size	266216.0

stage attributes

key	value
starexec-result	WORST_CASE(Omega(n^4), O(n^7))

output

15.67/11.13 WORST_CASE(Omega(n^4), O(n^7)) 15.67/11.15 proof of /export/starexec/sandbox/benchmark/theBenchmark.koat 15.67/11.15 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 15.67/11.15 15.67/11.15 15.67/11.15 The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(n^4, nat(3 * Arg_0 * max(3 * Arg_1, min(3, 3 * Arg_1))) * nat(Arg_0 + Arg_1) + 2 * nat(3 * Arg_0 * max(3 * Arg_1, min(3, 3 * Arg_1))) * nat(Arg_0 + Arg_1) * nat(Arg_1) + nat(3 * Arg_0 * max(3 * Arg_1, min(3, 3 * Arg_1))) * nat(Arg_0 + Arg_1) * max(4, -2 + 6 * Arg_0 + 6 * nat(3 * Arg_0 * max(3 * Arg_1, min(3, 3 * Arg_1))) * nat(Arg_0 + Arg_1) * nat(Arg_1) + 6 * nat(3 * Arg_1) * nat(Arg_0 + Arg_1) * nat(Arg_1) + 6 * nat(-10 * Arg_3) * nat(Arg_1)) + nat(3 * Arg_0 * max(3 * Arg_1, min(3, 3 * Arg_1))) * nat(Arg_0 + Arg_1) * max(1, -1 + 2 * Arg_0 + 2 * nat(3 * Arg_1) * nat(Arg_0 + Arg_1) * nat(Arg_1) + 2 * nat(3 * Arg_0 * max(3 * Arg_1, min(3, 3 * Arg_1))) * nat(Arg_0 + Arg_1) * nat(Arg_1) + 2 * nat(-10 * Arg_3) * nat(Arg_1)) + 2 * nat(3 * Arg_1) * nat(Arg_0 + Arg_1) * nat(Arg_1) + nat(3 * Arg_1) * nat(Arg_0 + Arg_1) + nat(3 * Arg_1) * nat(Arg_0 + Arg_1) * max(1, -1 + 2 * Arg_0 + 2 * nat(3 * Arg_1) * nat(Arg_0 + Arg_1) * nat(Arg_1) + 2 * nat(3 * Arg_0 * max(3 * Arg_1, min(3, 3 * Arg_1))) * nat(Arg_0 + Arg_1) * nat(Arg_1) + 2 * nat(-10 * Arg_3) * nat(Arg_1)) + nat(3 * Arg_1) * nat(Arg_0 + Arg_1) * max(4, -2 + 6 * Arg_0 + 6 * nat(3 * Arg_1) * nat(Arg_0 + Arg_1) * nat(Arg_1) + 6 * nat(3 * Arg_0 * max(3 * Arg_1, min(3, 3 * Arg_1))) * nat(Arg_0 + Arg_1) * nat(Arg_1) + 6 * nat(-10 * Arg_3) * nat(Arg_1)) + 2 * nat(-10 * Arg_3) * nat(Arg_1) + nat(-10 * Arg_3) + nat(-10 * Arg_3) * max(1, -1 + 2 * Arg_0 + 2 * nat(3 * Arg_1) * nat(Arg_0 + Arg_1) * nat(Arg_1) + 2 * nat(3 * Arg_0 * max(3 * Arg_1, min(3, 3 * Arg_1))) * nat(Arg_0 + Arg_1) * nat(Arg_1) + 2 * nat(-10 * Arg_3) * nat(Arg_1)) + nat(-10 * Arg_3) * max(4, -2 + 6 * Arg_0 + 6 * nat(3 * Arg_1) * nat(Arg_0 + Arg_1) * nat(Arg_1) + 6 * nat(3 * Arg_0 * max(3 * Arg_1, min(3, 3 * Arg_1))) * nat(Arg_0 + Arg_1) * nat(Arg_1) + 6 * nat(-10 * Arg_3) * nat(Arg_1)) + nat(6 * Arg_0) + nat(-2 * Arg_4) + nat(3 * Arg_0 * max(min(4, 4 * Arg_1), 4 * Arg_1)) + nat(4 * Arg_1) + max(1, 2 + Arg_0) + nat(-9 * Arg_4) + max(3 + 6 * Arg_1, 3) + nat(6 * Arg_0 * max(3 * Arg_1, min(3, 3 * Arg_1)))). 15.67/11.15 15.67/11.15 (0) CpxIntTrs 15.67/11.15 (1) Koat2 Proof [FINISHED, 9087 ms] 15.67/11.15 (2) BOUNDS(1, nat(3 * Arg_0 * max(3 * Arg_1, min(3, 3 * Arg_1))) * nat(Arg_0 + Arg_1) + 2 * nat(3 * Arg_0 * max(3 * Arg_1, min(3, 3 * Arg_1))) * nat(Arg_0 + Arg_1) * nat(Arg_1) + nat(3 * Arg_0 * max(3 * Arg_1, min(3, 3 * Arg_1))) * nat(Arg_0 + Arg_1) * max(4, -2 + 6 * Arg_0 + 6 * nat(3 * Arg_0 * max(3 * Arg_1, min(3, 3 * Arg_1))) * nat(Arg_0 + Arg_1) * nat(Arg_1) + 6 * nat(3 * Arg_1) * nat(Arg_0 + Arg_1) * nat(Arg_1) + 6 * nat(-10 * Arg_3) * nat(Arg_1)) + nat(3 * Arg_0 * max(3 * Arg_1, min(3, 3 * Arg_1))) * nat(Arg_0 + Arg_1) * max(1, -1 + 2 * Arg_0 + 2 * nat(3 * Arg_1) * nat(Arg_0 + Arg_1) * nat(Arg_1) + 2 * nat(3 * Arg_0 * max(3 * Arg_1, min(3, 3 * Arg_1))) * nat(Arg_0 + Arg_1) * nat(Arg_1) + 2 * nat(-10 * Arg_3) * nat(Arg_1)) + 2 * nat(3 * Arg_1) * nat(Arg_0 + Arg_1) * nat(Arg_1) + nat(3 * Arg_1) * nat(Arg_0 + Arg_1) + nat(3 * Arg_1) * nat(Arg_0 + Arg_1) * max(1, -1 + 2 * Arg_0 + 2 * nat(3 * Arg_1) * nat(Arg_0 + Arg_1) * nat(Arg_1) + 2 * nat(3 * Arg_0 * max(3 * Arg_1, min(3, 3 * Arg_1))) * nat(Arg_0 + Arg_1) * nat(Arg_1) + 2 * nat(-10 * Arg_3) * nat(Arg_1)) + nat(3 * Arg_1) * nat(Arg_0 + Arg_1) * max(4, -2 + 6 * Arg_0 + 6 * nat(3 * Arg_1) * nat(Arg_0 + Arg_1) * nat(Arg_1) + 6 * nat(3 * Arg_0 * max(3 * Arg_1, min(3, 3 * Arg_1))) * nat(Arg_0 + Arg_1) * nat(Arg_1) + 6 * nat(-10 * Arg_3) * nat(Arg_1)) + 2 * nat(-10 * Arg_3) * nat(Arg_1) + nat(-10 * Arg_3) + nat(-10 * Arg_3) * max(1, -1 + 2 * Arg_0 + 2 * nat(3 * Arg_1) * nat(Arg_0 + Arg_1) * nat(Arg_1) + 2 * nat(3 * Arg_0 * max(3 * Arg_1, min(3, 3 * Arg_1))) * nat(Arg_0 + Arg_1) * nat(Arg_1) + 2 * nat(-10 * Arg_3) * nat(Arg_1)) + nat(-10 * Arg_3) * max(4, -2 + 6 * Arg_0 + 6 * nat(3 * Arg_1) * nat(Arg_0 + Arg_1) * nat(Arg_1) + 6 * nat(3 * Arg_0 * max(3 * Arg_1, min(3, 3 * Arg_1))) * nat(Arg_0 + Arg_1) * nat(Arg_1) + 6 * nat(-10 * Arg_3) * nat(Arg_1)) + nat(6 * Arg_0) + nat(-2 * Arg_4) + nat(3 * Arg_0 * max(min(4, 4 * Arg_1), 4 * Arg_1)) + nat(4 * Arg_1) + max(1, 2 + Arg_0) + nat(-9 * Arg_4) + max(3 + 6 * Arg_1, 3) + nat(6 * Arg_0 * max(3 * Arg_1, min(3, 3 * Arg_1)))) 15.67/11.15 (3) Loat Proof [FINISHED, 2127 ms] 15.67/11.15 (4) BOUNDS(n^4, INF) 15.67/11.15 15.67/11.15 15.67/11.15 ---------------------------------------- 15.67/11.15 15.67/11.15 (0) 15.67/11.15 Obligation: 15.67/11.15 Complexity Int TRS consisting of the following rules: 15.67/11.15 evalfstart(A, B, C, D, E) -> Com_1(evalfentryin(A, B, C, D, E)) :|: TRUE 15.67/11.15 evalfentryin(A, B, C, D, E) -> Com_1(evalfbb10in(B, A, C, D, E)) :|: TRUE 15.67/11.15 evalfbb10in(A, B, C, D, E) -> Com_1(evalfbb8in(A, B, 1, D, E)) :|: B >= 1 15.67/11.15 evalfbb10in(A, B, C, D, E) -> Com_1(evalfreturnin(A, B, C, D, E)) :|: 0 >= B 15.67/11.15 evalfbb8in(A, B, C, D, E) -> Com_1(evalfbb6in(A, B, C, B, E)) :|: A >= C 15.67/11.15 evalfbb8in(A, B, C, D, E) -> Com_1(evalfbb9in(A, B, C, D, E)) :|: C >= A + 1 15.67/11.15 evalfbb6in(A, B, C, D, E) -> Com_1(evalfbb4in(A, B, C, D, 1)) :|: B + C >= D 15.67/11.15 evalfbb6in(A, B, C, D, E) -> Com_1(evalfbb7in(A, B, C, D, E)) :|: D >= B + C + 1 15.67/11.15 evalfbb4in(A, B, C, D, E) -> Com_1(evalfbb3in(A, B, C, D, E)) :|: D >= E 15.67/11.15 evalfbb4in(A, B, C, D, E) -> Com_1(evalfbb5in(A, B, C, D, E)) :|: E >= D + 1 15.67/11.15 evalfbb3in(A, B, C, D, E) -> Com_1(evalfbb4in(A, B, C, D, E + 1)) :|: TRUE 15.67/11.15 evalfbb5in(A, B, C, D, E) -> Com_1(evalfbb6in(A, B, C, D + 1, E)) :|: TRUE 15.67/11.15 evalfbb7in(A, B, C, D, E) -> Com_1(evalfbb8in(A, B, C + 1, D, E)) :|: TRUE 15.67/11.15 evalfbb9in(A, B, C, D, E) -> Com_1(evalfbb10in(A, B - 1, C, D, E)) :|: TRUE 15.67/11.15 evalfreturnin(A, B, C, D, E) -> Com_1(evalfstop(A, B, C, D, E)) :|: TRUE 15.67/11.15 15.67/11.15 The start-symbols are:[evalfstart_5] 15.67/11.15 15.67/11.15 15.67/11.15 ---------------------------------------- 15.67/11.15 15.67/11.15 (1) Koat2 Proof (FINISHED) 15.67/11.15 YES( ?, 3+(max([0, 3*Arg_1])+max([0, 3*Arg_0*max([3*min([1, Arg_1]), 3*Arg_1])]))*max([0, Arg_0+Arg_1])+2*((max([0, 3*Arg_1])+max([0, 3*Arg_0*max([3*min([1, Arg_1]), 3*Arg_1])]))*max([0, Arg_0+Arg_1])+max([0, -10*Arg_3]))*max([0, Arg_1])+((max([0, 3*Arg_1])+max([0, 3*Arg_0*max([3*min([1, Arg_1]), 3*Arg_1])]))*max([0, Arg_0+Arg_1])+max([0, -10*Arg_3]))*max([4, -2+6*(Arg_0+((max([0, 3*Arg_1])+max([0, 3*Arg_0*max([3*min([1, Arg_1]), 3*Arg_1])]))*max([0, Arg_0+Arg_1])+max([0, -10*Arg_3]))*max([0, Arg_1]))])+((max([0, 3*Arg_1])+max([0, 3*Arg_0*max([3*min([1, Arg_1]), 3*Arg_1])]))*max([0, Arg_0+Arg_1])+max([0, -10*Arg_3]))*max([1, -1+2*(Arg_0+((max([0, 3*Arg_1])+max([0, 3*Arg_0*max([3*min([1, Arg_1]), 3*Arg_1])]))*max([0, Arg_0+Arg_1])+max([0, -10*Arg_3]))*max([0, Arg_1]))])+max([0, 3*Arg_0])+max([0, -2*Arg_4])+max([0, 3*Arg_0])+max([0, 3*Arg_0*max([3*min([1, Arg_1]), 3*Arg_1])])+max([0, 3*Arg_1])+max([0, 3*Arg_0*max([4*min([1, Arg_1]), 4*Arg_1])])+max([0, 4*Arg_1])+max([0, 3*Arg_0*max([3*min([1, Arg_1]), 3*Arg_1])])+max([0, 3*Arg_1])+max([0, -10*Arg_3])+max([1, 2+Arg_0])+max([0, -9*Arg_4]) {O(n^7)}) 15.67/11.15 15.67/11.15 15.67/11.15 15.67/11.15 Initial Complexity Problem: 15.67/11.15 15.67/11.15 Start: evalfstart 15.67/11.15 15.67/11.15 Program_Vars: Arg_0, Arg_1, Arg_2, Arg_3, Arg_4 15.67/11.15 15.67/11.15 Temp_Vars: 15.67/11.15 15.67/11.15 Locations: evalfbb10in, evalfbb3in, evalfbb4in, evalfbb5in, evalfbb6in, evalfbb7in, evalfbb8in, evalfbb9in, evalfentryin, evalfreturnin, evalfstart, evalfstop 15.67/11.15 15.67/11.15 Transitions: 15.67/11.15 15.67/11.15 evalfbb10in(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4) -> evalfbb8in(Arg_0,Arg_1,1,Arg_3,Arg_4):|:1 <= Arg_1 15.67/11.15 15.67/11.15 evalfbb10in(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4) -> evalfreturnin(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4):|:Arg_1 <= 0 15.67/11.15 15.67/11.15 evalfbb3in(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4) -> evalfbb4in(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4+1):|:Arg_4 <= Arg_3 && 1 <= Arg_4 && 2 <= Arg_3+Arg_4 && 2 <= Arg_2+Arg_4 && 2 <= Arg_1+Arg_4 && 2 <= Arg_0+Arg_4 && 1 <= Arg_3 && 2 <= Arg_2+Arg_3 && 2 <= Arg_1+Arg_3 && Arg_1 <= Arg_3 && 2 <= Arg_0+Arg_3 && Arg_2 <= Arg_0 && 1 <= Arg_2 && 2 <= Arg_1+Arg_2 && 2 <= Arg_0+Arg_2 && 1 <= Arg_1 && 2 <= Arg_0+Arg_1 && 1 <= Arg_0 15.67/11.15 15.67/11.15 evalfbb4in(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4) -> evalfbb3in(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4):|:1 <= Arg_4 && 2 <= Arg_3+Arg_4 && 2 <= Arg_2+Arg_4 && 2 <= Arg_1+Arg_4 && 2 <= Arg_0+Arg_4 && 1 <= Arg_3 && 2 <= Arg_2+Arg_3 && 2 <= Arg_1+Arg_3 && Arg_1 <= Arg_3 && 2 <= Arg_0+Arg_3 && Arg_2 <= Arg_0 && 1 <= Arg_2 && 2 <= Arg_1+Arg_2 && 2 <= Arg_0+Arg_2 && 1 <= Arg_1 && 2 <= Arg_0+Arg_1 && 1 <= Arg_0 && Arg_4 <= Arg_3 15.67/11.15 15.67/11.15 evalfbb4in(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4) -> evalfbb5in(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4):|:1 <= Arg_4 && 2 <= Arg_3+Arg_4 && 2 <= Arg_2+Arg_4 && 2 <= Arg_1+Arg_4 && 2 <= Arg_0+Arg_4 && 1 <= Arg_3 && 2 <= Arg_2+Arg_3 && 2 <= Arg_1+Arg_3 && Arg_1 <= Arg_3 && 2 <= Arg_0+Arg_3 && Arg_2 <= Arg_0 && 1 <= Arg_2 && 2 <= Arg_1+Arg_2 && 2 <= Arg_0+Arg_2 && 1 <= Arg_1 && 2 <= Arg_0+Arg_1 && 1 <= Arg_0 && Arg_3+1 <= Arg_4 15.67/11.15 15.67/11.15 evalfbb5in(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4) -> evalfbb6in(Arg_0,Arg_1,Arg_2,Arg_3+1,Arg_4):|:2 <= Arg_4 && 3 <= Arg_3+Arg_4 && 1+Arg_3 <= Arg_4 && 3 <= Arg_2+Arg_4 && 3 <= Arg_1+Arg_4 && 1+Arg_1 <= Arg_4 && 3 <= Arg_0+Arg_4 && 1 <= Arg_3 && 2 <= Arg_2+Arg_3 && 2 <= Arg_1+Arg_3 && Arg_1 <= Arg_3 && 2 <= Arg_0+Arg_3 && Arg_2 <= Arg_0 && 1 <= Arg_2 && 2 <= Arg_1+Arg_2 && 2 <= Arg_0+Arg_2 && 1 <= Arg_1 && 2 <= Arg_0+Arg_1 && 1 <= Arg_0 15.67/11.15 15.67/11.15 evalfbb6in(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4) -> evalfbb4in(Arg_0,Arg_1,Arg_2,Arg_3,1):|:1 <= Arg_3 && 2 <= Arg_2+Arg_3 && 2 <= Arg_1+Arg_3 && Arg_1 <= Arg_3 && 2 <= Arg_0+Arg_3 && Arg_2 <= Arg_0 && 1 <= Arg_2 && 2 <= Arg_1+Arg_2 && 2 <= Arg_0+Arg_2 && 1 <= Arg_1 && 2 <= Arg_0+Arg_1 && 1 <= Arg_0 && Arg_3 <= Arg_1+Arg_2 15.67/11.15 15.67/11.15 evalfbb6in(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4) -> evalfbb7in(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4):|:1 <= Arg_3 && 2 <= Arg_2+Arg_3 && 2 <= Arg_1+Arg_3 && Arg_1 <= Arg_3 && 2 <= Arg_0+Arg_3 && Arg_2 <= Arg_0 && 1 <= Arg_2 && 2 <= Arg_1+Arg_2 && 2 <= Arg_0+Arg_2 && 1 <= Arg_1 && 2 <= Arg_0+Arg_1 && 1 <= Arg_0 && Arg_1+Arg_2+1 <= Arg_3 15.67/11.15 15.67/11.15 evalfbb7in(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4) -> evalfbb8in(Arg_0,Arg_1,Arg_2+1,Arg_3,Arg_4):|:3 <= Arg_3 && 4 <= Arg_2+Arg_3 && 2+Arg_2 <= Arg_3 && 4 <= Arg_1+Arg_3 && 2+Arg_1 <= Arg_3 && 4 <= Arg_0+Arg_3 && Arg_2 <= Arg_0 && 1 <= Arg_2 && 2 <= Arg_1+Arg_2 && 2 <= Arg_0+Arg_2 && 1 <= Arg_1 && 2 <= Arg_0+Arg_1 && 1 <= Arg_0 15.67/11.15 15.67/11.15 evalfbb8in(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4) -> evalfbb6in(Arg_0,Arg_1,Arg_2,Arg_1,Arg_4):|:1 <= Arg_2 && 2 <= Arg_1+Arg_2 && 1 <= Arg_1 && Arg_2 <= Arg_0 15.67/11.15 15.67/11.15 evalfbb8in(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4) -> evalfbb9in(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4):|:1 <= Arg_2 && 2 <= Arg_1+Arg_2 && 1 <= Arg_1 && Arg_0+1 <= Arg_2 15.67/11.15 15.67/11.15 evalfbb9in(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4) -> evalfbb10in(Arg_0,Arg_1-1,Arg_2,Arg_3,Arg_4):|:1 <= Arg_2 && 2 <= Arg_1+Arg_2 && 1+Arg_0 <= Arg_2 && 1 <= Arg_1 15.67/11.15 15.67/11.15 evalfentryin(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4) -> evalfbb10in(Arg_1,Arg_0,Arg_2,Arg_3,Arg_4):|: 15.67/11.15 15.67/11.15 evalfreturnin(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4) -> evalfstop(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4):|:Arg_1 <= 0 15.67/11.15 15.67/11.15 evalfstart(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4) -> evalfentryin(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4):|: 15.67/11.15 15.67/11.15 15.67/11.15 15.67/11.15 Timebounds: 15.67/11.15 15.67/11.15 Overall timebound: 3+(max([0, 3*Arg_1])+max([0, 3*Arg_0*max([3*min([1, Arg_1]), 3*Arg_1])]))*max([0, Arg_0+Arg_1])+2*((max([0, 3*Arg_1])+max([0, 3*Arg_0*max([3*min([1, Arg_1]), 3*Arg_1])]))*max([0, Arg_0+Arg_1])+max([0, -10*Arg_3]))*max([0, Arg_1])+((max([0, 3*Arg_1])+max([0, 3*Arg_0*max([3*min([1, Arg_1]), 3*Arg_1])]))*max([0, Arg_0+Arg_1])+max([0, -10*Arg_3]))*max([4, -2+6*(Arg_0+((max([0, 3*Arg_1])+max([0, 3*Arg_0*max([3*min([1, Arg_1]), 3*Arg_1])]))*max([0, Arg_0+Arg_1])+max([0, -10*Arg_3]))*max([0, Arg_1]))])+((max([0, 3*Arg_1])+max([0, 3*Arg_0*max([3*min([1, Arg_1]), 3*Arg_1])]))*max([0, Arg_0+Arg_1])+max([0, -10*Arg_3]))*max([1, -1+2*(Arg_0+((max([0, 3*Arg_1])+max([0, 3*Arg_0*max([3*min([1, Arg_1]), 3*Arg_1])]))*max([0, Arg_0+Arg_1])+max([0, -10*Arg_3]))*max([0, Arg_1]))])+max([0, 3*Arg_0])+max([0, -2*Arg_4])+max([0, 3*Arg_0])+max([0, 3*Arg_0*max([3*min([1, Arg_1]), 3*Arg_1])])+max([0, 3*Arg_1])+max([0, 3*Arg_0*max([4*min([1, Arg_1]), 4*Arg_1])])+max([0, 4*Arg_1])+max([0, 3*Arg_0*max([3*min([1, Arg_1]), 3*Arg_1])])+max([0, 3*Arg_1])+max([0, -10*Arg_3])+max([1, 2+Arg_0])+max([0, -9*Arg_4]) {O(n^7)} 15.67/11.15 15.67/11.15 2: evalfbb10in->evalfbb8in: max([0, 1+Arg_0]) {O(n)} 15.67/11.15 15.67/11.15 3: evalfbb10in->evalfreturnin: 1 {O(1)} 15.67/11.15 15.67/11.15 10: evalfbb3in->evalfbb4in: ((max([0, 3*Arg_1])+max([0, 3*Arg_0*max([3*min([1, Arg_1]), 3*Arg_1])]))*max([0, Arg_0+Arg_1])+max([0, -10*Arg_3]))*max([1, -1+2*(Arg_0+((max([0, 3*Arg_1])+max([0, 3*Arg_0*max([3*min([1, Arg_1]), 3*Arg_1])]))*max([0, Arg_0+Arg_1])+max([0, -10*Arg_3]))*max([0, Arg_1]))])+max([0, -9*Arg_4]) {O(n^7)} 15.67/11.15 15.67/11.15 8: evalfbb4in->evalfbb3in: ((max([0, 3*Arg_1])+max([0, 3*Arg_0*max([3*min([1, Arg_1]), 3*Arg_1])]))*max([0, Arg_0+Arg_1])+max([0, -10*Arg_3]))*max([4, -2+6*(Arg_0+((max([0, 3*Arg_1])+max([0, 3*Arg_0*max([3*min([1, Arg_1]), 3*Arg_1])]))*max([0, Arg_0+Arg_1])+max([0, -10*Arg_3]))*max([0, Arg_1]))])+max([0, -2*Arg_4]) {O(n^7)} popout

output may be truncated. 'popout' for the full output.

job log

popout

actions

all output return to Complexity_ITS 2019-03-21 04.46