details

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

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	3.16491699219 seconds
cpu usage	7.061073362
max memory	3.70774016E8

stage attributes

key	value
output-size	66199
starexec-result	WORST_CASE(Omega(n^1), O(n^1))

output

/export/starexec/sandbox/solver/bin/starexec_run_complexity /export/starexec/sandbox/benchmark/theBenchmark.koat /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- WORST_CASE(Omega(n^1), O(n^1)) proof of /export/starexec/sandbox/benchmark/theBenchmark.koat # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(n^1, n^1). (0) CpxIntTrs (1) Koat Proof [FINISHED, 741 ms] (2) BOUNDS(1, n^1) (3) Loat Proof [FINISHED, 1442 ms] (4) BOUNDS(n^1, INF) ---------------------------------------- (0) Obligation: Complexity Int TRS consisting of the following rules: evalfstart(A, B, C, D, E, F) -> Com_1(evalfentryin(A, B, C, D, E, F)) :|: TRUE evalfentryin(A, B, C, D, E, F) -> Com_1(evalfbb9in(B, B, C, D, E, F)) :|: TRUE evalfbb9in(A, B, C, D, E, F) -> Com_1(evalfbbin(A, B, C, D, E, F)) :|: B >= 2 evalfbb9in(A, B, C, D, E, F) -> Com_1(evalfreturnin(A, B, C, D, E, F)) :|: 1 >= B evalfbbin(A, B, C, D, E, F) -> Com_1(evalfbb6in(A, B, B - 1, A + B - 1, E, F)) :|: TRUE evalfbb6in(A, B, C, D, E, F) -> Com_1(evalfbb8in(A, B, C, D, E, F)) :|: C >= D evalfbb6in(A, B, C, D, E, F) -> Com_1(evalfbb7in(A, B, C, D, E, F)) :|: D >= C + 1 evalfbb7in(A, B, C, D, E, F) -> Com_1(evalfbb1in(A, B, C, D, E, F)) :|: 0 >= G + 1 evalfbb7in(A, B, C, D, E, F) -> Com_1(evalfbb1in(A, B, C, D, E, F)) :|: G >= 1 evalfbb7in(A, B, C, D, E, F) -> Com_1(evalfbb8in(A, B, C, D, E, F)) :|: TRUE evalfbb1in(A, B, C, D, E, F) -> Com_1(evalfbb3in(A, B, C, D, C, D - 1)) :|: TRUE evalfbb3in(A, B, C, D, E, F) -> Com_1(evalfbb5in(A, B, C, D, E, F)) :|: TRUE evalfbb3in(A, B, C, D, E, F) -> Com_1(evalfbb4in(A, B, C, D, E, F)) :|: 0 >= 3 evalfbb4in(A, B, C, D, E, F) -> Com_1(evalfbb2in(A, B, C, D, E, F)) :|: 0 >= G + 1 evalfbb4in(A, B, C, D, E, F) -> Com_1(evalfbb2in(A, B, C, D, E, F)) :|: G >= 1 evalfbb4in(A, B, C, D, E, F) -> Com_1(evalfbb5in(A, B, C, D, E, F)) :|: TRUE evalfbb2in(A, B, C, D, E, F) -> Com_1(evalfbb3in(A, B, C, D, E + 1, F - 2)) :|: TRUE evalfbb5in(A, B, C, D, E, F) -> Com_1(evalfbb6in(A, B, E, F - 1, E, F)) :|: TRUE evalfbb8in(A, B, C, D, E, F) -> Com_1(evalfbb9in(D - C + 1, C - 1, C, D, E, F)) :|: TRUE evalfreturnin(A, B, C, D, E, F) -> Com_1(evalfstop(A, B, C, D, E, F)) :|: TRUE The start-symbols are:[evalfstart_6] ---------------------------------------- (1) Koat Proof (FINISHED) YES(?, 44*ar_1 + 14) Initial complexity problem: 1: T: (Comp: ?, Cost: 1) evalfstart(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfentryin(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) (Comp: ?, Cost: 1) evalfentryin(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfbb9in(ar_1, ar_1, ar_2, ar_3, ar_4, ar_5)) (Comp: ?, Cost: 1) evalfbb9in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfbbin(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ ar_1 >= 2 ] (Comp: ?, Cost: 1) evalfbb9in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfreturnin(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ 1 >= ar_1 ] (Comp: ?, Cost: 1) evalfbbin(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfbb6in(ar_0, ar_1, ar_1 - 1, ar_0 + ar_1 - 1, ar_4, ar_5)) (Comp: ?, Cost: 1) evalfbb6in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfbb8in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ ar_2 >= ar_3 ] (Comp: ?, Cost: 1) evalfbb6in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfbb7in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ ar_3 >= ar_2 + 1 ] (Comp: ?, Cost: 1) evalfbb7in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfbb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ 0 >= g + 1 ] (Comp: ?, Cost: 1) evalfbb7in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfbb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ g >= 1 ] (Comp: ?, Cost: 1) evalfbb7in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfbb8in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) (Comp: ?, Cost: 1) evalfbb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfbb3in(ar_0, ar_1, ar_2, ar_3, ar_2, ar_3 - 1)) (Comp: ?, Cost: 1) evalfbb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfbb5in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) (Comp: ?, Cost: 1) evalfbb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfbb4in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ 0 >= 3 ] (Comp: ?, Cost: 1) evalfbb4in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfbb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ 0 >= g + 1 ] (Comp: ?, Cost: 1) evalfbb4in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfbb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ g >= 1 ] (Comp: ?, Cost: 1) evalfbb4in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfbb5in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) (Comp: ?, Cost: 1) evalfbb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfbb3in(ar_0, ar_1, ar_2, ar_3, ar_4 + 1, ar_5 - 2)) (Comp: ?, Cost: 1) evalfbb5in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfbb6in(ar_0, ar_1, ar_4, ar_5 - 1, ar_4, ar_5)) (Comp: ?, Cost: 1) evalfbb8in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfbb9in(ar_3 - ar_2 + 1, ar_2 - 1, ar_2, ar_3, ar_4, ar_5)) (Comp: ?, Cost: 1) evalfreturnin(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfstop(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) popout

output may be truncated. 'popout' for the full output.

job log

popout

actions

all output return to Compl Integ Trans Syste 26843