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