YES

Problem 1: 

(VAR v_NonEmpty:S I:S P:S X:S X1:S X2:S Y:S Z:S)
(RULES
__(active(X1:S),X2:S) -> __(X1:S,X2:S)
__(mark(X1:S),X2:S) -> __(X1:S,X2:S)
__(X1:S,active(X2:S)) -> __(X1:S,X2:S)
__(X1:S,mark(X2:S)) -> __(X1:S,X2:S)
active(__(__(X:S,Y:S),Z:S)) -> mark(__(X:S,__(Y:S,Z:S)))
active(__(nil,X:S)) -> mark(X:S)
active(__(X:S,nil)) -> mark(X:S)
active(and(tt,X:S)) -> mark(X:S)
active(isNePal(__(I:S,__(P:S,I:S)))) -> mark(tt)
and(active(X1:S),X2:S) -> and(X1:S,X2:S)
and(mark(X1:S),X2:S) -> and(X1:S,X2:S)
and(X1:S,active(X2:S)) -> and(X1:S,X2:S)
and(X1:S,mark(X2:S)) -> and(X1:S,X2:S)
isNePal(active(X:S)) -> isNePal(X:S)
isNePal(mark(X:S)) -> isNePal(X:S)
mark(__(X1:S,X2:S)) -> active(__(mark(X1:S),mark(X2:S)))
mark(and(X1:S,X2:S)) -> active(and(mark(X1:S),X2:S))
mark(isNePal(X:S)) -> active(isNePal(mark(X:S)))
mark(nil) -> active(nil)
mark(tt) -> active(tt)
) 
(STRATEGY INNERMOST)

Problem 1: 

Dependency Pairs Processor:
-> Pairs:
 __#(active(X1:S),X2:S) -> __#(X1:S,X2:S)
 __#(mark(X1:S),X2:S) -> __#(X1:S,X2:S)
 __#(X1:S,active(X2:S)) -> __#(X1:S,X2:S)
 __#(X1:S,mark(X2:S)) -> __#(X1:S,X2:S)
 ACTIVE(__(__(X:S,Y:S),Z:S)) -> __#(X:S,__(Y:S,Z:S))
 ACTIVE(__(__(X:S,Y:S),Z:S)) -> __#(Y:S,Z:S)
 ACTIVE(__(__(X:S,Y:S),Z:S)) -> MARK(__(X:S,__(Y:S,Z:S)))
 ACTIVE(__(nil,X:S)) -> MARK(X:S)
 ACTIVE(__(X:S,nil)) -> MARK(X:S)
 ACTIVE(and(tt,X:S)) -> MARK(X:S)
 ACTIVE(isNePal(__(I:S,__(P:S,I:S)))) -> MARK(tt)
 AND(active(X1:S),X2:S) -> AND(X1:S,X2:S)
 AND(mark(X1:S),X2:S) -> AND(X1:S,X2:S)
 AND(X1:S,active(X2:S)) -> AND(X1:S,X2:S)
 AND(X1:S,mark(X2:S)) -> AND(X1:S,X2:S)
 ISNEPAL(active(X:S)) -> ISNEPAL(X:S)
 ISNEPAL(mark(X:S)) -> ISNEPAL(X:S)
 MARK(__(X1:S,X2:S)) -> __#(mark(X1:S),mark(X2:S))
 MARK(__(X1:S,X2:S)) -> ACTIVE(__(mark(X1:S),mark(X2:S)))
 MARK(__(X1:S,X2:S)) -> MARK(X1:S)
 MARK(__(X1:S,X2:S)) -> MARK(X2:S)
 MARK(and(X1:S,X2:S)) -> ACTIVE(and(mark(X1:S),X2:S))
 MARK(and(X1:S,X2:S)) -> AND(mark(X1:S),X2:S)
 MARK(and(X1:S,X2:S)) -> MARK(X1:S)
 MARK(isNePal(X:S)) -> ACTIVE(isNePal(mark(X:S)))
 MARK(isNePal(X:S)) -> ISNEPAL(mark(X:S))
 MARK(isNePal(X:S)) -> MARK(X:S)
-> Rules:
 __(active(X1:S),X2:S) -> __(X1:S,X2:S)
 __(mark(X1:S),X2:S) -> __(X1:S,X2:S)
 __(X1:S,active(X2:S)) -> __(X1:S,X2:S)
 __(X1:S,mark(X2:S)) -> __(X1:S,X2:S)
 active(__(__(X:S,Y:S),Z:S)) -> mark(__(X:S,__(Y:S,Z:S)))
 active(__(nil,X:S)) -> mark(X:S)
 active(__(X:S,nil)) -> mark(X:S)
 active(and(tt,X:S)) -> mark(X:S)
 active(isNePal(__(I:S,__(P:S,I:S)))) -> mark(tt)
 and(active(X1:S),X2:S) -> and(X1:S,X2:S)
 and(mark(X1:S),X2:S) -> and(X1:S,X2:S)
 and(X1:S,active(X2:S)) -> and(X1:S,X2:S)
 and(X1:S,mark(X2:S)) -> and(X1:S,X2:S)
 isNePal(active(X:S)) -> isNePal(X:S)
 isNePal(mark(X:S)) -> isNePal(X:S)
 mark(__(X1:S,X2:S)) -> active(__(mark(X1:S),mark(X2:S)))
 mark(and(X1:S,X2:S)) -> active(and(mark(X1:S),X2:S))
 mark(isNePal(X:S)) -> active(isNePal(mark(X:S)))
 mark(nil) -> active(nil)
 mark(tt) -> active(tt)

Problem 1: 

SCC Processor:
-> Pairs:
 __#(active(X1:S),X2:S) -> __#(X1:S,X2:S)
 __#(mark(X1:S),X2:S) -> __#(X1:S,X2:S)
 __#(X1:S,active(X2:S)) -> __#(X1:S,X2:S)
 __#(X1:S,mark(X2:S)) -> __#(X1:S,X2:S)
 ACTIVE(__(__(X:S,Y:S),Z:S)) -> __#(X:S,__(Y:S,Z:S))
 ACTIVE(__(__(X:S,Y:S),Z:S)) -> __#(Y:S,Z:S)
 ACTIVE(__(__(X:S,Y:S),Z:S)) -> MARK(__(X:S,__(Y:S,Z:S)))
 ACTIVE(__(nil,X:S)) -> MARK(X:S)
 ACTIVE(__(X:S,nil)) -> MARK(X:S)
 ACTIVE(and(tt,X:S)) -> MARK(X:S)
 ACTIVE(isNePal(__(I:S,__(P:S,I:S)))) -> MARK(tt)
 AND(active(X1:S),X2:S) -> AND(X1:S,X2:S)
 AND(mark(X1:S),X2:S) -> AND(X1:S,X2:S)
 AND(X1:S,active(X2:S)) -> AND(X1:S,X2:S)
 AND(X1:S,mark(X2:S)) -> AND(X1:S,X2:S)
 ISNEPAL(active(X:S)) -> ISNEPAL(X:S)
 ISNEPAL(mark(X:S)) -> ISNEPAL(X:S)
 MARK(__(X1:S,X2:S)) -> __#(mark(X1:S),mark(X2:S))
 MARK(__(X1:S,X2:S)) -> ACTIVE(__(mark(X1:S),mark(X2:S)))
 MARK(__(X1:S,X2:S)) -> MARK(X1:S)
 MARK(__(X1:S,X2:S)) -> MARK(X2:S)
 MARK(and(X1:S,X2:S)) -> ACTIVE(and(mark(X1:S),X2:S))
 MARK(and(X1:S,X2:S)) -> AND(mark(X1:S),X2:S)
 MARK(and(X1:S,X2:S)) -> MARK(X1:S)
 MARK(isNePal(X:S)) -> ACTIVE(isNePal(mark(X:S)))
 MARK(isNePal(X:S)) -> ISNEPAL(mark(X:S))
 MARK(isNePal(X:S)) -> MARK(X:S)
-> Rules:
 __(active(X1:S),X2:S) -> __(X1:S,X2:S)
 __(mark(X1:S),X2:S) -> __(X1:S,X2:S)
 __(X1:S,active(X2:S)) -> __(X1:S,X2:S)
 __(X1:S,mark(X2:S)) -> __(X1:S,X2:S)
 active(__(__(X:S,Y:S),Z:S)) -> mark(__(X:S,__(Y:S,Z:S)))
 active(__(nil,X:S)) -> mark(X:S)
 active(__(X:S,nil)) -> mark(X:S)
 active(and(tt,X:S)) -> mark(X:S)
 active(isNePal(__(I:S,__(P:S,I:S)))) -> mark(tt)
 and(active(X1:S),X2:S) -> and(X1:S,X2:S)
 and(mark(X1:S),X2:S) -> and(X1:S,X2:S)
 and(X1:S,active(X2:S)) -> and(X1:S,X2:S)
 and(X1:S,mark(X2:S)) -> and(X1:S,X2:S)
 isNePal(active(X:S)) -> isNePal(X:S)
 isNePal(mark(X:S)) -> isNePal(X:S)
 mark(__(X1:S,X2:S)) -> active(__(mark(X1:S),mark(X2:S)))
 mark(and(X1:S,X2:S)) -> active(and(mark(X1:S),X2:S))
 mark(isNePal(X:S)) -> active(isNePal(mark(X:S)))
 mark(nil) -> active(nil)
 mark(tt) -> active(tt)
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 ISNEPAL(active(X:S)) -> ISNEPAL(X:S)
 ISNEPAL(mark(X:S)) -> ISNEPAL(X:S)
->->-> Rules:
 __(active(X1:S),X2:S) -> __(X1:S,X2:S)
 __(mark(X1:S),X2:S) -> __(X1:S,X2:S)
 __(X1:S,active(X2:S)) -> __(X1:S,X2:S)
 __(X1:S,mark(X2:S)) -> __(X1:S,X2:S)
 active(__(__(X:S,Y:S),Z:S)) -> mark(__(X:S,__(Y:S,Z:S)))
 active(__(nil,X:S)) -> mark(X:S)
 active(__(X:S,nil)) -> mark(X:S)
 active(and(tt,X:S)) -> mark(X:S)
 active(isNePal(__(I:S,__(P:S,I:S)))) -> mark(tt)
 and(active(X1:S),X2:S) -> and(X1:S,X2:S)
 and(mark(X1:S),X2:S) -> and(X1:S,X2:S)
 and(X1:S,active(X2:S)) -> and(X1:S,X2:S)
 and(X1:S,mark(X2:S)) -> and(X1:S,X2:S)
 isNePal(active(X:S)) -> isNePal(X:S)
 isNePal(mark(X:S)) -> isNePal(X:S)
 mark(__(X1:S,X2:S)) -> active(__(mark(X1:S),mark(X2:S)))
 mark(and(X1:S,X2:S)) -> active(and(mark(X1:S),X2:S))
 mark(isNePal(X:S)) -> active(isNePal(mark(X:S)))
 mark(nil) -> active(nil)
 mark(tt) -> active(tt)
->->Cycle:
->->-> Pairs:
 AND(active(X1:S),X2:S) -> AND(X1:S,X2:S)
 AND(mark(X1:S),X2:S) -> AND(X1:S,X2:S)
 AND(X1:S,active(X2:S)) -> AND(X1:S,X2:S)
 AND(X1:S,mark(X2:S)) -> AND(X1:S,X2:S)
->->-> Rules:
 __(active(X1:S),X2:S) -> __(X1:S,X2:S)
 __(mark(X1:S),X2:S) -> __(X1:S,X2:S)
 __(X1:S,active(X2:S)) -> __(X1:S,X2:S)
 __(X1:S,mark(X2:S)) -> __(X1:S,X2:S)
 active(__(__(X:S,Y:S),Z:S)) -> mark(__(X:S,__(Y:S,Z:S)))
 active(__(nil,X:S)) -> mark(X:S)
 active(__(X:S,nil)) -> mark(X:S)
 active(and(tt,X:S)) -> mark(X:S)
 active(isNePal(__(I:S,__(P:S,I:S)))) -> mark(tt)
 and(active(X1:S),X2:S) -> and(X1:S,X2:S)
 and(mark(X1:S),X2:S) -> and(X1:S,X2:S)
 and(X1:S,active(X2:S)) -> and(X1:S,X2:S)
 and(X1:S,mark(X2:S)) -> and(X1:S,X2:S)
 isNePal(active(X:S)) -> isNePal(X:S)
 isNePal(mark(X:S)) -> isNePal(X:S)
 mark(__(X1:S,X2:S)) -> active(__(mark(X1:S),mark(X2:S)))
 mark(and(X1:S,X2:S)) -> active(and(mark(X1:S),X2:S))
 mark(isNePal(X:S)) -> active(isNePal(mark(X:S)))
 mark(nil) -> active(nil)
 mark(tt) -> active(tt)
->->Cycle:
->->-> Pairs:
 __#(active(X1:S),X2:S) -> __#(X1:S,X2:S)
 __#(mark(X1:S),X2:S) -> __#(X1:S,X2:S)
 __#(X1:S,active(X2:S)) -> __#(X1:S,X2:S)
 __#(X1:S,mark(X2:S)) -> __#(X1:S,X2:S)
->->-> Rules:
 __(active(X1:S),X2:S) -> __(X1:S,X2:S)
 __(mark(X1:S),X2:S) -> __(X1:S,X2:S)
 __(X1:S,active(X2:S)) -> __(X1:S,X2:S)
 __(X1:S,mark(X2:S)) -> __(X1:S,X2:S)
 active(__(__(X:S,Y:S),Z:S)) -> mark(__(X:S,__(Y:S,Z:S)))
 active(__(nil,X:S)) -> mark(X:S)
 active(__(X:S,nil)) -> mark(X:S)
 active(and(tt,X:S)) -> mark(X:S)
 active(isNePal(__(I:S,__(P:S,I:S)))) -> mark(tt)
 and(active(X1:S),X2:S) -> and(X1:S,X2:S)
 and(mark(X1:S),X2:S) -> and(X1:S,X2:S)
 and(X1:S,active(X2:S)) -> and(X1:S,X2:S)
 and(X1:S,mark(X2:S)) -> and(X1:S,X2:S)
 isNePal(active(X:S)) -> isNePal(X:S)
 isNePal(mark(X:S)) -> isNePal(X:S)
 mark(__(X1:S,X2:S)) -> active(__(mark(X1:S),mark(X2:S)))
 mark(and(X1:S,X2:S)) -> active(and(mark(X1:S),X2:S))
 mark(isNePal(X:S)) -> active(isNePal(mark(X:S)))
 mark(nil) -> active(nil)
 mark(tt) -> active(tt)
->->Cycle:
->->-> Pairs:
 ACTIVE(__(__(X:S,Y:S),Z:S)) -> MARK(__(X:S,__(Y:S,Z:S)))
 ACTIVE(__(nil,X:S)) -> MARK(X:S)
 ACTIVE(__(X:S,nil)) -> MARK(X:S)
 ACTIVE(and(tt,X:S)) -> MARK(X:S)
 MARK(__(X1:S,X2:S)) -> ACTIVE(__(mark(X1:S),mark(X2:S)))
 MARK(__(X1:S,X2:S)) -> MARK(X1:S)
 MARK(__(X1:S,X2:S)) -> MARK(X2:S)
 MARK(and(X1:S,X2:S)) -> ACTIVE(and(mark(X1:S),X2:S))
 MARK(and(X1:S,X2:S)) -> MARK(X1:S)
 MARK(isNePal(X:S)) -> ACTIVE(isNePal(mark(X:S)))
 MARK(isNePal(X:S)) -> MARK(X:S)
->->-> Rules:
 __(active(X1:S),X2:S) -> __(X1:S,X2:S)
 __(mark(X1:S),X2:S) -> __(X1:S,X2:S)
 __(X1:S,active(X2:S)) -> __(X1:S,X2:S)
 __(X1:S,mark(X2:S)) -> __(X1:S,X2:S)
 active(__(__(X:S,Y:S),Z:S)) -> mark(__(X:S,__(Y:S,Z:S)))
 active(__(nil,X:S)) -> mark(X:S)
 active(__(X:S,nil)) -> mark(X:S)
 active(and(tt,X:S)) -> mark(X:S)
 active(isNePal(__(I:S,__(P:S,I:S)))) -> mark(tt)
 and(active(X1:S),X2:S) -> and(X1:S,X2:S)
 and(mark(X1:S),X2:S) -> and(X1:S,X2:S)
 and(X1:S,active(X2:S)) -> and(X1:S,X2:S)
 and(X1:S,mark(X2:S)) -> and(X1:S,X2:S)
 isNePal(active(X:S)) -> isNePal(X:S)
 isNePal(mark(X:S)) -> isNePal(X:S)
 mark(__(X1:S,X2:S)) -> active(__(mark(X1:S),mark(X2:S)))
 mark(and(X1:S,X2:S)) -> active(and(mark(X1:S),X2:S))
 mark(isNePal(X:S)) -> active(isNePal(mark(X:S)))
 mark(nil) -> active(nil)
 mark(tt) -> active(tt)


The problem is decomposed in 4 subproblems.

Problem 1.1: 

Subterm Processor:
-> Pairs:
 ISNEPAL(active(X:S)) -> ISNEPAL(X:S)
 ISNEPAL(mark(X:S)) -> ISNEPAL(X:S)
-> Rules:
 __(active(X1:S),X2:S) -> __(X1:S,X2:S)
 __(mark(X1:S),X2:S) -> __(X1:S,X2:S)
 __(X1:S,active(X2:S)) -> __(X1:S,X2:S)
 __(X1:S,mark(X2:S)) -> __(X1:S,X2:S)
 active(__(__(X:S,Y:S),Z:S)) -> mark(__(X:S,__(Y:S,Z:S)))
 active(__(nil,X:S)) -> mark(X:S)
 active(__(X:S,nil)) -> mark(X:S)
 active(and(tt,X:S)) -> mark(X:S)
 active(isNePal(__(I:S,__(P:S,I:S)))) -> mark(tt)
 and(active(X1:S),X2:S) -> and(X1:S,X2:S)
 and(mark(X1:S),X2:S) -> and(X1:S,X2:S)
 and(X1:S,active(X2:S)) -> and(X1:S,X2:S)
 and(X1:S,mark(X2:S)) -> and(X1:S,X2:S)
 isNePal(active(X:S)) -> isNePal(X:S)
 isNePal(mark(X:S)) -> isNePal(X:S)
 mark(__(X1:S,X2:S)) -> active(__(mark(X1:S),mark(X2:S)))
 mark(and(X1:S,X2:S)) -> active(and(mark(X1:S),X2:S))
 mark(isNePal(X:S)) -> active(isNePal(mark(X:S)))
 mark(nil) -> active(nil)
 mark(tt) -> active(tt)
->Projection:
 pi(ISNEPAL) = 1

Problem 1.1: 

SCC Processor:
-> Pairs:
 Empty
-> Rules:
 __(active(X1:S),X2:S) -> __(X1:S,X2:S)
 __(mark(X1:S),X2:S) -> __(X1:S,X2:S)
 __(X1:S,active(X2:S)) -> __(X1:S,X2:S)
 __(X1:S,mark(X2:S)) -> __(X1:S,X2:S)
 active(__(__(X:S,Y:S),Z:S)) -> mark(__(X:S,__(Y:S,Z:S)))
 active(__(nil,X:S)) -> mark(X:S)
 active(__(X:S,nil)) -> mark(X:S)
 active(and(tt,X:S)) -> mark(X:S)
 active(isNePal(__(I:S,__(P:S,I:S)))) -> mark(tt)
 and(active(X1:S),X2:S) -> and(X1:S,X2:S)
 and(mark(X1:S),X2:S) -> and(X1:S,X2:S)
 and(X1:S,active(X2:S)) -> and(X1:S,X2:S)
 and(X1:S,mark(X2:S)) -> and(X1:S,X2:S)
 isNePal(active(X:S)) -> isNePal(X:S)
 isNePal(mark(X:S)) -> isNePal(X:S)
 mark(__(X1:S,X2:S)) -> active(__(mark(X1:S),mark(X2:S)))
 mark(and(X1:S,X2:S)) -> active(and(mark(X1:S),X2:S))
 mark(isNePal(X:S)) -> active(isNePal(mark(X:S)))
 mark(nil) -> active(nil)
 mark(tt) -> active(tt)
->Strongly Connected Components:
 There is no strongly connected component

The problem is finite.

Problem 1.2: 

Subterm Processor:
-> Pairs:
 AND(active(X1:S),X2:S) -> AND(X1:S,X2:S)
 AND(mark(X1:S),X2:S) -> AND(X1:S,X2:S)
 AND(X1:S,active(X2:S)) -> AND(X1:S,X2:S)
 AND(X1:S,mark(X2:S)) -> AND(X1:S,X2:S)
-> Rules:
 __(active(X1:S),X2:S) -> __(X1:S,X2:S)
 __(mark(X1:S),X2:S) -> __(X1:S,X2:S)
 __(X1:S,active(X2:S)) -> __(X1:S,X2:S)
 __(X1:S,mark(X2:S)) -> __(X1:S,X2:S)
 active(__(__(X:S,Y:S),Z:S)) -> mark(__(X:S,__(Y:S,Z:S)))
 active(__(nil,X:S)) -> mark(X:S)
 active(__(X:S,nil)) -> mark(X:S)
 active(and(tt,X:S)) -> mark(X:S)
 active(isNePal(__(I:S,__(P:S,I:S)))) -> mark(tt)
 and(active(X1:S),X2:S) -> and(X1:S,X2:S)
 and(mark(X1:S),X2:S) -> and(X1:S,X2:S)
 and(X1:S,active(X2:S)) -> and(X1:S,X2:S)
 and(X1:S,mark(X2:S)) -> and(X1:S,X2:S)
 isNePal(active(X:S)) -> isNePal(X:S)
 isNePal(mark(X:S)) -> isNePal(X:S)
 mark(__(X1:S,X2:S)) -> active(__(mark(X1:S),mark(X2:S)))
 mark(and(X1:S,X2:S)) -> active(and(mark(X1:S),X2:S))
 mark(isNePal(X:S)) -> active(isNePal(mark(X:S)))
 mark(nil) -> active(nil)
 mark(tt) -> active(tt)
->Projection:
 pi(AND) = 1

Problem 1.2: 

SCC Processor:
-> Pairs:
 AND(X1:S,active(X2:S)) -> AND(X1:S,X2:S)
 AND(X1:S,mark(X2:S)) -> AND(X1:S,X2:S)
-> Rules:
 __(active(X1:S),X2:S) -> __(X1:S,X2:S)
 __(mark(X1:S),X2:S) -> __(X1:S,X2:S)
 __(X1:S,active(X2:S)) -> __(X1:S,X2:S)
 __(X1:S,mark(X2:S)) -> __(X1:S,X2:S)
 active(__(__(X:S,Y:S),Z:S)) -> mark(__(X:S,__(Y:S,Z:S)))
 active(__(nil,X:S)) -> mark(X:S)
 active(__(X:S,nil)) -> mark(X:S)
 active(and(tt,X:S)) -> mark(X:S)
 active(isNePal(__(I:S,__(P:S,I:S)))) -> mark(tt)
 and(active(X1:S),X2:S) -> and(X1:S,X2:S)
 and(mark(X1:S),X2:S) -> and(X1:S,X2:S)
 and(X1:S,active(X2:S)) -> and(X1:S,X2:S)
 and(X1:S,mark(X2:S)) -> and(X1:S,X2:S)
 isNePal(active(X:S)) -> isNePal(X:S)
 isNePal(mark(X:S)) -> isNePal(X:S)
 mark(__(X1:S,X2:S)) -> active(__(mark(X1:S),mark(X2:S)))
 mark(and(X1:S,X2:S)) -> active(and(mark(X1:S),X2:S))
 mark(isNePal(X:S)) -> active(isNePal(mark(X:S)))
 mark(nil) -> active(nil)
 mark(tt) -> active(tt)
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 AND(X1:S,active(X2:S)) -> AND(X1:S,X2:S)
 AND(X1:S,mark(X2:S)) -> AND(X1:S,X2:S)
->->-> Rules:
 __(active(X1:S),X2:S) -> __(X1:S,X2:S)
 __(mark(X1:S),X2:S) -> __(X1:S,X2:S)
 __(X1:S,active(X2:S)) -> __(X1:S,X2:S)
 __(X1:S,mark(X2:S)) -> __(X1:S,X2:S)
 active(__(__(X:S,Y:S),Z:S)) -> mark(__(X:S,__(Y:S,Z:S)))
 active(__(nil,X:S)) -> mark(X:S)
 active(__(X:S,nil)) -> mark(X:S)
 active(and(tt,X:S)) -> mark(X:S)
 active(isNePal(__(I:S,__(P:S,I:S)))) -> mark(tt)
 and(active(X1:S),X2:S) -> and(X1:S,X2:S)
 and(mark(X1:S),X2:S) -> and(X1:S,X2:S)
 and(X1:S,active(X2:S)) -> and(X1:S,X2:S)
 and(X1:S,mark(X2:S)) -> and(X1:S,X2:S)
 isNePal(active(X:S)) -> isNePal(X:S)
 isNePal(mark(X:S)) -> isNePal(X:S)
 mark(__(X1:S,X2:S)) -> active(__(mark(X1:S),mark(X2:S)))
 mark(and(X1:S,X2:S)) -> active(and(mark(X1:S),X2:S))
 mark(isNePal(X:S)) -> active(isNePal(mark(X:S)))
 mark(nil) -> active(nil)
 mark(tt) -> active(tt)

Problem 1.2: 

Subterm Processor:
-> Pairs:
 AND(X1:S,active(X2:S)) -> AND(X1:S,X2:S)
 AND(X1:S,mark(X2:S)) -> AND(X1:S,X2:S)
-> Rules:
 __(active(X1:S),X2:S) -> __(X1:S,X2:S)
 __(mark(X1:S),X2:S) -> __(X1:S,X2:S)
 __(X1:S,active(X2:S)) -> __(X1:S,X2:S)
 __(X1:S,mark(X2:S)) -> __(X1:S,X2:S)
 active(__(__(X:S,Y:S),Z:S)) -> mark(__(X:S,__(Y:S,Z:S)))
 active(__(nil,X:S)) -> mark(X:S)
 active(__(X:S,nil)) -> mark(X:S)
 active(and(tt,X:S)) -> mark(X:S)
 active(isNePal(__(I:S,__(P:S,I:S)))) -> mark(tt)
 and(active(X1:S),X2:S) -> and(X1:S,X2:S)
 and(mark(X1:S),X2:S) -> and(X1:S,X2:S)
 and(X1:S,active(X2:S)) -> and(X1:S,X2:S)
 and(X1:S,mark(X2:S)) -> and(X1:S,X2:S)
 isNePal(active(X:S)) -> isNePal(X:S)
 isNePal(mark(X:S)) -> isNePal(X:S)
 mark(__(X1:S,X2:S)) -> active(__(mark(X1:S),mark(X2:S)))
 mark(and(X1:S,X2:S)) -> active(and(mark(X1:S),X2:S))
 mark(isNePal(X:S)) -> active(isNePal(mark(X:S)))
 mark(nil) -> active(nil)
 mark(tt) -> active(tt)
->Projection:
 pi(AND) = 2

Problem 1.2: 

SCC Processor:
-> Pairs:
 Empty
-> Rules:
 __(active(X1:S),X2:S) -> __(X1:S,X2:S)
 __(mark(X1:S),X2:S) -> __(X1:S,X2:S)
 __(X1:S,active(X2:S)) -> __(X1:S,X2:S)
 __(X1:S,mark(X2:S)) -> __(X1:S,X2:S)
 active(__(__(X:S,Y:S),Z:S)) -> mark(__(X:S,__(Y:S,Z:S)))
 active(__(nil,X:S)) -> mark(X:S)
 active(__(X:S,nil)) -> mark(X:S)
 active(and(tt,X:S)) -> mark(X:S)
 active(isNePal(__(I:S,__(P:S,I:S)))) -> mark(tt)
 and(active(X1:S),X2:S) -> and(X1:S,X2:S)
 and(mark(X1:S),X2:S) -> and(X1:S,X2:S)
 and(X1:S,active(X2:S)) -> and(X1:S,X2:S)
 and(X1:S,mark(X2:S)) -> and(X1:S,X2:S)
 isNePal(active(X:S)) -> isNePal(X:S)
 isNePal(mark(X:S)) -> isNePal(X:S)
 mark(__(X1:S,X2:S)) -> active(__(mark(X1:S),mark(X2:S)))
 mark(and(X1:S,X2:S)) -> active(and(mark(X1:S),X2:S))
 mark(isNePal(X:S)) -> active(isNePal(mark(X:S)))
 mark(nil) -> active(nil)
 mark(tt) -> active(tt)
->Strongly Connected Components:
 There is no strongly connected component

The problem is finite.

Problem 1.3: 

Subterm Processor:
-> Pairs:
 __#(active(X1:S),X2:S) -> __#(X1:S,X2:S)
 __#(mark(X1:S),X2:S) -> __#(X1:S,X2:S)
 __#(X1:S,active(X2:S)) -> __#(X1:S,X2:S)
 __#(X1:S,mark(X2:S)) -> __#(X1:S,X2:S)
-> Rules:
 __(active(X1:S),X2:S) -> __(X1:S,X2:S)
 __(mark(X1:S),X2:S) -> __(X1:S,X2:S)
 __(X1:S,active(X2:S)) -> __(X1:S,X2:S)
 __(X1:S,mark(X2:S)) -> __(X1:S,X2:S)
 active(__(__(X:S,Y:S),Z:S)) -> mark(__(X:S,__(Y:S,Z:S)))
 active(__(nil,X:S)) -> mark(X:S)
 active(__(X:S,nil)) -> mark(X:S)
 active(and(tt,X:S)) -> mark(X:S)
 active(isNePal(__(I:S,__(P:S,I:S)))) -> mark(tt)
 and(active(X1:S),X2:S) -> and(X1:S,X2:S)
 and(mark(X1:S),X2:S) -> and(X1:S,X2:S)
 and(X1:S,active(X2:S)) -> and(X1:S,X2:S)
 and(X1:S,mark(X2:S)) -> and(X1:S,X2:S)
 isNePal(active(X:S)) -> isNePal(X:S)
 isNePal(mark(X:S)) -> isNePal(X:S)
 mark(__(X1:S,X2:S)) -> active(__(mark(X1:S),mark(X2:S)))
 mark(and(X1:S,X2:S)) -> active(and(mark(X1:S),X2:S))
 mark(isNePal(X:S)) -> active(isNePal(mark(X:S)))
 mark(nil) -> active(nil)
 mark(tt) -> active(tt)
->Projection:
 pi(__#) = 1

Problem 1.3: 

SCC Processor:
-> Pairs:
 __#(X1:S,active(X2:S)) -> __#(X1:S,X2:S)
 __#(X1:S,mark(X2:S)) -> __#(X1:S,X2:S)
-> Rules:
 __(active(X1:S),X2:S) -> __(X1:S,X2:S)
 __(mark(X1:S),X2:S) -> __(X1:S,X2:S)
 __(X1:S,active(X2:S)) -> __(X1:S,X2:S)
 __(X1:S,mark(X2:S)) -> __(X1:S,X2:S)
 active(__(__(X:S,Y:S),Z:S)) -> mark(__(X:S,__(Y:S,Z:S)))
 active(__(nil,X:S)) -> mark(X:S)
 active(__(X:S,nil)) -> mark(X:S)
 active(and(tt,X:S)) -> mark(X:S)
 active(isNePal(__(I:S,__(P:S,I:S)))) -> mark(tt)
 and(active(X1:S),X2:S) -> and(X1:S,X2:S)
 and(mark(X1:S),X2:S) -> and(X1:S,X2:S)
 and(X1:S,active(X2:S)) -> and(X1:S,X2:S)
 and(X1:S,mark(X2:S)) -> and(X1:S,X2:S)
 isNePal(active(X:S)) -> isNePal(X:S)
 isNePal(mark(X:S)) -> isNePal(X:S)
 mark(__(X1:S,X2:S)) -> active(__(mark(X1:S),mark(X2:S)))
 mark(and(X1:S,X2:S)) -> active(and(mark(X1:S),X2:S))
 mark(isNePal(X:S)) -> active(isNePal(mark(X:S)))
 mark(nil) -> active(nil)
 mark(tt) -> active(tt)
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 __#(X1:S,active(X2:S)) -> __#(X1:S,X2:S)
 __#(X1:S,mark(X2:S)) -> __#(X1:S,X2:S)
->->-> Rules:
 __(active(X1:S),X2:S) -> __(X1:S,X2:S)
 __(mark(X1:S),X2:S) -> __(X1:S,X2:S)
 __(X1:S,active(X2:S)) -> __(X1:S,X2:S)
 __(X1:S,mark(X2:S)) -> __(X1:S,X2:S)
 active(__(__(X:S,Y:S),Z:S)) -> mark(__(X:S,__(Y:S,Z:S)))
 active(__(nil,X:S)) -> mark(X:S)
 active(__(X:S,nil)) -> mark(X:S)
 active(and(tt,X:S)) -> mark(X:S)
 active(isNePal(__(I:S,__(P:S,I:S)))) -> mark(tt)
 and(active(X1:S),X2:S) -> and(X1:S,X2:S)
 and(mark(X1:S),X2:S) -> and(X1:S,X2:S)
 and(X1:S,active(X2:S)) -> and(X1:S,X2:S)
 and(X1:S,mark(X2:S)) -> and(X1:S,X2:S)
 isNePal(active(X:S)) -> isNePal(X:S)
 isNePal(mark(X:S)) -> isNePal(X:S)
 mark(__(X1:S,X2:S)) -> active(__(mark(X1:S),mark(X2:S)))
 mark(and(X1:S,X2:S)) -> active(and(mark(X1:S),X2:S))
 mark(isNePal(X:S)) -> active(isNePal(mark(X:S)))
 mark(nil) -> active(nil)
 mark(tt) -> active(tt)

Problem 1.3: 

Subterm Processor:
-> Pairs:
 __#(X1:S,active(X2:S)) -> __#(X1:S,X2:S)
 __#(X1:S,mark(X2:S)) -> __#(X1:S,X2:S)
-> Rules:
 __(active(X1:S),X2:S) -> __(X1:S,X2:S)
 __(mark(X1:S),X2:S) -> __(X1:S,X2:S)
 __(X1:S,active(X2:S)) -> __(X1:S,X2:S)
 __(X1:S,mark(X2:S)) -> __(X1:S,X2:S)
 active(__(__(X:S,Y:S),Z:S)) -> mark(__(X:S,__(Y:S,Z:S)))
 active(__(nil,X:S)) -> mark(X:S)
 active(__(X:S,nil)) -> mark(X:S)
 active(and(tt,X:S)) -> mark(X:S)
 active(isNePal(__(I:S,__(P:S,I:S)))) -> mark(tt)
 and(active(X1:S),X2:S) -> and(X1:S,X2:S)
 and(mark(X1:S),X2:S) -> and(X1:S,X2:S)
 and(X1:S,active(X2:S)) -> and(X1:S,X2:S)
 and(X1:S,mark(X2:S)) -> and(X1:S,X2:S)
 isNePal(active(X:S)) -> isNePal(X:S)
 isNePal(mark(X:S)) -> isNePal(X:S)
 mark(__(X1:S,X2:S)) -> active(__(mark(X1:S),mark(X2:S)))
 mark(and(X1:S,X2:S)) -> active(and(mark(X1:S),X2:S))
 mark(isNePal(X:S)) -> active(isNePal(mark(X:S)))
 mark(nil) -> active(nil)
 mark(tt) -> active(tt)
->Projection:
 pi(__#) = 2

Problem 1.3: 

SCC Processor:
-> Pairs:
 Empty
-> Rules:
 __(active(X1:S),X2:S) -> __(X1:S,X2:S)
 __(mark(X1:S),X2:S) -> __(X1:S,X2:S)
 __(X1:S,active(X2:S)) -> __(X1:S,X2:S)
 __(X1:S,mark(X2:S)) -> __(X1:S,X2:S)
 active(__(__(X:S,Y:S),Z:S)) -> mark(__(X:S,__(Y:S,Z:S)))
 active(__(nil,X:S)) -> mark(X:S)
 active(__(X:S,nil)) -> mark(X:S)
 active(and(tt,X:S)) -> mark(X:S)
 active(isNePal(__(I:S,__(P:S,I:S)))) -> mark(tt)
 and(active(X1:S),X2:S) -> and(X1:S,X2:S)
 and(mark(X1:S),X2:S) -> and(X1:S,X2:S)
 and(X1:S,active(X2:S)) -> and(X1:S,X2:S)
 and(X1:S,mark(X2:S)) -> and(X1:S,X2:S)
 isNePal(active(X:S)) -> isNePal(X:S)
 isNePal(mark(X:S)) -> isNePal(X:S)
 mark(__(X1:S,X2:S)) -> active(__(mark(X1:S),mark(X2:S)))
 mark(and(X1:S,X2:S)) -> active(and(mark(X1:S),X2:S))
 mark(isNePal(X:S)) -> active(isNePal(mark(X:S)))
 mark(nil) -> active(nil)
 mark(tt) -> active(tt)
->Strongly Connected Components:
 There is no strongly connected component

The problem is finite.

Problem 1.4: 

Reduction Pairs Processor:
-> Pairs:
 ACTIVE(__(__(X:S,Y:S),Z:S)) -> MARK(__(X:S,__(Y:S,Z:S)))
 ACTIVE(__(nil,X:S)) -> MARK(X:S)
 ACTIVE(__(X:S,nil)) -> MARK(X:S)
 ACTIVE(and(tt,X:S)) -> MARK(X:S)
 MARK(__(X1:S,X2:S)) -> ACTIVE(__(mark(X1:S),mark(X2:S)))
 MARK(__(X1:S,X2:S)) -> MARK(X1:S)
 MARK(__(X1:S,X2:S)) -> MARK(X2:S)
 MARK(and(X1:S,X2:S)) -> ACTIVE(and(mark(X1:S),X2:S))
 MARK(and(X1:S,X2:S)) -> MARK(X1:S)
 MARK(isNePal(X:S)) -> ACTIVE(isNePal(mark(X:S)))
 MARK(isNePal(X:S)) -> MARK(X:S)
-> Rules:
 __(active(X1:S),X2:S) -> __(X1:S,X2:S)
 __(mark(X1:S),X2:S) -> __(X1:S,X2:S)
 __(X1:S,active(X2:S)) -> __(X1:S,X2:S)
 __(X1:S,mark(X2:S)) -> __(X1:S,X2:S)
 active(__(__(X:S,Y:S),Z:S)) -> mark(__(X:S,__(Y:S,Z:S)))
 active(__(nil,X:S)) -> mark(X:S)
 active(__(X:S,nil)) -> mark(X:S)
 active(and(tt,X:S)) -> mark(X:S)
 active(isNePal(__(I:S,__(P:S,I:S)))) -> mark(tt)
 and(active(X1:S),X2:S) -> and(X1:S,X2:S)
 and(mark(X1:S),X2:S) -> and(X1:S,X2:S)
 and(X1:S,active(X2:S)) -> and(X1:S,X2:S)
 and(X1:S,mark(X2:S)) -> and(X1:S,X2:S)
 isNePal(active(X:S)) -> isNePal(X:S)
 isNePal(mark(X:S)) -> isNePal(X:S)
 mark(__(X1:S,X2:S)) -> active(__(mark(X1:S),mark(X2:S)))
 mark(and(X1:S,X2:S)) -> active(and(mark(X1:S),X2:S))
 mark(isNePal(X:S)) -> active(isNePal(mark(X:S)))
 mark(nil) -> active(nil)
 mark(tt) -> active(tt)
-> Usable rules:
 __(active(X1:S),X2:S) -> __(X1:S,X2:S)
 __(mark(X1:S),X2:S) -> __(X1:S,X2:S)
 __(X1:S,active(X2:S)) -> __(X1:S,X2:S)
 __(X1:S,mark(X2:S)) -> __(X1:S,X2:S)
 active(__(__(X:S,Y:S),Z:S)) -> mark(__(X:S,__(Y:S,Z:S)))
 active(__(nil,X:S)) -> mark(X:S)
 active(__(X:S,nil)) -> mark(X:S)
 active(and(tt,X:S)) -> mark(X:S)
 active(isNePal(__(I:S,__(P:S,I:S)))) -> mark(tt)
 and(active(X1:S),X2:S) -> and(X1:S,X2:S)
 and(mark(X1:S),X2:S) -> and(X1:S,X2:S)
 and(X1:S,active(X2:S)) -> and(X1:S,X2:S)
 and(X1:S,mark(X2:S)) -> and(X1:S,X2:S)
 isNePal(active(X:S)) -> isNePal(X:S)
 isNePal(mark(X:S)) -> isNePal(X:S)
 mark(__(X1:S,X2:S)) -> active(__(mark(X1:S),mark(X2:S)))
 mark(and(X1:S,X2:S)) -> active(and(mark(X1:S),X2:S))
 mark(isNePal(X:S)) -> active(isNePal(mark(X:S)))
 mark(nil) -> active(nil)
 mark(tt) -> active(tt)
->Interpretation type:
 Linear
->Coefficients:
 Natural Numbers
->Dimension:
 1
->Bound:
 2
->Interpretation:
 
[__](X1,X2) = 2.X1 + X2 + 2
[active](X) = X
[and](X1,X2) = 2.X1 + 2.X2 + 2
[isNePal](X) = 2.X + 1
[mark](X) = X
[fSNonEmpty] = 0
[nil] = 1
[tt] = 2
[__#](X1,X2) = 0
[ACTIVE](X) = 2.X + 2
[AND](X1,X2) = 0
[ISNEPAL](X) = 0
[MARK](X) = 2.X + 2

Problem 1.4: 

SCC Processor:
-> Pairs:
 ACTIVE(__(nil,X:S)) -> MARK(X:S)
 ACTIVE(__(X:S,nil)) -> MARK(X:S)
 ACTIVE(and(tt,X:S)) -> MARK(X:S)
 MARK(__(X1:S,X2:S)) -> ACTIVE(__(mark(X1:S),mark(X2:S)))
 MARK(__(X1:S,X2:S)) -> MARK(X1:S)
 MARK(__(X1:S,X2:S)) -> MARK(X2:S)
 MARK(and(X1:S,X2:S)) -> ACTIVE(and(mark(X1:S),X2:S))
 MARK(and(X1:S,X2:S)) -> MARK(X1:S)
 MARK(isNePal(X:S)) -> ACTIVE(isNePal(mark(X:S)))
 MARK(isNePal(X:S)) -> MARK(X:S)
-> Rules:
 __(active(X1:S),X2:S) -> __(X1:S,X2:S)
 __(mark(X1:S),X2:S) -> __(X1:S,X2:S)
 __(X1:S,active(X2:S)) -> __(X1:S,X2:S)
 __(X1:S,mark(X2:S)) -> __(X1:S,X2:S)
 active(__(__(X:S,Y:S),Z:S)) -> mark(__(X:S,__(Y:S,Z:S)))
 active(__(nil,X:S)) -> mark(X:S)
 active(__(X:S,nil)) -> mark(X:S)
 active(and(tt,X:S)) -> mark(X:S)
 active(isNePal(__(I:S,__(P:S,I:S)))) -> mark(tt)
 and(active(X1:S),X2:S) -> and(X1:S,X2:S)
 and(mark(X1:S),X2:S) -> and(X1:S,X2:S)
 and(X1:S,active(X2:S)) -> and(X1:S,X2:S)
 and(X1:S,mark(X2:S)) -> and(X1:S,X2:S)
 isNePal(active(X:S)) -> isNePal(X:S)
 isNePal(mark(X:S)) -> isNePal(X:S)
 mark(__(X1:S,X2:S)) -> active(__(mark(X1:S),mark(X2:S)))
 mark(and(X1:S,X2:S)) -> active(and(mark(X1:S),X2:S))
 mark(isNePal(X:S)) -> active(isNePal(mark(X:S)))
 mark(nil) -> active(nil)
 mark(tt) -> active(tt)
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 ACTIVE(__(nil,X:S)) -> MARK(X:S)
 ACTIVE(__(X:S,nil)) -> MARK(X:S)
 ACTIVE(and(tt,X:S)) -> MARK(X:S)
 MARK(__(X1:S,X2:S)) -> ACTIVE(__(mark(X1:S),mark(X2:S)))
 MARK(__(X1:S,X2:S)) -> MARK(X1:S)
 MARK(__(X1:S,X2:S)) -> MARK(X2:S)
 MARK(and(X1:S,X2:S)) -> ACTIVE(and(mark(X1:S),X2:S))
 MARK(and(X1:S,X2:S)) -> MARK(X1:S)
 MARK(isNePal(X:S)) -> ACTIVE(isNePal(mark(X:S)))
 MARK(isNePal(X:S)) -> MARK(X:S)
->->-> Rules:
 __(active(X1:S),X2:S) -> __(X1:S,X2:S)
 __(mark(X1:S),X2:S) -> __(X1:S,X2:S)
 __(X1:S,active(X2:S)) -> __(X1:S,X2:S)
 __(X1:S,mark(X2:S)) -> __(X1:S,X2:S)
 active(__(__(X:S,Y:S),Z:S)) -> mark(__(X:S,__(Y:S,Z:S)))
 active(__(nil,X:S)) -> mark(X:S)
 active(__(X:S,nil)) -> mark(X:S)
 active(and(tt,X:S)) -> mark(X:S)
 active(isNePal(__(I:S,__(P:S,I:S)))) -> mark(tt)
 and(active(X1:S),X2:S) -> and(X1:S,X2:S)
 and(mark(X1:S),X2:S) -> and(X1:S,X2:S)
 and(X1:S,active(X2:S)) -> and(X1:S,X2:S)
 and(X1:S,mark(X2:S)) -> and(X1:S,X2:S)
 isNePal(active(X:S)) -> isNePal(X:S)
 isNePal(mark(X:S)) -> isNePal(X:S)
 mark(__(X1:S,X2:S)) -> active(__(mark(X1:S),mark(X2:S)))
 mark(and(X1:S,X2:S)) -> active(and(mark(X1:S),X2:S))
 mark(isNePal(X:S)) -> active(isNePal(mark(X:S)))
 mark(nil) -> active(nil)
 mark(tt) -> active(tt)

Problem 1.4: 

Reduction Pairs Processor:
-> Pairs:
 ACTIVE(__(nil,X:S)) -> MARK(X:S)
 ACTIVE(__(X:S,nil)) -> MARK(X:S)
 ACTIVE(and(tt,X:S)) -> MARK(X:S)
 MARK(__(X1:S,X2:S)) -> ACTIVE(__(mark(X1:S),mark(X2:S)))
 MARK(__(X1:S,X2:S)) -> MARK(X1:S)
 MARK(__(X1:S,X2:S)) -> MARK(X2:S)
 MARK(and(X1:S,X2:S)) -> ACTIVE(and(mark(X1:S),X2:S))
 MARK(and(X1:S,X2:S)) -> MARK(X1:S)
 MARK(isNePal(X:S)) -> ACTIVE(isNePal(mark(X:S)))
 MARK(isNePal(X:S)) -> MARK(X:S)
-> Rules:
 __(active(X1:S),X2:S) -> __(X1:S,X2:S)
 __(mark(X1:S),X2:S) -> __(X1:S,X2:S)
 __(X1:S,active(X2:S)) -> __(X1:S,X2:S)
 __(X1:S,mark(X2:S)) -> __(X1:S,X2:S)
 active(__(__(X:S,Y:S),Z:S)) -> mark(__(X:S,__(Y:S,Z:S)))
 active(__(nil,X:S)) -> mark(X:S)
 active(__(X:S,nil)) -> mark(X:S)
 active(and(tt,X:S)) -> mark(X:S)
 active(isNePal(__(I:S,__(P:S,I:S)))) -> mark(tt)
 and(active(X1:S),X2:S) -> and(X1:S,X2:S)
 and(mark(X1:S),X2:S) -> and(X1:S,X2:S)
 and(X1:S,active(X2:S)) -> and(X1:S,X2:S)
 and(X1:S,mark(X2:S)) -> and(X1:S,X2:S)
 isNePal(active(X:S)) -> isNePal(X:S)
 isNePal(mark(X:S)) -> isNePal(X:S)
 mark(__(X1:S,X2:S)) -> active(__(mark(X1:S),mark(X2:S)))
 mark(and(X1:S,X2:S)) -> active(and(mark(X1:S),X2:S))
 mark(isNePal(X:S)) -> active(isNePal(mark(X:S)))
 mark(nil) -> active(nil)
 mark(tt) -> active(tt)
-> Usable rules:
 __(active(X1:S),X2:S) -> __(X1:S,X2:S)
 __(mark(X1:S),X2:S) -> __(X1:S,X2:S)
 __(X1:S,active(X2:S)) -> __(X1:S,X2:S)
 __(X1:S,mark(X2:S)) -> __(X1:S,X2:S)
 active(__(__(X:S,Y:S),Z:S)) -> mark(__(X:S,__(Y:S,Z:S)))
 active(__(nil,X:S)) -> mark(X:S)
 active(__(X:S,nil)) -> mark(X:S)
 active(and(tt,X:S)) -> mark(X:S)
 active(isNePal(__(I:S,__(P:S,I:S)))) -> mark(tt)
 and(active(X1:S),X2:S) -> and(X1:S,X2:S)
 and(mark(X1:S),X2:S) -> and(X1:S,X2:S)
 and(X1:S,active(X2:S)) -> and(X1:S,X2:S)
 and(X1:S,mark(X2:S)) -> and(X1:S,X2:S)
 isNePal(active(X:S)) -> isNePal(X:S)
 isNePal(mark(X:S)) -> isNePal(X:S)
 mark(__(X1:S,X2:S)) -> active(__(mark(X1:S),mark(X2:S)))
 mark(and(X1:S,X2:S)) -> active(and(mark(X1:S),X2:S))
 mark(isNePal(X:S)) -> active(isNePal(mark(X:S)))
 mark(nil) -> active(nil)
 mark(tt) -> active(tt)
->Interpretation type:
 Linear
->Coefficients:
 Natural Numbers
->Dimension:
 1
->Bound:
 2
->Interpretation:
 
[__](X1,X2) = 2.X1 + X2
[active](X) = X
[and](X1,X2) = 2.X1 + 2.X2 + 2
[isNePal](X) = 2.X + 2
[mark](X) = X
[fSNonEmpty] = 0
[nil] = 2
[tt] = 0
[__#](X1,X2) = 0
[ACTIVE](X) = 2.X + 1
[AND](X1,X2) = 0
[ISNEPAL](X) = 0
[MARK](X) = 2.X + 2

Problem 1.4: 

SCC Processor:
-> Pairs:
 ACTIVE(__(X:S,nil)) -> MARK(X:S)
 ACTIVE(and(tt,X:S)) -> MARK(X:S)
 MARK(__(X1:S,X2:S)) -> ACTIVE(__(mark(X1:S),mark(X2:S)))
 MARK(__(X1:S,X2:S)) -> MARK(X1:S)
 MARK(__(X1:S,X2:S)) -> MARK(X2:S)
 MARK(and(X1:S,X2:S)) -> ACTIVE(and(mark(X1:S),X2:S))
 MARK(and(X1:S,X2:S)) -> MARK(X1:S)
 MARK(isNePal(X:S)) -> ACTIVE(isNePal(mark(X:S)))
 MARK(isNePal(X:S)) -> MARK(X:S)
-> Rules:
 __(active(X1:S),X2:S) -> __(X1:S,X2:S)
 __(mark(X1:S),X2:S) -> __(X1:S,X2:S)
 __(X1:S,active(X2:S)) -> __(X1:S,X2:S)
 __(X1:S,mark(X2:S)) -> __(X1:S,X2:S)
 active(__(__(X:S,Y:S),Z:S)) -> mark(__(X:S,__(Y:S,Z:S)))
 active(__(nil,X:S)) -> mark(X:S)
 active(__(X:S,nil)) -> mark(X:S)
 active(and(tt,X:S)) -> mark(X:S)
 active(isNePal(__(I:S,__(P:S,I:S)))) -> mark(tt)
 and(active(X1:S),X2:S) -> and(X1:S,X2:S)
 and(mark(X1:S),X2:S) -> and(X1:S,X2:S)
 and(X1:S,active(X2:S)) -> and(X1:S,X2:S)
 and(X1:S,mark(X2:S)) -> and(X1:S,X2:S)
 isNePal(active(X:S)) -> isNePal(X:S)
 isNePal(mark(X:S)) -> isNePal(X:S)
 mark(__(X1:S,X2:S)) -> active(__(mark(X1:S),mark(X2:S)))
 mark(and(X1:S,X2:S)) -> active(and(mark(X1:S),X2:S))
 mark(isNePal(X:S)) -> active(isNePal(mark(X:S)))
 mark(nil) -> active(nil)
 mark(tt) -> active(tt)
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 ACTIVE(__(X:S,nil)) -> MARK(X:S)
 ACTIVE(and(tt,X:S)) -> MARK(X:S)
 MARK(__(X1:S,X2:S)) -> ACTIVE(__(mark(X1:S),mark(X2:S)))
 MARK(__(X1:S,X2:S)) -> MARK(X1:S)
 MARK(__(X1:S,X2:S)) -> MARK(X2:S)
 MARK(and(X1:S,X2:S)) -> ACTIVE(and(mark(X1:S),X2:S))
 MARK(and(X1:S,X2:S)) -> MARK(X1:S)
 MARK(isNePal(X:S)) -> ACTIVE(isNePal(mark(X:S)))
 MARK(isNePal(X:S)) -> MARK(X:S)
->->-> Rules:
 __(active(X1:S),X2:S) -> __(X1:S,X2:S)
 __(mark(X1:S),X2:S) -> __(X1:S,X2:S)
 __(X1:S,active(X2:S)) -> __(X1:S,X2:S)
 __(X1:S,mark(X2:S)) -> __(X1:S,X2:S)
 active(__(__(X:S,Y:S),Z:S)) -> mark(__(X:S,__(Y:S,Z:S)))
 active(__(nil,X:S)) -> mark(X:S)
 active(__(X:S,nil)) -> mark(X:S)
 active(and(tt,X:S)) -> mark(X:S)
 active(isNePal(__(I:S,__(P:S,I:S)))) -> mark(tt)
 and(active(X1:S),X2:S) -> and(X1:S,X2:S)
 and(mark(X1:S),X2:S) -> and(X1:S,X2:S)
 and(X1:S,active(X2:S)) -> and(X1:S,X2:S)
 and(X1:S,mark(X2:S)) -> and(X1:S,X2:S)
 isNePal(active(X:S)) -> isNePal(X:S)
 isNePal(mark(X:S)) -> isNePal(X:S)
 mark(__(X1:S,X2:S)) -> active(__(mark(X1:S),mark(X2:S)))
 mark(and(X1:S,X2:S)) -> active(and(mark(X1:S),X2:S))
 mark(isNePal(X:S)) -> active(isNePal(mark(X:S)))
 mark(nil) -> active(nil)
 mark(tt) -> active(tt)

Problem 1.4: 

Reduction Pairs Processor:
-> Pairs:
 ACTIVE(__(X:S,nil)) -> MARK(X:S)
 ACTIVE(and(tt,X:S)) -> MARK(X:S)
 MARK(__(X1:S,X2:S)) -> ACTIVE(__(mark(X1:S),mark(X2:S)))
 MARK(__(X1:S,X2:S)) -> MARK(X1:S)
 MARK(__(X1:S,X2:S)) -> MARK(X2:S)
 MARK(and(X1:S,X2:S)) -> ACTIVE(and(mark(X1:S),X2:S))
 MARK(and(X1:S,X2:S)) -> MARK(X1:S)
 MARK(isNePal(X:S)) -> ACTIVE(isNePal(mark(X:S)))
 MARK(isNePal(X:S)) -> MARK(X:S)
-> Rules:
 __(active(X1:S),X2:S) -> __(X1:S,X2:S)
 __(mark(X1:S),X2:S) -> __(X1:S,X2:S)
 __(X1:S,active(X2:S)) -> __(X1:S,X2:S)
 __(X1:S,mark(X2:S)) -> __(X1:S,X2:S)
 active(__(__(X:S,Y:S),Z:S)) -> mark(__(X:S,__(Y:S,Z:S)))
 active(__(nil,X:S)) -> mark(X:S)
 active(__(X:S,nil)) -> mark(X:S)
 active(and(tt,X:S)) -> mark(X:S)
 active(isNePal(__(I:S,__(P:S,I:S)))) -> mark(tt)
 and(active(X1:S),X2:S) -> and(X1:S,X2:S)
 and(mark(X1:S),X2:S) -> and(X1:S,X2:S)
 and(X1:S,active(X2:S)) -> and(X1:S,X2:S)
 and(X1:S,mark(X2:S)) -> and(X1:S,X2:S)
 isNePal(active(X:S)) -> isNePal(X:S)
 isNePal(mark(X:S)) -> isNePal(X:S)
 mark(__(X1:S,X2:S)) -> active(__(mark(X1:S),mark(X2:S)))
 mark(and(X1:S,X2:S)) -> active(and(mark(X1:S),X2:S))
 mark(isNePal(X:S)) -> active(isNePal(mark(X:S)))
 mark(nil) -> active(nil)
 mark(tt) -> active(tt)
-> Usable rules:
 __(active(X1:S),X2:S) -> __(X1:S,X2:S)
 __(mark(X1:S),X2:S) -> __(X1:S,X2:S)
 __(X1:S,active(X2:S)) -> __(X1:S,X2:S)
 __(X1:S,mark(X2:S)) -> __(X1:S,X2:S)
 active(__(__(X:S,Y:S),Z:S)) -> mark(__(X:S,__(Y:S,Z:S)))
 active(__(nil,X:S)) -> mark(X:S)
 active(__(X:S,nil)) -> mark(X:S)
 active(and(tt,X:S)) -> mark(X:S)
 active(isNePal(__(I:S,__(P:S,I:S)))) -> mark(tt)
 and(active(X1:S),X2:S) -> and(X1:S,X2:S)
 and(mark(X1:S),X2:S) -> and(X1:S,X2:S)
 and(X1:S,active(X2:S)) -> and(X1:S,X2:S)
 and(X1:S,mark(X2:S)) -> and(X1:S,X2:S)
 isNePal(active(X:S)) -> isNePal(X:S)
 isNePal(mark(X:S)) -> isNePal(X:S)
 mark(__(X1:S,X2:S)) -> active(__(mark(X1:S),mark(X2:S)))
 mark(and(X1:S,X2:S)) -> active(and(mark(X1:S),X2:S))
 mark(isNePal(X:S)) -> active(isNePal(mark(X:S)))
 mark(nil) -> active(nil)
 mark(tt) -> active(tt)
->Interpretation type:
 Linear
->Coefficients:
 Natural Numbers
->Dimension:
 1
->Bound:
 2
->Interpretation:
 
[__](X1,X2) = 2.X1 + X2 + 2
[active](X) = X
[and](X1,X2) = 2.X1 + 2.X2
[isNePal](X) = 2.X + 1
[mark](X) = X
[fSNonEmpty] = 0
[nil] = 2
[tt] = 2
[__#](X1,X2) = 0
[ACTIVE](X) = 2.X + 1
[AND](X1,X2) = 0
[ISNEPAL](X) = 0
[MARK](X) = 2.X + 1

Problem 1.4: 

SCC Processor:
-> Pairs:
 ACTIVE(and(tt,X:S)) -> MARK(X:S)
 MARK(__(X1:S,X2:S)) -> ACTIVE(__(mark(X1:S),mark(X2:S)))
 MARK(__(X1:S,X2:S)) -> MARK(X1:S)
 MARK(__(X1:S,X2:S)) -> MARK(X2:S)
 MARK(and(X1:S,X2:S)) -> ACTIVE(and(mark(X1:S),X2:S))
 MARK(and(X1:S,X2:S)) -> MARK(X1:S)
 MARK(isNePal(X:S)) -> ACTIVE(isNePal(mark(X:S)))
 MARK(isNePal(X:S)) -> MARK(X:S)
-> Rules:
 __(active(X1:S),X2:S) -> __(X1:S,X2:S)
 __(mark(X1:S),X2:S) -> __(X1:S,X2:S)
 __(X1:S,active(X2:S)) -> __(X1:S,X2:S)
 __(X1:S,mark(X2:S)) -> __(X1:S,X2:S)
 active(__(__(X:S,Y:S),Z:S)) -> mark(__(X:S,__(Y:S,Z:S)))
 active(__(nil,X:S)) -> mark(X:S)
 active(__(X:S,nil)) -> mark(X:S)
 active(and(tt,X:S)) -> mark(X:S)
 active(isNePal(__(I:S,__(P:S,I:S)))) -> mark(tt)
 and(active(X1:S),X2:S) -> and(X1:S,X2:S)
 and(mark(X1:S),X2:S) -> and(X1:S,X2:S)
 and(X1:S,active(X2:S)) -> and(X1:S,X2:S)
 and(X1:S,mark(X2:S)) -> and(X1:S,X2:S)
 isNePal(active(X:S)) -> isNePal(X:S)
 isNePal(mark(X:S)) -> isNePal(X:S)
 mark(__(X1:S,X2:S)) -> active(__(mark(X1:S),mark(X2:S)))
 mark(and(X1:S,X2:S)) -> active(and(mark(X1:S),X2:S))
 mark(isNePal(X:S)) -> active(isNePal(mark(X:S)))
 mark(nil) -> active(nil)
 mark(tt) -> active(tt)
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 ACTIVE(and(tt,X:S)) -> MARK(X:S)
 MARK(__(X1:S,X2:S)) -> ACTIVE(__(mark(X1:S),mark(X2:S)))
 MARK(__(X1:S,X2:S)) -> MARK(X1:S)
 MARK(__(X1:S,X2:S)) -> MARK(X2:S)
 MARK(and(X1:S,X2:S)) -> ACTIVE(and(mark(X1:S),X2:S))
 MARK(and(X1:S,X2:S)) -> MARK(X1:S)
 MARK(isNePal(X:S)) -> ACTIVE(isNePal(mark(X:S)))
 MARK(isNePal(X:S)) -> MARK(X:S)
->->-> Rules:
 __(active(X1:S),X2:S) -> __(X1:S,X2:S)
 __(mark(X1:S),X2:S) -> __(X1:S,X2:S)
 __(X1:S,active(X2:S)) -> __(X1:S,X2:S)
 __(X1:S,mark(X2:S)) -> __(X1:S,X2:S)
 active(__(__(X:S,Y:S),Z:S)) -> mark(__(X:S,__(Y:S,Z:S)))
 active(__(nil,X:S)) -> mark(X:S)
 active(__(X:S,nil)) -> mark(X:S)
 active(and(tt,X:S)) -> mark(X:S)
 active(isNePal(__(I:S,__(P:S,I:S)))) -> mark(tt)
 and(active(X1:S),X2:S) -> and(X1:S,X2:S)
 and(mark(X1:S),X2:S) -> and(X1:S,X2:S)
 and(X1:S,active(X2:S)) -> and(X1:S,X2:S)
 and(X1:S,mark(X2:S)) -> and(X1:S,X2:S)
 isNePal(active(X:S)) -> isNePal(X:S)
 isNePal(mark(X:S)) -> isNePal(X:S)
 mark(__(X1:S,X2:S)) -> active(__(mark(X1:S),mark(X2:S)))
 mark(and(X1:S,X2:S)) -> active(and(mark(X1:S),X2:S))
 mark(isNePal(X:S)) -> active(isNePal(mark(X:S)))
 mark(nil) -> active(nil)
 mark(tt) -> active(tt)

Problem 1.4: 

Reduction Pairs Processor:
-> Pairs:
 ACTIVE(and(tt,X:S)) -> MARK(X:S)
 MARK(__(X1:S,X2:S)) -> ACTIVE(__(mark(X1:S),mark(X2:S)))
 MARK(__(X1:S,X2:S)) -> MARK(X1:S)
 MARK(__(X1:S,X2:S)) -> MARK(X2:S)
 MARK(and(X1:S,X2:S)) -> ACTIVE(and(mark(X1:S),X2:S))
 MARK(and(X1:S,X2:S)) -> MARK(X1:S)
 MARK(isNePal(X:S)) -> ACTIVE(isNePal(mark(X:S)))
 MARK(isNePal(X:S)) -> MARK(X:S)
-> Rules:
 __(active(X1:S),X2:S) -> __(X1:S,X2:S)
 __(mark(X1:S),X2:S) -> __(X1:S,X2:S)
 __(X1:S,active(X2:S)) -> __(X1:S,X2:S)
 __(X1:S,mark(X2:S)) -> __(X1:S,X2:S)
 active(__(__(X:S,Y:S),Z:S)) -> mark(__(X:S,__(Y:S,Z:S)))
 active(__(nil,X:S)) -> mark(X:S)
 active(__(X:S,nil)) -> mark(X:S)
 active(and(tt,X:S)) -> mark(X:S)
 active(isNePal(__(I:S,__(P:S,I:S)))) -> mark(tt)
 and(active(X1:S),X2:S) -> and(X1:S,X2:S)
 and(mark(X1:S),X2:S) -> and(X1:S,X2:S)
 and(X1:S,active(X2:S)) -> and(X1:S,X2:S)
 and(X1:S,mark(X2:S)) -> and(X1:S,X2:S)
 isNePal(active(X:S)) -> isNePal(X:S)
 isNePal(mark(X:S)) -> isNePal(X:S)
 mark(__(X1:S,X2:S)) -> active(__(mark(X1:S),mark(X2:S)))
 mark(and(X1:S,X2:S)) -> active(and(mark(X1:S),X2:S))
 mark(isNePal(X:S)) -> active(isNePal(mark(X:S)))
 mark(nil) -> active(nil)
 mark(tt) -> active(tt)
-> Usable rules:
 __(active(X1:S),X2:S) -> __(X1:S,X2:S)
 __(mark(X1:S),X2:S) -> __(X1:S,X2:S)
 __(X1:S,active(X2:S)) -> __(X1:S,X2:S)
 __(X1:S,mark(X2:S)) -> __(X1:S,X2:S)
 active(__(__(X:S,Y:S),Z:S)) -> mark(__(X:S,__(Y:S,Z:S)))
 active(__(nil,X:S)) -> mark(X:S)
 active(__(X:S,nil)) -> mark(X:S)
 active(and(tt,X:S)) -> mark(X:S)
 active(isNePal(__(I:S,__(P:S,I:S)))) -> mark(tt)
 and(active(X1:S),X2:S) -> and(X1:S,X2:S)
 and(mark(X1:S),X2:S) -> and(X1:S,X2:S)
 and(X1:S,active(X2:S)) -> and(X1:S,X2:S)
 and(X1:S,mark(X2:S)) -> and(X1:S,X2:S)
 isNePal(active(X:S)) -> isNePal(X:S)
 isNePal(mark(X:S)) -> isNePal(X:S)
 mark(__(X1:S,X2:S)) -> active(__(mark(X1:S),mark(X2:S)))
 mark(and(X1:S,X2:S)) -> active(and(mark(X1:S),X2:S))
 mark(isNePal(X:S)) -> active(isNePal(mark(X:S)))
 mark(nil) -> active(nil)
 mark(tt) -> active(tt)
->Interpretation type:
 Linear
->Coefficients:
 Natural Numbers
->Dimension:
 1
->Bound:
 2
->Interpretation:
 
[__](X1,X2) = 2.X1 + X2 + 2
[active](X) = X
[and](X1,X2) = 2.X1 + 2.X2 + 2
[isNePal](X) = X + 2
[mark](X) = X
[fSNonEmpty] = 0
[nil] = 2
[tt] = 2
[__#](X1,X2) = 0
[ACTIVE](X) = X + 1
[AND](X1,X2) = 0
[ISNEPAL](X) = 0
[MARK](X) = 2.X

Problem 1.4: 

SCC Processor:
-> Pairs:
 MARK(__(X1:S,X2:S)) -> ACTIVE(__(mark(X1:S),mark(X2:S)))
 MARK(__(X1:S,X2:S)) -> MARK(X1:S)
 MARK(__(X1:S,X2:S)) -> MARK(X2:S)
 MARK(and(X1:S,X2:S)) -> ACTIVE(and(mark(X1:S),X2:S))
 MARK(and(X1:S,X2:S)) -> MARK(X1:S)
 MARK(isNePal(X:S)) -> ACTIVE(isNePal(mark(X:S)))
 MARK(isNePal(X:S)) -> MARK(X:S)
-> Rules:
 __(active(X1:S),X2:S) -> __(X1:S,X2:S)
 __(mark(X1:S),X2:S) -> __(X1:S,X2:S)
 __(X1:S,active(X2:S)) -> __(X1:S,X2:S)
 __(X1:S,mark(X2:S)) -> __(X1:S,X2:S)
 active(__(__(X:S,Y:S),Z:S)) -> mark(__(X:S,__(Y:S,Z:S)))
 active(__(nil,X:S)) -> mark(X:S)
 active(__(X:S,nil)) -> mark(X:S)
 active(and(tt,X:S)) -> mark(X:S)
 active(isNePal(__(I:S,__(P:S,I:S)))) -> mark(tt)
 and(active(X1:S),X2:S) -> and(X1:S,X2:S)
 and(mark(X1:S),X2:S) -> and(X1:S,X2:S)
 and(X1:S,active(X2:S)) -> and(X1:S,X2:S)
 and(X1:S,mark(X2:S)) -> and(X1:S,X2:S)
 isNePal(active(X:S)) -> isNePal(X:S)
 isNePal(mark(X:S)) -> isNePal(X:S)
 mark(__(X1:S,X2:S)) -> active(__(mark(X1:S),mark(X2:S)))
 mark(and(X1:S,X2:S)) -> active(and(mark(X1:S),X2:S))
 mark(isNePal(X:S)) -> active(isNePal(mark(X:S)))
 mark(nil) -> active(nil)
 mark(tt) -> active(tt)
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 MARK(__(X1:S,X2:S)) -> MARK(X1:S)
 MARK(__(X1:S,X2:S)) -> MARK(X2:S)
 MARK(and(X1:S,X2:S)) -> MARK(X1:S)
 MARK(isNePal(X:S)) -> MARK(X:S)
->->-> Rules:
 __(active(X1:S),X2:S) -> __(X1:S,X2:S)
 __(mark(X1:S),X2:S) -> __(X1:S,X2:S)
 __(X1:S,active(X2:S)) -> __(X1:S,X2:S)
 __(X1:S,mark(X2:S)) -> __(X1:S,X2:S)
 active(__(__(X:S,Y:S),Z:S)) -> mark(__(X:S,__(Y:S,Z:S)))
 active(__(nil,X:S)) -> mark(X:S)
 active(__(X:S,nil)) -> mark(X:S)
 active(and(tt,X:S)) -> mark(X:S)
 active(isNePal(__(I:S,__(P:S,I:S)))) -> mark(tt)
 and(active(X1:S),X2:S) -> and(X1:S,X2:S)
 and(mark(X1:S),X2:S) -> and(X1:S,X2:S)
 and(X1:S,active(X2:S)) -> and(X1:S,X2:S)
 and(X1:S,mark(X2:S)) -> and(X1:S,X2:S)
 isNePal(active(X:S)) -> isNePal(X:S)
 isNePal(mark(X:S)) -> isNePal(X:S)
 mark(__(X1:S,X2:S)) -> active(__(mark(X1:S),mark(X2:S)))
 mark(and(X1:S,X2:S)) -> active(and(mark(X1:S),X2:S))
 mark(isNePal(X:S)) -> active(isNePal(mark(X:S)))
 mark(nil) -> active(nil)
 mark(tt) -> active(tt)

Problem 1.4: 

Subterm Processor:
-> Pairs:
 MARK(__(X1:S,X2:S)) -> MARK(X1:S)
 MARK(__(X1:S,X2:S)) -> MARK(X2:S)
 MARK(and(X1:S,X2:S)) -> MARK(X1:S)
 MARK(isNePal(X:S)) -> MARK(X:S)
-> Rules:
 __(active(X1:S),X2:S) -> __(X1:S,X2:S)
 __(mark(X1:S),X2:S) -> __(X1:S,X2:S)
 __(X1:S,active(X2:S)) -> __(X1:S,X2:S)
 __(X1:S,mark(X2:S)) -> __(X1:S,X2:S)
 active(__(__(X:S,Y:S),Z:S)) -> mark(__(X:S,__(Y:S,Z:S)))
 active(__(nil,X:S)) -> mark(X:S)
 active(__(X:S,nil)) -> mark(X:S)
 active(and(tt,X:S)) -> mark(X:S)
 active(isNePal(__(I:S,__(P:S,I:S)))) -> mark(tt)
 and(active(X1:S),X2:S) -> and(X1:S,X2:S)
 and(mark(X1:S),X2:S) -> and(X1:S,X2:S)
 and(X1:S,active(X2:S)) -> and(X1:S,X2:S)
 and(X1:S,mark(X2:S)) -> and(X1:S,X2:S)
 isNePal(active(X:S)) -> isNePal(X:S)
 isNePal(mark(X:S)) -> isNePal(X:S)
 mark(__(X1:S,X2:S)) -> active(__(mark(X1:S),mark(X2:S)))
 mark(and(X1:S,X2:S)) -> active(and(mark(X1:S),X2:S))
 mark(isNePal(X:S)) -> active(isNePal(mark(X:S)))
 mark(nil) -> active(nil)
 mark(tt) -> active(tt)
->Projection:
 pi(MARK) = 1

Problem 1.4: 

SCC Processor:
-> Pairs:
 Empty
-> Rules:
 __(active(X1:S),X2:S) -> __(X1:S,X2:S)
 __(mark(X1:S),X2:S) -> __(X1:S,X2:S)
 __(X1:S,active(X2:S)) -> __(X1:S,X2:S)
 __(X1:S,mark(X2:S)) -> __(X1:S,X2:S)
 active(__(__(X:S,Y:S),Z:S)) -> mark(__(X:S,__(Y:S,Z:S)))
 active(__(nil,X:S)) -> mark(X:S)
 active(__(X:S,nil)) -> mark(X:S)
 active(and(tt,X:S)) -> mark(X:S)
 active(isNePal(__(I:S,__(P:S,I:S)))) -> mark(tt)
 and(active(X1:S),X2:S) -> and(X1:S,X2:S)
 and(mark(X1:S),X2:S) -> and(X1:S,X2:S)
 and(X1:S,active(X2:S)) -> and(X1:S,X2:S)
 and(X1:S,mark(X2:S)) -> and(X1:S,X2:S)
 isNePal(active(X:S)) -> isNePal(X:S)
 isNePal(mark(X:S)) -> isNePal(X:S)
 mark(__(X1:S,X2:S)) -> active(__(mark(X1:S),mark(X2:S)))
 mark(and(X1:S,X2:S)) -> active(and(mark(X1:S),X2:S))
 mark(isNePal(X:S)) -> active(isNePal(mark(X:S)))
 mark(nil) -> active(nil)
 mark(tt) -> active(tt)
->Strongly Connected Components:
 There is no strongly connected component

The problem is finite.