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