YES
Input TRS:
      1: .(1(),x) -> x
      2: .(x,1()) -> x
      3: .(i(x),x) -> 1()
      4: .(x,i(x)) -> 1()
      5: i(1()) -> 1()
      6: i(i(x)) -> x
      7: .(i(y),.(y,z)) -> z
      8: .(y,.(i(y),z)) -> z
      9: .(.(x,y),z) -> .(x,.(y,z))
      10: i(.(x,y)) -> .(i(y),i(x))
Number of strict rules: 10
Direct POLO(bPol) ... removes: 4 8 1 3 7 2
      1 	w: 1
      . 	w: x1 + x2 + 11799
      i 	w: x1
Number of strict rules: 4
Direct POLO(bPol) ... removes: 5 10
      1 	w: 282
      . 	w: x1 + x2 + 282
      i 	w: 2 * x1
Number of strict rules: 2
Direct POLO(bPol) ... removes: 6
      1 	w: 17892
      . 	w: x1 + x2 + 8946
      i 	w: 2 * x1 + 8946
Number of strict rules: 1
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
     #1: #.(.(x,y),z) -> #.(x,.(y,z))
     #2: #.(.(x,y),z) -> #.(y,z)
Number of SCCs: 1, DPs: 2
  SCC { #1 #2 }
POLO(Sum)... succeeded.
      1 	w: 0
      #. 	w: x1
      . 	w: x1 + x2 + 1
      i 	w: 0
    USABLE RULES: { }
    Removed DPs: #1 #2
Number of SCCs: 0, DPs: 0