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