Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Complexity_ITS 2019-03-21 04.46 pair #429990868
details
property
value
status
complete
benchmark
ludcmp.koat
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n105.star.cs.uiowa.edu
space
T2
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
20.8892 seconds
cpu usage
38.7496
user time
37.4615
system time
1.28803
max virtual memory
1.898904E7
max residence set size
291348.0
stage attributes
key
value
starexec-result
WORST_CASE(Omega(n^1), O(n^1))
output
38.63/20.85 WORST_CASE(Omega(n^1), O(n^1)) 38.63/20.86 proof of /export/starexec/sandbox/benchmark/theBenchmark.koat 38.63/20.86 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 38.63/20.86 38.63/20.86 38.63/20.86 The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(n^1, nat(max(3 * Arg_1, 3 * Arg_1 + nat(6 + 6 * Arg_0 + -6 * Arg_1)) + max(-3 * Arg_3, min(-3 * Arg_3 + min(-6 + -6 * Arg_0 + 6 * Arg_3, 0), -3 * Arg_3))) + nat(1 + 2 * Arg_0 + max(-2 * Arg_3, min(-2 * Arg_3 + min(-4 + -4 * Arg_0 + 4 * Arg_3, 0), -2 * Arg_3))) + nat(2 + 2 * Arg_0 + -2 * Arg_1) + nat(-1 * Arg_7 + max(Arg_1 + nat(2 + 2 * Arg_0 + -2 * Arg_1), Arg_1)) + nat(2 * Arg_0 + max(-2 * Arg_3, min(-2 * Arg_3 + min(-4 + -4 * Arg_0 + 4 * Arg_3, 0), -2 * Arg_3))) + max(1, 7 + 6 * Arg_0 + -6 * Arg_3) + nat(-3 * Arg_3 + max(3 * Arg_1 + nat(6 + 6 * Arg_0 + -6 * Arg_1), 3 * Arg_1)) + max(2, 4 + 2 * Arg_0 + -2 * Arg_1) + nat(3 * Arg_0 + max(-3 * Arg_3, min(-3 * Arg_3 + min(-6 + -6 * Arg_0 + 6 * Arg_3, 0), -3 * Arg_3)))). 38.63/20.86 38.63/20.86 (0) CpxIntTrs 38.63/20.86 (1) Koat2 Proof [FINISHED, 13.4 s] 38.63/20.86 (2) BOUNDS(1, nat(max(3 * Arg_1, 3 * Arg_1 + nat(6 + 6 * Arg_0 + -6 * Arg_1)) + max(-3 * Arg_3, min(-3 * Arg_3 + min(-6 + -6 * Arg_0 + 6 * Arg_3, 0), -3 * Arg_3))) + nat(1 + 2 * Arg_0 + max(-2 * Arg_3, min(-2 * Arg_3 + min(-4 + -4 * Arg_0 + 4 * Arg_3, 0), -2 * Arg_3))) + nat(2 + 2 * Arg_0 + -2 * Arg_1) + nat(-1 * Arg_7 + max(Arg_1 + nat(2 + 2 * Arg_0 + -2 * Arg_1), Arg_1)) + nat(2 * Arg_0 + max(-2 * Arg_3, min(-2 * Arg_3 + min(-4 + -4 * Arg_0 + 4 * Arg_3, 0), -2 * Arg_3))) + max(1, 7 + 6 * Arg_0 + -6 * Arg_3) + nat(-3 * Arg_3 + max(3 * Arg_1 + nat(6 + 6 * Arg_0 + -6 * Arg_1), 3 * Arg_1)) + max(2, 4 + 2 * Arg_0 + -2 * Arg_1) + nat(3 * Arg_0 + max(-3 * Arg_3, min(-3 * Arg_3 + min(-6 + -6 * Arg_0 + 6 * Arg_3, 0), -3 * Arg_3)))) 38.63/20.86 (3) Loat Proof [FINISHED, 19.1 s] 38.63/20.86 (4) BOUNDS(n^1, INF) 38.63/20.86 38.63/20.86 38.63/20.86 ---------------------------------------- 38.63/20.86 38.63/20.86 (0) 38.63/20.86 Obligation: 38.63/20.86 Complexity Int TRS consisting of the following rules: 38.63/20.86 f69(A, B, C, D, E, F, G, H, I, J, K) -> Com_1(f71(A, B, C, D, E, F, G, H, I, J, K)) :|: 0 >= L + 1 38.63/20.86 f69(A, B, C, D, E, F, G, H, I, J, K) -> Com_1(f71(A, B, C, D, E, F, G, H, I, J, K)) :|: TRUE 38.63/20.86 f0(A, B, C, D, E, F, G, H, I, J, K) -> Com_1(f12(A, B, C, D, E, F, G, H, I, J, K)) :|: TRUE 38.63/20.86 f12(A, B, C, D, E, F, G, H, I, J, K) -> Com_1(f15(A, B, 0, D, E, F, G, H, I, J, K)) :|: A >= B 38.63/20.86 f15(A, B, C, D, E, F, G, H, I, J, K) -> Com_1(f15(A, B, C, D + 1, L, L, G, H, I, J, K)) :|: C >= L && A >= D 38.63/20.86 f15(A, B, C, D, E, F, G, H, I, J, K) -> Com_1(f15(A, B, L, D + 1, L, L, G, H, I, J, K)) :|: L >= 1 + C && A >= D 38.63/20.86 f28(A, B, C, D, E, F, G, H, I, J, K) -> Com_1(f30(A, B, C, D, E, F, G, H, I, J, K)) :|: A >= D 38.63/20.86 f30(A, B, C, D, E, F, G, H, I, J, K) -> Com_1(f33(A, B, C, D, E, F, L, H, I, J, K)) :|: D >= B + 1 38.63/20.86 f33(A, B, C, D, E, F, G, H, I, J, K) -> Com_1(f33(A, B, C, D, E, F, L, H + 1, I, J, K)) :|: B >= H + 1 38.63/20.86 f42(A, B, C, D, E, F, G, H, I, J, K) -> Com_1(f45(A, B, C, D, E, F, L, H, I, J, K)) :|: A >= B 38.63/20.86 f45(A, B, C, D, E, F, G, H, I, J, K) -> Com_1(f45(A, B, C, D, E, F, L, H + 1, I, J, K)) :|: D >= H + 1 38.63/20.86 f59(A, B, C, D, E, F, G, H, I, J, K) -> Com_1(f59(A, B, C, D, E, F, G, H + 1, L, J, K)) :|: A >= H 38.63/20.86 f71(A, B, C, D, E, F, G, H, I, J, K) -> Com_1(f73(A, B, C, D, E, F, G, H, L, J, K)) :|: A >= D + 1 38.63/20.86 f71(A, B, C, D, E, F, G, H, I, J, K) -> Com_1(f73(A, B, C, D, E, F, G, H, L, J, K)) :|: D >= 1 + A 38.63/20.86 f73(A, B, C, D, E, F, G, H, I, J, K) -> Com_1(f73(A, B + 1, C, D, E, F, G, H, I, J, K)) :|: A >= B 38.63/20.86 f71(A, B, C, D, E, F, G, H, I, J, K) -> Com_1(f28(A, B, C, A + 1, E, F, G, H, I, J, K)) :|: A >= D && A <= D 38.63/20.86 f73(A, B, C, D, E, F, G, H, I, J, K) -> Com_1(f28(A, B, C, D + 1, E, F, G, H, I, J, K)) :|: B >= 1 + A 38.63/20.86 f59(A, B, C, D, E, F, G, H, I, J, K) -> Com_1(f69(A, B, C, D, E, F, G, H, I, J, K)) :|: H >= 1 + A 38.63/20.86 f45(A, B, C, D, E, F, G, H, I, J, K) -> Com_1(f42(A, B + 1, C, D, E, F, G, H, M, L, K)) :|: C >= M + 1 && H >= D 38.63/20.86 f45(A, B, C, D, E, F, G, H, I, J, K) -> Com_1(f42(A, B + 1, L, D, E, F, G, H, L, M, B)) :|: L >= C && H >= D 38.63/20.86 f42(A, B, C, D, E, F, G, H, I, J, K) -> Com_1(f59(A, B, C, D, E, F, G, H, I, J, K)) :|: B >= 1 + A && K >= D + 1 38.63/20.86 f42(A, B, C, D, E, F, G, H, I, J, K) -> Com_1(f59(A, B, C, D, E, F, G, H, I, J, K)) :|: B >= 1 + A && D >= 1 + K 38.63/20.86 f42(A, B, C, D, E, F, G, H, I, J, K) -> Com_1(f69(A, B, C, D, E, F, G, H, I, J, D)) :|: B >= 1 + A && D >= K && D <= K 38.63/20.86 f33(A, B, C, D, E, F, G, H, I, J, K) -> Com_1(f30(A, B + 1, C, D, E, F, G, H, I, J, K)) :|: H >= B 38.63/20.86 f30(A, B, C, D, E, F, G, H, I, J, K) -> Com_1(f42(A, B, 0, D, E, F, G, H, I, J, K)) :|: B >= D 38.63/20.86 f28(A, B, C, D, E, F, G, H, I, J, K) -> Com_1(f82(A, B, C, D, E, F, G, H, I, J, K)) :|: D >= 1 + A 38.63/20.86 f15(A, B, C, D, E, F, G, H, I, J, K) -> Com_1(f12(A, B + 1, C, D, E, F, G, H, I, J, K)) :|: 0 >= C + 1 && D >= 1 + A 38.63/20.86 f15(A, B, C, D, E, F, G, H, I, J, K) -> Com_1(f12(A, B + 1, C, D, E, F, G, H, I, J, K)) :|: C >= 1 && D >= 1 + A 38.63/20.86 f15(A, B, C, D, E, F, G, H, I, J, K) -> Com_1(f12(A, B + 1, 0, D, E, F, G, H, I, J, K)) :|: D >= 1 + A && C >= 0 && C <= 0 38.63/20.86 f12(A, B, C, D, E, F, G, H, I, J, K) -> Com_1(f28(A, B, C, D, E, F, G, H, I, J, K)) :|: B >= 1 + A 38.63/20.86 38.63/20.86 The start-symbols are:[f0_11] 38.63/20.86 38.63/20.86 38.63/20.86 ---------------------------------------- 38.63/20.86 38.63/20.86 (1) Koat2 Proof (FINISHED) 38.63/20.86 YES( ?, 1+2*2*max([0, 1+Arg_0-Arg_3])+max([0, 3*Arg_0+max([-3*Arg_3, -3*max([Arg_3, Arg_3+2*max([0, 1+Arg_0-Arg_3])])])])+max([0, 1+Arg_0-Arg_1])+max([0, 2*Arg_0+max([-2*Arg_3, -2*max([Arg_3, Arg_3+2*max([0, 1+Arg_0-Arg_3])])])])+max([0, 1+Arg_0-Arg_3])+max([0, -(Arg_3)+max([Arg_1, Arg_1+2*max([0, 1+Arg_0-Arg_1])])])+max([2, 2+2+2*Arg_0+-2*Arg_1])+max([0, -(Arg_3)+max([Arg_1, Arg_1+2*max([0, 1+Arg_0-Arg_1])])])+max([0, 1+Arg_0-Arg_3])+max([0, -(Arg_3)+max([Arg_1, Arg_1+2*max([0, 1+Arg_0-Arg_1])])])+max([0, 1+Arg_0-Arg_1])+max([0, max([3*Arg_1, 3*max([Arg_1, Arg_1+2*max([0, 1+Arg_0-Arg_1])])])+max([-3*Arg_3, -3*max([Arg_3, Arg_3+2*max([0, 1+Arg_0-Arg_3])])])])+max([0, 1+2*Arg_0+max([-2*Arg_3, -2*max([Arg_3, Arg_3+2*max([0, 1+Arg_0-Arg_3])])])])+max([0, -(Arg_7)+max([Arg_1, Arg_1+2*max([0, 1+Arg_0-Arg_1])])]) {O(n)}) 38.63/20.86 38.63/20.86 38.63/20.86 38.63/20.86 Initial Complexity Problem: 38.63/20.86 38.63/20.86 Start: f0 38.63/20.86 38.63/20.86 Program_Vars: Arg_0, Arg_1, Arg_2, Arg_3, Arg_4, Arg_5, Arg_6, Arg_7, Arg_8, Arg_9, Arg_10 38.63/20.86 38.63/20.86 Temp_Vars: L 38.63/20.86 38.63/20.86 Locations: f0, f12, f15, f28, f30, f42, f59, f69, f71, f73, f82 38.63/20.86 38.63/20.86 Transitions: 38.63/20.86 38.63/20.86 f0(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10) -> f12(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10):|: 38.63/20.86 38.63/20.86 f12(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10) -> f15(Arg_0,Arg_1,0,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10):|:Arg_1 <= Arg_0 38.63/20.86 38.63/20.86 f12(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10) -> f28(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10):|:1+Arg_0 <= Arg_1 38.63/20.86 38.63/20.86 f15(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10) -> f12(Arg_0,Arg_1+1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10):|:0 <= Arg_2 && Arg_1 <= Arg_0 && 1 <= Arg_2 && 1+Arg_0 <= Arg_3 38.63/20.86 38.63/20.86 f15(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10) -> f12(Arg_0,Arg_1+1,0,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10):|:0 <= Arg_2 && Arg_1 <= Arg_0 && 1+Arg_0 <= Arg_3 && Arg_2 <= 0 && 0 <= Arg_2 38.63/20.86 38.63/20.86 f15(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10) -> f15(Arg_0,Arg_1,Arg_2,Arg_3+1,L,L,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10):|:0 <= Arg_2 && Arg_1 <= Arg_0 && L <= Arg_2 && Arg_3 <= Arg_0 38.63/20.86 38.63/20.86 f15(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10) -> f15(Arg_0,Arg_1,L,Arg_3+1,L,L,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10):|:0 <= Arg_2 && Arg_1 <= Arg_0 && 1+Arg_2 <= L && Arg_3 <= Arg_0 38.63/20.86 38.63/20.86 f28(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10) -> f30(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10):|:1+Arg_0 <= Arg_1 && Arg_3 <= Arg_0 38.63/20.86 38.63/20.86 f28(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10) -> f82(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10):|:1+Arg_0 <= Arg_1 && 1+Arg_0 <= Arg_3 38.63/20.86 38.63/20.86 f30(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10) -> f42(Arg_0,Arg_1,0,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10):|:1+Arg_3 <= Arg_1 && Arg_3 <= Arg_0 && 1+Arg_0 <= Arg_1 && Arg_3 <= Arg_1 38.63/20.86 38.63/20.86 f42(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10) -> f59(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10):|:1+Arg_3 <= Arg_1 && Arg_3 <= Arg_0 && Arg_2 <= 0 && 0 <= Arg_2 && 1+Arg_0 <= Arg_1 && 1+Arg_0 <= Arg_1 && Arg_3+1 <= Arg_10 38.63/20.86 38.63/20.86 f42(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10) -> f59(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10):|:1+Arg_3 <= Arg_1 && Arg_3 <= Arg_0 && Arg_2 <= 0 && 0 <= Arg_2 && 1+Arg_0 <= Arg_1 && 1+Arg_0 <= Arg_1 && 1+Arg_10 <= Arg_3 38.63/20.86 38.63/20.86 f42(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10) -> f69(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_3):|:1+Arg_3 <= Arg_1 && Arg_3 <= Arg_0 && Arg_2 <= 0 && 0 <= Arg_2 && 1+Arg_0 <= Arg_1 && 1+Arg_0 <= Arg_1 && Arg_3 <= Arg_10 && Arg_10 <= Arg_3 38.63/20.86 38.63/20.86 f59(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10) -> f59(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7+1,L,Arg_9,Arg_10):|:1+Arg_3 <= Arg_1 && Arg_3 <= Arg_0 && Arg_2 <= 0 && 0 <= Arg_2 && 1+Arg_0 <= Arg_1 && Arg_7 <= Arg_0 38.63/20.86
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