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