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