MAYBE
Input TRS:
      1: c(b(a(a(x1)))) -> a(a(b(a(a(b(c(b(a(c(x1))))))))))
Number of strict rules: 1
Direct POLO(bPol) ... failed.
Uncurrying c^1_b c
      1: c^1_b^1_a(a(x1)) -> a(a(b(a(a(b(c^1_b^1_a(c(x1))))))))
      2: c(b(_1)) ->= c^1_b(_1)
      3: c^1_b(a(_1)) ->= c^1_b^1_a(_1)
Number of strict rules: 1
Direct POLO(bPol) ... failed.
Dependency Pairs:
     #1: #c(b(_1)) ->? #c^1_b(_1)
     #2: #c^1_b(a(_1)) ->? #c^1_b^1_a(_1)
     #3: #c^1_b^1_a(a(x1)) -> #c^1_b^1_a(c(x1))
     #4: #c^1_b^1_a(a(x1)) -> #c(x1)
Number of SCCs: 1, DPs: 4
  SCC { #1..4 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
Finding a loop...  failed.