Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Complexity_ITS 2019-03-21 04.46 pair #429990812
details
property
value
status
complete
benchmark
elmhes.koat
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n081.star.cs.uiowa.edu
space
T2
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
19.42 seconds
cpu usage
28.0892
user time
27.4509
system time
0.638387
max virtual memory
1.875642E7
max residence set size
235888.0
stage attributes
key
value
starexec-result
WORST_CASE(Omega(n^1), O(n^2))
output
28.00/19.36 WORST_CASE(Omega(n^1), O(n^2)) 28.02/19.37 proof of /export/starexec/sandbox/benchmark/theBenchmark.koat 28.02/19.37 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 28.02/19.37 28.02/19.37 28.02/19.37 The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(n^1, n^2). 28.02/19.37 28.02/19.37 (0) CpxIntTrs 28.02/19.37 (1) Koat Proof [FINISHED, 820 ms] 28.02/19.37 (2) BOUNDS(1, n^2) 28.02/19.37 (3) Loat Proof [FINISHED, 5619 ms] 28.02/19.37 (4) BOUNDS(n^1, INF) 28.02/19.37 28.02/19.37 28.02/19.37 ---------------------------------------- 28.02/19.37 28.02/19.37 (0) 28.02/19.37 Obligation: 28.02/19.37 Complexity Int TRS consisting of the following rules: 28.02/19.37 f0(A, B, C, D, E, F, G, H) -> Com_1(f12(A, B, 0, B, E, F, G, H)) :|: A >= B + 1 28.02/19.37 f12(A, B, C, D, E, F, G, H) -> Com_1(f12(A, B, C, D, E + 1, J, I, H)) :|: A >= E && I >= J 28.02/19.37 f12(A, B, C, D, E, F, G, H) -> Com_1(f12(A, B, J, E, E + 1, I, K, H)) :|: A >= E && I >= 1 + K 28.02/19.37 f22(A, B, C, D, E, F, G, H) -> Com_1(f22(A, B, C, D, E + 1, F, G, J)) :|: A >= E 28.02/19.37 f29(A, B, C, D, E, F, G, H) -> Com_1(f29(A, B, C, D, E + 1, F, G, J)) :|: A >= E 28.02/19.37 f35(A, B, C, D, E, F, G, H) -> Com_1(f37(A, B, C, D, E, F, G, H)) :|: 0 >= C + 1 28.02/19.37 f35(A, B, C, D, E, F, G, H) -> Com_1(f37(A, B, C, D, E, F, G, H)) :|: C >= 1 28.02/19.37 f37(A, B, C, D, E, F, G, H) -> Com_1(f43(A, B, C, D, E, F, G, J)) :|: A >= D && 0 >= I + 1 28.02/19.37 f37(A, B, C, D, E, F, G, H) -> Com_1(f43(A, B, C, D, E, F, G, J)) :|: A >= D && I >= 1 28.02/19.37 f43(A, B, C, D, E, F, G, H) -> Com_1(f43(A, B, C, D, E + 1, F, G, H)) :|: A >= E 28.02/19.37 f48(A, B, C, D, E, F, G, H) -> Com_1(f48(A, B, C, D, E + 1, F, G, H)) :|: A >= E 28.02/19.37 f37(A, B, C, D, E, F, G, H) -> Com_1(f37(A, B, C, D + 1, E, F, G, 0)) :|: A >= D 28.02/19.37 f35(A, B, C, D, E, F, G, H) -> Com_1(f0(A, B + 1, 0, D, E, F, G, H)) :|: C >= 0 && C <= 0 28.02/19.37 f48(A, B, C, D, E, F, G, H) -> Com_1(f37(A, B, C, D + 1, E, F, G, H)) :|: E >= 1 + A 28.02/19.37 f43(A, B, C, D, E, F, G, H) -> Com_1(f48(A, B, C, D, E, F, G, H)) :|: E >= 1 + A 28.02/19.37 f37(A, B, C, D, E, F, G, H) -> Com_1(f0(A, B + 1, C, D, E, F, G, H)) :|: D >= 1 + A 28.02/19.37 f29(A, B, C, D, E, F, G, H) -> Com_1(f35(A, B, C, D, E, F, G, H)) :|: E >= 1 + A 28.02/19.37 f22(A, B, C, D, E, F, G, H) -> Com_1(f29(A, B, C, D, E, F, G, H)) :|: E >= 1 + A 28.02/19.37 f12(A, B, C, D, E, F, G, H) -> Com_1(f35(A, B, C, B, E, F, G, H)) :|: E >= 1 + A && B >= D && B <= D 28.02/19.37 f12(A, B, C, D, E, F, G, H) -> Com_1(f22(A, B, C, D, E, F, G, H)) :|: B >= D + 1 && E >= 1 + A 28.02/19.37 f12(A, B, C, D, E, F, G, H) -> Com_1(f22(A, B, C, D, E, F, G, H)) :|: D >= 1 + B && E >= 1 + A 28.02/19.37 f0(A, B, C, D, E, F, G, H) -> Com_1(f58(A, B, C, D, E, F, G, H)) :|: B >= A 28.02/19.37 start(A, B, C, D, E, F, G, H) -> Com_1(f0(A, B, C, D, E, F, G, H)) :|: TRUE 28.02/19.37 28.02/19.37 The start-symbols are:[start_8] 28.02/19.37 28.02/19.37 28.02/19.37 ---------------------------------------- 28.02/19.37 28.02/19.37 (1) Koat Proof (FINISHED) 28.02/19.37 YES(?, 312460831275774*ar_0 + 44637261614347*ar_1 + 267823569665387*ar_4 + 5040*ar_0^2 + 9150*ar_0*ar_4 + 5550*ar_0*ar_1 + 4830*ar_1*ar_4 + 690*ar_1^2 + 4140*ar_4^2 + 267823569661249) 28.02/19.37 28.02/19.37 28.02/19.37 28.02/19.37 Initial complexity problem: 28.02/19.37 28.02/19.37 1: T: 28.02/19.37 28.02/19.37 (Comp: ?, Cost: 1) f0(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(f12(ar_0, ar_1, 0, ar_1, ar_4, ar_5, ar_6, ar_7)) [ ar_0 >= ar_1 + 1 ] 28.02/19.37 28.02/19.37 (Comp: ?, Cost: 1) f12(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(f12(ar_0, ar_1, ar_2, ar_3, ar_4 + 1, j, i, ar_7)) [ ar_0 >= ar_4 /\ i >= j ] 28.02/19.37 28.02/19.37 (Comp: ?, Cost: 1) f12(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(f12(ar_0, ar_1, j, ar_4, ar_4 + 1, i, k, ar_7)) [ ar_0 >= ar_4 /\ i >= k + 1 ] 28.02/19.37 28.02/19.37 (Comp: ?, Cost: 1) f22(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(f22(ar_0, ar_1, ar_2, ar_3, ar_4 + 1, ar_5, ar_6, j)) [ ar_0 >= ar_4 ] 28.02/19.37 28.02/19.37 (Comp: ?, Cost: 1) f29(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(f29(ar_0, ar_1, ar_2, ar_3, ar_4 + 1, ar_5, ar_6, j)) [ ar_0 >= ar_4 ] 28.02/19.37 28.02/19.37 (Comp: ?, Cost: 1) f35(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(f37(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ 0 >= ar_2 + 1 ] 28.02/19.37 28.02/19.37 (Comp: ?, Cost: 1) f35(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(f37(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ ar_2 >= 1 ] 28.02/19.37 28.02/19.37 (Comp: ?, Cost: 1) f37(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(f43(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, j)) [ ar_0 >= ar_3 /\ 0 >= i + 1 ] 28.02/19.37 28.02/19.37 (Comp: ?, Cost: 1) f37(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(f43(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, j)) [ ar_0 >= ar_3 /\ i >= 1 ] 28.02/19.37 28.02/19.37 (Comp: ?, Cost: 1) f43(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(f43(ar_0, ar_1, ar_2, ar_3, ar_4 + 1, ar_5, ar_6, ar_7)) [ ar_0 >= ar_4 ] 28.02/19.37 28.02/19.37 (Comp: ?, Cost: 1) f48(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(f48(ar_0, ar_1, ar_2, ar_3, ar_4 + 1, ar_5, ar_6, ar_7)) [ ar_0 >= ar_4 ] 28.02/19.37 28.02/19.37 (Comp: ?, Cost: 1) f37(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(f37(ar_0, ar_1, ar_2, ar_3 + 1, ar_4, ar_5, ar_6, 0)) [ ar_0 >= ar_3 ] 28.02/19.37 28.02/19.37 (Comp: ?, Cost: 1) f35(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(f0(ar_0, ar_1 + 1, 0, ar_3, ar_4, ar_5, ar_6, ar_7)) [ ar_2 = 0 ] 28.02/19.37 28.02/19.37 (Comp: ?, Cost: 1) f48(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(f37(ar_0, ar_1, ar_2, ar_3 + 1, ar_4, ar_5, ar_6, ar_7)) [ ar_4 >= ar_0 + 1 ] 28.02/19.37 28.02/19.37 (Comp: ?, Cost: 1) f43(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(f48(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ ar_4 >= ar_0 + 1 ] 28.02/19.37 28.02/19.37 (Comp: ?, Cost: 1) f37(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(f0(ar_0, ar_1 + 1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ ar_3 >= ar_0 + 1 ] 28.02/19.37 28.02/19.37 (Comp: ?, Cost: 1) f29(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(f35(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ ar_4 >= ar_0 + 1 ] 28.02/19.37 28.02/19.37 (Comp: ?, Cost: 1) f22(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(f29(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ ar_4 >= ar_0 + 1 ] 28.02/19.37 28.02/19.37 (Comp: ?, Cost: 1) f12(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(f35(ar_0, ar_1, ar_2, ar_1, ar_4, ar_5, ar_6, ar_7)) [ ar_4 >= ar_0 + 1 /\ ar_1 = ar_3 ] 28.02/19.37 28.02/19.37 (Comp: ?, Cost: 1) f12(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(f22(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ ar_1 >= ar_3 + 1 /\ ar_4 >= ar_0 + 1 ] 28.02/19.37 28.02/19.37 (Comp: ?, Cost: 1) f12(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(f22(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ ar_3 >= ar_1 + 1 /\ ar_4 >= ar_0 + 1 ] 28.02/19.37 28.02/19.37 (Comp: ?, Cost: 1) f0(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(f58(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ ar_1 >= ar_0 ]
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