Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Complexity_ITS 2019-03-21 04.46 pair #429990564
details
property
value
status
complete
benchmark
fun1.koat
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n074.star.cs.uiowa.edu
space
T2
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
16.1486 seconds
cpu usage
36.656
user time
35.7223
system time
0.933739
max virtual memory
1.8997272E7
max residence set size
331984.0
stage attributes
key
value
starexec-result
WORST_CASE(NON_POLY, ?)
output
36.53/16.10 WORST_CASE(NON_POLY, ?) 36.60/16.12 proof of /export/starexec/sandbox/benchmark/theBenchmark.koat 36.60/16.12 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 36.60/16.12 36.60/16.12 36.60/16.12 The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(INF, INF). 36.60/16.12 36.60/16.12 (0) CpxIntTrs 36.60/16.12 (1) Loat Proof [FINISHED, 14.3 s] 36.60/16.12 (2) BOUNDS(INF, INF) 36.60/16.12 36.60/16.12 36.60/16.12 ---------------------------------------- 36.60/16.12 36.60/16.12 (0) 36.60/16.12 Obligation: 36.60/16.12 Complexity Int TRS consisting of the following rules: 36.60/16.12 f0(A, B, C, D, E, F, G, H, I, J, K, L, M, N) -> Com_1(f1(A, B, C, D, E, F, G, H, I, J, K, L, M, N)) :|: TRUE 36.60/16.12 f1(A, B, C, D, E, F, G, H, I, J, K, L, M, N) -> Com_1(f7(1, C, C, E, E, P, O, 0, 1, P, O, 7, M, N)) :|: 7 >= O && 7 >= P && 3 >= O && O >= 1 && P >= 1 36.60/16.12 f1(A, B, C, D, E, F, G, H, I, J, K, L, M, N) -> Com_1(f7(1, C, C, E, E, P, O, 0, 1, P, O, 7, M, N)) :|: 7 >= O && 7 >= P && O >= 5 && P >= 1 36.60/16.12 f1(A, B, C, D, E, F, G, H, I, J, K, L, M, N) -> Com_1(f7(1, C + 1, C + 1, E + 1, E + 1, P, 4, 1, 1, P, 4, 7, M, N)) :|: 7 >= P && P >= 1 36.60/16.12 f1(A, B, C, D, E, F, G, H, I, J, K, L, M, N) -> Com_1(f2(0, C, C, E, E, 3, P, 0, 0, 3, P, 2, M, N)) :|: 7 >= P && 3 >= P && P >= 1 36.60/16.12 f1(A, B, C, D, E, F, G, H, I, J, K, L, M, N) -> Com_1(f2(0, C, C, E, E, 3, P, 0, 0, 3, P, 2, M, N)) :|: 7 >= P && P >= 5 36.60/16.12 f1(A, B, C, D, E, F, G, H, I, J, K, L, M, N) -> Com_1(f2(0, C + 1, C + 1, E + 1, E + 1, 3, 4, 1, 0, 3, 4, 2, M, N)) :|: TRUE 36.60/16.12 f2(A, B, C, D, E, F, G, H, I, J, K, L, M, N) -> Com_1(f7(1, C, C, E, E, P, O, H, 1, P, O, 7, M, N)) :|: 7 >= O && 7 >= P && 3 >= O && O >= 1 && P >= 1 36.60/16.12 f2(A, B, C, D, E, F, G, H, I, J, K, L, M, N) -> Com_1(f7(1, C, C, E, E, P, O, H, 1, P, O, 7, M, N)) :|: 7 >= O && 7 >= P && O >= 5 && P >= 1 36.60/16.12 f2(A, B, C, D, E, F, G, H, I, J, K, L, M, N) -> Com_1(f7(1, C + 1, C + 1, E + 1, E + 1, P, 4, 1, 1, P, 4, 7, M, N)) :|: 7 >= P && P >= 1 36.60/16.12 f2(A, B, C, D, E, F, G, H, I, J, K, L, M, N) -> Com_1(f3(0, C, C, E, E, P, O, H, 0, P, O, 3, M, N)) :|: 7 >= O && 7 >= P && 3 >= O && O >= 1 && P >= 1 36.60/16.12 f2(A, B, C, D, E, F, G, H, I, J, K, L, M, N) -> Com_1(f3(0, C, C, E, E, P, O, H, 0, P, O, 3, M, N)) :|: 7 >= O && 7 >= P && O >= 5 && P >= 1 36.60/16.12 f2(A, B, C, D, E, F, G, H, I, J, K, L, M, N) -> Com_1(f3(0, C + 1, C + 1, E + 1, E + 1, P, 4, 1, 0, P, 4, 3, M, N)) :|: 7 >= P && P >= 1 36.60/16.12 f3(A, B, C, D, E, F, G, H, I, J, K, L, M, N) -> Com_1(f6(1, C, C, E, E, P, O, H, 1, P, O, 6, M, N)) :|: 7 >= O && 7 >= P && 3 >= O && O >= 1 && P >= 1 36.60/16.12 f3(A, B, C, D, E, F, G, H, I, J, K, L, M, N) -> Com_1(f6(1, C, C, E, E, P, O, H, 1, P, O, 6, M, N)) :|: 7 >= O && 7 >= P && O >= 5 && P >= 1 36.60/16.12 f3(A, B, C, D, E, F, G, H, I, J, K, L, M, N) -> Com_1(f6(1, C + 1, C + 1, E + 1, E + 1, P, 4, 1, 1, P, 4, 6, M, N)) :|: 7 >= P && P >= 1 36.60/16.12 f6(A, B, C, D, E, F, G, H, I, J, K, L, M, N) -> Com_1(f4(1, C, C, E, E, P, 2, 0, 1, P, 2, 4, M, N)) :|: P >= 1 && 7 >= P 36.60/16.12 f6(A, B, C, D, E, F, G, H, I, J, K, L, M, N) -> Com_1(f4(P, C, C, E, E, O, 7, 1, P, O, 7, 4, M, N)) :|: 7 >= O && 1 >= P && P >= 0 && O >= 1 && H >= 1 && H <= 1 36.60/16.12 f4(A, B, C, D, E, F, G, H, I, J, K, L, M, N) -> Com_1(f2(0, C, C, E, E, P, O, 1, 0, P, O, 2, M, N)) :|: M >= 1 && M >= E + 1 && N >= 1 && N >= C + 1 && 7 >= O && 7 >= P && 3 >= O && O >= 1 && P >= 1 && H >= 1 && H <= 1 36.60/16.12 f4(A, B, C, D, E, F, G, H, I, J, K, L, M, N) -> Com_1(f2(0, C, C, E, E, P, O, 1, 0, P, O, 2, M, N)) :|: M >= 1 && M >= E + 1 && N >= 1 && N >= C + 1 && 7 >= O && 7 >= P && O >= 5 && P >= 1 && H >= 1 && H <= 1 36.60/16.12 f4(A, B, C, D, E, F, G, H, I, J, K, L, M, N) -> Com_1(f2(0, C + 1, C + 1, E + 1, E + 1, P, 4, 1, 0, P, 4, 2, M, N)) :|: M >= E + 2 && N >= C + 2 && M >= 1 && N >= 1 && 7 >= P && P >= 1 36.60/16.12 f4(A, B, C, D, E, F, G, H, I, J, K, L, M, N) -> Com_1(f7(0, C, C, E, E, P, O, H, 0, P, O, 7, M, N)) :|: E >= M && C >= N && 7 >= O && 7 >= P && 3 >= O && O >= 1 && P >= 1 36.60/16.12 f4(A, B, C, D, E, F, G, H, I, J, K, L, M, N) -> Com_1(f7(0, C, C, E, E, P, O, H, 0, P, O, 7, M, N)) :|: E >= M && C >= N && 7 >= O && 7 >= P && O >= 5 && P >= 1 36.60/16.12 f4(A, B, C, D, E, F, G, H, I, J, K, L, M, N) -> Com_1(f7(0, C + 1, C + 1, E + 1, E + 1, P, 4, 1, 0, P, 4, 7, M, N)) :|: E + 1 >= M && C + 1 >= N && 7 >= P && P >= 1 36.60/16.12 f4(A, B, C, D, E, F, G, H, I, J, K, L, M, N) -> Com_1(f7(1, C, C, E, E, P, O, H, 1, P, O, 7, M, N)) :|: 7 >= O && 7 >= P && 3 >= O && O >= 1 && P >= 1 36.60/16.12 f4(A, B, C, D, E, F, G, H, I, J, K, L, M, N) -> Com_1(f7(1, C, C, E, E, P, O, H, 1, P, O, 7, M, N)) :|: 7 >= O && 7 >= P && O >= 5 && P >= 1 36.60/16.12 f4(A, B, C, D, E, F, G, H, I, J, K, L, M, N) -> Com_1(f7(1, C + 1, C + 1, E + 1, E + 1, P, 4, 1, 1, P, 4, 7, M, N)) :|: 7 >= P && P >= 1 36.60/16.12 36.60/16.12 The start-symbols are:[f0_14] 36.60/16.12 36.60/16.12 36.60/16.12 ---------------------------------------- 36.60/16.12 36.60/16.12 (1) Loat Proof (FINISHED) 36.60/16.12 36.60/16.12 36.60/16.12 ### Pre-processing the ITS problem ### 36.60/16.12 36.60/16.12 36.60/16.12 36.60/16.12 Initial linear ITS problem 36.60/16.12 36.60/16.12 Start location: f0 36.60/16.12 36.60/16.12 0: f0 -> f1 : [], cost: 1 36.60/16.12 36.60/16.12 1: f1 -> f7 : A'=1, B'=C, D'=E, F'=free, G'=free_1, H'=0, Q'=1, J'=free, K'=free_1, L'=7, [ 7>=free_1 && 7>=free && 3>=free_1 && free_1>=1 && free>=1 ], cost: 1 36.60/16.12 36.60/16.12 2: f1 -> f7 : A'=1, B'=C, D'=E, F'=free_2, G'=free_3, H'=0, Q'=1, J'=free_2, K'=free_3, L'=7, [ 7>=free_3 && 7>=free_2 && free_3>=5 && free_2>=1 ], cost: 1 36.60/16.12 36.60/16.12 3: f1 -> f7 : A'=1, B'=1+C, C'=1+C, D'=1+E, E'=1+E, F'=free_4, G'=4, H'=1, Q'=1, J'=free_4, K'=4, L'=7, [ 7>=free_4 && free_4>=1 ], cost: 1 36.60/16.12 36.60/16.12 4: f1 -> f2 : A'=0, B'=C, D'=E, F'=3, G'=free_5, H'=0, Q'=0, J'=3, K'=free_5, L'=2, [ 7>=free_5 && 3>=free_5 && free_5>=1 ], cost: 1 36.60/16.12 36.60/16.12 5: f1 -> f2 : A'=0, B'=C, D'=E, F'=3, G'=free_6, H'=0, Q'=0, J'=3, K'=free_6, L'=2, [ 7>=free_6 && free_6>=5 ], cost: 1 36.60/16.12 36.60/16.12 6: f1 -> f2 : A'=0, B'=1+C, C'=1+C, D'=1+E, E'=1+E, F'=3, G'=4, H'=1, Q'=0, J'=3, K'=4, L'=2, [], cost: 1 36.60/16.12 36.60/16.12 7: f2 -> f7 : A'=1, B'=C, D'=E, F'=free_7, G'=free_8, Q'=1, J'=free_7, K'=free_8, L'=7, [ 7>=free_8 && 7>=free_7 && 3>=free_8 && free_8>=1 && free_7>=1 ], cost: 1 36.60/16.12 36.60/16.12 8: f2 -> f7 : A'=1, B'=C, D'=E, F'=free_9, G'=free_10, Q'=1, J'=free_9, K'=free_10, L'=7, [ 7>=free_10 && 7>=free_9 && free_10>=5 && free_9>=1 ], cost: 1 36.60/16.12 36.60/16.12 9: f2 -> f7 : A'=1, B'=1+C, C'=1+C, D'=1+E, E'=1+E, F'=free_11, G'=4, H'=1, Q'=1, J'=free_11, K'=4, L'=7, [ 7>=free_11 && free_11>=1 ], cost: 1 36.60/16.12 36.60/16.12 10: f2 -> f3 : A'=0, B'=C, D'=E, F'=free_12, G'=free_13, Q'=0, J'=free_12, K'=free_13, L'=3, [ 7>=free_13 && 7>=free_12 && 3>=free_13 && free_13>=1 && free_12>=1 ], cost: 1 36.60/16.12 36.60/16.12 11: f2 -> f3 : A'=0, B'=C, D'=E, F'=free_14, G'=free_15, Q'=0, J'=free_14, K'=free_15, L'=3, [ 7>=free_15 && 7>=free_14 && free_15>=5 && free_14>=1 ], cost: 1 36.60/16.12 36.60/16.12 12: f2 -> f3 : A'=0, B'=1+C, C'=1+C, D'=1+E, E'=1+E, F'=free_16, G'=4, H'=1, Q'=0, J'=free_16, K'=4, L'=3, [ 7>=free_16 && free_16>=1 ], cost: 1 36.60/16.12 36.60/16.12 13: f3 -> f6 : A'=1, B'=C, D'=E, F'=free_17, G'=free_18, Q'=1, J'=free_17, K'=free_18, L'=6, [ 7>=free_18 && 7>=free_17 && 3>=free_18 && free_18>=1 && free_17>=1 ], cost: 1 36.60/16.12 36.60/16.12 14: f3 -> f6 : A'=1, B'=C, D'=E, F'=free_19, G'=free_20, Q'=1, J'=free_19, K'=free_20, L'=6, [ 7>=free_20 && 7>=free_19 && free_20>=5 && free_19>=1 ], cost: 1 36.60/16.12 36.60/16.12 15: f3 -> f6 : A'=1, B'=1+C, C'=1+C, D'=1+E, E'=1+E, F'=free_21, G'=4, H'=1, Q'=1, J'=free_21, K'=4, L'=6, [ 7>=free_21 && free_21>=1 ], cost: 1 36.60/16.12 36.60/16.12 16: f6 -> f4 : A'=1, B'=C, D'=E, F'=free_22, G'=2, H'=0, Q'=1, J'=free_22, K'=2, L'=4, [ free_22>=1 && 7>=free_22 ], cost: 1 36.60/16.12 36.60/16.12 17: f6 -> f4 : A'=free_23, B'=C, D'=E, F'=free_24, G'=7, H'=1, Q'=free_23, J'=free_24, K'=7, L'=4, [ 7>=free_24 && 1>=free_23 && free_23>=0 && free_24>=1 && H==1 ], cost: 1 36.60/16.12 36.60/16.12 18: f4 -> f2 : A'=0, B'=C, D'=E, F'=free_25, G'=free_26, H'=1, Q'=0, J'=free_25, K'=free_26, L'=2, [ M>=1 && M>=1+E && N>=1 && N>=1+C && 7>=free_26 && 7>=free_25 && 3>=free_26 && free_26>=1 && free_25>=1 && H==1 ], cost: 1 36.60/16.12 36.60/16.12 19: f4 -> f2 : A'=0, B'=C, D'=E, F'=free_27, G'=free_28, H'=1, Q'=0, J'=free_27, K'=free_28, L'=2, [ M>=1 && M>=1+E && N>=1 && N>=1+C && 7>=free_28 && 7>=free_27 && free_28>=5 && free_27>=1 && H==1 ], cost: 1
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
