0.00/0.01	YES
0.00/0.01	
0.00/0.01	Problem 1: 
0.00/0.01	
0.00/0.01	(VAR L X XS Y YS)
0.00/0.01	(STRATEGY CONTEXTSENSITIVE
0.00/0.01	(app 1 2)
0.00/0.01	(from 1)
0.00/0.01	(prefix 1)
0.00/0.01	(zWadr 1 2)
0.00/0.01	(cons 1)
0.00/0.01	(nil)
0.00/0.01	(s 1)
0.00/0.01	)
0.00/0.01	(RULES
0.00/0.01	app(cons(X,XS),YS) -> cons(X,app(XS,YS))
0.00/0.01	app(nil,YS) -> YS
0.00/0.01	from(X) -> cons(X,from(s(X)))
0.00/0.01	prefix(L) -> cons(nil,zWadr(L,prefix(L)))
0.00/0.01	zWadr(cons(X,XS),cons(Y,YS)) -> cons(app(Y,cons(X,nil)),zWadr(XS,YS))
0.00/0.01	zWadr(nil,YS) -> nil
0.00/0.01	zWadr(XS,nil) -> nil
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	 ZWADR(cons(X,XS),cons(Y,YS)) -> APP(Y,cons(X,nil))
0.00/0.01	-> Rules:
0.00/0.01	 app(cons(X,XS),YS) -> cons(X,app(XS,YS))
0.00/0.01	 app(nil,YS) -> YS
0.00/0.01	 from(X) -> cons(X,from(s(X)))
0.00/0.01	 prefix(L) -> cons(nil,zWadr(L,prefix(L)))
0.00/0.01	 zWadr(cons(X,XS),cons(Y,YS)) -> cons(app(Y,cons(X,nil)),zWadr(XS,YS))
0.00/0.01	 zWadr(nil,YS) -> nil
0.00/0.01	 zWadr(XS,nil) -> nil
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	 ZWADR(cons(X,XS),cons(Y,YS)) -> APP(Y,cons(X,nil))
0.00/0.01	-> Rules:
0.00/0.01	 app(cons(X,XS),YS) -> cons(X,app(XS,YS))
0.00/0.01	 app(nil,YS) -> YS
0.00/0.01	 from(X) -> cons(X,from(s(X)))
0.00/0.01	 prefix(L) -> cons(nil,zWadr(L,prefix(L)))
0.00/0.01	 zWadr(cons(X,XS),cons(Y,YS)) -> cons(app(Y,cons(X,nil)),zWadr(XS,YS))
0.00/0.01	 zWadr(nil,YS) -> nil
0.00/0.01	 zWadr(XS,nil) -> nil
0.00/0.01	-> Unhiding rules:
0.00/0.01	 Empty
0.00/0.01	->Strongly Connected Components:
0.00/0.01	 There is no strongly connected component
0.00/0.01	
0.00/0.01	The problem is finite.
0.00/0.01	EOF