MAYBE
Input TRS:
      1: c(c(b(x1))) -> a(c(b(x1)))
      2: a(c(b(a(x1)))) -> b(c(c(x1)))
      3: b(a(c(x1))) -> a(b(c(a(x1))))
      4: b(c(a(x1))) -> c(a(b(x1)))
Number of strict rules: 4
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
     #1: #a(c(b(a(x1)))) -> #b(c(c(x1)))
     #2: #a(c(b(a(x1)))) -> #c(c(x1))
     #3: #a(c(b(a(x1)))) -> #c(x1)
     #4: #b(a(c(x1))) -> #a(b(c(a(x1))))
     #5: #b(a(c(x1))) -> #b(c(a(x1)))
     #6: #b(a(c(x1))) -> #c(a(x1))
     #7: #b(a(c(x1))) -> #a(x1)
     #8: #c(c(b(x1))) -> #a(c(b(x1)))
     #9: #b(c(a(x1))) -> #c(a(b(x1)))
     #10: #b(c(a(x1))) -> #a(b(x1))
     #11: #b(c(a(x1))) -> #b(x1)
Number of SCCs: 1, DPs: 11
  SCC { #1..11 }
POLO(Sum)... succeeded.
      a 	w: x1
      b 	w: x1 + 2438
      c 	w: x1
      #c 	w: x1
      #a 	w: x1
      #b 	w: x1 + 2438
    USABLE RULES: { 1..4 }
    Removed DPs: #2 #3 #6 #7
Number of SCCs: 1, DPs: 7
  SCC { #1 #4 #5 #8..11 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... succeeded.
      a 	w: max(x1 - 23613, 0)
      b 	w: 47225
      c 	w: max(x1 + 23613, 0)
      #c 	w: max(x1 - 23612, 0)
      #a 	w: max(x1 - 94451, 0)
      #b 	w: 0
    USABLE RULES: { 1..4 }
    Removed DPs: #8
Number of SCCs: 1, DPs: 5
  SCC { #1 #4 #5 #10 #11 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... succeeded.
      a 	w: max(x1 - 2, 0)
      b 	w: 4
      c 	w: max(x1 + 2, 0)
      #c 	w: max(x1 - 23612, 0)
      #a 	w: max(x1 - 5, 0)
      #b 	w: 0
    USABLE RULES: { 1..4 }
    Removed DPs: #1
Number of SCCs: 1, DPs: 2
  SCC { #5 #11 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
Finding a loop...  failed.