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