0.00/0.01	YES
0.00/0.01	
0.00/0.01	Problem 1: 
0.00/0.01	
0.00/0.01	(VAR I P X Y Z)
0.00/0.01	(STRATEGY CONTEXTSENSITIVE
0.00/0.01	(U11 1)
0.00/0.01	(U12 1)
0.00/0.01	(__ 1 2)
0.00/0.01	(isNePal 1)
0.00/0.01	(nil)
0.00/0.01	(tt)
0.00/0.01	)
0.00/0.01	(RULES
0.00/0.01	U11(tt) -> U12(tt)
0.00/0.01	U12(tt) -> tt
0.00/0.01	__(__(X,Y),Z) -> __(X,__(Y,Z))
0.00/0.01	__(nil,X) -> X
0.00/0.01	__(X,nil) -> X
0.00/0.01	isNePal(__(I,__(P,I))) -> U11(tt)
0.00/0.01	)
0.00/0.01	
0.00/0.01	Problem 1: 
0.00/0.01	
0.00/0.01	Dependency Pairs Processor:
0.00/0.01	-> Pairs:
0.00/0.01	 U11#(tt) -> U12#(tt)
0.00/0.01	 __#(__(X,Y),Z) -> __#(X,__(Y,Z))
0.00/0.01	 __#(__(X,Y),Z) -> __#(Y,Z)
0.00/0.01	 ISNEPAL(__(I,__(P,I))) -> U11#(tt)
0.00/0.01	-> Rules:
0.00/0.01	 U11(tt) -> U12(tt)
0.00/0.01	 U12(tt) -> tt
0.00/0.01	 __(__(X,Y),Z) -> __(X,__(Y,Z))
0.00/0.01	 __(nil,X) -> X
0.00/0.01	 __(X,nil) -> X
0.00/0.01	 isNePal(__(I,__(P,I))) -> U11(tt)
0.00/0.01	-> Unhiding Rules:
0.00/0.01	 Empty
0.00/0.01	
0.00/0.01	Problem 1: 
0.00/0.01	
0.00/0.01	SCC Processor:
0.00/0.01	-> Pairs:
0.00/0.01	 U11#(tt) -> U12#(tt)
0.00/0.01	 __#(__(X,Y),Z) -> __#(X,__(Y,Z))
0.00/0.01	 __#(__(X,Y),Z) -> __#(Y,Z)
0.00/0.01	 ISNEPAL(__(I,__(P,I))) -> U11#(tt)
0.00/0.01	-> Rules:
0.00/0.01	 U11(tt) -> U12(tt)
0.00/0.01	 U12(tt) -> tt
0.00/0.01	 __(__(X,Y),Z) -> __(X,__(Y,Z))
0.00/0.01	 __(nil,X) -> X
0.00/0.01	 __(X,nil) -> X
0.00/0.01	 isNePal(__(I,__(P,I))) -> U11(tt)
0.00/0.01	-> Unhiding rules:
0.00/0.01	 Empty
0.00/0.01	->Strongly Connected Components:
0.00/0.01	->->Cycle:
0.00/0.01	->->-> Pairs:
0.00/0.01	 __#(__(X,Y),Z) -> __#(X,__(Y,Z))
0.00/0.01	 __#(__(X,Y),Z) -> __#(Y,Z)
0.00/0.01	->->-> Rules:
0.00/0.01	 U11(tt) -> U12(tt)
0.00/0.01	 U12(tt) -> tt
0.00/0.01	 __(__(X,Y),Z) -> __(X,__(Y,Z))
0.00/0.01	 __(nil,X) -> X
0.00/0.01	 __(X,nil) -> X
0.00/0.01	 isNePal(__(I,__(P,I))) -> U11(tt)
0.00/0.01	->->-> Unhiding rules:
0.00/0.01	 Empty
0.00/0.01	
0.00/0.01	Problem 1: 
0.00/0.01	
0.00/0.01	SubNColl Processor:
0.00/0.01	-> Pairs:
0.00/0.01	 __#(__(X,Y),Z) -> __#(X,__(Y,Z))
0.00/0.01	 __#(__(X,Y),Z) -> __#(Y,Z)
0.00/0.01	-> Rules:
0.00/0.01	 U11(tt) -> U12(tt)
0.00/0.01	 U12(tt) -> tt
0.00/0.01	 __(__(X,Y),Z) -> __(X,__(Y,Z))
0.00/0.01	 __(nil,X) -> X
0.00/0.01	 __(X,nil) -> X
0.00/0.01	 isNePal(__(I,__(P,I))) -> U11(tt)
0.00/0.01	-> Unhiding rules:
0.00/0.01	 Empty
0.00/0.01	->Projection:
0.00/0.01	 pi(__#) = 1
0.00/0.01	
0.00/0.01	Problem 1: 
0.00/0.01	
0.00/0.01	Basic Processor:
0.00/0.01	-> Pairs:
0.00/0.01	 Empty
0.00/0.01	-> Rules:
0.00/0.01	 U11(tt) -> U12(tt)
0.00/0.01	 U12(tt) -> tt
0.00/0.01	 __(__(X,Y),Z) -> __(X,__(Y,Z))
0.00/0.01	 __(nil,X) -> X
0.00/0.01	 __(X,nil) -> X
0.00/0.01	 isNePal(__(I,__(P,I))) -> U11(tt)
0.00/0.01	-> Unhiding rules:
0.00/0.01	 Empty
0.00/0.01	-> Result:
0.00/0.01	 Set P is empty
0.00/0.01	
0.00/0.01	The problem is finite.
0.00/0.01	EOF