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