11.07/4.86	WORST_CASE(NON_POLY, ?)
11.07/4.87	proof of /export/starexec/sandbox/benchmark/theBenchmark.koat
11.07/4.87	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
11.07/4.87	
11.07/4.87	
11.07/4.87	The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(INF, INF).
11.07/4.87	
11.07/4.87	(0) CpxIntTrs
11.07/4.87	(1) Loat Proof [FINISHED, 3231 ms]
11.07/4.87	(2) BOUNDS(INF, INF)
11.07/4.87	
11.07/4.87	
11.07/4.87	----------------------------------------
11.07/4.87	
11.07/4.87	(0)
11.07/4.87	Obligation:
11.07/4.87	Complexity Int TRS consisting of the following rules:
11.07/4.87	f2(A, B, C) -> Com_1(f300(A, B, D)) :|: A >= 3 && B >= 2
11.07/4.87	f2(A, B, C) -> Com_1(f2(1, 2, C)) :|: 1 >= D && B >= 1 && B <= 1 && A >= 1 && A <= 1
11.07/4.87	f2(A, B, C) -> Com_1(f2(1 + A, 2, C)) :|: A >= 2 && 1 >= D && B >= 1 && B <= 1
11.07/4.87	f2(A, B, C) -> Com_1(f2(1 + A, 2, C)) :|: 0 >= A && 1 >= D && B >= 1 && B <= 1
11.07/4.87	f2(A, B, C) -> Com_1(f2(1, 1 + B, C)) :|: B >= 2 && 1 >= B && A >= 1 && A <= 1
11.07/4.87	f2(A, B, C) -> Com_1(f2(1, 1 + B, C)) :|: 0 >= B && 1 >= B && A >= 1 && A <= 1
11.07/4.87	f2(A, B, C) -> Com_1(f2(1 + A, 1 + B, C)) :|: 1 >= B && A >= 2 && B >= 2
11.07/4.87	f2(A, B, C) -> Com_1(f2(1 + A, 1 + B, C)) :|: 1 >= B && A >= 2 && 0 >= B
11.07/4.87	f2(A, B, C) -> Com_1(f2(1 + A, 1 + B, C)) :|: 1 >= B && 0 >= A && B >= 2
11.07/4.87	f2(A, B, C) -> Com_1(f2(1 + A, 1 + B, C)) :|: 1 >= B && 0 >= A && 0 >= B
11.07/4.87	f2(A, B, C) -> Com_1(f2(1, 1 + B, C)) :|: B >= 2 && 2 >= D && A >= 1 && A <= 1
11.07/4.87	f2(A, B, C) -> Com_1(f2(1, 1 + B, C)) :|: B >= 2 && 0 >= B && 2 >= D && A >= 1 && A <= 1
11.07/4.87	f2(A, B, C) -> Com_1(f2(1 + A, 1 + B, C)) :|: B >= 2 && A >= 2 && A <= 2
11.07/4.87	f2(A, B, C) -> Com_1(f2(1 + A, 1 + B, C)) :|: B >= 2 && 0 >= B && A >= 2 && A <= 2
11.07/4.87	f2(A, B, C) -> Com_1(f2(1 + A, 1 + B, C)) :|: B >= 2 && 2 >= A && 0 >= A
11.07/4.87	f2(A, B, C) -> Com_1(f2(1 + A, 1 + B, C)) :|: B >= 2 && 2 >= A && 0 >= A && 0 >= B
11.07/4.87	f1(A, B, C) -> Com_1(f2(A, B, C)) :|: TRUE
11.07/4.87	
11.07/4.87	The start-symbols are:[f1_3]
11.07/4.87	
11.07/4.87	
11.07/4.87	----------------------------------------
11.07/4.87	
11.07/4.87	(1) Loat Proof (FINISHED)
11.07/4.87	
11.07/4.87	
11.07/4.87	### Pre-processing the ITS problem ###
11.07/4.87	
11.07/4.87	
11.07/4.87	
11.07/4.87	Initial linear ITS problem
11.07/4.87	
11.07/4.87	   Start location: f1
11.07/4.87	
11.07/4.87	      0: f2 -> f300 : C'=free, [ A>=3 && B>=2 ], cost: 1
11.07/4.87	
11.07/4.87	      1: f2 -> f2 : A'=1, B'=2, [ 1>=free_1 && B==1 && A==1 ], cost: 1
11.07/4.87	
11.07/4.87	      2: f2 -> f2 : A'=1+A, B'=2, [ A>=2 && 1>=free_2 && B==1 ], cost: 1
11.07/4.87	
11.07/4.87	      3: f2 -> f2 : A'=1+A, B'=2, [ 0>=A && 1>=free_3 && B==1 ], cost: 1
11.07/4.87	
11.07/4.87	      4: f2 -> f2 : A'=1, B'=1+B, [ B>=2 && 1>=B && A==1 ], cost: 1
11.07/4.87	
11.07/4.87	      5: f2 -> f2 : A'=1, B'=1+B, [ 0>=B && 1>=B && A==1 ], cost: 1
11.07/4.87	
11.07/4.87	      6: f2 -> f2 : A'=1+A, B'=1+B, [ 1>=B && A>=2 && B>=2 ], cost: 1
11.07/4.87	
11.07/4.87	      7: f2 -> f2 : A'=1+A, B'=1+B, [ 1>=B && A>=2 && 0>=B ], cost: 1
11.07/4.87	
11.07/4.87	      8: f2 -> f2 : A'=1+A, B'=1+B, [ 1>=B && 0>=A && B>=2 ], cost: 1
11.07/4.87	
11.07/4.87	      9: f2 -> f2 : A'=1+A, B'=1+B, [ 1>=B && 0>=A && 0>=B ], cost: 1
11.07/4.87	
11.07/4.87	     10: f2 -> f2 : A'=1, B'=1+B, [ B>=2 && 2>=free_4 && A==1 ], cost: 1
11.07/4.87	
11.07/4.87	     11: f2 -> f2 : A'=1, B'=1+B, [ B>=2 && 0>=B && 2>=free_5 && A==1 ], cost: 1
11.07/4.87	
11.07/4.87	     12: f2 -> f2 : A'=1+A, B'=1+B, [ B>=2 && A==2 ], cost: 1
11.07/4.87	
11.07/4.87	     13: f2 -> f2 : A'=1+A, B'=1+B, [ B>=2 && 0>=B && A==2 ], cost: 1
11.07/4.87	
11.07/4.87	     14: f2 -> f2 : A'=1+A, B'=1+B, [ B>=2 && 2>=A && 0>=A ], cost: 1
11.07/4.87	
11.07/4.87	     15: f2 -> f2 : A'=1+A, B'=1+B, [ B>=2 && 2>=A && 0>=A && 0>=B ], cost: 1
11.07/4.87	
11.07/4.87	     16: f1 -> f2 : [], cost: 1
11.07/4.87	
11.07/4.87	
11.07/4.87	
11.07/4.87	Removed unreachable and leaf rules:
11.07/4.87	
11.07/4.87	   Start location: f1
11.07/4.87	
11.07/4.87	      1: f2 -> f2 : A'=1, B'=2, [ 1>=free_1 && B==1 && A==1 ], cost: 1
11.07/4.87	
11.07/4.87	      2: f2 -> f2 : A'=1+A, B'=2, [ A>=2 && 1>=free_2 && B==1 ], cost: 1
11.07/4.87	
11.07/4.87	      3: f2 -> f2 : A'=1+A, B'=2, [ 0>=A && 1>=free_3 && B==1 ], cost: 1
11.07/4.87	
11.07/4.87	      4: f2 -> f2 : A'=1, B'=1+B, [ B>=2 && 1>=B && A==1 ], cost: 1
11.07/4.87	
11.07/4.87	      5: f2 -> f2 : A'=1, B'=1+B, [ 0>=B && 1>=B && A==1 ], cost: 1
11.07/4.87	
11.07/4.87	      6: f2 -> f2 : A'=1+A, B'=1+B, [ 1>=B && A>=2 && B>=2 ], cost: 1
11.07/4.87	
11.07/4.87	      7: f2 -> f2 : A'=1+A, B'=1+B, [ 1>=B && A>=2 && 0>=B ], cost: 1
11.07/4.87	
11.07/4.87	      8: f2 -> f2 : A'=1+A, B'=1+B, [ 1>=B && 0>=A && B>=2 ], cost: 1
11.07/4.87	
11.07/4.87	      9: f2 -> f2 : A'=1+A, B'=1+B, [ 1>=B && 0>=A && 0>=B ], cost: 1
11.07/4.87	
11.07/4.87	     10: f2 -> f2 : A'=1, B'=1+B, [ B>=2 && 2>=free_4 && A==1 ], cost: 1
11.07/4.87	
11.07/4.87	     11: f2 -> f2 : A'=1, B'=1+B, [ B>=2 && 0>=B && 2>=free_5 && A==1 ], cost: 1
11.07/4.87	
11.07/4.87	     12: f2 -> f2 : A'=1+A, B'=1+B, [ B>=2 && A==2 ], cost: 1
11.07/4.87	
11.07/4.87	     13: f2 -> f2 : A'=1+A, B'=1+B, [ B>=2 && 0>=B && A==2 ], cost: 1
11.07/4.87	
11.07/4.87	     14: f2 -> f2 : A'=1+A, B'=1+B, [ B>=2 && 2>=A && 0>=A ], cost: 1
11.07/4.87	
11.07/4.87	     15: f2 -> f2 : A'=1+A, B'=1+B, [ B>=2 && 2>=A && 0>=A && 0>=B ], cost: 1
11.07/4.87	
11.07/4.87	     16: f1 -> f2 : [], cost: 1
11.07/4.87	
11.07/4.87	
11.07/4.87	
11.07/4.87	Removed rules with unsatisfiable guard:
11.07/4.87	
11.07/4.87	   Start location: f1
11.07/4.87	
11.07/4.87	      1: f2 -> f2 : A'=1, B'=2, [ 1>=free_1 && B==1 && A==1 ], cost: 1
11.07/4.87	
11.07/4.87	      2: f2 -> f2 : A'=1+A, B'=2, [ A>=2 && 1>=free_2 && B==1 ], cost: 1
11.07/4.87	
11.07/4.87	      3: f2 -> f2 : A'=1+A, B'=2, [ 0>=A && 1>=free_3 && B==1 ], cost: 1
11.07/4.87	
11.07/4.87	      5: f2 -> f2 : A'=1, B'=1+B, [ 0>=B && 1>=B && A==1 ], cost: 1
11.07/4.87	
11.07/4.87	      7: f2 -> f2 : A'=1+A, B'=1+B, [ 1>=B && A>=2 && 0>=B ], cost: 1
11.07/4.87	
11.07/4.87	      9: f2 -> f2 : A'=1+A, B'=1+B, [ 1>=B && 0>=A && 0>=B ], cost: 1
11.07/4.87	
11.07/4.87	     10: f2 -> f2 : A'=1, B'=1+B, [ B>=2 && 2>=free_4 && A==1 ], cost: 1
11.07/4.87	
11.07/4.87	     12: f2 -> f2 : A'=1+A, B'=1+B, [ B>=2 && A==2 ], cost: 1
11.07/4.87	
11.07/4.87	     14: f2 -> f2 : A'=1+A, B'=1+B, [ B>=2 && 2>=A && 0>=A ], cost: 1
11.07/4.87	
11.07/4.87	     16: f1 -> f2 : [], cost: 1
11.07/4.87	
11.07/4.87	
11.07/4.87	
11.07/4.87	Simplified all rules, resulting in:
11.07/4.87	
11.07/4.87	   Start location: f1
11.07/4.87	
11.07/4.87	      1: f2 -> f2 : A'=1, B'=2, [ B==1 && A==1 ], cost: 1
11.07/4.87	
11.07/4.87	      2: f2 -> f2 : A'=1+A, B'=2, [ A>=2 && B==1 ], cost: 1
11.07/4.87	
11.07/4.87	      3: f2 -> f2 : A'=1+A, B'=2, [ 0>=A && B==1 ], cost: 1
11.07/4.87	
11.07/4.87	      5: f2 -> f2 : A'=1, B'=1+B, [ 0>=B && A==1 ], cost: 1
11.07/4.87	
11.07/4.87	      7: f2 -> f2 : A'=1+A, B'=1+B, [ A>=2 && 0>=B ], cost: 1
11.07/4.87	
11.07/4.87	      9: f2 -> f2 : A'=1+A, B'=1+B, [ 0>=A && 0>=B ], cost: 1
11.07/4.87	
11.07/4.87	     10: f2 -> f2 : A'=1, B'=1+B, [ B>=2 && A==1 ], cost: 1
11.07/4.87	
11.07/4.87	     12: f2 -> f2 : A'=1+A, B'=1+B, [ B>=2 && A==2 ], cost: 1
11.07/4.87	
11.07/4.87	     14: f2 -> f2 : A'=1+A, B'=1+B, [ B>=2 && 0>=A ], cost: 1
11.07/4.87	
11.07/4.87	     16: f1 -> f2 : [], cost: 1
11.07/4.87	
11.07/4.87	
11.07/4.87	
11.07/4.87	### Simplification by acceleration and chaining ###
11.07/4.87	
11.07/4.87	
11.07/4.87	
11.07/4.87	Accelerating simple loops of location 0.
11.07/4.87	
11.07/4.87	   Accelerating the following rules:
11.07/4.87	
11.07/4.87	      1: f2 -> f2 : A'=1, B'=2, [ B==1 && A==1 ], cost: 1
11.07/4.87	
11.07/4.87	      2: f2 -> f2 : A'=1+A, B'=2, [ A>=2 && B==1 ], cost: 1
11.07/4.87	
11.07/4.87	      3: f2 -> f2 : A'=1+A, B'=2, [ 0>=A && B==1 ], cost: 1
11.07/4.87	
11.07/4.87	      5: f2 -> f2 : A'=1, B'=1+B, [ 0>=B && A==1 ], cost: 1
11.07/4.87	
11.07/4.87	      7: f2 -> f2 : A'=1+A, B'=1+B, [ A>=2 && 0>=B ], cost: 1
11.07/4.87	
11.07/4.87	      9: f2 -> f2 : A'=1+A, B'=1+B, [ 0>=A && 0>=B ], cost: 1
11.07/4.87	
11.07/4.87	     10: f2 -> f2 : A'=1, B'=1+B, [ B>=2 && A==1 ], cost: 1
11.07/4.87	
11.07/4.87	     12: f2 -> f2 : A'=1+A, B'=1+B, [ B>=2 && A==2 ], cost: 1
11.07/4.87	
11.07/4.87	     14: f2 -> f2 : A'=1+A, B'=1+B, [ B>=2 && 0>=A ], cost: 1
11.07/4.87	
11.07/4.87	
11.07/4.87	
11.07/4.87	   Accelerated rule 1 with metering function 2-B, yielding the new rule 17.
11.07/4.87	
11.07/4.87	   Accelerated rule 2 with metering function 2-B, yielding the new rule 18.
11.07/4.87	
11.07/4.87	   Accelerated rule 3 with metering function 1-B, yielding the new rule 19.
11.07/4.87	
11.07/4.87	   Accelerated rule 5 with metering function 1-B, yielding the new rule 20.
11.07/4.87	
11.07/4.87	   Accelerated rule 7 with metering function 1-B, yielding the new rule 21.
11.07/4.87	
11.07/4.87	   Accelerated rule 9 with metering function 1-A (after adding A>=B), yielding the new rule 22.
11.07/4.87	
11.07/4.87	   Accelerated rule 9 with metering function 1-B (after adding A<=B), yielding the new rule 23.
11.07/4.87	
11.07/4.87	   Accelerated rule 10 with NONTERM, yielding the new rule 24.
11.07/4.87	
11.07/4.87	   Accelerated rule 12 with metering function 3-A, yielding the new rule 25.
11.07/4.87	
11.07/4.87	   Accelerated rule 14 with metering function 1-A, yielding the new rule 26.
11.07/4.87	
11.07/4.87	   Removing the simple loops: 1 2 3 5 7 9 10 12 14.
11.07/4.87	
11.07/4.87	
11.07/4.87	
11.07/4.87	Accelerated all simple loops using metering functions (where possible):
11.07/4.87	
11.07/4.87	   Start location: f1
11.07/4.87	
11.07/4.87	     17: f2 -> f2 : A'=1, B'=2, [ B==1 && A==1 ], cost: 2-B
11.07/4.87	
11.07/4.87	     18: f2 -> f2 : A'=2+A-B, B'=2, [ A>=2 && B==1 ], cost: 2-B
11.07/4.87	
11.07/4.87	     19: f2 -> f2 : A'=1+A-B, B'=2, [ 0>=A && B==1 && 1-B>=1 ], cost: 1-B
11.07/4.87	
11.07/4.87	     20: f2 -> f2 : A'=1, B'=1, [ 0>=B && A==1 ], cost: 1-B
11.07/4.87	
11.07/4.87	     21: f2 -> f2 : A'=1+A-B, B'=1, [ A>=2 && 0>=B ], cost: 1-B
11.07/4.87	
11.07/4.87	     22: f2 -> f2 : A'=1, B'=1-A+B, [ 0>=A && 0>=B && A>=B ], cost: 1-A
11.07/4.87	
11.07/4.87	     23: f2 -> f2 : A'=1+A-B, B'=1, [ 0>=A && 0>=B && A<=B ], cost: 1-B
11.07/4.87	
11.07/4.87	     24: f2 -> [3] : [ B>=2 && A==1 ], cost: INF
11.07/4.87	
11.07/4.87	     25: f2 -> f2 : A'=3, B'=3-A+B, [ B>=2 && A==2 ], cost: 3-A
11.07/4.87	
11.07/4.87	     26: f2 -> f2 : A'=1, B'=1-A+B, [ B>=2 && 0>=A ], cost: 1-A
11.07/4.87	
11.07/4.87	     16: f1 -> f2 : [], cost: 1
11.07/4.87	
11.07/4.87	
11.07/4.87	
11.07/4.87	Chained accelerated rules (with incoming rules):
11.07/4.87	
11.07/4.87	   Start location: f1
11.07/4.87	
11.07/4.87	     16: f1 -> f2 : [], cost: 1
11.07/4.87	
11.07/4.87	     27: f1 -> f2 : A'=1, B'=2, [ B==1 && A==1 ], cost: 3-B
11.07/4.87	
11.07/4.87	     28: f1 -> f2 : A'=2+A-B, B'=2, [ A>=2 && B==1 ], cost: 3-B
11.07/4.87	
11.07/4.87	     29: f1 -> f2 : A'=1, B'=1, [ 0>=B && A==1 ], cost: 2-B
11.07/4.87	
11.07/4.87	     30: f1 -> f2 : A'=1+A-B, B'=1, [ A>=2 && 0>=B ], cost: 2-B
11.07/4.87	
11.07/4.87	     31: f1 -> f2 : A'=1, B'=1-A+B, [ 0>=A && 0>=B && A>=B ], cost: 2-A
11.07/4.87	
11.07/4.87	     32: f1 -> f2 : A'=1+A-B, B'=1, [ 0>=A && 0>=B && A<=B ], cost: 2-B
11.07/4.87	
11.07/4.87	     33: f1 -> [3] : [ B>=2 && A==1 ], cost: INF
11.07/4.87	
11.07/4.87	     34: f1 -> f2 : A'=3, B'=3-A+B, [ B>=2 && A==2 ], cost: 4-A
11.07/4.87	
11.07/4.87	     35: f1 -> f2 : A'=1, B'=1-A+B, [ B>=2 && 0>=A ], cost: 2-A
11.07/4.87	
11.07/4.87	
11.07/4.87	
11.07/4.87	Removed unreachable locations (and leaf rules with constant cost):
11.07/4.87	
11.07/4.87	   Start location: f1
11.07/4.87	
11.07/4.87	     27: f1 -> f2 : A'=1, B'=2, [ B==1 && A==1 ], cost: 3-B
11.07/4.87	
11.07/4.87	     28: f1 -> f2 : A'=2+A-B, B'=2, [ A>=2 && B==1 ], cost: 3-B
11.07/4.87	
11.07/4.87	     29: f1 -> f2 : A'=1, B'=1, [ 0>=B && A==1 ], cost: 2-B
11.07/4.87	
11.07/4.87	     30: f1 -> f2 : A'=1+A-B, B'=1, [ A>=2 && 0>=B ], cost: 2-B
11.07/4.87	
11.07/4.87	     31: f1 -> f2 : A'=1, B'=1-A+B, [ 0>=A && 0>=B && A>=B ], cost: 2-A
11.07/4.87	
11.07/4.87	     32: f1 -> f2 : A'=1+A-B, B'=1, [ 0>=A && 0>=B && A<=B ], cost: 2-B
11.07/4.87	
11.07/4.87	     33: f1 -> [3] : [ B>=2 && A==1 ], cost: INF
11.07/4.87	
11.07/4.87	     34: f1 -> f2 : A'=3, B'=3-A+B, [ B>=2 && A==2 ], cost: 4-A
11.07/4.87	
11.07/4.87	     35: f1 -> f2 : A'=1, B'=1-A+B, [ B>=2 && 0>=A ], cost: 2-A
11.07/4.87	
11.07/4.87	
11.07/4.87	
11.07/4.87	### Computing asymptotic complexity ###
11.07/4.87	
11.07/4.87	
11.07/4.87	
11.07/4.87	Fully simplified ITS problem
11.07/4.87	
11.07/4.87	   Start location: f1
11.07/4.87	
11.07/4.87	     27: f1 -> f2 : A'=1, B'=2, [ B==1 && A==1 ], cost: 3-B
11.07/4.87	
11.07/4.87	     28: f1 -> f2 : A'=2+A-B, B'=2, [ A>=2 && B==1 ], cost: 3-B
11.07/4.87	
11.07/4.87	     29: f1 -> f2 : A'=1, B'=1, [ 0>=B && A==1 ], cost: 2-B
11.07/4.87	
11.07/4.87	     30: f1 -> f2 : A'=1+A-B, B'=1, [ A>=2 && 0>=B ], cost: 2-B
11.07/4.87	
11.07/4.87	     31: f1 -> f2 : A'=1, B'=1-A+B, [ 0>=A && 0>=B && A>=B ], cost: 2-A
11.07/4.87	
11.07/4.87	     32: f1 -> f2 : A'=1+A-B, B'=1, [ 0>=A && 0>=B && A<=B ], cost: 2-B
11.07/4.87	
11.07/4.87	     33: f1 -> [3] : [ B>=2 && A==1 ], cost: INF
11.07/4.87	
11.07/4.87	     34: f1 -> f2 : A'=3, B'=3-A+B, [ B>=2 && A==2 ], cost: 4-A
11.07/4.87	
11.07/4.87	     35: f1 -> f2 : A'=1, B'=1-A+B, [ B>=2 && 0>=A ], cost: 2-A
11.07/4.87	
11.07/4.87	
11.07/4.87	
11.07/4.87	Computing asymptotic complexity for rule 27
11.07/4.87	
11.07/4.87	   Could not solve the limit problem.
11.07/4.87	
11.07/4.87	   Resulting cost 0 has complexity: Unknown
11.07/4.87	
11.07/4.87	
11.07/4.87	
11.07/4.87	Computing asymptotic complexity for rule 28
11.07/4.87	
11.07/4.87	   Could not solve the limit problem.
11.07/4.87	
11.07/4.87	   Resulting cost 0 has complexity: Unknown
11.07/4.87	
11.07/4.87	
11.07/4.87	
11.07/4.87	Computing asymptotic complexity for rule 29
11.07/4.87	
11.07/4.87	   Solved the limit problem by the following transformations:
11.07/4.87	
11.07/4.87	      Created initial limit problem:
11.07/4.87	
11.07/4.87	      2-A (+/+!), 1-B (+/+!), A (+/+!), 2-B (+) [not solved]
11.07/4.87	
11.07/4.87	
11.07/4.87	
11.07/4.87	      applying transformation rule (C) using substitution {A==1}
11.07/4.87	
11.07/4.87	      resulting limit problem:
11.07/4.87	
11.07/4.87	      1 (+/+!), 1-B (+/+!), 2-B (+) [not solved]
11.07/4.87	
11.07/4.87	
11.07/4.87	
11.07/4.87	      applying transformation rule (B), deleting 1 (+/+!)
11.07/4.87	
11.07/4.87	      resulting limit problem:
11.07/4.87	
11.07/4.87	      1-B (+/+!), 2-B (+) [not solved]
11.07/4.87	
11.07/4.87	
11.07/4.87	
11.07/4.87	      removing all constraints (solved by SMT)
11.07/4.87	
11.07/4.87	      resulting limit problem: [solved]
11.07/4.87	
11.07/4.87	
11.07/4.87	
11.07/4.87	      applying transformation rule (C) using substitution {B==-n}
11.07/4.87	
11.07/4.87	      resulting limit problem:
11.07/4.87	
11.07/4.87	      [solved]
11.07/4.87	
11.07/4.87	
11.07/4.87	
11.07/4.87	   Solution:
11.07/4.87	
11.07/4.87	      A / 1
11.07/4.87	
11.07/4.87	      B / -n
11.07/4.87	
11.07/4.87	   Resulting cost 2+n has complexity: Poly(n^1)
11.07/4.87	
11.07/4.87	
11.07/4.87	
11.07/4.87	Found new complexity Poly(n^1).
11.07/4.87	
11.07/4.87	
11.07/4.87	
11.07/4.87	Computing asymptotic complexity for rule 33
11.07/4.87	
11.07/4.87	   Resulting cost INF has complexity: Nonterm
11.07/4.87	
11.07/4.87	
11.07/4.87	
11.07/4.87	Found new complexity Nonterm.
11.07/4.87	
11.07/4.87	
11.07/4.87	
11.07/4.87	Obtained the following overall complexity (w.r.t. the length of the input n):
11.07/4.87	
11.07/4.87	   Complexity:  Nonterm
11.07/4.87	
11.07/4.87	   Cpx degree:  Nonterm
11.07/4.87	
11.07/4.87	   Solved cost: INF
11.07/4.87	
11.07/4.87	   Rule cost:   INF
11.07/4.87	
11.07/4.87	   Rule guard:  [ B>=2 && A==1 ]
11.07/4.87	
11.07/4.87	
11.07/4.87	
11.07/4.87	NO
11.07/4.87	
11.07/4.87	
11.07/4.87	----------------------------------------
11.07/4.87	
11.07/4.87	(2)
11.07/4.87	BOUNDS(INF, INF)
11.07/4.90	EOF