120.23/120.39	NO
120.23/120.39	
120.23/120.39	Problem 1: 
120.23/120.39	
120.23/120.39	(VAR v_NonEmpty:S x:S y:S)
120.23/120.39	(RULES
120.23/120.39	b -> f(a)
120.23/120.39	f(x:S) -> y:S | g(x:S) ->* c(y:S)
120.23/120.39	g(a) -> c(b)
120.23/120.39	)
120.23/120.39	
120.23/120.39	Problem 1: 
120.23/120.39	Valid CTRS Processor:
120.23/120.39	-> Rules:
120.23/120.39	 b -> f(a)
120.23/120.39	 f(x:S) -> y:S | g(x:S) ->* c(y:S)
120.23/120.39	 g(a) -> c(b)
120.23/120.39	-> The system is a deterministic 3-CTRS.
120.23/120.39	
120.23/120.39	Problem 1: 
120.23/120.39	
120.23/120.39	Dependency Pairs Processor:
120.23/120.39	
120.23/120.39	Conditional Termination Problem 1:
120.23/120.39	-> Pairs:
120.23/120.39	 B -> F(a)
120.23/120.39	 G(a) -> B
120.23/120.39	-> QPairs:
120.23/120.39	 Empty
120.23/120.39	-> Rules:
120.23/120.39	 b -> f(a)
120.23/120.39	 f(x:S) -> y:S | g(x:S) ->* c(y:S)
120.23/120.39	 g(a) -> c(b)
120.23/120.39	
120.23/120.39	Conditional Termination Problem 2:
120.23/120.39	-> Pairs:
120.23/120.39	 F(x:S) -> G(x:S)
120.23/120.39	-> QPairs:
120.23/120.39	 B -> F(a)
120.23/120.39	 G(a) -> B
120.23/120.39	-> Rules:
120.23/120.39	 b -> f(a)
120.23/120.39	 f(x:S) -> y:S | g(x:S) ->* c(y:S)
120.23/120.39	 g(a) -> c(b)
120.23/120.39	
120.23/120.39	Problem 1: 
120.23/120.39	
120.23/120.39	SCC Processor:
120.23/120.39	-> Pairs:
120.23/120.39	 F(x:S) -> G(x:S)
120.23/120.39	-> QPairs:
120.23/120.39	 B -> F(a)
120.23/120.39	 G(a) -> B
120.23/120.39	-> Rules:
120.23/120.39	 b -> f(a)
120.23/120.39	 f(x:S) -> y:S | g(x:S) ->* c(y:S)
120.23/120.39	 g(a) -> c(b)
120.23/120.39	->Strongly Connected Components:
120.23/120.39	->->Cycle:
120.23/120.39	->->-> Pairs:
120.23/120.39	 F(x:S) -> G(x:S)
120.23/120.39	-> QPairs:
120.23/120.39	 B -> F(a)
120.23/120.39	 G(a) -> B
120.23/120.39	->->-> Rules:
120.23/120.39	 b -> f(a)
120.23/120.39	 f(x:S) -> y:S | g(x:S) ->* c(y:S)
120.23/120.39	 g(a) -> c(b)
120.23/120.39	
120.23/120.39	Problem 1: 
120.23/120.39	
120.23/120.39	Conditional Narrowing using Q Processor:
120.23/120.39	-> Pairs:
120.23/120.39	 F(x:S) -> G(x:S)
120.23/120.39	-> QPairs:
120.23/120.39	 B -> F(a)
120.23/120.39	 G(a) -> B
120.23/120.39	-> Rules:
120.23/120.39	 b -> f(a)
120.23/120.39	 f(x:S) -> y:S | g(x:S) ->* c(y:S)
120.23/120.39	 g(a) -> c(b)
120.23/120.39	->Narrowed Pairs:
120.23/120.39	->->Original Pair:
120.23/120.39	 F(x:S) -> G(x:S)
120.23/120.39	->-> Narrowed pairs:
120.23/120.39	 F(a) -> B
120.23/120.39	
120.23/120.39	Problem 1: 
120.23/120.39	
120.23/120.39	SCC Processor:
120.23/120.39	-> Pairs:
120.23/120.39	 F(a) -> B
120.23/120.39	-> QPairs:
120.23/120.39	 B -> F(a)
120.23/120.39	 G(a) -> B
120.23/120.39	-> Rules:
120.23/120.39	 b -> f(a)
120.23/120.39	 f(x:S) -> y:S | g(x:S) ->* c(y:S)
120.23/120.39	 g(a) -> c(b)
120.23/120.39	->Strongly Connected Components:
120.23/120.39	->->Cycle:
120.23/120.39	->->-> Pairs:
120.23/120.39	 F(a) -> B
120.23/120.39	-> QPairs:
120.23/120.39	 B -> F(a)
120.23/120.39	->->-> Rules:
120.23/120.39	 b -> f(a)
120.23/120.39	 f(x:S) -> y:S | g(x:S) ->* c(y:S)
120.23/120.39	 g(a) -> c(b)
120.23/120.39	
120.23/120.39	Problem 1: 
120.23/120.39	
120.23/120.39	Conditional Narrowing using Q Processor:
120.23/120.39	-> Pairs:
120.23/120.39	 F(a) -> B
120.23/120.39	-> QPairs:
120.23/120.39	 B -> F(a)
120.23/120.39	-> Rules:
120.23/120.39	 b -> f(a)
120.23/120.39	 f(x:S) -> y:S | g(x:S) ->* c(y:S)
120.23/120.39	 g(a) -> c(b)
120.23/120.39	->Narrowed Pairs:
120.23/120.39	->->Original Pair:
120.23/120.39	 F(a) -> B
120.23/120.39	->-> Narrowed pairs:
120.23/120.39	 F(a) -> F(a)
120.23/120.39	
120.23/120.39	Problem 1: 
120.23/120.39	
120.23/120.39	Infinite Processor:
120.23/120.39	-> Pairs:
120.23/120.39	 F(a) -> F(a)
120.23/120.39	-> QPairs:
120.23/120.39	 B -> F(a)
120.23/120.39	-> Rules:
120.23/120.39	 b -> f(a)
120.23/120.39	 f(x:S) -> y:S | g(x:S) ->* c(y:S)
120.23/120.39	 g(a) -> c(b)
120.23/120.39	-> Pairs in cycle:
120.23/120.39	 F(a) -> F(a)
120.23/120.39	
120.23/120.39	The problem is infinite.
120.23/120.39	EOF