MAYBE
Input TRS:
      1: b(a(L(x1))) -> L(a(L(X(b(a(b(b(x1))))))))
      2: b(L(x1)) -> L(b(x1))
Number of strict rules: 2
Direct POLO(bPol) ... failed.
Uncurrying b
      1: b^1_a(L(x1)) -> L(a(L(X(b^1_a(b(b(x1)))))))
      2: b^1_L(x1) -> L(b(x1))
      3: b(a(_1)) ->= b^1_a(_1)
      4: b(L(_1)) ->= b^1_L(_1)
Number of strict rules: 2
Direct POLO(bPol) ... failed.
Dependency Pairs:
     #1: #b^1_L(x1) -> #b(x1)
     #2: #b(a(_1)) ->? #b^1_a(_1)
     #3: #b^1_a(L(x1)) -> #b^1_a(b(b(x1)))
     #4: #b^1_a(L(x1)) -> #b(b(x1))
     #5: #b^1_a(L(x1)) -> #b(x1)
     #6: #b(L(_1)) ->? #b^1_L(_1)
Number of SCCs: 1, DPs: 6
  SCC { #1..6 }
POLO(Sum)... succeeded.
      a 	w: x1 + 25908
      b^1_L	w: x1
      b 	w: x1
      #b^1_L	w: x1 + 6
      L 	w: x1
      b^1_a	w: 25908
      X 	w: 0
      #b 	w: x1 + 6
      #b^1_a	w: x1 + 25913
    USABLE RULES: { 1..4 }
    Removed DPs: #2 #4 #5
Number of SCCs: 2, DPs: 3
  SCC { #3 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
Finding a loop...  failed.