MAYBE
Input TRS:
      1: c(a(a(b(c(a(x1)))))) -> a(a(b(c(c(a(a(b(c(x1)))))))))
Number of strict rules: 1
Direct POLO(bPol) ... failed.
Uncurrying c
      1: c^1_a(a(b(c^1_a(x1)))) -> a(a(b(c(c^1_a(a(b(c(x1))))))))
      2: c(a(_1)) ->= c^1_a(_1)
Number of strict rules: 1
Direct POLO(bPol) ... failed.
Dependency Pairs:
     #1: #c(a(_1)) ->? #c^1_a(_1)
     #2: #c^1_a(a(b(c^1_a(x1)))) -> #c(c^1_a(a(b(c(x1)))))
     #3: #c^1_a(a(b(c^1_a(x1)))) -> #c^1_a(a(b(c(x1))))
     #4: #c^1_a(a(b(c^1_a(x1)))) -> #c(x1)
Number of SCCs: 1, DPs: 4
  SCC { #1..4 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... succeeded.
      a 	w: max(x1 + 30950, 0)
      b 	w: max(x1 - 64749, 0)
      c^1_a	w: max(x1 + 30950, 0)
      c 	w: max(x1 + 1425, 0)
      #c^1_a	w: max(x1 + 33800, 0)
      #c 	w: max(x1 + 2850, 0)
    USABLE RULES: { 1 2 }
    Removed DPs: #4
Number of SCCs: 1, DPs: 3
  SCC { #1..3 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... succeeded.
      a 	w: x1 + [1;11984]
      b 	w: [0,0;1,0] * x1 + [0;11344]
      c^1_a	w: [1,0;1,1] * x1 + [1;11984]
      c 	w: [1,0;1,1] * x1 + [0;1]
      #c^1_a	w: [0,1;0,0] * x1 + [11984;0]
      #c 	w: [0,1;0,0] * x1
    USABLE RULES: { 1 2 }
    Removed DPs: #3
Number of SCCs: 1, DPs: 2
  SCC { #1 #2 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
Finding a loop...  failed.