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


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


YES

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

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

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

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