MAYBE
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 POLO(bPol) ... failed.
Uncurrying ... 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
  SCC { #1..6 }
POLO(Sum)... succeeded.
      a 	w: x1
      #R 	w: x1 + 8368
      R 	w: x1 + 8367
      L 	w: x1 + 8367
      #a 	w: x1
    USABLE RULES: { 1..4 }
    Removed DPs: #1 #4..6
Number of SCCs: 2, DPs: 2
  SCC { #2 }
POLO(Sum)... succeeded.
      a 	w: x1 + 1
      #R 	w: x1 + 8368
      R 	w: 28101
      L 	w: x1 + 31755
      #a 	w: 0
    USABLE RULES: { }
    Removed DPs: #2
Number of SCCs: 1, DPs: 1
  SCC { #3 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
Finding a loop...  failed.