Input TRS:
    1: a(L(x)) -> L(a(x))
    2: R(a(a(x))) -> a(a(a(R(x))))
    3: b(L(x)) -> b(R(a(x)))
    4: R(b(x)) -> L(b(x))
    5: R(a(b(x))) -> L(a(b(x)))
Number of strict rules: 5
Direct Order(PosReal,>,Poly) ... failed.
Freezing ... failed.
Dependency Pairs:
   #1: #R(a(a(x))) -> #a(a(a(R(x))))
   #2: #R(a(a(x))) -> #a(a(R(x)))
   #3: #R(a(a(x))) -> #a(R(x))
   #4: #R(a(a(x))) -> #R(x)
   #5: #b(L(x)) -> #b(R(a(x)))
   #6: #b(L(x)) -> #R(a(x))
   #7: #b(L(x)) -> #a(x)
   #8: #a(L(x)) -> #a(x)
Number of SCCs: 3, DPs: 3, edges: 3
	SCC { #8 }
Removing DPs: Order(PosReal,>,Sum)... succeeded.
     a(x1)	weight: 0
     b(x1)	weight: 0
   #R(x1)	weight: 0
     R(x1)	weight: 0
     L(x1)	weight: (/ 1 2) + x1
   #a(x1)	weight: x1
   #b(x1)	weight: 0
    Usable rules: { }
    Removed DPs: #8
Number of SCCs: 2, DPs: 2, edges: 2
	SCC { #4 }
Removing DPs: Order(PosReal,>,Sum)... succeeded.
     a(x1)	weight: (/ 1 4) + x1
     b(x1)	weight: 0
   #R(x1)	weight: x1
     R(x1)	weight: 0
     L(x1)	weight: (/ 1 4)
   #a(x1)	weight: 0
   #b(x1)	weight: 0
    Usable rules: { }
    Removed DPs: #4
Number of SCCs: 1, DPs: 1, edges: 1
	SCC { #5 }
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