MAYBE
Input TRS:
      1: f(g(x),y,z) -> f(x,y,g(z))
      2: f(x,y,g(z)) ->= f(x,g(y),z)
      3: f(x,a(),z) ->= f(x,g(a()),z)
      4: f(x,y,z) ->= f(x,y,g(z))
Number of strict rules: 1
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
     #1: #f(x,y,g(z)) ->? #f(x,g(y),z)
     #2: #f(x,a(),z) ->? #f(x,g(a()),z)
     #3: #f(g(x),y,z) -> #f(x,y,g(z))
     #4: #f(x,y,z) ->? #f(x,y,g(z))
Number of SCCs: 1, DPs: 4
  SCC { #1..4 }
POLO(Sum)... succeeded.
      a 	w: 1
      f 	w: 0
      #f 	w: x1
      g 	w: x1 + 1
    USABLE RULES: { }
    Removed DPs: #3
Number of SCCs: 1, DPs: 3
  SCC { #1 #2 #4 }
POLO(Sum)... succeeded.
      a 	w: 1
      f 	w: 0
      #f 	w: x2
      g 	w: 0
    USABLE RULES: { }
    Removed DPs: #2
Number of SCCs: 1, DPs: 2
  SCC { #1 #4 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
Finding a loop...  failed.