details

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

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	5.25285 seconds
cpu usage	14.672
user time	14.1
system time	0.571923
max virtual memory	1.8762908E7
max residence set size	228944.0

stage attributes

key	value
starexec-result	WORST_CASE(NON_POLY, ?)

output

14.58/5.21 WORST_CASE(NON_POLY, ?) 14.58/5.22 proof of /export/starexec/sandbox/benchmark/theBenchmark.koat 14.58/5.22 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 14.58/5.22 14.58/5.22 14.58/5.22 The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(INF, INF). 14.58/5.22 14.58/5.22 (0) CpxIntTrs 14.58/5.22 (1) Loat Proof [FINISHED, 3517 ms] 14.58/5.22 (2) BOUNDS(INF, INF) 14.58/5.22 14.58/5.22 14.58/5.22 ---------------------------------------- 14.58/5.22 14.58/5.22 (0) 14.58/5.22 Obligation: 14.58/5.22 Complexity Int TRS consisting of the following rules: 14.58/5.22 f0(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R) -> Com_1(f13(1, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R)) :|: A >= 1 && A <= 1 14.58/5.22 f0(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R) -> Com_1(f17(A, 1, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R)) :|: 0 >= A 14.58/5.22 f0(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R) -> Com_1(f17(A, 1, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R)) :|: A >= 2 14.58/5.22 f17(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R) -> Com_1(f23(A, B, B + 1, S, T, 1, G, H, I, J, K, L, M, N, O, P, Q, R)) :|: A >= B 14.58/5.22 f23(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R) -> Com_1(f23(A, B, C, S, T, F + 1, G, H, I, J, K, L, M, N, O, P, Q, R)) :|: B >= F 14.58/5.22 f33(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R) -> Com_1(f33(A, B, C, D, E, F + 1, G, H, I, J, K, L, M, N, O, P, Q, R)) :|: B >= F 14.58/5.22 f46(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R) -> Com_1(f46(A, B, C, D, E, F + 1, S, T, U, J, K, L, M, N, O, P, Q, R)) :|: B >= F 14.58/5.22 f60(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R) -> Com_1(f60(A, B, C, D, E, F + 1, G, H, I, J, K - 1, S, T, U, V, K, Q, R)) :|: J >= F 14.58/5.22 f60(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R) -> Com_1(f17(A, B + 1, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R)) :|: F >= 1 + J 14.58/5.22 f46(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R) -> Com_1(f60(A, B, C, D, E, 1, G, H, I, S, B, L, M, N, O, P, T, U)) :|: F >= 1 + B 14.58/5.22 f33(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R) -> Com_1(f13(A, B, A, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R)) :|: F >= 1 + B && A >= C && A <= C 14.58/5.22 f33(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R) -> Com_1(f46(A, B, C, D, E, 1, S, T, U, J, K, L, M, N, O, P, Q, R)) :|: A >= C + 1 && F >= 1 + B 14.58/5.22 f33(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R) -> Com_1(f46(A, B, C, D, E, 1, S, T, U, J, K, L, M, N, O, P, Q, R)) :|: C >= 1 + A && F >= 1 + B 14.58/5.22 f23(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R) -> Com_1(f33(A, B, C, D, E, 1, G, H, I, J, K, L, M, N, O, P, Q, R)) :|: 0 >= E + 1 && F >= 1 + B 14.58/5.22 f23(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R) -> Com_1(f33(A, B, C, D, E, 1, G, H, I, J, K, L, M, N, O, P, Q, R)) :|: E >= 1 && F >= 1 + B 14.58/5.22 f23(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R) -> Com_1(f33(A, B, C, D, 0, 1, G, H, I, J, K, L, M, N, O, P, Q, R)) :|: F >= 1 + B && E >= 0 && E <= 0 14.58/5.22 f17(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R) -> Com_1(f13(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R)) :|: B >= 1 + A 14.58/5.22 14.58/5.22 The start-symbols are:[f0_18] 14.58/5.22 14.58/5.22 14.58/5.22 ---------------------------------------- 14.58/5.22 14.58/5.22 (1) Loat Proof (FINISHED) 14.58/5.22 14.58/5.22 14.58/5.22 ### Pre-processing the ITS problem ### 14.58/5.22 14.58/5.22 14.58/5.22 14.58/5.22 Initial linear ITS problem 14.58/5.22 14.58/5.22 Start location: f0 14.58/5.22 14.58/5.22 0: f0 -> f13 : A'=1, [ A==1 ], cost: 1 14.58/5.22 14.58/5.22 1: f0 -> f17 : B'=1, [ 0>=A ], cost: 1 14.58/5.22 14.58/5.22 2: f0 -> f17 : B'=1, [ A>=2 ], cost: 1 14.58/5.22 14.58/5.22 3: f17 -> f23 : C'=1+B, D'=free, E'=free_1, F'=1, [ A>=B ], cost: 1 14.58/5.22 14.58/5.22 16: f17 -> f13 : [ B>=1+A ], cost: 1 14.58/5.22 14.58/5.22 4: f23 -> f23 : D'=free_2, E'=free_3, F'=1+F, [ B>=F ], cost: 1 14.58/5.22 14.58/5.22 13: f23 -> f33 : F'=1, [ 0>=1+E && F>=1+B ], cost: 1 14.58/5.22 14.58/5.22 14: f23 -> f33 : F'=1, [ E>=1 && F>=1+B ], cost: 1 14.58/5.22 14.58/5.22 15: f23 -> f33 : E'=0, F'=1, [ F>=1+B && E==0 ], cost: 1 14.58/5.22 14.58/5.22 5: f33 -> f33 : F'=1+F, [ B>=F ], cost: 1 14.58/5.22 14.58/5.22 10: f33 -> f13 : C'=A, [ F>=1+B && A==C ], cost: 1 14.58/5.22 14.58/5.22 11: f33 -> f46 : F'=1, G'=free_14, H'=free_15, Q'=free_16, [ A>=1+C && F>=1+B ], cost: 1 14.58/5.22 14.58/5.22 12: f33 -> f46 : F'=1, G'=free_17, H'=free_18, Q'=free_19, [ C>=1+A && F>=1+B ], cost: 1 14.58/5.22 14.58/5.22 6: f46 -> f46 : F'=1+F, G'=free_4, H'=free_5, Q'=free_6, [ B>=F ], cost: 1 14.58/5.22 14.58/5.22 9: f46 -> f60 : F'=1, J'=free_11, K'=B, Q_1'=free_12, R'=free_13, [ F>=1+B ], cost: 1 14.58/5.22 14.58/5.22 7: f60 -> f60 : F'=1+F, K'=-1+K, L'=free_8, M'=free_9, N'=free_10, O'=free_7, P'=K, [ J>=F ], cost: 1 14.58/5.22 14.58/5.22 8: f60 -> f17 : B'=1+B, [ F>=1+J ], cost: 1 14.58/5.22 14.58/5.22 14.58/5.22 14.58/5.22 Removed unreachable and leaf rules: 14.58/5.22 14.58/5.22 Start location: f0 14.58/5.22 14.58/5.22 1: f0 -> f17 : B'=1, [ 0>=A ], cost: 1 14.58/5.22 14.58/5.22 2: f0 -> f17 : B'=1, [ A>=2 ], cost: 1 14.58/5.22 14.58/5.22 3: f17 -> f23 : C'=1+B, D'=free, E'=free_1, F'=1, [ A>=B ], cost: 1 14.58/5.22 14.58/5.22 4: f23 -> f23 : D'=free_2, E'=free_3, F'=1+F, [ B>=F ], cost: 1 14.58/5.22 14.58/5.22 13: f23 -> f33 : F'=1, [ 0>=1+E && F>=1+B ], 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