NO
Input TRS:
      1: f(x,y) -> f(x,x)
      2: f(s(x),y) -> f(y,x)
Number of strict rules: 2
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
     #1: #f(s(x),y) -> #f(y,x)
     #2: #f(x,y) -> #f(x,x)
Number of SCCs: 1, DPs: 2
  SCC { #1 #2 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
Finding a loop...  found.
  #f(x_{1},y)	-#2->
  #f(x_{1},x_{1})	--->*
  #f(x_{1},x_{1})
  Looping with: [ y := x_{1}; x_{1} := x_{1}; ]