3.56/1.95	WORST_CASE(NON_POLY, ?)
3.56/1.95	proof of /export/starexec/sandbox/benchmark/theBenchmark.koat
3.56/1.95	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
3.56/1.95	
3.56/1.95	
3.56/1.95	The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(INF, INF).
3.56/1.95	
3.56/1.95	(0) CpxIntTrs
3.56/1.95	(1) Loat Proof [FINISHED, 145 ms]
3.56/1.95	(2) BOUNDS(INF, INF)
3.56/1.95	
3.56/1.95	
3.56/1.95	----------------------------------------
3.56/1.95	
3.56/1.95	(0)
3.56/1.95	Obligation:
3.56/1.95	Complexity Int TRS consisting of the following rules:
3.56/1.95	f3(A, B) -> Com_1(f0(2, B)) :|: TRUE
3.56/1.95	f0(A, B) -> Com_1(f0(A + 1, C)) :|: C >= 1
3.56/1.95	f0(A, B) -> Com_1(f0(A - 1, C)) :|: 0 >= C
3.56/1.95	
3.56/1.95	The start-symbols are:[f3_2]
3.56/1.95	
3.56/1.95	
3.56/1.95	----------------------------------------
3.56/1.95	
3.56/1.95	(1) Loat Proof (FINISHED)
3.56/1.95	
3.56/1.95	
3.56/1.95	### Pre-processing the ITS problem ###
3.56/1.95	
3.56/1.95	
3.56/1.95	
3.56/1.95	Initial linear ITS problem
3.56/1.95	
3.56/1.95	   Start location: f3
3.56/1.95	
3.56/1.95	      0: f3 -> f0 : A'=2, [], cost: 1
3.56/1.95	
3.56/1.95	      1: f0 -> f0 : A'=1+A, B'=free, [ free>=1 ], cost: 1
3.56/1.95	
3.56/1.95	      2: f0 -> f0 : A'=-1+A, B'=free_1, [ 0>=free_1 ], cost: 1
3.56/1.95	
3.56/1.95	
3.56/1.95	
3.56/1.95	### Simplification by acceleration and chaining ###
3.56/1.95	
3.56/1.95	
3.56/1.95	
3.56/1.95	Accelerating simple loops of location 1.
3.56/1.95	
3.56/1.95	   Accelerating the following rules:
3.56/1.95	
3.56/1.95	      1: f0 -> f0 : A'=1+A, B'=free, [ free>=1 ], cost: 1
3.56/1.95	
3.56/1.95	      2: f0 -> f0 : A'=-1+A, B'=free_1, [ 0>=free_1 ], cost: 1
3.56/1.95	
3.56/1.95	
3.56/1.95	
3.56/1.95	   Accelerated rule 1 with NONTERM, yielding the new rule 3.
3.56/1.95	
3.56/1.95	   Accelerated rule 2 with NONTERM, yielding the new rule 4.
3.56/1.95	
3.56/1.95	   Removing the simple loops: 1 2.
3.56/1.95	
3.56/1.95	
3.56/1.95	
3.56/1.95	Accelerated all simple loops using metering functions (where possible):
3.56/1.95	
3.56/1.95	   Start location: f3
3.56/1.95	
3.56/1.95	      0: f3 -> f0 : A'=2, [], cost: 1
3.56/1.95	
3.56/1.95	      3: f0 -> [2] : [ free>=1 ], cost: INF
3.56/1.95	
3.56/1.95	      4: f0 -> [2] : [ 0>=free_1 ], cost: INF
3.56/1.95	
3.56/1.95	
3.56/1.95	
3.56/1.95	Chained accelerated rules (with incoming rules):
3.56/1.95	
3.56/1.95	   Start location: f3
3.56/1.95	
3.56/1.95	      0: f3 -> f0 : A'=2, [], cost: 1
3.56/1.95	
3.56/1.95	      5: f3 -> [2] : A'=2, [], cost: INF
3.56/1.95	
3.56/1.95	      6: f3 -> [2] : A'=2, [], cost: INF
3.56/1.95	
3.56/1.95	
3.56/1.95	
3.56/1.95	Removed unreachable locations (and leaf rules with constant cost):
3.56/1.95	
3.56/1.95	   Start location: f3
3.56/1.95	
3.56/1.95	      5: f3 -> [2] : A'=2, [], cost: INF
3.56/1.95	
3.56/1.95	      6: f3 -> [2] : A'=2, [], cost: INF
3.56/1.95	
3.56/1.95	
3.56/1.95	
3.56/1.95	### Computing asymptotic complexity ###
3.56/1.95	
3.56/1.95	
3.56/1.95	
3.56/1.95	Fully simplified ITS problem
3.56/1.95	
3.56/1.95	   Start location: f3
3.56/1.95	
3.56/1.95	      6: f3 -> [2] : A'=2, [], cost: INF
3.56/1.95	
3.56/1.95	
3.56/1.95	
3.56/1.95	Computing asymptotic complexity for rule 6
3.56/1.95	
3.56/1.95	   Resulting cost INF has complexity: Nonterm
3.56/1.95	
3.56/1.95	
3.56/1.95	
3.56/1.95	Found new complexity Nonterm.
3.56/1.95	
3.56/1.95	
3.56/1.95	
3.56/1.95	Obtained the following overall complexity (w.r.t. the length of the input n):
3.56/1.95	
3.56/1.95	   Complexity:  Nonterm
3.56/1.95	
3.56/1.95	   Cpx degree:  Nonterm
3.56/1.95	
3.56/1.95	   Solved cost: INF
3.56/1.95	
3.56/1.95	   Rule cost:   INF
3.56/1.95	
3.56/1.95	   Rule guard:  []
3.56/1.95	
3.56/1.95	
3.56/1.95	
3.56/1.95	NO
3.56/1.95	
3.56/1.95	
3.56/1.95	----------------------------------------
3.56/1.95	
3.56/1.95	(2)
3.56/1.95	BOUNDS(INF, INF)
3.56/1.98	EOF