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