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