YES
Input TRS:
      1: active(__(__(X,Y),Z)) -> mark(__(X,__(Y,Z)))
      2: active(__(X,nil())) -> mark(X)
      3: active(__(nil(),X)) -> mark(X)
      4: active(and(tt(),X)) -> mark(X)
      5: active(isNePal(__(I,__(P,I)))) -> mark(tt())
      6: active(__(X1,X2)) -> __(active(X1),X2)
      7: active(__(X1,X2)) -> __(X1,active(X2))
      8: active(and(X1,X2)) -> and(active(X1),X2)
      9: active(isNePal(X)) -> isNePal(active(X))
      10: __(mark(X1),X2) -> mark(__(X1,X2))
      11: __(X1,mark(X2)) -> mark(__(X1,X2))
      12: and(mark(X1),X2) -> mark(and(X1,X2))
      13: isNePal(mark(X)) -> mark(isNePal(X))
      14: proper(__(X1,X2)) -> __(proper(X1),proper(X2))
      15: proper(nil()) -> ok(nil())
      16: proper(and(X1,X2)) -> and(proper(X1),proper(X2))
      17: proper(tt()) -> ok(tt())
      18: proper(isNePal(X)) -> isNePal(proper(X))
      19: __(ok(X1),ok(X2)) -> ok(__(X1,X2))
      20: and(ok(X1),ok(X2)) -> ok(and(X1,X2))
      21: isNePal(ok(X)) -> ok(isNePal(X))
      22: top(mark(X)) -> top(proper(X))
      23: top(ok(X)) -> top(active(X))
Number of strict rules: 23
Direct POLO(bPol) ... removes: 4 1 3 22 5 10 2
      top	w: x1 + 25191
      and	w: x1 + x2 + 1
      isNePal	w: x1 + 3566
      proper	w: x1
      ok	w: x1
      nil	w: 1
      mark	w: x1 + 1
      active	w: x1
      tt	w: 1
      __	w: 2 * x1 + x2 + 2
Number of strict rules: 16
Direct POLO(bPol) ... removes: 12
      top	w: x1 + 27751
      and	w: 2 * x1 + x2 + 26666
      isNePal	w: x1
      proper	w: x1
      ok	w: x1
      nil	w: 15538
      mark	w: x1 + 1
      active	w: x1
      tt	w: 0
      __	w: 2 * x1 + x2 + 1
Number of strict rules: 15
Direct POLO(bPol) ... removes: 13
      top	w: x1 + 27751
      and	w: 2 * x1 + x2 + 26666
      isNePal	w: 2 * x1
      proper	w: x1
      ok	w: x1
      nil	w: 19456
      mark	w: x1 + 1
      active	w: x1
      tt	w: 0
      __	w: 2 * x1 + x2 + 1
Number of strict rules: 14
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
     #1: #active(__(X1,X2)) -> #__(active(X1),X2)
     #2: #active(__(X1,X2)) -> #active(X1)
     #3: #active(isNePal(X)) -> #isNePal(active(X))
     #4: #active(isNePal(X)) -> #active(X)
     #5: #__(X1,mark(X2)) -> #__(X1,X2)
     #6: #top(ok(X)) -> #top(active(X))
     #7: #top(ok(X)) -> #active(X)
     #8: #proper(__(X1,X2)) -> #__(proper(X1),proper(X2))
     #9: #proper(__(X1,X2)) -> #proper(X1)
     #10: #proper(__(X1,X2)) -> #proper(X2)
     #11: #and(ok(X1),ok(X2)) -> #and(X1,X2)
     #12: #active(__(X1,X2)) -> #__(X1,active(X2))
     #13: #active(__(X1,X2)) -> #active(X2)
     #14: #__(ok(X1),ok(X2)) -> #__(X1,X2)
     #15: #isNePal(ok(X)) -> #isNePal(X)
     #16: #proper(and(X1,X2)) -> #and(proper(X1),proper(X2))
     #17: #proper(and(X1,X2)) -> #proper(X1)
     #18: #proper(and(X1,X2)) -> #proper(X2)
     #19: #active(and(X1,X2)) -> #and(active(X1),X2)
     #20: #active(and(X1,X2)) -> #active(X1)
     #21: #proper(isNePal(X)) -> #isNePal(proper(X))
     #22: #proper(isNePal(X)) -> #proper(X)
Number of SCCs: 6, DPs: 14
  SCC { #15 }
POLO(Sum)... succeeded.
      top	w: 0
      and	w: 0
      #top	w: 0
      #__	w: 0
      isNePal	w: 0
      proper	w: 0
      ok	w: x1 + 1
      #isNePal	w: x1
      nil	w: 0
      mark	w: 0
      #proper	w: 0
      active	w: 0
      #active	w: 0
      tt	w: 0
      #and	w: 0
      __	w: 0
    USABLE RULES: { }
    Removed DPs: #15
Number of SCCs: 5, DPs: 13
  SCC { #6 }
POLO(Sum)... succeeded.
      top	w: 0
      and	w: x1 + x2 + 1
      #top	w: x1
      #__	w: 0
      isNePal	w: x1 + 36466
      proper	w: 0
      ok	w: x1 + 2
      #isNePal	w: 0
      nil	w: 0
      mark	w: x1 + 38139
      #proper	w: 0
      active	w: x1 + 1
      #active	w: 0
      tt	w: 0
      #and	w: 0
      __	w: x1 + x2 + 41063
    USABLE RULES: { 6..9 11 19..21 }
    Removed DPs: #6
Number of SCCs: 4, DPs: 12
  SCC { #11 }
POLO(Sum)... succeeded.
      top	w: 0
      and	w: x1 + x2 + 1
      #top	w: x1
      #__	w: 0
      isNePal	w: x1 + 42207
      proper	w: 0
      ok	w: x1 + 2
      #isNePal	w: 0
      nil	w: 0
      mark	w: x1 + 11943
      #proper	w: 0
      active	w: x1 + 1
      #active	w: 0
      tt	w: 0
      #and	w: x1 + x2
      __	w: x1 + x2 + 1
    USABLE RULES: { 6..9 11 19..21 }
    Removed DPs: #11
Number of SCCs: 3, DPs: 11
  SCC { #5 #14 }
POLO(Sum)... succeeded.
      top	w: 0
      and	w: x1 + x2 + 1
      #top	w: x1
      #__	w: x2
      isNePal	w: x1 + 1
      proper	w: 0
      ok	w: x1 + 2
      #isNePal	w: 0
      nil	w: 0
      mark	w: x1 + 11943
      #proper	w: 0
      active	w: x1 + 1
      #active	w: 0
      tt	w: 0
      #and	w: 0
      __	w: x1 + x2 + 35657
    USABLE RULES: { 6..9 11 19..21 }
    Removed DPs: #5 #14
Number of SCCs: 2, DPs: 9
  SCC { #2 #4 #13 #20 }
POLO(Sum)... succeeded.
      top	w: 0
      and	w: x1 + x2 + 1
      #top	w: x1
      #__	w: 0
      isNePal	w: x1 + 1
      proper	w: 0
      ok	w: x1 + 1
      #isNePal	w: 0
      nil	w: 0
      mark	w: x1 + 11943
      #proper	w: 0
      active	w: x1 + 1
      #active	w: x1
      tt	w: 0
      #and	w: 0
      __	w: x1 + x2 + 1
    USABLE RULES: { 6..9 11 19..21 }
    Removed DPs: #2 #4 #13 #20
Number of SCCs: 1, DPs: 5
  SCC { #9 #10 #17 #18 #22 }
POLO(Sum)... succeeded.
      top	w: 0
      and	w: x1 + x2 + 1
      #top	w: x1
      #__	w: 0
      isNePal	w: x1 + 1
      proper	w: 0
      ok	w: x1 + 3564
      #isNePal	w: 0
      nil	w: 0
      mark	w: x1 + 38607
      #proper	w: x1
      active	w: x1 + 1
      #active	w: 0
      tt	w: 0
      #and	w: 0
      __	w: x1 + x2 + 1
    USABLE RULES: { 6..9 11 19..21 }
    Removed DPs: #9 #10 #17 #18 #22
Number of SCCs: 0, DPs: 0