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