YES
Input TRS:
      1: f(f(a(),a()),x) -> f(f(a(),x),f(a(),f(a(),a())))
Number of strict rules: 1
Direct POLO(bPol) ... failed.
Uncurrying f
      1: f^2_a(a(),x) -> f^2_a(x,f^1_a(f^1_a(a())))
      2: f(a(),_1) ->= f^1_a(_1)
      3: f(f^1_a(_1),_2) ->= f^2_a(_1,_2)
Number of strict rules: 1
Direct POLO(bPol) ... removes: 3 2
      a 	w: 1
      f 	w: 2 * x1 + 2 * x2 + 2438
      f^1_a	w: x1
      f^2_a	w: 2 * x1 + 2 * x2 + 2437
Number of strict rules: 1
Direct POLO(bPol) ... failed.
Dependency Pairs:
     #1: #f^2_a(a(),x) -> #f^2_a(x,f^1_a(f^1_a(a())))
Number of SCCs: 1, DPs: 1
  SCC { #1 }
POLO(Sum)... succeeded.
      a 	w: 2
      f 	w: 0
      #f^2_a	w: x1 + x2
      f^1_a	w: 1
      f^2_a	w: 0
    USABLE RULES: { }
    Removed DPs: #1
Number of SCCs: 0, DPs: 0