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