NO
Input TRS:
      1: h(X,Z) -> f(X,s(X),Z)
      2: f(X,Y,g(X,Y)) -> h(0(),g(X,Y))
      3: g(0(),Y) -> 0()
      4: g(X,s(Y)) -> g(X,Y)
Number of strict rules: 4
Direct POLO(bPol) ... removes: 3
      h 	w: 2 * x1 + x2 + 21655
      s 	w: x1
      f 	w: x1 + x2 + x3 + 21655
      0 	w: 0
      g 	w: 2 * x1 + 2 * x2 + 31893
Number of strict rules: 3
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
     #1: #f(X,Y,g(X,Y)) -> #h(0(),g(X,Y))
     #2: #h(X,Z) -> #f(X,s(X),Z)
     #3: #g(X,s(Y)) -> #g(X,Y)
Number of SCCs: 2, DPs: 3
  SCC { #3 }
POLO(Sum)... succeeded.
      h 	w: 0
      s 	w: x1 + 1
      f 	w: 0
      0 	w: 0
      #h 	w: 0
      #f 	w: 0
      #g 	w: x2
      g 	w: 0
    USABLE RULES: { }
    Removed DPs: #3
Number of SCCs: 1, DPs: 2
  SCC { #1 #2 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
Finding a loop...  found.
  #f(0(),s(0()),g(0(),s(0())))	-#1->
  #h(0(),g(0(),s(0())))	--->*
  #h(0(),g(0(),s(0())))	-#2->
  #f(0(),s(0()),g(0(),s(0())))	--->*
  #f(0(),s(0()),g(0(),s(0())))
  Looping with: [ ]