WORST_CASE(Omega(1),?)

### Pre-processing the ITS problem ###

Initial linear ITS problem
   Start location: l6
      0: l0 -> l1 : a^0'=a^post_1, b^0'=b^post_1, [ 1<=0 && a^0==a^post_1 && b^0==b^post_1 ], cost: 1
      2: l0 -> l2 : a^0'=a^post_3, b^0'=b^post_3, [ b^post_3==0 && a^0==a^post_3 ], cost: 1
      1: l1 -> l0 : a^0'=a^post_2, b^0'=b^post_2, [ a^0==a^post_2 && b^0==b^post_2 ], cost: 1
      3: l2 -> l3 : a^0'=a^post_4, b^0'=b^post_4, [ 1+b^0<=1 && a^0==a^post_4 && b^0==b^post_4 ], cost: 1
      4: l4 -> l0 : a^0'=a^post_5, b^0'=b^post_5, [ 1+a^0<=1 && a^0==a^post_5 && b^0==b^post_5 ], cost: 1
      5: l4 -> l2 : a^0'=a^post_6, b^0'=b^post_6, [ b^post_6==1 && a^0==a^post_6 ], cost: 1
      6: l5 -> l4 : a^0'=a^post_7, b^0'=b^post_7, [ a^post_7==1 && b^0==b^post_7 ], cost: 1
      7: l6 -> l5 : a^0'=a^post_8, b^0'=b^post_8, [ a^0==a^post_8 && b^0==b^post_8 ], cost: 1

Checking for constant complexity:
   The following rule is satisfiable with cost >= 1, yielding constant complexity:
      7: l6 -> l5 : a^0'=a^post_8, b^0'=b^post_8, [ a^0==a^post_8 && b^0==b^post_8 ], cost: 1

Removed unreachable and leaf rules:
   Start location: l6
      0: l0 -> l1 : a^0'=a^post_1, b^0'=b^post_1, [ 1<=0 && a^0==a^post_1 && b^0==b^post_1 ], cost: 1
      1: l1 -> l0 : a^0'=a^post_2, b^0'=b^post_2, [ a^0==a^post_2 && b^0==b^post_2 ], cost: 1
      4: l4 -> l0 : a^0'=a^post_5, b^0'=b^post_5, [ 1+a^0<=1 && a^0==a^post_5 && b^0==b^post_5 ], cost: 1
      6: l5 -> l4 : a^0'=a^post_7, b^0'=b^post_7, [ a^post_7==1 && b^0==b^post_7 ], cost: 1
      7: l6 -> l5 : a^0'=a^post_8, b^0'=b^post_8, [ a^0==a^post_8 && b^0==b^post_8 ], cost: 1

Removed rules with unsatisfiable guard:
   Start location: l6
      1: l1 -> l0 : a^0'=a^post_2, b^0'=b^post_2, [ a^0==a^post_2 && b^0==b^post_2 ], cost: 1
      4: l4 -> l0 : a^0'=a^post_5, b^0'=b^post_5, [ 1+a^0<=1 && a^0==a^post_5 && b^0==b^post_5 ], cost: 1
      6: l5 -> l4 : a^0'=a^post_7, b^0'=b^post_7, [ a^post_7==1 && b^0==b^post_7 ], cost: 1
      7: l6 -> l5 : a^0'=a^post_8, b^0'=b^post_8, [ a^0==a^post_8 && b^0==b^post_8 ], cost: 1

Removed unreachable and leaf rules:
   Start location: l6
     <empty>

Empty problem, aborting

Obtained the following overall complexity (w.r.t. the length of the input n):
   Complexity:  Constant
   Cpx degree:  0
   Solved cost: 1
   Rule cost:   1
   Rule guard:  [ a^0==a^post_8 && b^0==b^post_8 ]

WORST_CASE(Omega(1),?)