YES
Input TRS:
      1: 1(2(1(x1))) -> 2(0(2(x1)))
      2: 0(2(1(x1))) -> 1(0(2(x1)))
      3: L(2(1(x1))) -> L(1(0(2(x1))))
      4: 1(2(0(x1))) -> 2(0(1(x1)))
      5: 1(2(R(x1))) -> 2(0(1(R(x1))))
      6: 0(2(0(x1))) -> 1(0(1(x1)))
      7: L(2(0(x1))) -> L(1(0(1(x1))))
      8: 0(2(R(x1))) -> 1(0(1(R(x1))))
Number of strict rules: 8
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
     #1: #0(2(1(x1))) -> #1(0(2(x1)))
     #2: #0(2(1(x1))) -> #0(2(x1))
     #3: #0(2(0(x1))) -> #1(0(1(x1)))
     #4: #0(2(0(x1))) -> #0(1(x1))
     #5: #0(2(0(x1))) -> #1(x1)
     #6: #L(2(0(x1))) -> #L(1(0(1(x1))))
     #7: #L(2(0(x1))) -> #1(0(1(x1)))
     #8: #L(2(0(x1))) -> #0(1(x1))
     #9: #L(2(0(x1))) -> #1(x1)
     #10: #1(2(R(x1))) -> #0(1(R(x1)))
     #11: #1(2(R(x1))) -> #1(R(x1))
     #12: #L(2(1(x1))) -> #L(1(0(2(x1))))
     #13: #L(2(1(x1))) -> #1(0(2(x1)))
     #14: #L(2(1(x1))) -> #0(2(x1))
     #15: #1(2(1(x1))) -> #0(2(x1))
     #16: #0(2(R(x1))) -> #1(0(1(R(x1))))
     #17: #0(2(R(x1))) -> #0(1(R(x1)))
     #18: #0(2(R(x1))) -> #1(R(x1))
     #19: #1(2(0(x1))) -> #0(1(x1))
     #20: #1(2(0(x1))) -> #1(x1)
Number of SCCs: 2, DPs: 10
  SCC { #6 #12 }
POLO(Sum)... succeeded.
      #0 	w: 0
      1 	w: x1
      #L 	w: x1
      0 	w: 8366
      R 	w: 1
      L 	w: 0
      2 	w: 8367
      #1 	w: 0
    USABLE RULES: { 1 2 4..6 8 }
    Removed DPs: #6 #12
Number of SCCs: 1, DPs: 8
  SCC { #1..5 #15 #19 #20 }
POLO(Sum)... succeeded.
      #0 	w: x1
      1 	w: x1 + 1
      #L 	w: x1
      0 	w: x1
      R 	w: 33954
      L 	w: 0
      2 	w: x1 + 2
      #1 	w: x1
    USABLE RULES: { 1 2 4..6 8 }
    Removed DPs: #1..5 #15 #19 #20
Number of SCCs: 0, DPs: 0