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