YES
Input TRS:
      1: a(b(x1)) -> b(a(a(a(x1))))
      2: b(a(x1)) -> a(a(x1))
      3: a(a(x1)) -> a(c(b(x1)))
Number of strict rules: 3
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
     #1: #b(a(x1)) -> #a(a(x1))
     #2: #a(a(x1)) -> #a(c(b(x1)))
     #3: #a(a(x1)) -> #b(x1)
     #4: #a(b(x1)) -> #b(a(a(a(x1))))
     #5: #a(b(x1)) -> #a(a(a(x1)))
     #6: #a(b(x1)) -> #a(a(x1))
     #7: #a(b(x1)) -> #a(x1)
Number of SCCs: 1, DPs: 6
  SCC { #1 #3..7 }
POLO(Sum)... succeeded.
      a 	w: x1
      b 	w: x1 + 1
      c 	w: 0
      #a 	w: x1
      #b 	w: x1
    USABLE RULES: { 1..3 }
    Removed DPs: #4..7
Number of SCCs: 1, DPs: 2
  SCC { #1 #3 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... succeeded.
      a 	s: [1]	p: 1	w: x1
      b 	s: []	p: 2	w: x1 + 1
      c 	s: []	p: 0	w: 0
      #a 	s: [1]	p: 1	w: x1
      #b 	s: [1]	p: 1	w: x1
    USABLE RULES: { 1..3 }
    Removed DPs: #3
Number of SCCs: 0, DPs: 0