details

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

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	291.59 seconds
cpu usage	312.196
user time	310.264
system time	1.93229
max virtual memory	1.8740288E7
max residence set size	309332.0

stage attributes

key	value
starexec-result	MAYBE

output

312.10/291.56 KILLED 312.15/291.57 proof of /export/starexec/sandbox/benchmark/theBenchmark.koat 312.15/291.57 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 312.15/291.57 312.15/291.57 312.15/291.57 The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(1, INF). 312.15/291.57 312.15/291.57 (0) CpxIntTrs 312.15/291.57 (1) Loat Proof [FINISHED, 6685 ms] 312.15/291.57 (2) BOUNDS(1, INF) 312.15/291.57 312.15/291.57 312.15/291.57 ---------------------------------------- 312.15/291.57 312.15/291.57 (0) 312.15/291.57 Obligation: 312.15/291.57 Complexity Int TRS consisting of the following rules: 312.15/291.57 f4(A, B, C, D, E, F) -> Com_1(f14(A, B, C, D, E, F)) :|: 0 >= A 312.15/291.57 f13(A, B, C, D, E, F) -> Com_1(f4(A, B, C, D, E, F)) :|: TRUE 312.15/291.57 f13(A, B, C, D, E, F) -> Com_1(f400(A, B, C, D, E, F)) :|: B >= A + 1 312.15/291.57 f2(A, B, C, D, E, F) -> Com_1(f23(G, I, H, J, 1, F)) :|: G >= 1 && H >= 1 && 0 >= I 312.15/291.57 f2(A, B, C, D, E, F) -> Com_1(f23(G, I, H, J, 1, 0)) :|: G >= 1 && H >= 1 && I >= 1 312.15/291.57 f23(A, B, C, D, E, F) -> Com_1(f4(A, B, C, D, E, F)) :|: E >= C 312.15/291.57 f23(A, B, C, D, E, F) -> Com_1(f4(A, B, C, D, E, 1)) :|: C >= E + 1 312.15/291.57 f4(A, B, C, D, E, F) -> Com_1(f33(A - 1, B, H, J, C, F)) :|: H >= C && 0 >= B && A >= 1 312.15/291.57 f4(A, B, C, D, E, F) -> Com_1(f33(A - 1, B, H, J, C, 0)) :|: H >= C && B >= 1 && A >= 1 312.15/291.57 f33(A, B, C, D, E, F) -> Com_1(f6(A, B, C, D, E, F)) :|: E >= C 312.15/291.57 f33(A, B, C, D, E, F) -> Com_1(f6(A, B, C, D, E, 1)) :|: C >= E + 1 312.15/291.57 f6(A, B, C, D, E, F) -> Com_1(f43(A, B, H, J, C, F)) :|: H >= C && 0 >= C && 0 >= B 312.15/291.57 f6(A, B, C, D, E, F) -> Com_1(f43(A, B, H, J, C, 0)) :|: H >= C && 0 >= C && B >= 1 312.15/291.57 f43(A, B, C, D, E, F) -> Com_1(f6(A, B, C, D, C, F)) :|: C >= E && C <= E 312.15/291.57 f43(A, B, C, D, E, F) -> Com_1(f6(A, B, C, D, E, 1)) :|: C >= E + 1 312.15/291.57 f6(A, B, C, D, E, F) -> Com_1(f53(A, B, H, J, C - 1, F)) :|: H + 1 >= C && C >= 1 && 0 >= B 312.15/291.57 f6(A, B, C, D, E, F) -> Com_1(f53(A, B, H, J, C - 1, 0)) :|: H + 1 >= C && C >= 1 && B >= 1 312.15/291.57 f53(A, B, C, D, E, F) -> Com_1(f61(A, A, C, D, C, F)) :|: E >= C 312.15/291.57 f53(A, B, C, D, E, F) -> Com_1(f61(A, A, C, D, C, 1)) :|: C >= E + 1 312.15/291.57 f61(A, B, C, D, E, F) -> Com_1(f63(A, B, H, J, E, F)) :|: 0 >= B && H >= E 312.15/291.57 f61(A, B, C, D, E, F) -> Com_1(f63(A, B, H, J, E, 0)) :|: B >= 1 && H >= E 312.15/291.57 f63(A, B, C, D, E, F) -> Com_1(f71(A, B, C, D + 1, C, F)) :|: E >= C 312.15/291.57 f63(A, B, C, D, E, F) -> Com_1(f71(A, B, C, D + 1, C, 1)) :|: C >= E + 1 312.15/291.57 f71(A, B, C, D, E, F) -> Com_1(f73(A, B, H, J, E, F)) :|: 0 >= B && H >= E 312.15/291.57 f71(A, B, C, D, E, F) -> Com_1(f73(A, B, H, J, E, 0)) :|: B >= 1 && H >= E 312.15/291.57 f73(A, B, C, D, E, F) -> Com_1(f13(A, B, C, D, E, F)) :|: E >= C 312.15/291.57 f73(A, B, C, D, E, F) -> Com_1(f13(A, B, C, D, E, 1)) :|: C >= E + 1 312.15/291.57 312.15/291.57 The start-symbols are:[f2_6] 312.15/291.57 312.15/291.57 312.15/291.57 ---------------------------------------- 312.15/291.57 312.15/291.57 (1) Loat Proof (FINISHED) 312.15/291.57 312.15/291.57 312.15/291.57 ### Pre-processing the ITS problem ### 312.15/291.57 312.15/291.57 312.15/291.57 312.15/291.57 Initial linear ITS problem 312.15/291.57 312.15/291.57 Start location: f2 312.15/291.57 312.15/291.57 0: f4 -> f14 : [ 0>=A ], cost: 1 312.15/291.57 312.15/291.57 7: f4 -> f33 : A'=-1+A, C'=free_9, D'=free_8, E'=C, [ free_9>=C && 0>=B && A>=1 ], cost: 1 312.15/291.57 312.15/291.57 8: f4 -> f33 : A'=-1+A, C'=free_11, D'=free_10, E'=C, F'=0, [ free_11>=C && B>=1 && A>=1 ], cost: 1 312.15/291.57 312.15/291.57 1: f13 -> f4 : [], cost: 1 312.15/291.57 312.15/291.57 2: f13 -> f400 : [ B>=1+A ], cost: 1 312.15/291.57 312.15/291.57 3: f2 -> f23 : A'=free_2, B'=free, C'=free_3, D'=free_1, E'=1, [ free_2>=1 && free_3>=1 && 0>=free ], cost: 1 312.15/291.57 312.15/291.57 4: f2 -> f23 : A'=free_6, B'=free_4, C'=free_7, D'=free_5, E'=1, F'=0, [ free_6>=1 && free_7>=1 && free_4>=1 ], cost: 1 312.15/291.57 312.15/291.57 5: f23 -> f4 : [ E>=C ], cost: 1 312.15/291.57 312.15/291.57 6: f23 -> f4 : F'=1, [ C>=1+E ], cost: 1 312.15/291.57 312.15/291.57 9: f33 -> f6 : [ E>=C ], cost: 1 312.15/291.57 312.15/291.57 10: f33 -> f6 : F'=1, [ C>=1+E ], cost: 1 312.15/291.57 312.15/291.57 11: f6 -> f43 : C'=free_13, D'=free_12, E'=C, [ free_13>=C && 0>=C && 0>=B ], cost: 1 312.15/291.57 312.15/291.57 12: f6 -> f43 : C'=free_15, D'=free_14, E'=C, F'=0, [ free_15>=C && 0>=C && B>=1 ], cost: 1 312.15/291.57 312.15/291.57 15: f6 -> f53 : C'=free_17, D'=free_16, E'=-1+C, [ 1+free_17>=C && C>=1 && 0>=B ], cost: 1 312.15/291.57 312.15/291.57 16: f6 -> f53 : C'=free_19, D'=free_18, E'=-1+C, F'=0, [ 1+free_19>=C && C>=1 && B>=1 ], cost: 1 312.15/291.57 312.15/291.57 13: f43 -> f6 : E'=C, [ C==E ], cost: 1 312.15/291.57 312.15/291.57 14: f43 -> f6 : F'=1, [ C>=1+E ], cost: 1 312.15/291.57 312.15/291.57 17: f53 -> f61 : B'=A, E'=C, [ E>=C ], cost: 1 312.15/291.57 312.15/291.57 18: f53 -> f61 : B'=A, E'=C, F'=1, [ C>=1+E ], cost: 1 312.15/291.57 312.15/291.57 19: f61 -> f63 : C'=free_21, D'=free_20, [ 0>=B && free_21>=E ], 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