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