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