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