MAYBE
Input TRS:
      1: 0(q0(0(x1))) -> 0(0(q0(x1)))
      2: 0(q0(h(x1))) -> 0(0(q0(h(x1))))
      3: 0(q0(1(x1))) -> 0(1(q0(x1)))
      4: 1(q0(0(x1))) -> 0(0(q1(x1)))
      5: 1(q0(h(x1))) -> 0(0(q1(h(x1))))
      6: 1(q0(1(x1))) -> 0(1(q1(x1)))
      7: 1(q1(0(x1))) -> 1(0(q1(x1)))
      8: 1(q1(h(x1))) -> 1(0(q1(h(x1))))
      9: 1(q1(1(x1))) -> 1(1(q1(x1)))
      10: 0(q1(0(x1))) -> 0(0(q2(x1)))
      11: 0(q1(h(x1))) -> 0(0(q2(h(x1))))
      12: 0(q1(1(x1))) -> 0(1(q2(x1)))
      13: 1(q2(0(x1))) -> 1(0(q2(x1)))
      14: 1(q2(h(x1))) -> 1(0(q2(h(x1))))
      15: 1(q2(1(x1))) -> 1(1(q2(x1)))
      16: 0(q2(x1)) -> q3(1(x1))
      17: 1(q3(x1)) -> q3(1(x1))
      18: 0(q3(x1)) -> q4(0(x1))
      19: 1(q4(x1)) -> q4(1(x1))
      20: 0(q4(0(x1))) -> 1(0(q5(x1)))
      21: 0(q4(h(x1))) -> 1(0(q5(h(x1))))
      22: 0(q4(1(x1))) -> 1(1(q5(x1)))
      23: 1(q5(0(x1))) -> 0(0(q1(x1)))
      24: 1(q5(h(x1))) -> 0(0(q1(h(x1))))
      25: 1(q5(1(x1))) -> 0(1(q1(x1)))
      26: h(q0(x1)) -> h(0(q0(x1)))
      27: h(q1(x1)) -> h(0(q1(x1)))
      28: h(q2(x1)) -> h(0(q2(x1)))
      29: h(q3(x1)) -> h(0(q3(x1)))
      30: h(q4(x1)) -> h(0(q4(x1)))
      31: h(q5(x1)) -> h(0(q5(x1)))
Number of strict rules: 31
Direct POLO(bPol) ... removes: 4 5 6
      h 	w: x1 + 1
      1 	w: x1
      q3	w: x1 + 1
      q4	w: x1 + 1
      0 	w: x1
      q1	w: x1 + 1
      q5	w: x1 + 1
      q2	w: x1 + 1
      q0	w: x1 + 2
Number of strict rules: 28
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
     #1: #0(q0(h(x1))) -> #0(0(q0(h(x1))))
     #2: #0(q0(h(x1))) -> #0(q0(h(x1)))
     #3: #h(q3(x1)) -> #h(0(q3(x1)))
     #4: #h(q3(x1)) -> #0(q3(x1))
     #5: #1(q2(0(x1))) -> #1(0(q2(x1)))
     #6: #1(q2(0(x1))) -> #0(q2(x1))
     #7: #1(q1(1(x1))) -> #1(1(q1(x1)))
     #8: #1(q1(1(x1))) -> #1(q1(x1))
     #9: #0(q1(h(x1))) -> #0(0(q2(h(x1))))
     #10: #0(q1(h(x1))) -> #0(q2(h(x1)))
     #11: #1(q5(h(x1))) -> #0(0(q1(h(x1))))
     #12: #1(q5(h(x1))) -> #0(q1(h(x1)))
     #13: #1(q5(0(x1))) -> #0(0(q1(x1)))
     #14: #1(q5(0(x1))) -> #0(q1(x1))
     #15: #0(q1(1(x1))) -> #0(1(q2(x1)))
     #16: #0(q1(1(x1))) -> #1(q2(x1))
     #17: #h(q5(x1)) -> #h(0(q5(x1)))
     #18: #h(q5(x1)) -> #0(q5(x1))
     #19: #1(q2(h(x1))) -> #1(0(q2(h(x1))))
     #20: #1(q2(h(x1))) -> #0(q2(h(x1)))
     #21: #h(q4(x1)) -> #h(0(q4(x1)))
     #22: #h(q4(x1)) -> #0(q4(x1))
     #23: #1(q5(1(x1))) -> #0(1(q1(x1)))
     #24: #1(q5(1(x1))) -> #1(q1(x1))
     #25: #0(q4(0(x1))) -> #1(0(q5(x1)))
     #26: #0(q4(0(x1))) -> #0(q5(x1))
     #27: #1(q1(0(x1))) -> #1(0(q1(x1)))
     #28: #1(q1(0(x1))) -> #0(q1(x1))
     #29: #0(q1(0(x1))) -> #0(0(q2(x1)))
     #30: #0(q1(0(x1))) -> #0(q2(x1))
     #31: #h(q2(x1)) -> #h(0(q2(x1)))
     #32: #h(q2(x1)) -> #0(q2(x1))
     #33: #0(q4(1(x1))) -> #1(1(q5(x1)))
     #34: #0(q4(1(x1))) -> #1(q5(x1))
     #35: #h(q1(x1)) -> #h(0(q1(x1)))
     #36: #h(q1(x1)) -> #0(q1(x1))
     #37: #1(q3(x1)) -> #1(x1)
     #38: #1(q4(x1)) -> #1(x1)
     #39: #h(q0(x1)) -> #h(0(q0(x1)))
     #40: #h(q0(x1)) -> #0(q0(x1))
     #41: #0(q4(h(x1))) -> #1(0(q5(h(x1))))
     #42: #0(q4(h(x1))) -> #0(q5(h(x1)))
     #43: #0(q2(x1)) -> #1(x1)
     #44: #0(q0(1(x1))) -> #0(1(q0(x1)))
     #45: #0(q0(1(x1))) -> #1(q0(x1))
     #46: #0(q0(0(x1))) -> #0(0(q0(x1)))
     #47: #0(q0(0(x1))) -> #0(q0(x1))
     #48: #1(q1(h(x1))) -> #1(0(q1(h(x1))))
     #49: #1(q1(h(x1))) -> #0(q1(h(x1)))
     #50: #1(q2(1(x1))) -> #1(1(q2(x1)))
     #51: #1(q2(1(x1))) -> #1(q2(x1))
     #52: #0(q3(x1)) -> #0(x1)
Number of SCCs: 2, DPs: 36
  SCC { #3 #21 }
POLO(Sum)... succeeded.
      h 	w: x1 + 282
      #0 	w: 0
      1 	w: x1
      q3	w: 3
      q4	w: 2
      0 	w: 2
      #h 	w: x1
      q1	w: x1 + 2
      q5	w: 2
      q2	w: 1
      #1 	w: 0
      q0	w: x1 + 2
    USABLE RULES: { 17..25 29..31 }
    Removed DPs: #3
Number of SCCs: 2, DPs: 35
  SCC { #21 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
Finding a loop...  failed.