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