WORST_CASE(Omega(1),?)

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

Initial linear ITS problem
   Start location: l3
      0: l0 -> l1 : [ 1<=0 ], cost: 1
      1: l1 -> l0 : [ 0<=0 ], cost: 1
      2: l2 -> l0 : [ 0<=0 ], cost: 1
      3: l3 -> l2 : [ 0<=0 ], cost: 1

Checking for constant complexity:
   The following rule is satisfiable with cost >= 1, yielding constant complexity:
      3: l3 -> l2 : [ 0<=0 ], cost: 1

Removed rules with unsatisfiable guard:
   Start location: l3
      1: l1 -> l0 : [ 0<=0 ], cost: 1
      2: l2 -> l0 : [ 0<=0 ], cost: 1
      3: l3 -> l2 : [ 0<=0 ], cost: 1

Removed unreachable and leaf rules:
   Start location: l3
     <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:  [ 0<=0 ]

WORST_CASE(Omega(1),?)