0.00/0.01	YES
0.00/0.01	
0.00/0.01	Problem 1: 
0.00/0.01	
0.00/0.01	(VAR v_NonEmpty:S x:S y:S)
0.00/0.01	(RULES
0.00/0.01	f(g(x:S),g(y:S)) -> f(p(f(g(x:S),s(y:S))),g(s(p(x:S))))
0.00/0.01	g(s(p(x:S))) -> p(x:S)
0.00/0.01	p(0) -> g(0)
0.00/0.01	) 
0.00/0.01	(STRATEGY INNERMOST)
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	 F(g(x:S),g(y:S)) -> F(g(x:S),s(y:S))
0.00/0.01	 F(g(x:S),g(y:S)) -> F(p(f(g(x:S),s(y:S))),g(s(p(x:S))))
0.00/0.01	 F(g(x:S),g(y:S)) -> G(s(p(x:S)))
0.00/0.01	 F(g(x:S),g(y:S)) -> P(f(g(x:S),s(y:S)))
0.00/0.01	 F(g(x:S),g(y:S)) -> P(x:S)
0.00/0.01	-> Rules:
0.00/0.01	 f(g(x:S),g(y:S)) -> f(p(f(g(x:S),s(y:S))),g(s(p(x:S))))
0.00/0.01	 g(s(p(x:S))) -> p(x:S)
0.00/0.01	 p(0) -> g(0)
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	 F(g(x:S),g(y:S)) -> F(g(x:S),s(y:S))
0.00/0.01	 F(g(x:S),g(y:S)) -> F(p(f(g(x:S),s(y:S))),g(s(p(x:S))))
0.00/0.01	 F(g(x:S),g(y:S)) -> G(s(p(x:S)))
0.00/0.01	 F(g(x:S),g(y:S)) -> P(f(g(x:S),s(y:S)))
0.00/0.01	 F(g(x:S),g(y:S)) -> P(x:S)
0.00/0.01	-> Rules:
0.00/0.01	 f(g(x:S),g(y:S)) -> f(p(f(g(x:S),s(y:S))),g(s(p(x:S))))
0.00/0.01	 g(s(p(x:S))) -> p(x:S)
0.00/0.01	 p(0) -> g(0)
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