MAYBE
Input TRS:
      1: f(x,x) -> f(g(x),x)
      2: g(x) -> s(x)
Number of strict rules: 2
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
     #1: #f(x,x) -> #f(g(x),x)
     #2: #f(x,x) -> #g(x)
Number of SCCs: 1, DPs: 1
  SCC { #1 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
Finding a loop...  failed.