details

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

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	16.3251 seconds
cpu usage	37.2076
user time	36.1547
system time	1.0529
max virtual memory	1.898376E7
max residence set size	380740.0

stage attributes

key	value
starexec-result	WORST_CASE(NON_POLY, ?)

output

36.94/16.27 WORST_CASE(NON_POLY, ?) 37.17/16.28 proof of /export/starexec/sandbox2/benchmark/theBenchmark.koat 37.17/16.28 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 37.17/16.28 37.17/16.28 37.17/16.28 The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(INF, INF). 37.17/16.28 37.17/16.28 (0) CpxIntTrs 37.17/16.28 (1) Loat Proof [FINISHED, 14.4 s] 37.17/16.28 (2) BOUNDS(INF, INF) 37.17/16.28 37.17/16.28 37.17/16.28 ---------------------------------------- 37.17/16.28 37.17/16.28 (0) 37.17/16.28 Obligation: 37.17/16.28 Complexity Int TRS consisting of the following rules: 37.17/16.28 f0(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O) -> Com_1(f1(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O)) :|: TRUE 37.17/16.28 f1(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O) -> Com_1(f7(A - 1, 1, D, D, F, F, Q, P, 0, 1, Q, P, 7, N, O)) :|: A >= 1 && 7 >= P && 7 >= Q && 3 >= P && P >= 1 && Q >= 1 37.17/16.28 f1(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O) -> Com_1(f7(A, 1, D, D, F, F, Q, P, 0, 1, Q, P, 7, N, O)) :|: 7 >= P && 7 >= Q && P >= 5 && Q >= 1 37.17/16.28 f1(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O) -> Com_1(f7(A, 1, D + 1, D + 1, F + 1, F + 1, Q, 4, 1, 1, Q, 4, 7, N, O)) :|: 7 >= Q && Q >= 1 37.17/16.28 f1(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O) -> Com_1(f2(A, 0, D, D, F, F, 3, Q, 0, 0, 3, Q, 2, N, O)) :|: 7 >= Q && 3 >= Q && Q >= 1 37.17/16.28 f1(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O) -> Com_1(f2(A, 0, D, D, F, F, 3, Q, 0, 0, 3, Q, 2, N, O)) :|: 7 >= Q && Q >= 5 37.17/16.28 f1(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O) -> Com_1(f2(A, 0, D + 1, D + 1, F + 1, F + 1, 3, 4, 1, 0, 3, 4, 2, N, O)) :|: TRUE 37.17/16.28 f2(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O) -> Com_1(f7(A, 1, D, D, F, F, Q, P, I, 1, Q, P, 7, N, O)) :|: 7 >= P && 7 >= Q && 3 >= P && P >= 1 && Q >= 1 37.17/16.28 f2(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O) -> Com_1(f7(A, 1, D, D, F, F, Q, P, I, 1, Q, P, 7, N, O)) :|: 7 >= P && 7 >= Q && P >= 5 && Q >= 1 37.17/16.28 f2(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O) -> Com_1(f7(A, 1, D + 1, D + 1, F + 1, F + 1, Q, 4, 1, 1, Q, 4, 7, N, O)) :|: 7 >= Q && Q >= 1 37.17/16.28 f2(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O) -> Com_1(f3(A, 0, D, D, F, F, Q, P, I, 0, Q, P, 3, N, O)) :|: 7 >= P && 7 >= Q && 3 >= P && P >= 1 && Q >= 1 37.17/16.28 f2(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O) -> Com_1(f3(A, 0, D, D, F, F, Q, P, I, 0, Q, P, 3, N, O)) :|: 7 >= P && 7 >= Q && P >= 5 && Q >= 1 37.17/16.28 f2(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O) -> Com_1(f3(A, 0, D + 1, D + 1, F + 1, F + 1, Q, 4, 1, 0, Q, 4, 3, N, O)) :|: 7 >= Q && Q >= 1 37.17/16.28 f3(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O) -> Com_1(f6(A, 1, D, D, F, F, Q, P, I, 1, Q, P, 6, N, O)) :|: 7 >= P && 7 >= Q && 3 >= P && P >= 1 && Q >= 1 37.17/16.28 f3(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O) -> Com_1(f6(A, 1, D, D, F, F, Q, P, I, 1, Q, P, 6, N, O)) :|: 7 >= P && 7 >= Q && P >= 5 && Q >= 1 37.17/16.28 f3(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O) -> Com_1(f6(A, 1, D + 1, D + 1, F + 1, F + 1, Q, 4, 1, 1, Q, 4, 6, N, O)) :|: 7 >= Q && Q >= 1 37.17/16.28 f6(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O) -> Com_1(f4(A, 1, D, D, F, F, Q, 2, 0, 1, Q, 2, 4, N, O)) :|: Q >= 1 && 7 >= Q 37.17/16.28 f6(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O) -> Com_1(f4(A, Q, D, D, F, F, P, 7, 1, Q, P, 7, 4, N, O)) :|: 7 >= P && 1 >= Q && Q >= 0 && P >= 1 && I >= 1 && I <= 1 37.17/16.28 f4(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O) -> Com_1(f2(A, 0, D, D, F, F, Q, P, 1, 0, Q, P, 2, N, O)) :|: N >= 1 && N >= F + 1 && O >= 1 && O >= D + 1 && 7 >= P && 7 >= Q && 3 >= P && P >= 1 && Q >= 1 && I >= 1 && I <= 1 37.17/16.28 f4(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O) -> Com_1(f2(A, 0, D, D, F, F, Q, P, 1, 0, Q, P, 2, N, O)) :|: N >= 1 && N >= F + 1 && O >= 1 && O >= D + 1 && 7 >= P && 7 >= Q && P >= 5 && Q >= 1 && I >= 1 && I <= 1 37.17/16.28 f4(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O) -> Com_1(f2(A, 0, D + 1, D + 1, F + 1, F + 1, Q, 4, 1, 0, Q, 4, 2, N, O)) :|: N >= F + 2 && O >= D + 2 && N >= 1 && O >= 1 && 7 >= Q && Q >= 1 37.17/16.28 f4(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O) -> Com_1(f7(A, 0, D, D, F, F, Q, P, I, 0, Q, P, 7, N, O)) :|: F >= N && D >= O && 7 >= P && 7 >= Q && 3 >= P && P >= 1 && Q >= 1 37.17/16.28 f4(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O) -> Com_1(f7(A, 0, D, D, F, F, Q, P, I, 0, Q, P, 7, N, O)) :|: F >= N && D >= O && 7 >= P && 7 >= Q && P >= 5 && Q >= 1 37.17/16.28 f4(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O) -> Com_1(f7(A, 0, D + 1, D + 1, F + 1, F + 1, Q, 4, 1, 0, Q, 4, 7, N, O)) :|: F + 1 >= N && D + 1 >= O && 7 >= Q && Q >= 1 37.17/16.28 f4(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O) -> Com_1(f7(A, 1, D, D, F, F, Q, P, I, 1, Q, P, 7, N, O)) :|: 7 >= P && 7 >= Q && 3 >= P && P >= 1 && Q >= 1 37.17/16.28 f4(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O) -> Com_1(f7(A, 1, D, D, F, F, Q, P, I, 1, Q, P, 7, N, O)) :|: 7 >= P && 7 >= Q && P >= 5 && Q >= 1 37.17/16.28 f4(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O) -> Com_1(f7(A, 1, D + 1, D + 1, F + 1, F + 1, Q, 4, 1, 1, Q, 4, 7, N, O)) :|: 7 >= Q && Q >= 1 37.17/16.28 37.17/16.28 The start-symbols are:[f0_15] 37.17/16.28 37.17/16.28 37.17/16.28 ---------------------------------------- 37.17/16.28 37.17/16.28 (1) Loat Proof (FINISHED) 37.17/16.28 37.17/16.28 37.17/16.28 ### Pre-processing the ITS problem ### 37.17/16.28 37.17/16.28 37.17/16.28 37.17/16.28 Initial linear ITS problem 37.17/16.28 37.17/16.28 Start location: f0 37.17/16.28 37.17/16.28 0: f0 -> f1 : [], cost: 1 37.17/16.28 37.17/16.28 1: f1 -> f7 : A'=-1+A, B'=1, C'=D, E'=F, G'=free_1, H'=free, Q'=0, J'=1, K'=free_1, L'=free, M'=7, [ A>=1 && 7>=free && 7>=free_1 && 3>=free && free>=1 && free_1>=1 ], cost: 1 37.17/16.28 37.17/16.28 2: f1 -> f7 : B'=1, C'=D, E'=F, G'=free_3, H'=free_2, Q'=0, J'=1, K'=free_3, L'=free_2, M'=7, [ 7>=free_2 && 7>=free_3 && free_2>=5 && free_3>=1 ], cost: 1 37.17/16.28 37.17/16.28 3: f1 -> f7 : B'=1, C'=1+D, D'=1+D, E'=1+F, F'=1+F, G'=free_4, H'=4, Q'=1, J'=1, K'=free_4, L'=4, M'=7, [ 7>=free_4 && free_4>=1 ], cost: 1 37.17/16.28 37.17/16.28 4: f1 -> f2 : B'=0, C'=D, E'=F, G'=3, H'=free_5, Q'=0, J'=0, K'=3, L'=free_5, M'=2, [ 7>=free_5 && 3>=free_5 && free_5>=1 ], cost: 1 37.17/16.28 37.17/16.28 5: f1 -> f2 : B'=0, C'=D, E'=F, G'=3, H'=free_6, Q'=0, J'=0, K'=3, L'=free_6, M'=2, [ 7>=free_6 && free_6>=5 ], cost: 1 37.17/16.28 37.17/16.28 6: f1 -> f2 : B'=0, C'=1+D, D'=1+D, E'=1+F, F'=1+F, G'=3, H'=4, Q'=1, J'=0, K'=3, L'=4, M'=2, [], cost: 1 37.17/16.28 37.17/16.28 7: f2 -> f7 : B'=1, C'=D, E'=F, G'=free_8, H'=free_7, J'=1, K'=free_8, L'=free_7, M'=7, [ 7>=free_7 && 7>=free_8 && 3>=free_7 && free_7>=1 && free_8>=1 ], cost: 1 37.17/16.28 37.17/16.28 8: f2 -> f7 : B'=1, C'=D, E'=F, G'=free_10, H'=free_9, J'=1, K'=free_10, L'=free_9, M'=7, [ 7>=free_9 && 7>=free_10 && free_9>=5 && free_10>=1 ], cost: 1 37.17/16.28 37.17/16.28 9: f2 -> f7 : B'=1, C'=1+D, D'=1+D, E'=1+F, F'=1+F, G'=free_11, H'=4, Q'=1, J'=1, K'=free_11, L'=4, M'=7, [ 7>=free_11 && free_11>=1 ], cost: 1 37.17/16.28 37.17/16.28 10: f2 -> f3 : B'=0, C'=D, E'=F, G'=free_13, H'=free_12, J'=0, K'=free_13, L'=free_12, M'=3, [ 7>=free_12 && 7>=free_13 && 3>=free_12 && free_12>=1 && free_13>=1 ], cost: 1 37.17/16.28 37.17/16.28 11: f2 -> f3 : B'=0, C'=D, E'=F, G'=free_15, H'=free_14, J'=0, K'=free_15, L'=free_14, M'=3, [ 7>=free_14 && 7>=free_15 && free_14>=5 && free_15>=1 ], cost: 1 37.17/16.28 37.17/16.28 12: f2 -> f3 : B'=0, C'=1+D, D'=1+D, E'=1+F, F'=1+F, G'=free_16, H'=4, Q'=1, J'=0, K'=free_16, L'=4, M'=3, [ 7>=free_16 && free_16>=1 ], cost: 1 37.17/16.28 37.17/16.28 13: f3 -> f6 : B'=1, C'=D, E'=F, G'=free_18, H'=free_17, J'=1, K'=free_18, L'=free_17, M'=6, [ 7>=free_17 && 7>=free_18 && 3>=free_17 && free_17>=1 && free_18>=1 ], cost: 1 37.17/16.28 37.17/16.28 14: f3 -> f6 : B'=1, C'=D, E'=F, G'=free_20, H'=free_19, J'=1, K'=free_20, L'=free_19, M'=6, [ 7>=free_19 && 7>=free_20 && free_19>=5 && free_20>=1 ], cost: 1 37.17/16.28 37.17/16.28 15: f3 -> f6 : B'=1, C'=1+D, D'=1+D, E'=1+F, F'=1+F, G'=free_21, H'=4, Q'=1, J'=1, K'=free_21, L'=4, M'=6, [ 7>=free_21 && free_21>=1 ], cost: 1 37.17/16.28 37.17/16.28 16: f6 -> f4 : B'=1, C'=D, E'=F, G'=free_22, H'=2, Q'=0, J'=1, K'=free_22, L'=2, M'=4, [ free_22>=1 && 7>=free_22 ], cost: 1 37.17/16.28 37.17/16.28 17: f6 -> f4 : B'=free_24, C'=D, E'=F, G'=free_23, H'=7, Q'=1, J'=free_24, K'=free_23, L'=7, M'=4, [ 7>=free_23 && 1>=free_24 && free_24>=0 && free_23>=1 && Q==1 ], cost: 1 37.17/16.28 37.17/16.28 18: f4 -> f2 : B'=0, C'=D, E'=F, G'=free_26, H'=free_25, Q'=1, J'=0, K'=free_26, L'=free_25, M'=2, [ N>=1 && N>=1+F && O>=1 && O>=1+D && 7>=free_25 && 7>=free_26 && 3>=free_25 && free_25>=1 && free_26>=1 && Q==1 ], cost: 1 37.17/16.28 37.17/16.28 19: f4 -> f2 : B'=0, C'=D, E'=F, G'=free_28, H'=free_27, Q'=1, J'=0, K'=free_28, L'=free_27, M'=2, [ N>=1 && N>=1+F && O>=1 && O>=1+D && 7>=free_27 && 7>=free_28 && free_27>=5 && free_28>=1 && Q==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