60.33/60.47	NO
60.33/60.47	
60.33/60.47	Problem 1: 
60.33/60.47	
60.33/60.47	(VAR v_NonEmpty:S x:S y:S)
60.33/60.47	(RULES
60.33/60.47	a -> d
60.33/60.47	b -> d
60.33/60.47	e -> e
60.33/60.47	f(x:S,y:S) -> g(x:S) | a ->* d
60.33/60.47	f(x:S,y:S) -> h(x:S) | b ->* d
60.33/60.47	g(s(x:S)) -> x:S
60.33/60.47	h(s(x:S)) -> x:S
60.33/60.47	)
60.33/60.47	
60.33/60.47	Problem 1: 
60.33/60.47	Valid CTRS Processor:
60.33/60.47	-> Rules:
60.33/60.47	 a -> d
60.33/60.47	 b -> d
60.33/60.47	 e -> e
60.33/60.47	 f(x:S,y:S) -> g(x:S) | a ->* d
60.33/60.47	 f(x:S,y:S) -> h(x:S) | b ->* d
60.33/60.47	 g(s(x:S)) -> x:S
60.33/60.47	 h(s(x:S)) -> x:S
60.33/60.47	-> The system is a deterministic 3-CTRS.
60.33/60.47	
60.33/60.47	Problem 1: 
60.33/60.47	
60.33/60.47	Dependency Pairs Processor:
60.33/60.47	
60.33/60.47	Conditional Termination Problem 1:
60.33/60.47	-> Pairs:
60.33/60.47	 E -> E
60.33/60.47	 F(x:S,y:S) -> G(x:S) | a ->* d
60.33/60.47	 F(x:S,y:S) -> H(x:S) | b ->* d
60.33/60.47	-> QPairs:
60.33/60.47	 Empty
60.33/60.47	-> Rules:
60.33/60.47	 a -> d
60.33/60.47	 b -> d
60.33/60.47	 e -> e
60.33/60.47	 f(x:S,y:S) -> g(x:S) | a ->* d
60.33/60.47	 f(x:S,y:S) -> h(x:S) | b ->* d
60.33/60.47	 g(s(x:S)) -> x:S
60.33/60.47	 h(s(x:S)) -> x:S
60.33/60.47	
60.33/60.47	Conditional Termination Problem 2:
60.33/60.47	-> Pairs:
60.33/60.47	 F(x:S,y:S) -> A
60.33/60.47	 F(x:S,y:S) -> B
60.33/60.47	-> QPairs:
60.33/60.47	 Empty
60.33/60.47	-> Rules:
60.33/60.47	 a -> d
60.33/60.47	 b -> d
60.33/60.47	 e -> e
60.33/60.47	 f(x:S,y:S) -> g(x:S) | a ->* d
60.33/60.47	 f(x:S,y:S) -> h(x:S) | b ->* d
60.33/60.47	 g(s(x:S)) -> x:S
60.33/60.47	 h(s(x:S)) -> x:S
60.33/60.47	
60.33/60.47	Problem 1: 
60.33/60.47	
60.33/60.47	SCC Processor:
60.33/60.47	-> Pairs:
60.33/60.47	 E -> E
60.33/60.47	 F(x:S,y:S) -> G(x:S) | a ->* d
60.33/60.47	 F(x:S,y:S) -> H(x:S) | b ->* d
60.33/60.47	-> QPairs:
60.33/60.47	 Empty
60.33/60.47	-> Rules:
60.33/60.47	 a -> d
60.33/60.47	 b -> d
60.33/60.47	 e -> e
60.33/60.47	 f(x:S,y:S) -> g(x:S) | a ->* d
60.33/60.47	 f(x:S,y:S) -> h(x:S) | b ->* d
60.33/60.47	 g(s(x:S)) -> x:S
60.33/60.47	 h(s(x:S)) -> x:S
60.33/60.47	->Strongly Connected Components:
60.33/60.47	->->Cycle:
60.33/60.47	->->-> Pairs:
60.33/60.47	 E -> E
60.33/60.47	-> QPairs:
60.33/60.47	 Empty
60.33/60.47	->->-> Rules:
60.33/60.47	 a -> d
60.33/60.47	 b -> d
60.33/60.47	 e -> e
60.33/60.47	 f(x:S,y:S) -> g(x:S) | a ->* d
60.33/60.47	 f(x:S,y:S) -> h(x:S) | b ->* d
60.33/60.47	 g(s(x:S)) -> x:S
60.33/60.47	 h(s(x:S)) -> x:S
60.33/60.47	
60.33/60.47	Problem 1: 
60.33/60.47	
60.33/60.47	Infinite Processor:
60.33/60.47	-> Pairs:
60.33/60.47	 E -> E
60.33/60.47	-> QPairs:
60.33/60.47	 Empty
60.33/60.47	-> Rules:
60.33/60.47	 a -> d
60.33/60.47	 b -> d
60.33/60.47	 e -> e
60.33/60.47	 f(x:S,y:S) -> g(x:S) | a ->* d
60.33/60.47	 f(x:S,y:S) -> h(x:S) | b ->* d
60.33/60.47	 g(s(x:S)) -> x:S
60.33/60.47	 h(s(x:S)) -> x:S
60.33/60.47	-> Pairs in cycle:
60.33/60.47	 E -> E
60.33/60.47	
60.33/60.47	The problem is infinite.
60.33/60.47	EOF