YES
Input TRS:
      1: f(a(),f(x,a())) -> f(a(),f(a(),f(f(a(),a()),x)))
Number of strict rules: 1
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
     #1: #f(a(),f(x,a())) -> #f(a(),f(a(),f(f(a(),a()),x)))
     #2: #f(a(),f(x,a())) -> #f(a(),f(f(a(),a()),x))
     #3: #f(a(),f(x,a())) -> #f(f(a(),a()),x)
     #4: #f(a(),f(x,a())) -> #f(a(),a())
Number of SCCs: 1, DPs: 2
  SCC { #1 #2 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... succeeded.
      a 	w: [1;1]
      f 	w: [0,1;0,0] * x1 + [0,1;0,0] * x2 + [1;0]
      #f 	w: [1,1;1,0] * x2
    USABLE RULES: { 1 }
    Removed DPs: #2
Number of SCCs: 1, DPs: 1
  SCC { #1 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... succeeded.
      a 	w: [30809;1]
      f 	w: [0,0;1,0] * x2 + [30808;1]
      #f 	w: [0,1;0,0] * x2
    USABLE RULES: { 1 }
    Removed DPs: #1
Number of SCCs: 0, DPs: 0