MAYBE
Input TRS:
      1: s(b(x1)) -> b(s(s(s(x1))))
      2: s(b(s(x1))) -> b(t(x1))
      3: t(b(x1)) -> b(s(x1))
      4: t(b(s(x1))) -> u(t(b(x1)))
      5: b(u(x1)) -> b(s(x1))
      6: t(s(x1)) -> t(t(x1))
      7: t(u(x1)) -> u(t(x1))
      8: s(u(x1)) -> s(s(x1))
Number of strict rules: 8
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
     #1: #s(b(s(x1))) -> #b(t(x1))
     #2: #s(b(s(x1))) -> #t(x1)
     #3: #t(s(x1)) -> #t(t(x1))
     #4: #t(s(x1)) -> #t(x1)
     #5: #t(u(x1)) -> #t(x1)
     #6: #b(u(x1)) -> #b(s(x1))
     #7: #b(u(x1)) -> #s(x1)
     #8: #t(b(x1)) -> #b(s(x1))
     #9: #t(b(x1)) -> #s(x1)
     #10: #s(b(x1)) -> #b(s(s(s(x1))))
     #11: #s(b(x1)) -> #s(s(s(x1)))
     #12: #s(b(x1)) -> #s(s(x1))
     #13: #s(b(x1)) -> #s(x1)
     #14: #s(u(x1)) -> #s(s(x1))
     #15: #s(u(x1)) -> #s(x1)
     #16: #t(b(s(x1))) -> #t(b(x1))
     #17: #t(b(s(x1))) -> #b(x1)
Number of SCCs: 1, DPs: 14
  SCC { #1..5 #7 #9 #11..17 }
POLO(Sum)... succeeded.
      s 	w: x1
      b 	w: x1 + 5855
      u 	w: x1
      t 	w: x1
      #s 	w: x1
      #t 	w: x1 + 5854
      #b 	w: x1 + 5854
    USABLE RULES: { 1..8 }
    Removed DPs: #1 #2 #7 #9 #11..13 #17
Number of SCCs: 3, DPs: 5
  SCC { #15 }
POLO(Sum)... succeeded.
      s 	w: 26287
      b 	w: 26287
      u 	w: x1 + 1
      t 	w: 26286
      #s 	w: x1
      #t 	w: 5854
      #b 	w: 5854
    USABLE RULES: { 1 2 5 8 }
    Removed DPs: #15
Number of SCCs: 2, DPs: 4
  SCC { #16 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
Finding a loop...  failed.