YES
Input TRS:
      1: active(and(tt(),X)) -> mark(X)
      2: active(plus(N,0())) -> mark(N)
      3: active(plus(N,s(M))) -> mark(s(plus(N,M)))
      4: mark(and(X1,X2)) -> active(and(mark(X1),X2))
      5: mark(tt()) -> active(tt())
      6: mark(plus(X1,X2)) -> active(plus(mark(X1),mark(X2)))
      7: mark(0()) -> active(0())
      8: mark(s(X)) -> active(s(mark(X)))
      9: and(mark(X1),X2) -> and(X1,X2)
      10: and(X1,mark(X2)) -> and(X1,X2)
      11: and(active(X1),X2) -> and(X1,X2)
      12: and(X1,active(X2)) -> and(X1,X2)
      13: plus(mark(X1),X2) -> plus(X1,X2)
      14: plus(X1,mark(X2)) -> plus(X1,X2)
      15: plus(active(X1),X2) -> plus(X1,X2)
      16: plus(X1,active(X2)) -> plus(X1,X2)
      17: s(mark(X)) -> s(X)
      18: s(active(X)) -> s(X)
Number of strict rules: 18
Direct POLO(bPol) ... removes: 1 2
      s 	w: x1 + 28224
      and	w: 2 * x1 + x2 + 2
      0 	w: 17889
      mark	w: x1
      plus	w: x1 + x2 + 6879
      active	w: x1
      tt	w: 1
Number of strict rules: 16
Direct POLO(bPol) ... removes: 3
      s 	w: x1 + 1
      and	w: x1 + x2 + 1
      0 	w: 12063
      mark	w: x1
      plus	w: x1 + 2 * x2 + 6812
      active	w: x1
      tt	w: 1
Number of strict rules: 15
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
     #1: #mark(plus(X1,X2)) -> #plus(mark(X1),mark(X2))
     #2: #mark(plus(X1,X2)) -> #mark(X1)
     #3: #mark(plus(X1,X2)) -> #mark(X2)
     #4: #plus(mark(X1),X2) -> #plus(X1,X2)
     #5: #and(mark(X1),X2) -> #and(X1,X2)
     #6: #and(active(X1),X2) -> #and(X1,X2)
     #7: #and(X1,active(X2)) -> #and(X1,X2)
     #8: #plus(X1,mark(X2)) -> #plus(X1,X2)
     #9: #and(X1,mark(X2)) -> #and(X1,X2)
     #10: #s(mark(X)) -> #s(X)
     #11: #plus(X1,active(X2)) -> #plus(X1,X2)
     #12: #mark(s(X)) -> #s(mark(X))
     #13: #mark(s(X)) -> #mark(X)
     #14: #plus(active(X1),X2) -> #plus(X1,X2)
     #15: #mark(and(X1,X2)) -> #and(mark(X1),X2)
     #16: #mark(and(X1,X2)) -> #mark(X1)
     #17: #s(active(X)) -> #s(X)
Number of SCCs: 4, DPs: 14
  SCC { #10 #17 }
POLO(Sum)... succeeded.
      s 	w: 0
      and	w: 0
      #plus	w: 0
      #mark	w: 0
      0 	w: 0
      #s 	w: x1
      mark	w: x1 + 1
      plus	w: 0
      active	w: x1 + 1
      tt	w: 0
      #and	w: 0
    USABLE RULES: { }
    Removed DPs: #10 #17
Number of SCCs: 3, DPs: 12
  SCC { #2 #3 #13 #16 }
POLO(Sum)... succeeded.
      s 	w: x1 + 1
      and	w: x1 + 1
      #plus	w: 0
      #mark	w: x1
      0 	w: 0
      #s 	w: 0
      mark	w: 1
      plus	w: x1 + x2 + 1
      active	w: 1
      tt	w: 0
      #and	w: 0
    USABLE RULES: { }
    Removed DPs: #2 #3 #13 #16
Number of SCCs: 2, DPs: 8
  SCC { #4 #8 #11 #14 }
POLO(Sum)... succeeded.
      s 	w: 1
      and	w: 1
      #plus	w: x1 + x2
      #mark	w: 0
      0 	w: 0
      #s 	w: 0
      mark	w: x1 + 1
      plus	w: 1
      active	w: x1 + 1
      tt	w: 0
      #and	w: 0
    USABLE RULES: { }
    Removed DPs: #4 #8 #11 #14
Number of SCCs: 1, DPs: 4
  SCC { #5..7 #9 }
POLO(Sum)... succeeded.
      s 	w: 1
      and	w: 1
      #plus	w: 0
      #mark	w: 0
      0 	w: 0
      #s 	w: 0
      mark	w: x1 + 1
      plus	w: 1
      active	w: x1 + 1
      tt	w: 0
      #and	w: x1
    USABLE RULES: { }
    Removed DPs: #5 #6
Number of SCCs: 1, DPs: 2
  SCC { #7 #9 }
POLO(Sum)... succeeded.
      s 	w: 1
      and	w: 1
      #plus	w: 0
      #mark	w: 0
      0 	w: 0
      #s 	w: 0
      mark	w: x1 + 1
      plus	w: 1
      active	w: x1 + 1
      tt	w: 0
      #and	w: x2
    USABLE RULES: { }
    Removed DPs: #7 #9
Number of SCCs: 0, DPs: 0