MAYBE
Input TRS:
      1: a(0(),b(0(),x)) -> b(0(),a(0(),x))
      2: a(0(),x) -> b(0(),b(0(),x))
      3: a(0(),a(1(),a(x,y))) -> a(1(),a(0(),a(x,y)))
      4: b(0(),a(1(),a(x,y))) -> b(1(),a(0(),a(x,y)))
      5: a(0(),a(x,y)) -> a(1(),a(1(),a(x,y)))
Number of strict rules: 5
Direct POLO(bPol) ... failed.
Uncurrying b
      1: a(0(),b^1_0(x)) -> b^1_0(a(0(),x))
      2: a(0(),x) -> b^1_0(b^1_0(x))
      3: a(0(),a(1(),a(x,y))) -> a(1(),a(0(),a(x,y)))
      4: b^1_0(a(1(),a(x,y))) -> b^1_1(a(0(),a(x,y)))
      5: a(0(),a(x,y)) -> a(1(),a(1(),a(x,y)))
      6: b(1(),_1) ->= b^1_1(_1)
      7: b(0(),_1) ->= b^1_0(_1)
Number of strict rules: 5
Direct POLO(bPol) ... removes: 7 6
      a 	w: x1 + x2 + 26286
      1 	w: 1
      b^1_1	w: x1
      b 	w: 2 * x1 + 2 * x2 + 2998
      b^1_0	w: x1 + 26287
      0 	w: 26288
Number of strict rules: 5
Direct POLO(bPol) ... failed.
Dependency Pairs:
     #1: #a(0(),x) -> #b^1_0(b^1_0(x))
     #2: #a(0(),x) -> #b^1_0(x)
     #3: #a(0(),a(x,y)) -> #a(1(),a(1(),a(x,y)))
     #4: #a(0(),a(x,y)) -> #a(1(),a(x,y))
     #5: #a(0(),a(1(),a(x,y))) -> #a(1(),a(0(),a(x,y)))
     #6: #a(0(),a(1(),a(x,y))) -> #a(0(),a(x,y))
     #7: #a(0(),b^1_0(x)) -> #b^1_0(a(0(),x))
     #8: #a(0(),b^1_0(x)) -> #a(0(),x)
     #9: #b^1_0(a(1(),a(x,y))) -> #a(0(),a(x,y))
Number of SCCs: 1, DPs: 5
  SCC { #2 #6..9 }
POLO(Sum)... succeeded.
      a 	w: x1 + x2 + 1
      1 	w: 23676
      b^1_1	w: x1
      b 	w: 0
      b^1_0	w: x1 + 23677
      #b^1_0	w: x1 + 23676
      0 	w: 47353
      #a 	w: x1 + x2
    USABLE RULES: { 1..5 }
    Removed DPs: #2 #6 #8
Number of SCCs: 1, DPs: 2
  SCC { #7 #9 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
Finding a loop...  failed.