WORST_CASE(Omega(0),?)

Initial ITS
Start location: l4
   0: l0 -> l1 : tmp3^0'=tmp3^post0, j^0'=j^post0, tmp2^0'=tmp2^post0, i^0'=i^post0, tmp1^0'=tmp1^post0, (-tmp1^post0+tmp1^0 == 0 /\ tmp3^0-tmp3^post0 == 0 /\ i^0-i^post0 == 0 /\ -j^post0+j^0 == 0 /\ tmp2^0-tmp2^post0 == 0), cost: 1
   1: l2 -> l0 : tmp3^0'=tmp3^post1, j^0'=j^post1, tmp2^0'=tmp2^post1, i^0'=i^post1, tmp1^0'=tmp1^post1, (-i^post1+i^0 == 0 /\ -tmp2^post1+tmp2^0 == 0 /\ -tmp1^post1+tmp1^0 == 0 /\ j^0-j^post1 == 0 /\ tmp3^0-tmp3^post1 == 0), cost: 1
   2: l2 -> l0 : tmp3^0'=tmp3^post2, j^0'=j^post2, tmp2^0'=tmp2^post2, i^0'=i^post2, tmp1^0'=tmp1^post2, (tmp3^0-tmp3^post2 == 0 /\ -j^post2+j^0 == 0 /\ -tmp1^post2+tmp1^0 == 0 /\ i^0-i^post2 == 0 /\ tmp2^0-tmp2^post2 == 0), cost: 1
   3: l3 -> l2 : tmp3^0'=tmp3^post3, j^0'=j^post3, tmp2^0'=tmp2^post3, i^0'=i^post3, tmp1^0'=tmp1^post3, (0 == 0 /\ i^post3 == 0 /\ -1+j^post3 == 0), cost: 1
   4: l4 -> l3 : tmp3^0'=tmp3^post4, j^0'=j^post4, tmp2^0'=tmp2^post4, i^0'=i^post4, tmp1^0'=tmp1^post4, (i^0-i^post4 == 0 /\ tmp2^0-tmp2^post4 == 0 /\ -tmp1^post4+tmp1^0 == 0 /\ j^0-j^post4 == 0 /\ tmp3^0-tmp3^post4 == 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