details

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

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	16.1175 seconds
cpu usage	35.8274
user time	34.8246
system time	1.0028
max virtual memory	1.8912464E7
max residence set size	275536.0

stage attributes

key	value
starexec-result	WORST_CASE(NON_POLY, ?)

output

35.70/16.06 WORST_CASE(NON_POLY, ?) 35.70/16.08 proof of /export/starexec/sandbox/benchmark/theBenchmark.koat 35.70/16.08 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 35.70/16.08 35.70/16.08 35.70/16.08 The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(INF, INF). 35.70/16.08 35.70/16.08 (0) CpxIntTrs 35.70/16.08 (1) Loat Proof [FINISHED, 13.8 s] 35.70/16.08 (2) BOUNDS(INF, INF) 35.70/16.08 35.70/16.08 35.70/16.08 ---------------------------------------- 35.70/16.08 35.70/16.08 (0) 35.70/16.08 Obligation: 35.70/16.08 Complexity Int TRS consisting of the following rules: 35.70/16.08 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 35.70/16.08 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 35.70/16.08 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 35.70/16.08 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 35.70/16.08 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 35.70/16.08 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 35.70/16.08 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 35.70/16.08 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 35.70/16.08 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 35.70/16.08 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 35.70/16.08 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 35.70/16.08 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 35.70/16.08 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 35.70/16.08 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 35.70/16.08 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 35.70/16.08 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 35.70/16.08 f6(A, B, C, D, E, F, G, H, I, J, K, L, M, N) -> Com_1(f4(P, C, C, E, E, O, 2, 0, P, O, 2, 4, M, N)) :|: 7 >= O && 1 >= P && P >= 0 && O >= 1 35.70/16.08 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 35.70/16.08 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, 0, 0, P, O, 2, M, N)) :|: M >= Q + 1 && N >= R + 1 && M >= 1 && N >= 1 && 7 >= O && 7 >= P && 3 >= O && O >= 1 && P >= 1 && H >= 1 && H <= 1 35.70/16.08 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, 0, 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 35.70/16.08 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, 0, 0, P, 4, 2, M, N)) :|: M >= E + 2 && N >= C + 2 && M >= 1 && N >= 1 && 7 >= P && P >= 1 35.70/16.08 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 35.70/16.08 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 35.70/16.08 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 35.70/16.08 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 35.70/16.08 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 35.70/16.08 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 35.70/16.08 35.70/16.08 The start-symbols are:[f0_14] 35.70/16.08 35.70/16.08 35.70/16.08 ---------------------------------------- 35.70/16.08 35.70/16.08 (1) Loat Proof (FINISHED) 35.70/16.08 35.70/16.08 35.70/16.08 ### Pre-processing the ITS problem ### 35.70/16.08 35.70/16.08 35.70/16.08 35.70/16.08 Initial linear ITS problem 35.70/16.08 35.70/16.08 Start location: f0 35.70/16.08 35.70/16.08 0: f0 -> f1 : [], cost: 1 35.70/16.08 35.70/16.08 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 35.70/16.08 35.70/16.08 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 35.70/16.08 35.70/16.08 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 35.70/16.08 35.70/16.08 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 35.70/16.08 35.70/16.08 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 35.70/16.08 35.70/16.08 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 35.70/16.08 35.70/16.08 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 35.70/16.08 35.70/16.08 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 35.70/16.08 35.70/16.08 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 35.70/16.08 35.70/16.08 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 35.70/16.08 35.70/16.08 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 35.70/16.08 35.70/16.08 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 35.70/16.08 35.70/16.08 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 35.70/16.08 35.70/16.08 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 35.70/16.08 35.70/16.08 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 35.70/16.08 35.70/16.08 16: f6 -> f4 : A'=free_22, B'=C, D'=E, F'=free_23, G'=2, H'=0, Q'=free_22, J'=free_23, K'=2, L'=4, [ 7>=free_23 && 1>=free_22 && free_22>=0 && free_23>=1 ], cost: 1 35.70/16.08 35.70/16.08 17: f6 -> f4 : A'=free_24, B'=C, D'=E, F'=free_25, G'=7, H'=1, Q'=free_24, J'=free_25, K'=7, L'=4, [ 7>=free_25 && 1>=free_24 && free_24>=0 && free_25>=1 && H==1 ], cost: 1 35.70/16.08 35.70/16.08 18: f4 -> f2 : A'=0, B'=C, D'=E, F'=free_26, G'=free_29, H'=0, Q'=0, J'=free_26, K'=free_29, L'=2, [ M>=1+free_27 && N>=1+free_28 && M>=1 && N>=1 && 7>=free_29 && 7>=free_26 && 3>=free_29 && free_29>=1 && free_26>=1 && H==1 ], cost: 1 35.70/16.08 35.70/16.08 19: f4 -> f2 : A'=0, B'=C, D'=E, F'=free_30, G'=free_31, H'=0, Q'=0, J'=free_30, K'=free_31, L'=2, [ M>=1 && M>=1+E && N>=1 && N>=1+C && 7>=free_31 && 7>=free_30 && free_31>=5 && free_30>=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