Input TRS:
    1: p(a(x0),p(b(a(x1)),x2)) -> p(x1,p(a(b(a(x1))),x2))
    2: a(b(a(x0))) -> b(a(b(x0)))
Number of strict rules: 2
Direct Order(PosReal,>,Poly) ... failed.
Freezing ... failed.
Dependency Pairs:
   #1: #a(b(a(x0))) -> #a(b(x0))
   #2: #p(a(x0),p(b(a(x1)),x2)) -> #p(x1,p(a(b(a(x1))),x2))
   #3: #p(a(x0),p(b(a(x1)),x2)) -> #p(a(b(a(x1))),x2)
   #4: #p(a(x0),p(b(a(x1)),x2)) -> #a(b(a(x1)))
Number of SCCs: 2, DPs: 3, edges: 5
	SCC { #1 }
Removing DPs: Order(PosReal,>,Sum)... succeeded.
     a(x1)	weight: (/ 1 4) + x1
     b(x1)	weight: (/ 1 4) + x1
   #p(x1,x2)	weight: 0
     p(x1,x2)	weight: 0
   #a(x1)	weight: x1
    Usable rules: { }
    Removed DPs: #1
Number of SCCs: 1, DPs: 2, edges: 4
	SCC { #2 #3 }
Removing DPs: Order(PosReal,>,Sum)... succeeded.
     a(x1)	weight: (/ 1 4)
     b(x1)	weight: (/ 1 2)
   #p(x1,x2)	weight: x2
     p(x1,x2)	weight: (/ 1 4) + x2
   #a(x1)	weight: 0
    Usable rules: { 1 }
    Removed DPs: #3
Number of SCCs: 1, DPs: 1, edges: 1
	SCC { #2 }
Removing DPs: Order(PosReal,>,Sum)... Order(PosReal,>,Max)... QLPOpS... Order(PosReal,>,MaxSum)... QWPOpS(PosReal,>,MaxSum)... Order(PosReal,>,Sum-Sum; PosReal,≥,Sum-Sum)... Order(PosReal,>,Sum-Sum; NegReal,≥,Sum)... Order(PosReal,>,MaxSum-Sum; NegReal,≥,Sum)... failed.
Removing edges: failed.
Finding a loop...  failed.
MAYBE