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