YES
Input TRS:
      1: r(e(x1)) -> w(r(x1))
      2: i(t(x1)) -> e(r(x1))
      3: e(w(x1)) -> r(i(x1))
      4: t(e(x1)) -> r(e(x1))
      5: w(r(x1)) -> i(t(x1))
      6: e(r(x1)) -> e(w(x1))
      7: r(i(t(e(r(x1))))) -> e(w(r(i(t(e(x1))))))
Number of strict rules: 7
Direct POLO(bPol) ... removes: 4 6
      r 	w: x1 + 25236
      t 	w: x1 + 37854
      w 	w: x1 + 12618
      i 	w: x1
      e 	w: x1 + 12618
Number of strict rules: 5
Direct POLO(bPol) ... failed.
Uncurrying i
      1: r(e(x1)) -> w(r(x1))
      2: i^1_t(x1) -> e(r(x1))
      3: e(w(x1)) -> r(i(x1))
      5: w(r(x1)) -> i^1_t(x1)
      7: r(i^1_t(e(r(x1)))) -> e(w(r(i^1_t(e(x1)))))
      8: i(t(_1)) ->= i^1_t(_1)
Number of strict rules: 5
Direct POLO(bPol) ... removes: 8
      r 	w: x1 + 41076
      i^1_t	w: x1 + 61614
      t 	w: x1 + 61615
      w 	w: x1 + 20538
      i 	w: x1
      e 	w: x1 + 20538
Number of strict rules: 5
Direct POLO(bPol) ... failed.
Dependency Pairs:
     #1: #i^1_t(x1) -> #e(r(x1))
     #2: #i^1_t(x1) -> #r(x1)
     #3: #r(i^1_t(e(r(x1)))) -> #e(w(r(i^1_t(e(x1)))))
     #4: #r(i^1_t(e(r(x1)))) -> #w(r(i^1_t(e(x1))))
     #5: #r(i^1_t(e(r(x1)))) -> #r(i^1_t(e(x1)))
     #6: #r(i^1_t(e(r(x1)))) -> #i^1_t(e(x1))
     #7: #r(i^1_t(e(r(x1)))) -> #e(x1)
     #8: #w(r(x1)) -> #i^1_t(x1)
     #9: #e(w(x1)) -> #r(i(x1))
     #10: #r(e(x1)) -> #w(r(x1))
     #11: #r(e(x1)) -> #r(x1)
Number of SCCs: 1, DPs: 7
  SCC { #2 #4..6 #8 #10 #11 }
POLO(Sum)... succeeded.
      #w 	w: x1
      #e 	w: 0
      r 	w: x1 + 16736
      i^1_t	w: x1 + 25104
      t 	w: 0
      w 	w: x1 + 8368
      i 	w: 0
      #r 	w: x1 + 8369
      e 	w: x1 + 8368
      #i^1_t	w: x1 + 8370
    USABLE RULES: { 1..3 5 7 }
    Removed DPs: #2 #4..6 #8 #10 #11
Number of SCCs: 0, DPs: 0