YES
Input TRS:
      1: f(f(x)) -> f(x)
      2: f(s(x)) -> f(x)
      3: g(s(0())) -> g(f(s(0())))
Number of strict rules: 3
Direct POLO(bPol) ... removes: 2
      s 	w: x1 + 1
      f 	w: x1
      0 	w: 11798
      g 	w: x1
Number of strict rules: 2
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
     #1: #g(s(0())) -> #g(f(s(0())))
     #2: #g(s(0())) -> #f(s(0()))
Number of SCCs: 0, DPs: 0