YES
LCTRS
  Theories
    Core, Ints
  Signature
    g: (Int, Int) -> Int
  Rules
    g(!x, !y) -> 0 [or(<(!x, 0), <(!y, 0))]
    g(!x, !y) -> 0 [or(or(>=(-(!x, 1), -(!y, 1)), <(-(!x, 1), 0)), <(-(!y, 1), 0))]
    g(!x, !y) -> 0 [or(<(!x, 0), <(!y, 0))]
    g(0, !y) -> 0 [>=(!y, 0)]
    g(!x, !y) -> g(-(!x, 1), -(!y, 1)) [and(and(<(-(!x, 1), -(!y, 1)), >=(-(!x, 1), 0)), >=(-(!y, 1), 0))]
DPGraph with indexed dependency pairs
  {1: g#(!x, !y) -> g#(-(!x, 1), -(!y, 1)) [and(and(<(-(!x, 1), -(!y, 1)), >=(-(!x, 1), 0)), >=(-(!y, 1), 0))]}
and edges
  1 -> {1}
with 1 SCC(s)
  SCC:
    {g#(!x, !y) -> g#(-(!x, 1), -(!y, 1)) [and(and(<(-(!x, 1), -(!y, 1)), >=(-(!x, 1), 0)), >=(-(!y, 1), 0))]}
Value criterion after 1 iteration(s) with the projections:
  Iteration 1:
    projection(s):
      v(g#) = 1
    removing the rule(s):
      {g#(!x, !y) -> g#(-(!x, 1), -(!y, 1)) [and(and(<(-(!x, 1), -(!y, 1)), >=(-(!x, 1), 0)), >=(-(!y, 1), 0))]}

Elapsed Time:  36.90 ms