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