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 Order(PosReal,>,Poly) ... failed.
Freezing ... 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, edges: 1
	SCC { #1 }
Removing DPs: Order(PosReal,>,Sum)... Order(PosReal,>,Max)... QLPOpS... Order(PosReal,>,MaxSum)... QWPOpS(PosReal,>,MaxSum)... Order(PosReal,>,Sum-Sum; PosReal,≥,Sum-Sum)... succeeded.
     a(x1)	weight: (/ 1 4) + x1_1 + x1_2; 0
     b(x1)	weight: (/ 1 4); (/ 1 4) + x1_1
   #p(x1,x2)	weight: x2_1 + x1_2; 0
     p(x1,x2)	weight: (/ 1 4) + x2_2; (/ 1 4) + x1_2
    Usable rules: { }
    Removed DPs: #1
Number of SCCs: 0, DPs: 0, edges: 0
YES