MAYBE
Input TRS:
      1: b(a(b(a(c(b(a(x1))))))) -> a(b(a(c(b(b(a(b(a(c(x1))))))))))
Number of strict rules: 1
Direct POLO(bPol) ... failed.
Uncurrying b
      1: b^1_a(b^1_a(c(b^1_a(x1)))) -> a(b^1_a(c(b(b^1_a(b^1_a(c(x1)))))))
      2: b(a(_1)) ->= b^1_a(_1)
Number of strict rules: 1
Direct POLO(bPol) ... failed.
Dependency Pairs:
     #1: #b(a(_1)) ->? #b^1_a(_1)
     #2: #b^1_a(b^1_a(c(b^1_a(x1)))) -> #b^1_a(c(b(b^1_a(b^1_a(c(x1))))))
     #3: #b^1_a(b^1_a(c(b^1_a(x1)))) -> #b(b^1_a(b^1_a(c(x1))))
     #4: #b^1_a(b^1_a(c(b^1_a(x1)))) -> #b^1_a(b^1_a(c(x1)))
     #5: #b^1_a(b^1_a(c(b^1_a(x1)))) -> #b^1_a(c(x1))
Number of SCCs: 1, DPs: 3
  SCC { #1 #3 #4 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... succeeded.
      a 	w: x1 + [1;34361]
      b 	w: x1 + [0;1]
      c 	w: [0,0;1,0] * x1 + [0;11020]
      b^1_a	w: x1 + [1;34362]
      #b 	w: [0,1;1,0] * x1
      #b^1_a	w: [0,1;1,0] * x1 + [34361;1]
    USABLE RULES: { 1 2 }
    Removed DPs: #4
Number of SCCs: 1, DPs: 2
  SCC { #1 #3 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
Finding a loop...  failed.