YES
Input TRS:
      1: 1(0(x1)) -> 0(0(0(1(x1))))
      2: 0(1(x1)) -> 1(x1)
      3: 1(1(x1)) -> 0(0(0(0(x1))))
      4: 0(0(x1)) -> 0(x1)
Number of strict rules: 4
Direct POLO(bPol) ... removes: 3
      1 	w: x1 + 2438
      0 	w: x1
Number of strict rules: 3
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
     #1: #1(0(x1)) -> #0(0(0(1(x1))))
     #2: #1(0(x1)) -> #0(0(1(x1)))
     #3: #1(0(x1)) -> #0(1(x1))
     #4: #1(0(x1)) -> #1(x1)
Number of SCCs: 1, DPs: 1
  SCC { #4 }
POLO(Sum)... succeeded.
      #0 	w: 0
      1 	w: 0
      0 	w: x1 + 1
      #1 	w: x1
    USABLE RULES: { }
    Removed DPs: #4
Number of SCCs: 0, DPs: 0