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