6.56/3.35	MAYBE
6.56/3.36	proof of /export/starexec/sandbox/benchmark/theBenchmark.koat
6.56/3.36	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
6.56/3.36	
6.56/3.36	
6.56/3.36	The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(1, INF).
6.56/3.36	
6.56/3.36	(0) CpxIntTrs
6.56/3.36	(1) Loat Proof [FINISHED, 521 ms]
6.56/3.36	(2) BOUNDS(1, INF)
6.56/3.36	
6.56/3.36	
6.56/3.36	----------------------------------------
6.56/3.36	
6.56/3.36	(0)
6.56/3.36	Obligation:
6.56/3.36	Complexity Int TRS consisting of the following rules:
6.56/3.36	evalspeedFails4start(A, B, C, D) -> Com_1(evalspeedFails4entryin(A, B, C, D)) :|: TRUE
6.56/3.36	evalspeedFails4entryin(A, B, C, D) -> Com_1(evalspeedFails4bb6in(1, C, A, B)) :|: A >= 1
6.56/3.36	evalspeedFails4entryin(A, B, C, D) -> Com_1(evalspeedFails4bb6in(-(1), C, A, B)) :|: 0 >= A
6.56/3.36	evalspeedFails4bb6in(A, B, C, D) -> Com_1(evalspeedFails4bb3in(A, B, C, D)) :|: B >= D
6.56/3.36	evalspeedFails4bb6in(A, B, C, D) -> Com_1(evalspeedFails4returnin(A, B, C, D)) :|: D >= B + 1
6.56/3.36	evalspeedFails4bb3in(A, B, C, D) -> Com_1(evalspeedFails4bb4in(A, B, C, D)) :|: C >= 1
6.56/3.36	evalspeedFails4bb3in(A, B, C, D) -> Com_1(evalspeedFails4bb5in(A, B, C, D)) :|: 0 >= C
6.56/3.36	evalspeedFails4bb4in(A, B, C, D) -> Com_1(evalspeedFails4bb6in(A, B, C, D + A)) :|: TRUE
6.56/3.36	evalspeedFails4bb5in(A, B, C, D) -> Com_1(evalspeedFails4bb6in(A, B, C, D - A)) :|: TRUE
6.56/3.36	evalspeedFails4returnin(A, B, C, D) -> Com_1(evalspeedFails4stop(A, B, C, D)) :|: TRUE
6.56/3.36	
6.56/3.36	The start-symbols are:[evalspeedFails4start_4]
6.56/3.36	
6.56/3.36	
6.56/3.36	----------------------------------------
6.56/3.36	
6.56/3.36	(1) Loat Proof (FINISHED)
6.56/3.36	
6.56/3.36	
6.56/3.36	### Pre-processing the ITS problem ###
6.56/3.36	
6.56/3.36	
6.56/3.36	
6.56/3.36	Initial linear ITS problem
6.56/3.36	
6.56/3.36	   Start location: evalspeedFails4start
6.56/3.36	
6.56/3.36	      0: evalspeedFails4start -> evalspeedFails4entryin : [], cost: 1
6.56/3.36	
6.56/3.36	      1: evalspeedFails4entryin -> evalspeedFails4bb6in : A'=1, B'=C, C'=A, D'=B, [ A>=1 ], cost: 1
6.56/3.36	
6.56/3.36	      2: evalspeedFails4entryin -> evalspeedFails4bb6in : A'=-1, B'=C, C'=A, D'=B, [ 0>=A ], cost: 1
6.56/3.36	
6.56/3.36	      3: evalspeedFails4bb6in -> evalspeedFails4bb3in : [ B>=D ], cost: 1
6.56/3.36	
6.56/3.36	      4: evalspeedFails4bb6in -> evalspeedFails4returnin : [ D>=1+B ], cost: 1
6.56/3.36	
6.56/3.36	      5: evalspeedFails4bb3in -> evalspeedFails4bb4in : [ C>=1 ], cost: 1
6.56/3.36	
6.56/3.36	      6: evalspeedFails4bb3in -> evalspeedFails4bb5in : [ 0>=C ], cost: 1
6.56/3.36	
6.56/3.36	      7: evalspeedFails4bb4in -> evalspeedFails4bb6in : D'=D+A, [], cost: 1
6.56/3.36	
6.56/3.36	      8: evalspeedFails4bb5in -> evalspeedFails4bb6in : D'=D-A, [], cost: 1
6.56/3.36	
6.56/3.36	      9: evalspeedFails4returnin -> evalspeedFails4stop : [], cost: 1
6.56/3.36	
6.56/3.36	
6.56/3.36	
6.56/3.36	Removed unreachable and leaf rules:
6.56/3.36	
6.56/3.36	   Start location: evalspeedFails4start
6.56/3.36	
6.56/3.36	      0: evalspeedFails4start -> evalspeedFails4entryin : [], cost: 1
6.56/3.36	
6.56/3.36	      1: evalspeedFails4entryin -> evalspeedFails4bb6in : A'=1, B'=C, C'=A, D'=B, [ A>=1 ], cost: 1
6.56/3.36	
6.56/3.36	      2: evalspeedFails4entryin -> evalspeedFails4bb6in : A'=-1, B'=C, C'=A, D'=B, [ 0>=A ], cost: 1
6.56/3.36	
6.56/3.36	      3: evalspeedFails4bb6in -> evalspeedFails4bb3in : [ B>=D ], cost: 1
6.56/3.36	
6.56/3.36	      5: evalspeedFails4bb3in -> evalspeedFails4bb4in : [ C>=1 ], cost: 1
6.56/3.36	
6.56/3.36	      6: evalspeedFails4bb3in -> evalspeedFails4bb5in : [ 0>=C ], cost: 1
6.56/3.36	
6.56/3.36	      7: evalspeedFails4bb4in -> evalspeedFails4bb6in : D'=D+A, [], cost: 1
6.56/3.36	
6.56/3.36	      8: evalspeedFails4bb5in -> evalspeedFails4bb6in : D'=D-A, [], cost: 1
6.56/3.36	
6.56/3.36	
6.56/3.36	
6.56/3.36	### Simplification by acceleration and chaining ###
6.56/3.36	
6.56/3.36	
6.56/3.36	
6.56/3.36	Eliminated locations (on linear paths):
6.56/3.36	
6.56/3.36	   Start location: evalspeedFails4start
6.56/3.36	
6.56/3.36	      0: evalspeedFails4start -> evalspeedFails4entryin : [], cost: 1
6.56/3.36	
6.56/3.36	      1: evalspeedFails4entryin -> evalspeedFails4bb6in : A'=1, B'=C, C'=A, D'=B, [ A>=1 ], cost: 1
6.56/3.36	
6.56/3.36	      2: evalspeedFails4entryin -> evalspeedFails4bb6in : A'=-1, B'=C, C'=A, D'=B, [ 0>=A ], cost: 1
6.56/3.36	
6.56/3.36	      3: evalspeedFails4bb6in -> evalspeedFails4bb3in : [ B>=D ], cost: 1
6.56/3.36	
6.56/3.36	     10: evalspeedFails4bb3in -> evalspeedFails4bb6in : D'=D+A, [ C>=1 ], cost: 2
6.56/3.36	
6.56/3.36	     11: evalspeedFails4bb3in -> evalspeedFails4bb6in : D'=D-A, [ 0>=C ], cost: 2
6.56/3.36	
6.56/3.36	
6.56/3.36	
6.56/3.36	Eliminated locations (on tree-shaped paths):
6.56/3.36	
6.56/3.36	   Start location: evalspeedFails4start
6.56/3.36	
6.56/3.36	     12: evalspeedFails4start -> evalspeedFails4bb6in : A'=1, B'=C, C'=A, D'=B, [ A>=1 ], cost: 2
6.56/3.36	
6.56/3.36	     13: evalspeedFails4start -> evalspeedFails4bb6in : A'=-1, B'=C, C'=A, D'=B, [ 0>=A ], cost: 2
6.56/3.36	
6.56/3.36	     14: evalspeedFails4bb6in -> evalspeedFails4bb6in : D'=D+A, [ B>=D && C>=1 ], cost: 3
6.56/3.36	
6.56/3.36	     15: evalspeedFails4bb6in -> evalspeedFails4bb6in : D'=D-A, [ B>=D && 0>=C ], cost: 3
6.56/3.36	
6.56/3.36	
6.56/3.36	
6.56/3.36	Accelerating simple loops of location 2.
6.56/3.36	
6.56/3.36	   Accelerating the following rules:
6.56/3.36	
6.56/3.36	     14: evalspeedFails4bb6in -> evalspeedFails4bb6in : D'=D+A, [ B>=D && C>=1 ], cost: 3
6.56/3.36	
6.56/3.36	     15: evalspeedFails4bb6in -> evalspeedFails4bb6in : D'=D-A, [ B>=D && 0>=C ], cost: 3
6.56/3.36	
6.56/3.36	
6.56/3.36	
6.56/3.36	   Found no metering function for rule 14.
6.56/3.36	
6.56/3.36	   Found no metering function for rule 15.
6.56/3.36	
6.56/3.36	   Removing the simple loops:.
6.56/3.36	
6.56/3.36	
6.56/3.36	
6.56/3.36	Accelerated all simple loops using metering functions (where possible):
6.56/3.36	
6.56/3.36	   Start location: evalspeedFails4start
6.56/3.36	
6.56/3.36	     12: evalspeedFails4start -> evalspeedFails4bb6in : A'=1, B'=C, C'=A, D'=B, [ A>=1 ], cost: 2
6.56/3.36	
6.56/3.36	     13: evalspeedFails4start -> evalspeedFails4bb6in : A'=-1, B'=C, C'=A, D'=B, [ 0>=A ], cost: 2
6.56/3.36	
6.56/3.36	     14: evalspeedFails4bb6in -> evalspeedFails4bb6in : D'=D+A, [ B>=D && C>=1 ], cost: 3
6.56/3.36	
6.56/3.36	     15: evalspeedFails4bb6in -> evalspeedFails4bb6in : D'=D-A, [ B>=D && 0>=C ], cost: 3
6.56/3.36	
6.56/3.36	
6.56/3.36	
6.56/3.36	Chained accelerated rules (with incoming rules):
6.56/3.36	
6.56/3.36	   Start location: evalspeedFails4start
6.56/3.36	
6.56/3.36	     12: evalspeedFails4start -> evalspeedFails4bb6in : A'=1, B'=C, C'=A, D'=B, [ A>=1 ], cost: 2
6.56/3.36	
6.56/3.36	     13: evalspeedFails4start -> evalspeedFails4bb6in : A'=-1, B'=C, C'=A, D'=B, [ 0>=A ], cost: 2
6.56/3.36	
6.56/3.36	     16: evalspeedFails4start -> evalspeedFails4bb6in : A'=1, B'=C, C'=A, D'=1+B, [ A>=1 && C>=B ], cost: 5
6.56/3.36	
6.56/3.36	     17: evalspeedFails4start -> evalspeedFails4bb6in : A'=-1, B'=C, C'=A, D'=1+B, [ 0>=A && C>=B ], cost: 5
6.56/3.36	
6.56/3.36	
6.56/3.36	
6.56/3.36	Removed unreachable locations (and leaf rules with constant cost):
6.56/3.36	
6.56/3.36	   Start location: evalspeedFails4start
6.56/3.36	
6.56/3.36	
6.56/3.36	
6.56/3.36	### Computing asymptotic complexity ###
6.56/3.36	
6.56/3.36	
6.56/3.36	
6.56/3.36	Fully simplified ITS problem
6.56/3.36	
6.56/3.36	   Start location: evalspeedFails4start
6.56/3.36	
6.56/3.36	
6.56/3.36	
6.56/3.36	Obtained the following overall complexity (w.r.t. the length of the input n):
6.56/3.36	
6.56/3.36	   Complexity:  Unknown
6.56/3.36	
6.56/3.36	   Cpx degree:  ?
6.56/3.36	
6.56/3.36	   Solved cost: 0
6.56/3.36	
6.56/3.36	   Rule cost:   0
6.56/3.36	
6.56/3.36	   Rule guard:  []
6.56/3.36	
6.56/3.36	
6.56/3.36	
6.56/3.36	WORST_CASE(Omega(0),?)
6.56/3.36	
6.56/3.36	
6.56/3.36	----------------------------------------
6.56/3.36	
6.56/3.36	(2)
6.56/3.36	BOUNDS(1, INF)
6.56/3.39	EOF