/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 - 1, y - 1) [x > 0 && y > 0]
R = 
  eval(x, y) -> eval(x - 1, y - 1) [x > 0 && y > 0]

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

This gives the following inequalities:
  x > 0 && y > 0  ==>  x > x - 1  with  x >= 0

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