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