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