/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 =
  g#(x, cons(y, ys)) -> g#(x, ys) 
R = 
  g(x, cons(y, ys)) -> cons(x + y, g(x, ys)) 

We use the subterm criterion with the projection function NU:
  NU[g#(x0,x1)] = x1

This gives the following inequalities:
  cons(y, ys) |> ys

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