YES

Problem:
 active(__(__(X,Y),Z)) -> mark(__(X,__(Y,Z)))
 active(__(X,nil())) -> mark(X)
 active(__(nil(),X)) -> mark(X)
 active(and(tt(),X)) -> mark(X)
 active(isNePal(__(I,__(P,I)))) -> mark(tt())
 active(__(X1,X2)) -> __(active(X1),X2)
 active(__(X1,X2)) -> __(X1,active(X2))
 active(and(X1,X2)) -> and(active(X1),X2)
 active(isNePal(X)) -> isNePal(active(X))
 __(mark(X1),X2) -> mark(__(X1,X2))
 __(X1,mark(X2)) -> mark(__(X1,X2))
 and(mark(X1),X2) -> mark(and(X1,X2))
 isNePal(mark(X)) -> mark(isNePal(X))
 proper(__(X1,X2)) -> __(proper(X1),proper(X2))
 proper(nil()) -> ok(nil())
 proper(and(X1,X2)) -> and(proper(X1),proper(X2))
 proper(tt()) -> ok(tt())
 proper(isNePal(X)) -> isNePal(proper(X))
 __(ok(X1),ok(X2)) -> ok(__(X1,X2))
 and(ok(X1),ok(X2)) -> ok(and(X1,X2))
 isNePal(ok(X)) -> ok(isNePal(X))
 top(mark(X)) -> top(proper(X))
 top(ok(X)) -> top(active(X))

Proof:
 Matrix Interpretation Processor: dim=1
  
  interpretation:
   [top](x0) = x0,
   
   [ok](x0) = x0,
   
   [proper](x0) = x0,
   
   [isNePal](x0) = 2x0 + 4,
   
   [and](x0, x1) = 5x0 + 4x1 + 6,
   
   [tt] = 4,
   
   [nil] = 0,
   
   [mark](x0) = x0,
   
   [active](x0) = x0,
   
   [__](x0, x1) = x0 + x1
  orientation:
   active(__(__(X,Y),Z)) = X + Y + Z >= X + Y + Z = mark(__(X,__(Y,Z)))
   
   active(__(X,nil())) = X >= X = mark(X)
   
   active(__(nil(),X)) = X >= X = mark(X)
   
   active(and(tt(),X)) = 4X + 26 >= X = mark(X)
   
   active(isNePal(__(I,__(P,I)))) = 4I + 2P + 4 >= 4 = mark(tt())
   
   active(__(X1,X2)) = X1 + X2 >= X1 + X2 = __(active(X1),X2)
   
   active(__(X1,X2)) = X1 + X2 >= X1 + X2 = __(X1,active(X2))
   
   active(and(X1,X2)) = 5X1 + 4X2 + 6 >= 5X1 + 4X2 + 6 = and(active(X1),X2)
   
   active(isNePal(X)) = 2X + 4 >= 2X + 4 = isNePal(active(X))
   
   __(mark(X1),X2) = X1 + X2 >= X1 + X2 = mark(__(X1,X2))
   
   __(X1,mark(X2)) = X1 + X2 >= X1 + X2 = mark(__(X1,X2))
   
   and(mark(X1),X2) = 5X1 + 4X2 + 6 >= 5X1 + 4X2 + 6 = mark(and(X1,X2))
   
   isNePal(mark(X)) = 2X + 4 >= 2X + 4 = mark(isNePal(X))
   
   proper(__(X1,X2)) = X1 + X2 >= X1 + X2 = __(proper(X1),proper(X2))
   
   proper(nil()) = 0 >= 0 = ok(nil())
   
   proper(and(X1,X2)) = 5X1 + 4X2 + 6 >= 5X1 + 4X2 + 6 = and(proper(X1),proper(X2))
   
   proper(tt()) = 4 >= 4 = ok(tt())
   
   proper(isNePal(X)) = 2X + 4 >= 2X + 4 = isNePal(proper(X))
   
   __(ok(X1),ok(X2)) = X1 + X2 >= X1 + X2 = ok(__(X1,X2))
   
   and(ok(X1),ok(X2)) = 5X1 + 4X2 + 6 >= 5X1 + 4X2 + 6 = ok(and(X1,X2))
   
   isNePal(ok(X)) = 2X + 4 >= 2X + 4 = ok(isNePal(X))
   
   top(mark(X)) = X >= X = top(proper(X))
   
   top(ok(X)) = X >= X = top(active(X))
  problem:
   active(__(__(X,Y),Z)) -> mark(__(X,__(Y,Z)))
   active(__(X,nil())) -> mark(X)
   active(__(nil(),X)) -> mark(X)
   active(isNePal(__(I,__(P,I)))) -> mark(tt())
   active(__(X1,X2)) -> __(active(X1),X2)
   active(__(X1,X2)) -> __(X1,active(X2))
   active(and(X1,X2)) -> and(active(X1),X2)
   active(isNePal(X)) -> isNePal(active(X))
   __(mark(X1),X2) -> mark(__(X1,X2))
   __(X1,mark(X2)) -> mark(__(X1,X2))
   and(mark(X1),X2) -> mark(and(X1,X2))
   isNePal(mark(X)) -> mark(isNePal(X))
   proper(__(X1,X2)) -> __(proper(X1),proper(X2))
   proper(nil()) -> ok(nil())
   proper(and(X1,X2)) -> and(proper(X1),proper(X2))
   proper(tt()) -> ok(tt())
   proper(isNePal(X)) -> isNePal(proper(X))
   __(ok(X1),ok(X2)) -> ok(__(X1,X2))
   and(ok(X1),ok(X2)) -> ok(and(X1,X2))
   isNePal(ok(X)) -> ok(isNePal(X))
   top(mark(X)) -> top(proper(X))
   top(ok(X)) -> top(active(X))
  DP Processor:
   DPs:
    active#(__(__(X,Y),Z)) -> __#(Y,Z)
    active#(__(__(X,Y),Z)) -> __#(X,__(Y,Z))
    active#(__(X1,X2)) -> active#(X1)
    active#(__(X1,X2)) -> __#(active(X1),X2)
    active#(__(X1,X2)) -> active#(X2)
    active#(__(X1,X2)) -> __#(X1,active(X2))
    active#(and(X1,X2)) -> active#(X1)
    active#(and(X1,X2)) -> and#(active(X1),X2)
    active#(isNePal(X)) -> active#(X)
    active#(isNePal(X)) -> isNePal#(active(X))
    __#(mark(X1),X2) -> __#(X1,X2)
    __#(X1,mark(X2)) -> __#(X1,X2)
    and#(mark(X1),X2) -> and#(X1,X2)
    isNePal#(mark(X)) -> isNePal#(X)
    proper#(__(X1,X2)) -> proper#(X2)
    proper#(__(X1,X2)) -> proper#(X1)
    proper#(__(X1,X2)) -> __#(proper(X1),proper(X2))
    proper#(and(X1,X2)) -> proper#(X2)
    proper#(and(X1,X2)) -> proper#(X1)
    proper#(and(X1,X2)) -> and#(proper(X1),proper(X2))
    proper#(isNePal(X)) -> proper#(X)
    proper#(isNePal(X)) -> isNePal#(proper(X))
    __#(ok(X1),ok(X2)) -> __#(X1,X2)
    and#(ok(X1),ok(X2)) -> and#(X1,X2)
    isNePal#(ok(X)) -> isNePal#(X)
    top#(mark(X)) -> proper#(X)
    top#(mark(X)) -> top#(proper(X))
    top#(ok(X)) -> active#(X)
    top#(ok(X)) -> top#(active(X))
   TRS:
    active(__(__(X,Y),Z)) -> mark(__(X,__(Y,Z)))
    active(__(X,nil())) -> mark(X)
    active(__(nil(),X)) -> mark(X)
    active(isNePal(__(I,__(P,I)))) -> mark(tt())
    active(__(X1,X2)) -> __(active(X1),X2)
    active(__(X1,X2)) -> __(X1,active(X2))
    active(and(X1,X2)) -> and(active(X1),X2)
    active(isNePal(X)) -> isNePal(active(X))
    __(mark(X1),X2) -> mark(__(X1,X2))
    __(X1,mark(X2)) -> mark(__(X1,X2))
    and(mark(X1),X2) -> mark(and(X1,X2))
    isNePal(mark(X)) -> mark(isNePal(X))
    proper(__(X1,X2)) -> __(proper(X1),proper(X2))
    proper(nil()) -> ok(nil())
    proper(and(X1,X2)) -> and(proper(X1),proper(X2))
    proper(tt()) -> ok(tt())
    proper(isNePal(X)) -> isNePal(proper(X))
    __(ok(X1),ok(X2)) -> ok(__(X1,X2))
    and(ok(X1),ok(X2)) -> ok(and(X1,X2))
    isNePal(ok(X)) -> ok(isNePal(X))
    top(mark(X)) -> top(proper(X))
    top(ok(X)) -> top(active(X))
   TDG Processor:
    DPs:
     active#(__(__(X,Y),Z)) -> __#(Y,Z)
     active#(__(__(X,Y),Z)) -> __#(X,__(Y,Z))
     active#(__(X1,X2)) -> active#(X1)
     active#(__(X1,X2)) -> __#(active(X1),X2)
     active#(__(X1,X2)) -> active#(X2)
     active#(__(X1,X2)) -> __#(X1,active(X2))
     active#(and(X1,X2)) -> active#(X1)
     active#(and(X1,X2)) -> and#(active(X1),X2)
     active#(isNePal(X)) -> active#(X)
     active#(isNePal(X)) -> isNePal#(active(X))
     __#(mark(X1),X2) -> __#(X1,X2)
     __#(X1,mark(X2)) -> __#(X1,X2)
     and#(mark(X1),X2) -> and#(X1,X2)
     isNePal#(mark(X)) -> isNePal#(X)
     proper#(__(X1,X2)) -> proper#(X2)
     proper#(__(X1,X2)) -> proper#(X1)
     proper#(__(X1,X2)) -> __#(proper(X1),proper(X2))
     proper#(and(X1,X2)) -> proper#(X2)
     proper#(and(X1,X2)) -> proper#(X1)
     proper#(and(X1,X2)) -> and#(proper(X1),proper(X2))
     proper#(isNePal(X)) -> proper#(X)
     proper#(isNePal(X)) -> isNePal#(proper(X))
     __#(ok(X1),ok(X2)) -> __#(X1,X2)
     and#(ok(X1),ok(X2)) -> and#(X1,X2)
     isNePal#(ok(X)) -> isNePal#(X)
     top#(mark(X)) -> proper#(X)
     top#(mark(X)) -> top#(proper(X))
     top#(ok(X)) -> active#(X)
     top#(ok(X)) -> top#(active(X))
    TRS:
     active(__(__(X,Y),Z)) -> mark(__(X,__(Y,Z)))
     active(__(X,nil())) -> mark(X)
     active(__(nil(),X)) -> mark(X)
     active(isNePal(__(I,__(P,I)))) -> mark(tt())
     active(__(X1,X2)) -> __(active(X1),X2)
     active(__(X1,X2)) -> __(X1,active(X2))
     active(and(X1,X2)) -> and(active(X1),X2)
     active(isNePal(X)) -> isNePal(active(X))
     __(mark(X1),X2) -> mark(__(X1,X2))
     __(X1,mark(X2)) -> mark(__(X1,X2))
     and(mark(X1),X2) -> mark(and(X1,X2))
     isNePal(mark(X)) -> mark(isNePal(X))
     proper(__(X1,X2)) -> __(proper(X1),proper(X2))
     proper(nil()) -> ok(nil())
     proper(and(X1,X2)) -> and(proper(X1),proper(X2))
     proper(tt()) -> ok(tt())
     proper(isNePal(X)) -> isNePal(proper(X))
     __(ok(X1),ok(X2)) -> ok(__(X1,X2))
     and(ok(X1),ok(X2)) -> ok(and(X1,X2))
     isNePal(ok(X)) -> ok(isNePal(X))
     top(mark(X)) -> top(proper(X))
     top(ok(X)) -> top(active(X))
    graph:
     top#(ok(X)) -> top#(active(X)) -> top#(ok(X)) -> top#(active(X))
     top#(ok(X)) -> top#(active(X)) -> top#(ok(X)) -> active#(X)
     top#(ok(X)) -> top#(active(X)) ->
     top#(mark(X)) -> top#(proper(X))
     top#(ok(X)) -> top#(active(X)) -> top#(mark(X)) -> proper#(X)
     top#(ok(X)) -> active#(X) ->
     active#(isNePal(X)) -> isNePal#(active(X))
     top#(ok(X)) -> active#(X) -> active#(isNePal(X)) -> active#(X)
     top#(ok(X)) -> active#(X) ->
     active#(and(X1,X2)) -> and#(active(X1),X2)
     top#(ok(X)) -> active#(X) -> active#(and(X1,X2)) -> active#(X1)
     top#(ok(X)) -> active#(X) -> active#(__(X1,X2)) -> __#(X1,active(X2))
     top#(ok(X)) -> active#(X) -> active#(__(X1,X2)) -> active#(X2)
     top#(ok(X)) -> active#(X) -> active#(__(X1,X2)) -> __#(active(X1),X2)
     top#(ok(X)) -> active#(X) -> active#(__(X1,X2)) -> active#(X1)
     top#(ok(X)) -> active#(X) -> active#(__(__(X,Y),Z)) -> __#(X,__(Y,Z))
     top#(ok(X)) -> active#(X) ->
     active#(__(__(X,Y),Z)) -> __#(Y,Z)
     top#(mark(X)) -> top#(proper(X)) ->
     top#(ok(X)) -> top#(active(X))
     top#(mark(X)) -> top#(proper(X)) -> top#(ok(X)) -> active#(X)
     top#(mark(X)) -> top#(proper(X)) ->
     top#(mark(X)) -> top#(proper(X))
     top#(mark(X)) -> top#(proper(X)) -> top#(mark(X)) -> proper#(X)
     top#(mark(X)) -> proper#(X) ->
     proper#(isNePal(X)) -> isNePal#(proper(X))
     top#(mark(X)) -> proper#(X) -> proper#(isNePal(X)) -> proper#(X)
     top#(mark(X)) -> proper#(X) ->
     proper#(and(X1,X2)) -> and#(proper(X1),proper(X2))
     top#(mark(X)) -> proper#(X) -> proper#(and(X1,X2)) -> proper#(X1)
     top#(mark(X)) -> proper#(X) -> proper#(and(X1,X2)) -> proper#(X2)
     top#(mark(X)) -> proper#(X) ->
     proper#(__(X1,X2)) -> __#(proper(X1),proper(X2))
     top#(mark(X)) -> proper#(X) -> proper#(__(X1,X2)) -> proper#(X1)
     top#(mark(X)) -> proper#(X) ->
     proper#(__(X1,X2)) -> proper#(X2)
     proper#(isNePal(X)) -> proper#(X) ->
     proper#(isNePal(X)) -> isNePal#(proper(X))
     proper#(isNePal(X)) -> proper#(X) ->
     proper#(isNePal(X)) -> proper#(X)
     proper#(isNePal(X)) -> proper#(X) ->
     proper#(and(X1,X2)) -> and#(proper(X1),proper(X2))
     proper#(isNePal(X)) -> proper#(X) ->
     proper#(and(X1,X2)) -> proper#(X1)
     proper#(isNePal(X)) -> proper#(X) ->
     proper#(and(X1,X2)) -> proper#(X2)
     proper#(isNePal(X)) -> proper#(X) ->
     proper#(__(X1,X2)) -> __#(proper(X1),proper(X2))
     proper#(isNePal(X)) -> proper#(X) ->
     proper#(__(X1,X2)) -> proper#(X1)
     proper#(isNePal(X)) -> proper#(X) ->
     proper#(__(X1,X2)) -> proper#(X2)
     proper#(isNePal(X)) -> isNePal#(proper(X)) ->
     isNePal#(ok(X)) -> isNePal#(X)
     proper#(isNePal(X)) -> isNePal#(proper(X)) ->
     isNePal#(mark(X)) -> isNePal#(X)
     proper#(and(X1,X2)) -> proper#(X2) ->
     proper#(isNePal(X)) -> isNePal#(proper(X))
     proper#(and(X1,X2)) -> proper#(X2) ->
     proper#(isNePal(X)) -> proper#(X)
     proper#(and(X1,X2)) -> proper#(X2) ->
     proper#(and(X1,X2)) -> and#(proper(X1),proper(X2))
     proper#(and(X1,X2)) -> proper#(X2) ->
     proper#(and(X1,X2)) -> proper#(X1)
     proper#(and(X1,X2)) -> proper#(X2) ->
     proper#(and(X1,X2)) -> proper#(X2)
     proper#(and(X1,X2)) -> proper#(X2) ->
     proper#(__(X1,X2)) -> __#(proper(X1),proper(X2))
     proper#(and(X1,X2)) -> proper#(X2) ->
     proper#(__(X1,X2)) -> proper#(X1)
     proper#(and(X1,X2)) -> proper#(X2) ->
     proper#(__(X1,X2)) -> proper#(X2)
     proper#(and(X1,X2)) -> proper#(X1) ->
     proper#(isNePal(X)) -> isNePal#(proper(X))
     proper#(and(X1,X2)) -> proper#(X1) ->
     proper#(isNePal(X)) -> proper#(X)
     proper#(and(X1,X2)) -> proper#(X1) ->
     proper#(and(X1,X2)) -> and#(proper(X1),proper(X2))
     proper#(and(X1,X2)) -> proper#(X1) ->
     proper#(and(X1,X2)) -> proper#(X1)
     proper#(and(X1,X2)) -> proper#(X1) ->
     proper#(and(X1,X2)) -> proper#(X2)
     proper#(and(X1,X2)) -> proper#(X1) ->
     proper#(__(X1,X2)) -> __#(proper(X1),proper(X2))
     proper#(and(X1,X2)) -> proper#(X1) ->
     proper#(__(X1,X2)) -> proper#(X1)
     proper#(and(X1,X2)) -> proper#(X1) ->
     proper#(__(X1,X2)) -> proper#(X2)
     proper#(and(X1,X2)) -> and#(proper(X1),proper(X2)) ->
     and#(ok(X1),ok(X2)) -> and#(X1,X2)
     proper#(and(X1,X2)) -> and#(proper(X1),proper(X2)) ->
     and#(mark(X1),X2) -> and#(X1,X2)
     proper#(__(X1,X2)) -> proper#(X2) ->
     proper#(isNePal(X)) -> isNePal#(proper(X))
     proper#(__(X1,X2)) -> proper#(X2) ->
     proper#(isNePal(X)) -> proper#(X)
     proper#(__(X1,X2)) -> proper#(X2) ->
     proper#(and(X1,X2)) -> and#(proper(X1),proper(X2))
     proper#(__(X1,X2)) -> proper#(X2) ->
     proper#(and(X1,X2)) -> proper#(X1)
     proper#(__(X1,X2)) -> proper#(X2) ->
     proper#(and(X1,X2)) -> proper#(X2)
     proper#(__(X1,X2)) -> proper#(X2) ->
     proper#(__(X1,X2)) -> __#(proper(X1),proper(X2))
     proper#(__(X1,X2)) -> proper#(X2) ->
     proper#(__(X1,X2)) -> proper#(X1)
     proper#(__(X1,X2)) -> proper#(X2) ->
     proper#(__(X1,X2)) -> proper#(X2)
     proper#(__(X1,X2)) -> proper#(X1) ->
     proper#(isNePal(X)) -> isNePal#(proper(X))
     proper#(__(X1,X2)) -> proper#(X1) ->
     proper#(isNePal(X)) -> proper#(X)
     proper#(__(X1,X2)) -> proper#(X1) ->
     proper#(and(X1,X2)) -> and#(proper(X1),proper(X2))
     proper#(__(X1,X2)) -> proper#(X1) ->
     proper#(and(X1,X2)) -> proper#(X1)
     proper#(__(X1,X2)) -> proper#(X1) ->
     proper#(and(X1,X2)) -> proper#(X2)
     proper#(__(X1,X2)) -> proper#(X1) ->
     proper#(__(X1,X2)) -> __#(proper(X1),proper(X2))
     proper#(__(X1,X2)) -> proper#(X1) ->
     proper#(__(X1,X2)) -> proper#(X1)
     proper#(__(X1,X2)) -> proper#(X1) ->
     proper#(__(X1,X2)) -> proper#(X2)
     proper#(__(X1,X2)) -> __#(proper(X1),proper(X2)) ->
     __#(ok(X1),ok(X2)) -> __#(X1,X2)
     proper#(__(X1,X2)) -> __#(proper(X1),proper(X2)) ->
     __#(X1,mark(X2)) -> __#(X1,X2)
     proper#(__(X1,X2)) -> __#(proper(X1),proper(X2)) ->
     __#(mark(X1),X2) -> __#(X1,X2)
     isNePal#(ok(X)) -> isNePal#(X) -> isNePal#(ok(X)) -> isNePal#(X)
     isNePal#(ok(X)) -> isNePal#(X) ->
     isNePal#(mark(X)) -> isNePal#(X)
     isNePal#(mark(X)) -> isNePal#(X) ->
     isNePal#(ok(X)) -> isNePal#(X)
     isNePal#(mark(X)) -> isNePal#(X) ->
     isNePal#(mark(X)) -> isNePal#(X)
     and#(ok(X1),ok(X2)) -> and#(X1,X2) ->
     and#(ok(X1),ok(X2)) -> and#(X1,X2)
     and#(ok(X1),ok(X2)) -> and#(X1,X2) ->
     and#(mark(X1),X2) -> and#(X1,X2)
     and#(mark(X1),X2) -> and#(X1,X2) ->
     and#(ok(X1),ok(X2)) -> and#(X1,X2)
     and#(mark(X1),X2) -> and#(X1,X2) ->
     and#(mark(X1),X2) -> and#(X1,X2)
     __#(ok(X1),ok(X2)) -> __#(X1,X2) ->
     __#(ok(X1),ok(X2)) -> __#(X1,X2)
     __#(ok(X1),ok(X2)) -> __#(X1,X2) ->
     __#(X1,mark(X2)) -> __#(X1,X2)
     __#(ok(X1),ok(X2)) -> __#(X1,X2) ->
     __#(mark(X1),X2) -> __#(X1,X2)
     __#(mark(X1),X2) -> __#(X1,X2) ->
     __#(ok(X1),ok(X2)) -> __#(X1,X2)
     __#(mark(X1),X2) -> __#(X1,X2) -> __#(X1,mark(X2)) -> __#(X1,X2)
     __#(mark(X1),X2) -> __#(X1,X2) -> __#(mark(X1),X2) -> __#(X1,X2)
     __#(X1,mark(X2)) -> __#(X1,X2) ->
     __#(ok(X1),ok(X2)) -> __#(X1,X2)
     __#(X1,mark(X2)) -> __#(X1,X2) -> __#(X1,mark(X2)) -> __#(X1,X2)
     __#(X1,mark(X2)) -> __#(X1,X2) ->
     __#(mark(X1),X2) -> __#(X1,X2)
     active#(isNePal(X)) -> isNePal#(active(X)) ->
     isNePal#(ok(X)) -> isNePal#(X)
     active#(isNePal(X)) -> isNePal#(active(X)) ->
     isNePal#(mark(X)) -> isNePal#(X)
     active#(isNePal(X)) -> active#(X) ->
     active#(isNePal(X)) -> isNePal#(active(X))
     active#(isNePal(X)) -> active#(X) ->
     active#(isNePal(X)) -> active#(X)
     active#(isNePal(X)) -> active#(X) ->
     active#(and(X1,X2)) -> and#(active(X1),X2)
     active#(isNePal(X)) -> active#(X) ->
     active#(and(X1,X2)) -> active#(X1)
     active#(isNePal(X)) -> active#(X) ->
     active#(__(X1,X2)) -> __#(X1,active(X2))
     active#(isNePal(X)) -> active#(X) ->
     active#(__(X1,X2)) -> active#(X2)
     active#(isNePal(X)) -> active#(X) ->
     active#(__(X1,X2)) -> __#(active(X1),X2)
     active#(isNePal(X)) -> active#(X) ->
     active#(__(X1,X2)) -> active#(X1)
     active#(isNePal(X)) -> active#(X) ->
     active#(__(__(X,Y),Z)) -> __#(X,__(Y,Z))
     active#(isNePal(X)) -> active#(X) ->
     active#(__(__(X,Y),Z)) -> __#(Y,Z)
     active#(and(X1,X2)) -> and#(active(X1),X2) ->
     and#(ok(X1),ok(X2)) -> and#(X1,X2)
     active#(and(X1,X2)) -> and#(active(X1),X2) ->
     and#(mark(X1),X2) -> and#(X1,X2)
     active#(and(X1,X2)) -> active#(X1) ->
     active#(isNePal(X)) -> isNePal#(active(X))
     active#(and(X1,X2)) -> active#(X1) ->
     active#(isNePal(X)) -> active#(X)
     active#(and(X1,X2)) -> active#(X1) ->
     active#(and(X1,X2)) -> and#(active(X1),X2)
     active#(and(X1,X2)) -> active#(X1) ->
     active#(and(X1,X2)) -> active#(X1)
     active#(and(X1,X2)) -> active#(X1) ->
     active#(__(X1,X2)) -> __#(X1,active(X2))
     active#(and(X1,X2)) -> active#(X1) ->
     active#(__(X1,X2)) -> active#(X2)
     active#(and(X1,X2)) -> active#(X1) ->
     active#(__(X1,X2)) -> __#(active(X1),X2)
     active#(and(X1,X2)) -> active#(X1) ->
     active#(__(X1,X2)) -> active#(X1)
     active#(and(X1,X2)) -> active#(X1) ->
     active#(__(__(X,Y),Z)) -> __#(X,__(Y,Z))
     active#(and(X1,X2)) -> active#(X1) ->
     active#(__(__(X,Y),Z)) -> __#(Y,Z)
     active#(__(__(X,Y),Z)) -> __#(Y,Z) ->
     __#(ok(X1),ok(X2)) -> __#(X1,X2)
     active#(__(__(X,Y),Z)) -> __#(Y,Z) ->
     __#(X1,mark(X2)) -> __#(X1,X2)
     active#(__(__(X,Y),Z)) -> __#(Y,Z) ->
     __#(mark(X1),X2) -> __#(X1,X2)
     active#(__(__(X,Y),Z)) -> __#(X,__(Y,Z)) ->
     __#(ok(X1),ok(X2)) -> __#(X1,X2)
     active#(__(__(X,Y),Z)) -> __#(X,__(Y,Z)) ->
     __#(X1,mark(X2)) -> __#(X1,X2)
     active#(__(__(X,Y),Z)) -> __#(X,__(Y,Z)) ->
     __#(mark(X1),X2) -> __#(X1,X2)
     active#(__(X1,X2)) -> __#(active(X1),X2) ->
     __#(ok(X1),ok(X2)) -> __#(X1,X2)
     active#(__(X1,X2)) -> __#(active(X1),X2) ->
     __#(X1,mark(X2)) -> __#(X1,X2)
     active#(__(X1,X2)) -> __#(active(X1),X2) ->
     __#(mark(X1),X2) -> __#(X1,X2)
     active#(__(X1,X2)) -> __#(X1,active(X2)) ->
     __#(ok(X1),ok(X2)) -> __#(X1,X2)
     active#(__(X1,X2)) -> __#(X1,active(X2)) ->
     __#(X1,mark(X2)) -> __#(X1,X2)
     active#(__(X1,X2)) -> __#(X1,active(X2)) ->
     __#(mark(X1),X2) -> __#(X1,X2)
     active#(__(X1,X2)) -> active#(X2) ->
     active#(isNePal(X)) -> isNePal#(active(X))
     active#(__(X1,X2)) -> active#(X2) ->
     active#(isNePal(X)) -> active#(X)
     active#(__(X1,X2)) -> active#(X2) ->
     active#(and(X1,X2)) -> and#(active(X1),X2)
     active#(__(X1,X2)) -> active#(X2) ->
     active#(and(X1,X2)) -> active#(X1)
     active#(__(X1,X2)) -> active#(X2) ->
     active#(__(X1,X2)) -> __#(X1,active(X2))
     active#(__(X1,X2)) -> active#(X2) ->
     active#(__(X1,X2)) -> active#(X2)
     active#(__(X1,X2)) -> active#(X2) ->
     active#(__(X1,X2)) -> __#(active(X1),X2)
     active#(__(X1,X2)) -> active#(X2) ->
     active#(__(X1,X2)) -> active#(X1)
     active#(__(X1,X2)) -> active#(X2) ->
     active#(__(__(X,Y),Z)) -> __#(X,__(Y,Z))
     active#(__(X1,X2)) -> active#(X2) ->
     active#(__(__(X,Y),Z)) -> __#(Y,Z)
     active#(__(X1,X2)) -> active#(X1) ->
     active#(isNePal(X)) -> isNePal#(active(X))
     active#(__(X1,X2)) -> active#(X1) ->
     active#(isNePal(X)) -> active#(X)
     active#(__(X1,X2)) -> active#(X1) ->
     active#(and(X1,X2)) -> and#(active(X1),X2)
     active#(__(X1,X2)) -> active#(X1) ->
     active#(and(X1,X2)) -> active#(X1)
     active#(__(X1,X2)) -> active#(X1) ->
     active#(__(X1,X2)) -> __#(X1,active(X2))
     active#(__(X1,X2)) -> active#(X1) ->
     active#(__(X1,X2)) -> active#(X2)
     active#(__(X1,X2)) -> active#(X1) ->
     active#(__(X1,X2)) -> __#(active(X1),X2)
     active#(__(X1,X2)) -> active#(X1) ->
     active#(__(X1,X2)) -> active#(X1)
     active#(__(X1,X2)) -> active#(X1) ->
     active#(__(__(X,Y),Z)) -> __#(X,__(Y,Z))
     active#(__(X1,X2)) -> active#(X1) -> active#(__(__(X,Y),Z)) -> __#(Y,Z)
    SCC Processor:
     #sccs: 6
     #rules: 18
     #arcs: 146/841
     DPs:
      top#(ok(X)) -> top#(active(X))
      top#(mark(X)) -> top#(proper(X))
     TRS:
      active(__(__(X,Y),Z)) -> mark(__(X,__(Y,Z)))
      active(__(X,nil())) -> mark(X)
      active(__(nil(),X)) -> mark(X)
      active(isNePal(__(I,__(P,I)))) -> mark(tt())
      active(__(X1,X2)) -> __(active(X1),X2)
      active(__(X1,X2)) -> __(X1,active(X2))
      active(and(X1,X2)) -> and(active(X1),X2)
      active(isNePal(X)) -> isNePal(active(X))
      __(mark(X1),X2) -> mark(__(X1,X2))
      __(X1,mark(X2)) -> mark(__(X1,X2))
      and(mark(X1),X2) -> mark(and(X1,X2))
      isNePal(mark(X)) -> mark(isNePal(X))
      proper(__(X1,X2)) -> __(proper(X1),proper(X2))
      proper(nil()) -> ok(nil())
      proper(and(X1,X2)) -> and(proper(X1),proper(X2))
      proper(tt()) -> ok(tt())
      proper(isNePal(X)) -> isNePal(proper(X))
      __(ok(X1),ok(X2)) -> ok(__(X1,X2))
      and(ok(X1),ok(X2)) -> ok(and(X1,X2))
      isNePal(ok(X)) -> ok(isNePal(X))
      top(mark(X)) -> top(proper(X))
      top(ok(X)) -> top(active(X))
     Usable Rule Processor:
      DPs:
       top#(ok(X)) -> top#(active(X))
       top#(mark(X)) -> top#(proper(X))
      TRS:
       active(__(__(X,Y),Z)) -> mark(__(X,__(Y,Z)))
       active(__(X,nil())) -> mark(X)
       active(__(nil(),X)) -> mark(X)
       active(isNePal(__(I,__(P,I)))) -> mark(tt())
       active(__(X1,X2)) -> __(active(X1),X2)
       active(__(X1,X2)) -> __(X1,active(X2))
       active(and(X1,X2)) -> and(active(X1),X2)
       active(isNePal(X)) -> isNePal(active(X))
       __(mark(X1),X2) -> mark(__(X1,X2))
       __(X1,mark(X2)) -> mark(__(X1,X2))
       __(ok(X1),ok(X2)) -> ok(__(X1,X2))
       and(mark(X1),X2) -> mark(and(X1,X2))
       and(ok(X1),ok(X2)) -> ok(and(X1,X2))
       isNePal(mark(X)) -> mark(isNePal(X))
       isNePal(ok(X)) -> ok(isNePal(X))
       proper(__(X1,X2)) -> __(proper(X1),proper(X2))
       proper(nil()) -> ok(nil())
       proper(and(X1,X2)) -> and(proper(X1),proper(X2))
       proper(tt()) -> ok(tt())
       proper(isNePal(X)) -> isNePal(proper(X))
      Semantic Labeling Processor:
       dimension: 1
       usable rules:
        active(__(__(X,Y),Z)) -> mark(__(X,__(Y,Z)))
        active(__(X,nil())) -> mark(X)
        active(__(nil(),X)) -> mark(X)
        active(isNePal(__(I,__(P,I)))) -> mark(tt())
        active(__(X1,X2)) -> __(active(X1),X2)
        active(__(X1,X2)) -> __(X1,active(X2))
        active(and(X1,X2)) -> and(active(X1),X2)
        active(isNePal(X)) -> isNePal(active(X))
        __(mark(X1),X2) -> mark(__(X1,X2))
        __(X1,mark(X2)) -> mark(__(X1,X2))
        __(ok(X1),ok(X2)) -> ok(__(X1,X2))
        and(mark(X1),X2) -> mark(and(X1,X2))
        and(ok(X1),ok(X2)) -> ok(and(X1,X2))
        isNePal(mark(X)) -> mark(isNePal(X))
        isNePal(ok(X)) -> ok(isNePal(X))
        proper(__(X1,X2)) -> __(proper(X1),proper(X2))
        proper(nil()) -> ok(nil())
        proper(and(X1,X2)) -> and(proper(X1),proper(X2))
        proper(tt()) -> ok(tt())
        proper(isNePal(X)) -> isNePal(proper(X))
       interpretation:
        [ok](x0) = x0,
        
        [proper](x0) = x0 + 1,
        
        [isNePal](x0) = 0,
        
        [and](x0, x1) = x1 + 1,
        
        [tt] = 0,
        
        [nil] = 1,
        
        [mark](x0) = 0,
        
        [active](x0) = 0,
        
        [__](x0, x1) = 1
        labeled:
        usable (for model):
        argument filtering:
         pi(__) = [0,1]
         pi(active) = 0
         pi(mark) = [0]
         pi(nil) = []
         pi(tt) = []
         pi(and) = 0
         pi(isNePal) = [0]
         pi(proper) = 0
         pi(ok) = 0
         pi(top#) = 0
       precedence:
        isNePal ~ __ > top# ~ ok ~ proper ~ and ~ tt ~ nil ~ mark ~ active
       problem:
        DPs:
         top#(ok(X)) -> top#(active(X))
        TRS:
         active(__(__(X,Y),Z)) -> mark(__(X,__(Y,Z)))
         active(__(X,nil())) -> mark(X)
         active(__(nil(),X)) -> mark(X)
         active(isNePal(__(I,__(P,I)))) -> mark(tt())
         active(__(X1,X2)) -> __(active(X1),X2)
         active(__(X1,X2)) -> __(X1,active(X2))
         active(and(X1,X2)) -> and(active(X1),X2)
         active(isNePal(X)) -> isNePal(active(X))
         __(mark(X1),X2) -> mark(__(X1,X2))
         __(X1,mark(X2)) -> mark(__(X1,X2))
         __(ok(X1),ok(X2)) -> ok(__(X1,X2))
         and(mark(X1),X2) -> mark(and(X1,X2))
         and(ok(X1),ok(X2)) -> ok(and(X1,X2))
         isNePal(mark(X)) -> mark(isNePal(X))
         isNePal(ok(X)) -> ok(isNePal(X))
         proper(__(X1,X2)) -> __(proper(X1),proper(X2))
         proper(nil()) -> ok(nil())
         proper(and(X1,X2)) -> and(proper(X1),proper(X2))
         proper(tt()) -> ok(tt())
         proper(isNePal(X)) -> isNePal(proper(X))
       Restore Modifier:
        DPs:
         top#(ok(X)) -> top#(active(X))
        TRS:
         active(__(__(X,Y),Z)) -> mark(__(X,__(Y,Z)))
         active(__(X,nil())) -> mark(X)
         active(__(nil(),X)) -> mark(X)
         active(isNePal(__(I,__(P,I)))) -> mark(tt())
         active(__(X1,X2)) -> __(active(X1),X2)
         active(__(X1,X2)) -> __(X1,active(X2))
         active(and(X1,X2)) -> and(active(X1),X2)
         active(isNePal(X)) -> isNePal(active(X))
         __(mark(X1),X2) -> mark(__(X1,X2))
         __(X1,mark(X2)) -> mark(__(X1,X2))
         and(mark(X1),X2) -> mark(and(X1,X2))
         isNePal(mark(X)) -> mark(isNePal(X))
         proper(__(X1,X2)) -> __(proper(X1),proper(X2))
         proper(nil()) -> ok(nil())
         proper(and(X1,X2)) -> and(proper(X1),proper(X2))
         proper(tt()) -> ok(tt())
         proper(isNePal(X)) -> isNePal(proper(X))
         __(ok(X1),ok(X2)) -> ok(__(X1,X2))
         and(ok(X1),ok(X2)) -> ok(and(X1,X2))
         isNePal(ok(X)) -> ok(isNePal(X))
         top(mark(X)) -> top(proper(X))
         top(ok(X)) -> top(active(X))
        Usable Rule Processor:
         DPs:
          top#(ok(X)) -> top#(active(X))
         TRS:
          active(__(__(X,Y),Z)) -> mark(__(X,__(Y,Z)))
          active(__(X,nil())) -> mark(X)
          active(__(nil(),X)) -> mark(X)
          active(isNePal(__(I,__(P,I)))) -> mark(tt())
          active(__(X1,X2)) -> __(active(X1),X2)
          active(__(X1,X2)) -> __(X1,active(X2))
          active(and(X1,X2)) -> and(active(X1),X2)
          active(isNePal(X)) -> isNePal(active(X))
          __(mark(X1),X2) -> mark(__(X1,X2))
          __(X1,mark(X2)) -> mark(__(X1,X2))
          __(ok(X1),ok(X2)) -> ok(__(X1,X2))
          and(mark(X1),X2) -> mark(and(X1,X2))
          and(ok(X1),ok(X2)) -> ok(and(X1,X2))
          isNePal(mark(X)) -> mark(isNePal(X))
          isNePal(ok(X)) -> ok(isNePal(X))
         Semantic Labeling Processor:
          dimension: 1
          usable rules:
           active(__(__(X,Y),Z)) -> mark(__(X,__(Y,Z)))
           active(__(X,nil())) -> mark(X)
           active(__(nil(),X)) -> mark(X)
           active(isNePal(__(I,__(P,I)))) -> mark(tt())
           active(__(X1,X2)) -> __(active(X1),X2)
           active(__(X1,X2)) -> __(X1,active(X2))
           active(and(X1,X2)) -> and(active(X1),X2)
           active(isNePal(X)) -> isNePal(active(X))
           __(mark(X1),X2) -> mark(__(X1,X2))
           __(X1,mark(X2)) -> mark(__(X1,X2))
           __(ok(X1),ok(X2)) -> ok(__(X1,X2))
           and(mark(X1),X2) -> mark(and(X1,X2))
           and(ok(X1),ok(X2)) -> ok(and(X1,X2))
           isNePal(mark(X)) -> mark(isNePal(X))
           isNePal(ok(X)) -> ok(isNePal(X))
          interpretation:
           [ok](x0) = x0 + 1,
           
           [isNePal](x0) = 0,
           
           [and](x0, x1) = 1,
           
           [tt] = 0,
           
           [nil] = 0,
           
           [mark](x0) = x0,
           
           [active](x0) = 0,
           
           [__](x0, x1) = 1
           labeled:
           usable (for model):
           argument filtering:
            pi(__) = [1]
            pi(active) = 0
            pi(mark) = []
            pi(nil) = []
            pi(tt) = []
            pi(and) = [0]
            pi(isNePal) = [0]
            pi(ok) = [0]
            pi(top#) = 0
          precedence:
           isNePal > and ~ __ > top# ~ ok ~ tt ~ nil ~ mark ~ active
          problem:
           DPs:
            
           TRS:
            active(__(__(X,Y),Z)) -> mark(__(X,__(Y,Z)))
            active(__(X,nil())) -> mark(X)
            active(__(nil(),X)) -> mark(X)
            active(isNePal(__(I,__(P,I)))) -> mark(tt())
            active(__(X1,X2)) -> __(active(X1),X2)
            active(__(X1,X2)) -> __(X1,active(X2))
            active(and(X1,X2)) -> and(active(X1),X2)
            active(isNePal(X)) -> isNePal(active(X))
            __(mark(X1),X2) -> mark(__(X1,X2))
            __(X1,mark(X2)) -> mark(__(X1,X2))
            __(ok(X1),ok(X2)) -> ok(__(X1,X2))
            and(mark(X1),X2) -> mark(and(X1,X2))
            and(ok(X1),ok(X2)) -> ok(and(X1,X2))
            isNePal(mark(X)) -> mark(isNePal(X))
            isNePal(ok(X)) -> ok(isNePal(X))
          Qed
     
     DPs:
      active#(__(X1,X2)) -> active#(X1)
      active#(__(X1,X2)) -> active#(X2)
      active#(and(X1,X2)) -> active#(X1)
      active#(isNePal(X)) -> active#(X)
     TRS:
      active(__(__(X,Y),Z)) -> mark(__(X,__(Y,Z)))
      active(__(X,nil())) -> mark(X)
      active(__(nil(),X)) -> mark(X)
      active(isNePal(__(I,__(P,I)))) -> mark(tt())
      active(__(X1,X2)) -> __(active(X1),X2)
      active(__(X1,X2)) -> __(X1,active(X2))
      active(and(X1,X2)) -> and(active(X1),X2)
      active(isNePal(X)) -> isNePal(active(X))
      __(mark(X1),X2) -> mark(__(X1,X2))
      __(X1,mark(X2)) -> mark(__(X1,X2))
      and(mark(X1),X2) -> mark(and(X1,X2))
      isNePal(mark(X)) -> mark(isNePal(X))
      proper(__(X1,X2)) -> __(proper(X1),proper(X2))
      proper(nil()) -> ok(nil())
      proper(and(X1,X2)) -> and(proper(X1),proper(X2))
      proper(tt()) -> ok(tt())
      proper(isNePal(X)) -> isNePal(proper(X))
      __(ok(X1),ok(X2)) -> ok(__(X1,X2))
      and(ok(X1),ok(X2)) -> ok(and(X1,X2))
      isNePal(ok(X)) -> ok(isNePal(X))
      top(mark(X)) -> top(proper(X))
      top(ok(X)) -> top(active(X))
     Subterm Criterion Processor:
      simple projection:
       pi(active#) = 0
      problem:
       DPs:
        
       TRS:
        active(__(__(X,Y),Z)) -> mark(__(X,__(Y,Z)))
        active(__(X,nil())) -> mark(X)
        active(__(nil(),X)) -> mark(X)
        active(isNePal(__(I,__(P,I)))) -> mark(tt())
        active(__(X1,X2)) -> __(active(X1),X2)
        active(__(X1,X2)) -> __(X1,active(X2))
        active(and(X1,X2)) -> and(active(X1),X2)
        active(isNePal(X)) -> isNePal(active(X))
        __(mark(X1),X2) -> mark(__(X1,X2))
        __(X1,mark(X2)) -> mark(__(X1,X2))
        and(mark(X1),X2) -> mark(and(X1,X2))
        isNePal(mark(X)) -> mark(isNePal(X))
        proper(__(X1,X2)) -> __(proper(X1),proper(X2))
        proper(nil()) -> ok(nil())
        proper(and(X1,X2)) -> and(proper(X1),proper(X2))
        proper(tt()) -> ok(tt())
        proper(isNePal(X)) -> isNePal(proper(X))
        __(ok(X1),ok(X2)) -> ok(__(X1,X2))
        and(ok(X1),ok(X2)) -> ok(and(X1,X2))
        isNePal(ok(X)) -> ok(isNePal(X))
        top(mark(X)) -> top(proper(X))
        top(ok(X)) -> top(active(X))
      Qed
     
     DPs:
      proper#(__(X1,X2)) -> proper#(X2)
      proper#(__(X1,X2)) -> proper#(X1)
      proper#(and(X1,X2)) -> proper#(X2)
      proper#(and(X1,X2)) -> proper#(X1)
      proper#(isNePal(X)) -> proper#(X)
     TRS:
      active(__(__(X,Y),Z)) -> mark(__(X,__(Y,Z)))
      active(__(X,nil())) -> mark(X)
      active(__(nil(),X)) -> mark(X)
      active(isNePal(__(I,__(P,I)))) -> mark(tt())
      active(__(X1,X2)) -> __(active(X1),X2)
      active(__(X1,X2)) -> __(X1,active(X2))
      active(and(X1,X2)) -> and(active(X1),X2)
      active(isNePal(X)) -> isNePal(active(X))
      __(mark(X1),X2) -> mark(__(X1,X2))
      __(X1,mark(X2)) -> mark(__(X1,X2))
      and(mark(X1),X2) -> mark(and(X1,X2))
      isNePal(mark(X)) -> mark(isNePal(X))
      proper(__(X1,X2)) -> __(proper(X1),proper(X2))
      proper(nil()) -> ok(nil())
      proper(and(X1,X2)) -> and(proper(X1),proper(X2))
      proper(tt()) -> ok(tt())
      proper(isNePal(X)) -> isNePal(proper(X))
      __(ok(X1),ok(X2)) -> ok(__(X1,X2))
      and(ok(X1),ok(X2)) -> ok(and(X1,X2))
      isNePal(ok(X)) -> ok(isNePal(X))
      top(mark(X)) -> top(proper(X))
      top(ok(X)) -> top(active(X))
     Subterm Criterion Processor:
      simple projection:
       pi(proper#) = 0
      problem:
       DPs:
        
       TRS:
        active(__(__(X,Y),Z)) -> mark(__(X,__(Y,Z)))
        active(__(X,nil())) -> mark(X)
        active(__(nil(),X)) -> mark(X)
        active(isNePal(__(I,__(P,I)))) -> mark(tt())
        active(__(X1,X2)) -> __(active(X1),X2)
        active(__(X1,X2)) -> __(X1,active(X2))
        active(and(X1,X2)) -> and(active(X1),X2)
        active(isNePal(X)) -> isNePal(active(X))
        __(mark(X1),X2) -> mark(__(X1,X2))
        __(X1,mark(X2)) -> mark(__(X1,X2))
        and(mark(X1),X2) -> mark(and(X1,X2))
        isNePal(mark(X)) -> mark(isNePal(X))
        proper(__(X1,X2)) -> __(proper(X1),proper(X2))
        proper(nil()) -> ok(nil())
        proper(and(X1,X2)) -> and(proper(X1),proper(X2))
        proper(tt()) -> ok(tt())
        proper(isNePal(X)) -> isNePal(proper(X))
        __(ok(X1),ok(X2)) -> ok(__(X1,X2))
        and(ok(X1),ok(X2)) -> ok(and(X1,X2))
        isNePal(ok(X)) -> ok(isNePal(X))
        top(mark(X)) -> top(proper(X))
        top(ok(X)) -> top(active(X))
      Qed
     
     DPs:
      isNePal#(mark(X)) -> isNePal#(X)
      isNePal#(ok(X)) -> isNePal#(X)
     TRS:
      active(__(__(X,Y),Z)) -> mark(__(X,__(Y,Z)))
      active(__(X,nil())) -> mark(X)
      active(__(nil(),X)) -> mark(X)
      active(isNePal(__(I,__(P,I)))) -> mark(tt())
      active(__(X1,X2)) -> __(active(X1),X2)
      active(__(X1,X2)) -> __(X1,active(X2))
      active(and(X1,X2)) -> and(active(X1),X2)
      active(isNePal(X)) -> isNePal(active(X))
      __(mark(X1),X2) -> mark(__(X1,X2))
      __(X1,mark(X2)) -> mark(__(X1,X2))
      and(mark(X1),X2) -> mark(and(X1,X2))
      isNePal(mark(X)) -> mark(isNePal(X))
      proper(__(X1,X2)) -> __(proper(X1),proper(X2))
      proper(nil()) -> ok(nil())
      proper(and(X1,X2)) -> and(proper(X1),proper(X2))
      proper(tt()) -> ok(tt())
      proper(isNePal(X)) -> isNePal(proper(X))
      __(ok(X1),ok(X2)) -> ok(__(X1,X2))
      and(ok(X1),ok(X2)) -> ok(and(X1,X2))
      isNePal(ok(X)) -> ok(isNePal(X))
      top(mark(X)) -> top(proper(X))
      top(ok(X)) -> top(active(X))
     Subterm Criterion Processor:
      simple projection:
       pi(isNePal#) = 0
      problem:
       DPs:
        
       TRS:
        active(__(__(X,Y),Z)) -> mark(__(X,__(Y,Z)))
        active(__(X,nil())) -> mark(X)
        active(__(nil(),X)) -> mark(X)
        active(isNePal(__(I,__(P,I)))) -> mark(tt())
        active(__(X1,X2)) -> __(active(X1),X2)
        active(__(X1,X2)) -> __(X1,active(X2))
        active(and(X1,X2)) -> and(active(X1),X2)
        active(isNePal(X)) -> isNePal(active(X))
        __(mark(X1),X2) -> mark(__(X1,X2))
        __(X1,mark(X2)) -> mark(__(X1,X2))
        and(mark(X1),X2) -> mark(and(X1,X2))
        isNePal(mark(X)) -> mark(isNePal(X))
        proper(__(X1,X2)) -> __(proper(X1),proper(X2))
        proper(nil()) -> ok(nil())
        proper(and(X1,X2)) -> and(proper(X1),proper(X2))
        proper(tt()) -> ok(tt())
        proper(isNePal(X)) -> isNePal(proper(X))
        __(ok(X1),ok(X2)) -> ok(__(X1,X2))
        and(ok(X1),ok(X2)) -> ok(and(X1,X2))
        isNePal(ok(X)) -> ok(isNePal(X))
        top(mark(X)) -> top(proper(X))
        top(ok(X)) -> top(active(X))
      Qed
     
     DPs:
      and#(mark(X1),X2) -> and#(X1,X2)
      and#(ok(X1),ok(X2)) -> and#(X1,X2)
     TRS:
      active(__(__(X,Y),Z)) -> mark(__(X,__(Y,Z)))
      active(__(X,nil())) -> mark(X)
      active(__(nil(),X)) -> mark(X)
      active(isNePal(__(I,__(P,I)))) -> mark(tt())
      active(__(X1,X2)) -> __(active(X1),X2)
      active(__(X1,X2)) -> __(X1,active(X2))
      active(and(X1,X2)) -> and(active(X1),X2)
      active(isNePal(X)) -> isNePal(active(X))
      __(mark(X1),X2) -> mark(__(X1,X2))
      __(X1,mark(X2)) -> mark(__(X1,X2))
      and(mark(X1),X2) -> mark(and(X1,X2))
      isNePal(mark(X)) -> mark(isNePal(X))
      proper(__(X1,X2)) -> __(proper(X1),proper(X2))
      proper(nil()) -> ok(nil())
      proper(and(X1,X2)) -> and(proper(X1),proper(X2))
      proper(tt()) -> ok(tt())
      proper(isNePal(X)) -> isNePal(proper(X))
      __(ok(X1),ok(X2)) -> ok(__(X1,X2))
      and(ok(X1),ok(X2)) -> ok(and(X1,X2))
      isNePal(ok(X)) -> ok(isNePal(X))
      top(mark(X)) -> top(proper(X))
      top(ok(X)) -> top(active(X))
     Subterm Criterion Processor:
      simple projection:
       pi(and#) = 1
      problem:
       DPs:
        and#(mark(X1),X2) -> and#(X1,X2)
       TRS:
        active(__(__(X,Y),Z)) -> mark(__(X,__(Y,Z)))
        active(__(X,nil())) -> mark(X)
        active(__(nil(),X)) -> mark(X)
        active(isNePal(__(I,__(P,I)))) -> mark(tt())
        active(__(X1,X2)) -> __(active(X1),X2)
        active(__(X1,X2)) -> __(X1,active(X2))
        active(and(X1,X2)) -> and(active(X1),X2)
        active(isNePal(X)) -> isNePal(active(X))
        __(mark(X1),X2) -> mark(__(X1,X2))
        __(X1,mark(X2)) -> mark(__(X1,X2))
        and(mark(X1),X2) -> mark(and(X1,X2))
        isNePal(mark(X)) -> mark(isNePal(X))
        proper(__(X1,X2)) -> __(proper(X1),proper(X2))
        proper(nil()) -> ok(nil())
        proper(and(X1,X2)) -> and(proper(X1),proper(X2))
        proper(tt()) -> ok(tt())
        proper(isNePal(X)) -> isNePal(proper(X))
        __(ok(X1),ok(X2)) -> ok(__(X1,X2))
        and(ok(X1),ok(X2)) -> ok(and(X1,X2))
        isNePal(ok(X)) -> ok(isNePal(X))
        top(mark(X)) -> top(proper(X))
        top(ok(X)) -> top(active(X))
      Subterm Criterion Processor:
       simple projection:
        pi(and#) = 0
       problem:
        DPs:
         
        TRS:
         active(__(__(X,Y),Z)) -> mark(__(X,__(Y,Z)))
         active(__(X,nil())) -> mark(X)
         active(__(nil(),X)) -> mark(X)
         active(isNePal(__(I,__(P,I)))) -> mark(tt())
         active(__(X1,X2)) -> __(active(X1),X2)
         active(__(X1,X2)) -> __(X1,active(X2))
         active(and(X1,X2)) -> and(active(X1),X2)
         active(isNePal(X)) -> isNePal(active(X))
         __(mark(X1),X2) -> mark(__(X1,X2))
         __(X1,mark(X2)) -> mark(__(X1,X2))
         and(mark(X1),X2) -> mark(and(X1,X2))
         isNePal(mark(X)) -> mark(isNePal(X))
         proper(__(X1,X2)) -> __(proper(X1),proper(X2))
         proper(nil()) -> ok(nil())
         proper(and(X1,X2)) -> and(proper(X1),proper(X2))
         proper(tt()) -> ok(tt())
         proper(isNePal(X)) -> isNePal(proper(X))
         __(ok(X1),ok(X2)) -> ok(__(X1,X2))
         and(ok(X1),ok(X2)) -> ok(and(X1,X2))
         isNePal(ok(X)) -> ok(isNePal(X))
         top(mark(X)) -> top(proper(X))
         top(ok(X)) -> top(active(X))
       Qed
     
     DPs:
      __#(mark(X1),X2) -> __#(X1,X2)
      __#(X1,mark(X2)) -> __#(X1,X2)
      __#(ok(X1),ok(X2)) -> __#(X1,X2)
     TRS:
      active(__(__(X,Y),Z)) -> mark(__(X,__(Y,Z)))
      active(__(X,nil())) -> mark(X)
      active(__(nil(),X)) -> mark(X)
      active(isNePal(__(I,__(P,I)))) -> mark(tt())
      active(__(X1,X2)) -> __(active(X1),X2)
      active(__(X1,X2)) -> __(X1,active(X2))
      active(and(X1,X2)) -> and(active(X1),X2)
      active(isNePal(X)) -> isNePal(active(X))
      __(mark(X1),X2) -> mark(__(X1,X2))
      __(X1,mark(X2)) -> mark(__(X1,X2))
      and(mark(X1),X2) -> mark(and(X1,X2))
      isNePal(mark(X)) -> mark(isNePal(X))
      proper(__(X1,X2)) -> __(proper(X1),proper(X2))
      proper(nil()) -> ok(nil())
      proper(and(X1,X2)) -> and(proper(X1),proper(X2))
      proper(tt()) -> ok(tt())
      proper(isNePal(X)) -> isNePal(proper(X))
      __(ok(X1),ok(X2)) -> ok(__(X1,X2))
      and(ok(X1),ok(X2)) -> ok(and(X1,X2))
      isNePal(ok(X)) -> ok(isNePal(X))
      top(mark(X)) -> top(proper(X))
      top(ok(X)) -> top(active(X))
     Subterm Criterion Processor:
      simple projection:
       pi(__#) = 1
      problem:
       DPs:
        __#(mark(X1),X2) -> __#(X1,X2)
       TRS:
        active(__(__(X,Y),Z)) -> mark(__(X,__(Y,Z)))
        active(__(X,nil())) -> mark(X)
        active(__(nil(),X)) -> mark(X)
        active(isNePal(__(I,__(P,I)))) -> mark(tt())
        active(__(X1,X2)) -> __(active(X1),X2)
        active(__(X1,X2)) -> __(X1,active(X2))
        active(and(X1,X2)) -> and(active(X1),X2)
        active(isNePal(X)) -> isNePal(active(X))
        __(mark(X1),X2) -> mark(__(X1,X2))
        __(X1,mark(X2)) -> mark(__(X1,X2))
        and(mark(X1),X2) -> mark(and(X1,X2))
        isNePal(mark(X)) -> mark(isNePal(X))
        proper(__(X1,X2)) -> __(proper(X1),proper(X2))
        proper(nil()) -> ok(nil())
        proper(and(X1,X2)) -> and(proper(X1),proper(X2))
        proper(tt()) -> ok(tt())
        proper(isNePal(X)) -> isNePal(proper(X))
        __(ok(X1),ok(X2)) -> ok(__(X1,X2))
        and(ok(X1),ok(X2)) -> ok(and(X1,X2))
        isNePal(ok(X)) -> ok(isNePal(X))
        top(mark(X)) -> top(proper(X))
        top(ok(X)) -> top(active(X))
      Subterm Criterion Processor:
       simple projection:
        pi(__#) = 0
       problem:
        DPs:
         
        TRS:
         active(__(__(X,Y),Z)) -> mark(__(X,__(Y,Z)))
         active(__(X,nil())) -> mark(X)
         active(__(nil(),X)) -> mark(X)
         active(isNePal(__(I,__(P,I)))) -> mark(tt())
         active(__(X1,X2)) -> __(active(X1),X2)
         active(__(X1,X2)) -> __(X1,active(X2))
         active(and(X1,X2)) -> and(active(X1),X2)
         active(isNePal(X)) -> isNePal(active(X))
         __(mark(X1),X2) -> mark(__(X1,X2))
         __(X1,mark(X2)) -> mark(__(X1,X2))
         and(mark(X1),X2) -> mark(and(X1,X2))
         isNePal(mark(X)) -> mark(isNePal(X))
         proper(__(X1,X2)) -> __(proper(X1),proper(X2))
         proper(nil()) -> ok(nil())
         proper(and(X1,X2)) -> and(proper(X1),proper(X2))
         proper(tt()) -> ok(tt())
         proper(isNePal(X)) -> isNePal(proper(X))
         __(ok(X1),ok(X2)) -> ok(__(X1,X2))
         and(ok(X1),ok(X2)) -> ok(and(X1,X2))
         isNePal(ok(X)) -> ok(isNePal(X))
         top(mark(X)) -> top(proper(X))
         top(ok(X)) -> top(active(X))
       Qed