YES
Input TRS:
      1: f(f(X)) -> f(a(b(f(X))))
      2: f(a(g(X))) -> b(X)
      3: b(X) -> a(X)
Number of strict rules: 3
Direct POLO(bPol) ... removes: 2
      a 	w: x1
      b 	w: x1
      f 	w: x1 + 5854
      g 	w: 2 * x1 + 28101
Number of strict rules: 2
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
     #1: #f(f(X)) -> #f(a(b(f(X))))
     #2: #f(f(X)) -> #b(f(X))
Number of SCCs: 0, DPs: 0