WORST_CASE(Omega(0),?)

Initial ITS
Start location: l2
   0: l0 -> l1 : x^0'=x^post0, -1+x^post0 == 0, cost: 1
   1: l2 -> l0 : x^0'=x^post1, x^0-x^post1 == 0, cost: 1


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


Computing asymptotic complexity

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

Solved cost: 0
Rule cost:   0