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