/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 =
  f#(x, y) -> f#(x, y + 1) [x > y]
R = 
  f(x, y) -> f(x, y + 1) [x > y]

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

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

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