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