/export/starexec/sandbox/solver/bin/starexec_run_Itrs /export/starexec/sandbox/benchmark/theBenchmark.itrs /export/starexec/sandbox/output/output_files


--------------------------------------------------------------------------------


YES

DP problem for innermost termination.
P =
  eval#(x, y, z) -> eval#(x, y, z + y) [x >= z && y > 0]
R = 
  eval(x, y, z) -> eval(x, y, z + y) [x >= z && y > 0]

We use the reverse value criterion with the projection function NU:
  NU[eval#(z1,z2,z3)] = z1 + -1 * z3

This gives the following inequalities:
  x >= z && y > 0  ==>  x + -1 * z > x + -1 * (z + y)  with  x + -1 * z >= 0

All dependency pairs are strictly oriented, so the entire dependency pair problem may be removed.