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