YES
LCTRS
  Theories
    Core, Ints
  Sorts
    result_proc
  Signature
    proc_G: Int -> result_proc
    return_proc: Int -> result_proc
    v: (Int, result_proc) -> result_proc
  Rules
    v(!n, return_proc(!m)) -> return_proc(+(!n, !m))
    proc_G(!n) -> v(!n, proc_G(-(!n, 1))) [>(!n, 1)]
    proc_G(!n) -> return_proc(!n) [<=(!n, 1)]
DPGraph with indexed dependency pairs
  {1: proc_G#(!n) -> v#(!n, proc_G(-(!n, 1))) [>(!n, 1)]
  , 2: proc_G#(!n) -> proc_G#(-(!n, 1)) [>(!n, 1)]}
and edges
  1 -> {}
  2 -> {1, 2}
with 1 SCC(s)
  SCC:
    {proc_G#(!n) -> proc_G#(-(!n, 1)) [>(!n, 1)]}
Value criterion after 1 iteration(s) with the projections:
  Iteration 1:
    projection(s):
      v(proc_G#) = 1
    removing the rule(s):
      {proc_G#(!n) -> proc_G#(-(!n, 1)) [>(!n, 1)]}

Elapsed Time:  31.34 ms