WORST_CASE(Omega(0),?)

Initial ITS
Start location: l4
   0: l0 -> l1 : tmp^0'=tmp^post0, tmp^0-tmp^post0 == 0, cost: 1
   1: l2 -> l0 : tmp^0'=tmp^post1, -tmp^post1+tmp^0 == 0, cost: 1
   2: l3 -> l2 : tmp^0'=tmp^post2, -tmp^post2+tmp^0 == 0, cost: 1
   3: l3 -> l0 : tmp^0'=tmp^post3, 0 == 0, cost: 1
   4: l3 -> l2 : tmp^0'=tmp^post4, -tmp^post4+tmp^0 == 0, cost: 1
   5: l4 -> l3 : tmp^0'=tmp^post5, -tmp^post5+tmp^0 == 0, cost: 1


Removed unreachable rules and leafs
Start location: l4
  <empty>


Computing asymptotic complexity

Proved the following lower bound
Complexity:  Unknown
Cpx degree: ?

Solved cost: 0
Rule cost:   0