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