YES
Input TRS:
      1: f(a(),y) -> f(y,g(y))
      2: g(a()) -> b()
      3: g(b()) -> b()
Number of strict rules: 3
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
     #1: #f(a(),y) -> #f(y,g(y))
     #2: #f(a(),y) -> #g(y)
Number of SCCs: 1, DPs: 1
  SCC { #1 }
POLO(Sum)... succeeded.
      a 	w: 2
      b 	w: 1
      f 	w: 0
      #f 	w: x1 + x2
      #g 	w: 0
      g 	w: 1
    USABLE RULES: { 2 3 }
    Removed DPs: #1
Number of SCCs: 0, DPs: 0