MAYBE
Input TRS:
      1: R(2(x1)) -> 2(R(x1))
      2: R(3(x1)) -> 3(R(x1))
      3: R(1(x1)) -> L(3(x1))
      4: 3(L(x1)) -> L(3(x1))
      5: 2(L(x1)) -> L(2(x1))
      6: 0(L(x1)) -> 2(R(x1))
      7: R(b(x1)) -> c(1(b(x1)))
      8: 3(c(x1)) -> c(1(x1))
      9: 2(c(1(x1))) -> c(0(R(1(x1))))
      10: 2(c(0(x1))) -> c(0(0(x1)))
Number of strict rules: 10
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
     #1: #R(3(x1)) -> #3(R(x1))
     #2: #R(3(x1)) -> #R(x1)
     #3: #0(L(x1)) -> #2(R(x1))
     #4: #0(L(x1)) -> #R(x1)
     #5: #2(c(1(x1))) -> #0(R(1(x1)))
     #6: #2(c(1(x1))) -> #R(1(x1))
     #7: #2(c(0(x1))) -> #0(0(x1))
     #8: #2(L(x1)) -> #2(x1)
     #9: #R(1(x1)) -> #3(x1)
     #10: #R(2(x1)) -> #2(R(x1))
     #11: #R(2(x1)) -> #R(x1)
     #12: #3(L(x1)) -> #3(x1)
Number of SCCs: 2, DPs: 9
  SCC { #12 }
POLO(Sum)... succeeded.
      #0 	w: 0
      1 	w: 0
      b 	w: 0
      3 	w: 0
      #2 	w: 0
      c 	w: 0
      #R 	w: 0
      0 	w: 0
      #3 	w: x1
      R 	w: 0
      L 	w: x1 + 1
      2 	w: 0
    USABLE RULES: { }
    Removed DPs: #12
Number of SCCs: 1, DPs: 8
  SCC { #2..5 #7 #8 #10 #11 }
POLO(Sum)... succeeded.
      #0 	w: x1 + 2
      1 	w: x1
      b 	w: 15922
      3 	w: x1
      #2 	w: x1 + 2
      c 	w: x1
      #R 	w: x1
      0 	w: x1 + 3
      #3 	w: 0
      R 	w: x1
      L 	w: x1
      2 	w: x1 + 3
    USABLE RULES: { 1..10 }
    Removed DPs: #4 #10 #11
Number of SCCs: 2, DPs: 5
  SCC { #2 }
POLO(Sum)... succeeded.
      #0 	w: x1 + 2
      1 	w: x1
      b 	w: 25907
      3 	w: x1 + 31892
      #2 	w: x1 + 2
      c 	w: x1
      #R 	w: x1
      0 	w: 21656
      #3 	w: 0
      R 	w: x1 + 1
      L 	w: 1
      2 	w: 21656
    USABLE RULES: { 1..10 }
    Removed DPs: #2
Number of SCCs: 1, DPs: 4
  SCC { #3 #5 #7 #8 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
Finding a loop...  failed.