MAYBE
Input TRS:
      1: f(g(f(x))) -> f(g(g(g(f(x)))))
      2: g(x) ->= g(g(x))
      3: g(x) ->= g(g(f(g(g(x)))))
      4: f(x) ->= g(g(f(g(g(x)))))
Number of strict rules: 1
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
     #1: #g(x) ->? #g(g(x))
     #2: #g(x) ->? #g(x)
     #3: #g(x) ->? #g(g(f(g(g(x)))))
     #4: #g(x) ->? #g(f(g(g(x))))
     #5: #g(x) ->? #f(g(g(x)))
     #6: #g(x) ->? #g(g(x))
     #7: #g(x) ->? #g(x)
     #8: #f(g(f(x))) -> #f(g(g(g(f(x)))))
     #9: #f(g(f(x))) -> #g(g(g(f(x))))
     #10: #f(g(f(x))) -> #g(g(f(x)))
     #11: #f(x) ->? #g(g(f(g(g(x)))))
     #12: #f(x) ->? #g(f(g(g(x))))
     #13: #f(x) ->? #f(g(g(x)))
     #14: #f(x) ->? #g(g(x))
     #15: #f(x) ->? #g(x)
Number of SCCs: 1, DPs: 15
  SCC { #1..15 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... succeeded.
      f 	w: max(x1 + 23922, 0)
      #f 	w: max(x1 - 8366, 0)
      #g 	w: max(x1 - 39476, 0)
      g 	w: max(x1 - 15555, 0)
    USABLE RULES: { 1..4 }
    Removed DPs: #8..10
Number of SCCs: 1, DPs: 12
  SCC { #1..7 #11..15 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
Finding a loop...  failed.