Complexity_ITS 2019-03-21 04.46 pair #429991028

details

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

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	4.3186 seconds
cpu usage	11.5519
user time	11.1611
system time	0.390825
max virtual memory	1.8718468E7
max residence set size	226216.0

stage attributes

key	value
starexec-result	WORST_CASE(NON_POLY, ?)

output

11.22/4.26	WORST_CASE(NON_POLY, ?)
11.46/4.27	proof of /export/starexec/sandbox/benchmark/theBenchmark.koat
11.46/4.27	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
11.46/4.27	
11.46/4.27	
11.46/4.27	The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(INF, INF).
11.46/4.27	
11.46/4.27	(0) CpxIntTrs
11.46/4.27	(1) Loat Proof [FINISHED, 2544 ms]
11.46/4.27	(2) BOUNDS(INF, INF)
11.46/4.27	
11.46/4.27	
11.46/4.27	----------------------------------------
11.46/4.27	
11.46/4.27	(0)
11.46/4.27	Obligation:
11.46/4.27	Complexity Int TRS consisting of the following rules:
11.46/4.27	evalfstart(A, B, C, D, E, F, G) -> Com_1(evalfentryin(A, B, C, D, E, F, G)) :|: TRUE
11.46/4.27	evalfentryin(A, B, C, D, E, F, G) -> Com_1(evalfbb10in(B, C, D, A, E, F, G)) :|: TRUE
11.46/4.27	evalfbb10in(A, B, C, D, E, F, G) -> Com_1(evalfbb8in(A, B, C, D, 1, F, G)) :|: D >= 1
11.46/4.27	evalfbb10in(A, B, C, D, E, F, G) -> Com_1(evalfreturnin(A, B, C, D, E, F, G)) :|: 0 >= D
11.46/4.27	evalfbb8in(A, B, C, D, E, F, G) -> Com_1(evalfbb6in(A, B, C, D, E, D, G)) :|: A >= E
11.46/4.27	evalfbb8in(A, B, C, D, E, F, G) -> Com_1(evalfbb9in(A, B, C, D, E, F, G)) :|: E >= A + 1
11.46/4.27	evalfbb6in(A, B, C, D, E, F, G) -> Com_1(evalfbb4in(A, B, C, D, E, F, C)) :|: B >= F
11.46/4.27	evalfbb6in(A, B, C, D, E, F, G) -> Com_1(evalfbb7in(A, B, C, D, E, F, G)) :|: F >= B + 1
11.46/4.27	evalfbb4in(A, B, C, D, E, F, G) -> Com_1(evalfbb3in(A, B, C, D, E, F, G)) :|: E >= G
11.46/4.27	evalfbb4in(A, B, C, D, E, F, G) -> Com_1(evalfbb5in(A, B, C, D, E, F, G)) :|: G >= E + 1
11.46/4.27	evalfbb3in(A, B, C, D, E, F, G) -> Com_1(evalfbb4in(A, B, C, D, E, F, G - 1)) :|: TRUE
11.46/4.27	evalfbb5in(A, B, C, D, E, F, G) -> Com_1(evalfbb6in(A, B, C, D, E, F + 1, G)) :|: TRUE
11.46/4.27	evalfbb7in(A, B, C, D, E, F, G) -> Com_1(evalfbb8in(A, B, C, D, E + 1, F, G)) :|: TRUE
11.46/4.27	evalfbb9in(A, B, C, D, E, F, G) -> Com_1(evalfbb10in(A, B, C, D - 1, E, F, G)) :|: TRUE
11.46/4.27	evalfreturnin(A, B, C, D, E, F, G) -> Com_1(evalfstop(A, B, C, D, E, F, G)) :|: TRUE
11.46/4.27	
11.46/4.27	The start-symbols are:[evalfstart_7]
11.46/4.27	
11.46/4.27	
11.46/4.27	----------------------------------------
11.46/4.27	
11.46/4.27	(1) Loat Proof (FINISHED)
11.46/4.27	
11.46/4.27	
11.46/4.27	### Pre-processing the ITS problem ###
11.46/4.27	
11.46/4.27	
11.46/4.27	
11.46/4.27	Initial linear ITS problem
11.46/4.27	
11.46/4.27	   Start location: evalfstart
11.46/4.27	
11.46/4.27	      0: evalfstart -> evalfentryin : [], cost: 1
11.46/4.27	
11.46/4.27	      1: evalfentryin -> evalfbb10in : A'=B, B'=C, C'=D, D'=A, [], cost: 1
11.46/4.27	
11.46/4.27	      2: evalfbb10in -> evalfbb8in : E'=1, [ D>=1 ], cost: 1
11.46/4.27	
11.46/4.27	      3: evalfbb10in -> evalfreturnin : [ 0>=D ], cost: 1
11.46/4.27	
11.46/4.27	      4: evalfbb8in -> evalfbb6in : F'=D, [ A>=E ], cost: 1
11.46/4.27	
11.46/4.27	      5: evalfbb8in -> evalfbb9in : [ E>=1+A ], cost: 1
11.46/4.27	
11.46/4.27	      6: evalfbb6in -> evalfbb4in : G'=C, [ B>=F ], cost: 1
11.46/4.27	
11.46/4.27	      7: evalfbb6in -> evalfbb7in : [ F>=1+B ], cost: 1
11.46/4.27	
11.46/4.27	      8: evalfbb4in -> evalfbb3in : [ E>=G ], cost: 1
11.46/4.27	
11.46/4.27	      9: evalfbb4in -> evalfbb5in : [ G>=1+E ], cost: 1
11.46/4.27	
11.46/4.27	     10: evalfbb3in -> evalfbb4in : G'=-1+G, [], cost: 1
11.46/4.27	
11.46/4.27	     11: evalfbb5in -> evalfbb6in : F'=1+F, [], cost: 1
11.46/4.27	
11.46/4.27	     12: evalfbb7in -> evalfbb8in : E'=1+E, [], cost: 1
11.46/4.27	
11.46/4.27	     13: evalfbb9in -> evalfbb10in : D'=-1+D, [], cost: 1
11.46/4.27	
11.46/4.27	     14: evalfreturnin -> evalfstop : [], cost: 1
11.46/4.27	
11.46/4.27	
11.46/4.27	
11.46/4.27	Removed unreachable and leaf rules:
11.46/4.27	
11.46/4.27	   Start location: evalfstart
11.46/4.27	
11.46/4.27	      0: evalfstart -> evalfentryin : [], cost: 1
11.46/4.27	
11.46/4.27	      1: evalfentryin -> evalfbb10in : A'=B, B'=C, C'=D, D'=A, [], cost: 1
11.46/4.27	
11.46/4.27	      2: evalfbb10in -> evalfbb8in : E'=1, [ D>=1 ], cost: 1
11.46/4.27	
11.46/4.27	      4: evalfbb8in -> evalfbb6in : F'=D, [ A>=E ], cost: 1
11.46/4.27	
11.46/4.27	      5: evalfbb8in -> evalfbb9in : [ E>=1+A ], cost: 1
11.46/4.27	
11.46/4.27	      6: evalfbb6in -> evalfbb4in : G'=C, [ B>=F ], cost: 1
11.46/4.27	
11.46/4.27	      7: evalfbb6in -> evalfbb7in : [ F>=1+B ], cost: 1
11.46/4.27	
11.46/4.27	      8: evalfbb4in -> evalfbb3in : [ E>=G ], 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