WORST_CASE(Omega(0),?)

Initial ITS
Start location: l3
   0: l0 -> l1 : x^0'=x^post0, (1 <= 0 /\ x^0-x^post0 == 0), cost: 1
   1: l1 -> l0 : x^0'=x^post1, -x^post1+x^0 == 0, cost: 1
   2: l2 -> l0 : x^0'=x^post2, -x^post2+x^0 == 0, cost: 1
   3: l3 -> l2 : x^0'=x^post3, x^0-x^post3 == 0, cost: 1


Removed rules with unsatisfiable guard
Start location: l3
   1: l1 -> l0 : x^0'=x^post1, -x^post1+x^0 == 0, cost: 1
   2: l2 -> l0 : x^0'=x^post2, -x^post2+x^0 == 0, cost: 1
   3: l3 -> l2 : x^0'=x^post3, x^0-x^post3 == 0, cost: 1


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


Computing asymptotic complexity

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

Solved cost: 0
Rule cost:   0