MAYBE
Input TRS:
      1: g(x,x) -> g(a(),b())
      2: g(c(),g(c(),x)) -> g(e(),g(d(),x))
      3: g(d(),g(d(),x)) -> g(c(),g(e(),x))
      4: g(e(),g(e(),x)) -> g(d(),g(c(),x))
      5: f(g(x,y)) -> g(y,g(f(f(x)),a()))
Number of strict rules: 5
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
     #1: #g(c(),g(c(),x)) -> #g(e(),g(d(),x))
     #2: #g(c(),g(c(),x)) -> #g(d(),x)
     #3: #f(g(x,y)) -> #g(y,g(f(f(x)),a()))
     #4: #f(g(x,y)) -> #g(f(f(x)),a())
     #5: #f(g(x,y)) -> #f(f(x))
     #6: #f(g(x,y)) -> #f(x)
     #7: #g(d(),g(d(),x)) -> #g(c(),g(e(),x))
     #8: #g(d(),g(d(),x)) -> #g(e(),x)
     #9: #g(x,x) -> #g(a(),b())
     #10: #g(e(),g(e(),x)) -> #g(d(),g(c(),x))
     #11: #g(e(),g(e(),x)) -> #g(c(),x)
Number of SCCs: 3, DPs: 9
  SCC { #9 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
Finding a loop...  failed.