MAYBE
Input TRS:
      1: 0(q0(0(x1))) -> 0(0(q0(x1)))
      2: 0(q0(1(x1))) -> 0(1(q0(x1)))
      3: 1(q0(0(x1))) -> 0(0(q1(x1)))
      4: 1(q0(1(x1))) -> 0(1(q1(x1)))
      5: 1(q1(0(x1))) -> 1(0(q1(x1)))
      6: 1(q1(1(x1))) -> 1(1(q1(x1)))
      7: 0(q1(0(x1))) -> 0(0(q2(x1)))
      8: 0(q1(1(x1))) -> 0(1(q2(x1)))
      9: 1(q2(0(x1))) -> 1(0(q2(x1)))
      10: 1(q2(1(x1))) -> 1(1(q2(x1)))
      11: 0(q2(x1)) -> q3(1(x1))
      12: 1(q3(x1)) -> q3(1(x1))
      13: 0(q3(x1)) -> q4(0(x1))
      14: 1(q4(x1)) -> q4(1(x1))
      15: 0(q4(0(x1))) -> 1(0(q5(x1)))
      16: 0(q4(1(x1))) -> 1(1(q5(x1)))
      17: 1(q5(0(x1))) -> 0(0(q1(x1)))
      18: 1(q5(1(x1))) -> 0(1(q1(x1)))
      19: 0(q5(x1)) -> q6(0(x1))
      20: 1(q6(x1)) -> q6(1(x1))
      21: 1(q7(0(x1))) -> 0(0(q8(x1)))
      22: 1(q7(1(x1))) -> 0(1(q8(x1)))
      23: 0(q8(x1)) -> 0(q0(x1))
      24: 1(q8(0(x1))) -> 1(0(q8(x1)))
      25: 1(q8(1(x1))) -> 1(1(q8(x1)))
      26: 0(q6(x1)) -> q9(0(x1))
      27: 0(q9(0(x1))) -> 1(0(q7(x1)))
      28: 0(q9(1(x1))) -> 1(1(q7(x1)))
      29: 1(q9(x1)) -> q9(1(x1))
      30: h(q0(x1)) -> h(0(q0(x1)))
      31: q0(h(x1)) -> q0(0(h(x1)))
      32: h(q1(x1)) -> h(0(q1(x1)))
      33: q1(h(x1)) -> q1(0(h(x1)))
      34: h(q2(x1)) -> h(0(q2(x1)))
      35: q2(h(x1)) -> q2(0(h(x1)))
      36: h(q3(x1)) -> h(0(q3(x1)))
      37: q3(h(x1)) -> q3(0(h(x1)))
      38: h(q4(x1)) -> h(0(q4(x1)))
      39: q4(h(x1)) -> q4(0(h(x1)))
      40: h(q5(x1)) -> h(0(q5(x1)))
      41: q5(h(x1)) -> q5(0(h(x1)))
      42: h(q6(x1)) -> h(0(q6(x1)))
      43: q6(h(x1)) -> q6(0(h(x1)))
Number of strict rules: 43
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
     #1: #0(q0(1(x1))) -> #0(1(q0(x1)))
     #2: #0(q0(1(x1))) -> #1(q0(x1))
     #3: #0(q0(1(x1))) -> #q0(x1)
     #4: #q6(h(x1)) -> #q6(0(h(x1)))
     #5: #q6(h(x1)) -> #0(h(x1))
     #6: #1(q9(x1)) -> #1(x1)
     #7: #q2(h(x1)) -> #q2(0(h(x1)))
     #8: #q2(h(x1)) -> #0(h(x1))
     #9: #h(q6(x1)) -> #h(0(q6(x1)))
     #10: #h(q6(x1)) -> #0(q6(x1))
     #11: #q5(h(x1)) -> #q5(0(h(x1)))
     #12: #q5(h(x1)) -> #0(h(x1))
     #13: #q3(h(x1)) -> #q3(0(h(x1)))
     #14: #q3(h(x1)) -> #0(h(x1))
     #15: #h(q4(x1)) -> #h(0(q4(x1)))
     #16: #h(q4(x1)) -> #0(q4(x1))
     #17: #1(q1(1(x1))) -> #1(1(q1(x1)))
     #18: #1(q1(1(x1))) -> #1(q1(x1))
     #19: #1(q1(1(x1))) -> #q1(x1)
     #20: #h(q5(x1)) -> #h(0(q5(x1)))
     #21: #h(q5(x1)) -> #0(q5(x1))
     #22: #0(q3(x1)) -> #q4(0(x1))
     #23: #0(q3(x1)) -> #0(x1)
     #24: #1(q2(0(x1))) -> #1(0(q2(x1)))
     #25: #1(q2(0(x1))) -> #0(q2(x1))
     #26: #1(q2(0(x1))) -> #q2(x1)
     #27: #0(q2(x1)) -> #q3(1(x1))
     #28: #0(q2(x1)) -> #1(x1)
     #29: #1(q8(0(x1))) -> #1(0(q8(x1)))
     #30: #1(q8(0(x1))) -> #0(q8(x1))
     #31: #0(q8(x1)) -> #0(q0(x1))
     #32: #0(q8(x1)) -> #q0(x1)
     #33: #1(q3(x1)) -> #q3(1(x1))
     #34: #1(q3(x1)) -> #1(x1)
     #35: #q0(h(x1)) -> #q0(0(h(x1)))
     #36: #q0(h(x1)) -> #0(h(x1))
     #37: #1(q4(x1)) -> #q4(1(x1))
     #38: #1(q4(x1)) -> #1(x1)
     #39: #h(q0(x1)) -> #h(0(q0(x1)))
     #40: #h(q0(x1)) -> #0(q0(x1))
     #41: #1(q8(1(x1))) -> #1(1(q8(x1)))
     #42: #1(q8(1(x1))) -> #1(q8(x1))
     #43: #1(q6(x1)) -> #q6(1(x1))
     #44: #1(q6(x1)) -> #1(x1)
     #45: #0(q1(0(x1))) -> #0(0(q2(x1)))
     #46: #0(q1(0(x1))) -> #0(q2(x1))
     #47: #0(q1(0(x1))) -> #q2(x1)
     #48: #q4(h(x1)) -> #q4(0(h(x1)))
     #49: #q4(h(x1)) -> #0(h(x1))
     #50: #1(q2(1(x1))) -> #1(1(q2(x1)))
     #51: #1(q2(1(x1))) -> #1(q2(x1))
     #52: #1(q2(1(x1))) -> #q2(x1)
     #53: #q1(h(x1)) -> #q1(0(h(x1)))
     #54: #q1(h(x1)) -> #0(h(x1))
     #55: #1(q1(0(x1))) -> #1(0(q1(x1)))
     #56: #1(q1(0(x1))) -> #0(q1(x1))
     #57: #1(q1(0(x1))) -> #q1(x1)
     #58: #0(q9(1(x1))) -> #1(1(q7(x1)))
     #59: #0(q9(1(x1))) -> #1(q7(x1))
     #60: #1(q7(1(x1))) -> #0(1(q8(x1)))
     #61: #1(q7(1(x1))) -> #1(q8(x1))
     #62: #h(q2(x1)) -> #h(0(q2(x1)))
     #63: #h(q2(x1)) -> #0(q2(x1))
     #64: #0(q9(0(x1))) -> #1(0(q7(x1)))
     #65: #0(q9(0(x1))) -> #0(q7(x1))
     #66: #1(q5(0(x1))) -> #0(0(q1(x1)))
     #67: #1(q5(0(x1))) -> #0(q1(x1))
     #68: #1(q5(0(x1))) -> #q1(x1)
     #69: #h(q1(x1)) -> #h(0(q1(x1)))
     #70: #h(q1(x1)) -> #0(q1(x1))
     #71: #0(q5(x1)) -> #q6(0(x1))
     #72: #0(q5(x1)) -> #0(x1)
     #73: #0(q6(x1)) -> #0(x1)
     #74: #h(q3(x1)) -> #h(0(q3(x1)))
     #75: #h(q3(x1)) -> #0(q3(x1))
     #76: #1(q7(0(x1))) -> #0(0(q8(x1)))
     #77: #1(q7(0(x1))) -> #0(q8(x1))
     #78: #0(q4(1(x1))) -> #1(1(q5(x1)))
     #79: #0(q4(1(x1))) -> #1(q5(x1))
     #80: #0(q4(1(x1))) -> #q5(x1)
     #81: #1(q0(0(x1))) -> #0(0(q1(x1)))
     #82: #1(q0(0(x1))) -> #0(q1(x1))
     #83: #1(q0(0(x1))) -> #q1(x1)
     #84: #0(q0(0(x1))) -> #0(0(q0(x1)))
     #85: #0(q0(0(x1))) -> #0(q0(x1))
     #86: #0(q0(0(x1))) -> #q0(x1)
     #87: #0(q1(1(x1))) -> #0(1(q2(x1)))
     #88: #0(q1(1(x1))) -> #1(q2(x1))
     #89: #0(q1(1(x1))) -> #q2(x1)
     #90: #0(q4(0(x1))) -> #1(0(q5(x1)))
     #91: #0(q4(0(x1))) -> #0(q5(x1))
     #92: #0(q4(0(x1))) -> #q5(x1)
     #93: #1(q0(1(x1))) -> #0(1(q1(x1)))
     #94: #1(q0(1(x1))) -> #1(q1(x1))
     #95: #1(q0(1(x1))) -> #q1(x1)
     #96: #1(q5(1(x1))) -> #0(1(q1(x1)))
     #97: #1(q5(1(x1))) -> #1(q1(x1))
     #98: #1(q5(1(x1))) -> #q1(x1)
Number of SCCs: 2, DPs: 49
  SCC { #15 #74 }
POLO(Sum)... succeeded.
      h 	w: x1 + 1
      #0 	w: 0
      1 	w: x1
      q3	w: 3
      q6	w: 1
      #q4	w: 0
      q4	w: 2
      #q1	w: 0
      #q0	w: 0
      q8	w: x1 + 46572
      0 	w: 2
      #h 	w: x1
      q1	w: 1
      q5	w: 2
      q2	w: x1 + 1
      q7	w: 2
      q9	w: 2
      #q3	w: 0
      #1 	w: 0
      q0	w: x1 + 1
      #q5	w: 0
      #q6	w: 0
      #q2	w: 0
    USABLE RULES: { 12..22 26..29 41 }
    Removed DPs: #74
Number of SCCs: 2, DPs: 48
  SCC { #15 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
Finding a loop...  failed.