0.001/0.001	YES
0.001/0.001	
0.001/0.001	Problem 1:
0.001/0.001	
0.001/0.001	
0.001/0.001	:::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::
0.001/0.001	Confluence Problem:
0.001/0.001	(VAR vNonEmpty:S)
0.001/0.001	(STRATEGY CONTEXTSENSITIVE
0.001/0.001	(f 1)
0.001/0.001	(p 1)
0.001/0.001	(0)
0.001/0.001	(cons 1)
0.001/0.001	(fSNonEmpty)
0.001/0.001	(s 1)
0.001/0.001	)
0.001/0.001	(RULES
0.001/0.001	f(0) -> cons(0,f(s(0)))
0.001/0.001	f(s(0)) -> f(p(s(0)))
0.001/0.001	p(s(0)) -> 0
0.001/0.001	)
0.001/0.001	:::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::
0.001/0.001	
0.001/0.001	
0.001/0.001	Problem 1:
0.001/0.001	
0.001/0.001	CleanTRS Processor:
0.001/0.001	
0.001/0.001	:::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::
0.001/0.001	Confluence Problem:
0.001/0.001	(VAR vNonEmpty:S)
0.001/0.001	(STRATEGY CONTEXTSENSITIVE
0.001/0.001	(f 1)
0.001/0.001	(p 1)
0.001/0.001	(0)
0.001/0.001	(cons 1)
0.001/0.001	(fSNonEmpty)
0.001/0.001	(s 1)
0.001/0.001	)
0.001/0.001	(RULES
0.001/0.001	f(0) -> cons(0,f(s(0)))
0.001/0.001	f(s(0)) -> f(p(s(0)))
0.001/0.001	p(s(0)) -> 0
0.001/0.001	)
0.001/0.001	:::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::
0.001/0.001	
0.001/0.001	
0.001/0.001	Problem 1:
0.001/0.001	
0.001/0.001	Modular Confluence Combinations Decomposition Processor:
0.001/0.001	It is a CTRS -> No modular confluence
0.001/0.001	
0.001/0.001	Problem 1:
0.001/0.001	Left-Homogeneous u-Replacing Variables Processor:
0.001/0.001	R satisfies LHRV condition
0.001/0.001	
0.001/0.001	Problem 1:
0.001/0.001	:::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::
0.001/0.001	Confluence Problem:
0.001/0.001	(VAR vNonEmpty:S)
0.001/0.001	(STRATEGY CONTEXTSENSITIVE
0.001/0.001	(f 1)
0.001/0.001	(p 1)
0.001/0.001	(0)
0.001/0.001	(cons 1)
0.001/0.001	(fSNonEmpty)
0.001/0.001	(s 1)
0.001/0.001	)
0.001/0.001	(RULES
0.001/0.001	f(0) -> cons(0,f(s(0)))
0.001/0.001	f(s(0)) -> f(p(s(0)))
0.001/0.001	p(s(0)) -> 0
0.001/0.001	)
0.001/0.001	:::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::
0.001/0.001	
0.001/0.001	Huet Levy Processor:
0.001/0.001	-> Rules:
0.001/0.001	 f(0) -> cons(0,f(s(0)))
0.001/0.001	 f(s(0)) -> f(p(s(0)))
0.001/0.001	 p(s(0)) -> 0
0.001/0.001	-> Vars:
0.001/0.001	
0.001/0.001	-> UVars:
0.001/0.001	 (UV-RuleId: 1, UV-LActive: [], UV-RActive: [], UV-LFrozen: [], UV-RFrozen: [])
0.001/0.001	 (UV-RuleId: 2, UV-LActive: [], UV-RActive: [], UV-LFrozen: [], UV-RFrozen: [])
0.001/0.001	 (UV-RuleId: 3, UV-LActive: [], UV-RActive: [], UV-LFrozen: [], UV-RFrozen: [])
0.001/0.001	-> FVars:
0.001/0.001	
0.001/0.001	-> PVars:
0.001/0.001	
0.001/0.001	
0.001/0.001	-> Rlps:
0.001/0.001	 (rule: f(0) -> cons(0,f(s(0))), id: 1, possubterms: f(0)->[], 0->[1])
0.001/0.001	 (rule: f(s(0)) -> f(p(s(0))), id: 2, possubterms: f(s(0))->[], s(0)->[1], 0->[1, 1])
0.001/0.001	 (rule: p(s(0)) -> 0, id: 3, possubterms: p(s(0))->[], s(0)->[1], 0->[1, 1])
0.001/0.001	
0.001/0.001	-> Unifications:
0.001/0.001	
0.001/0.001	
0.001/0.001	-> Critical pairs info:
0.001/0.001	
0.001/0.001	
0.001/0.001	-> Problem conclusions:
0.001/0.001	 Left linear, Right linear, Linear
0.001/0.001	 Weakly orthogonal, Almost orthogonal, Orthogonal
0.001/0.001	 Huet-Levy confluent, Not Newman confluent
0.001/0.001	 R is a CS-TRS, Left-homogeneous u-replacing variables
0.001/0.001	
0.001/0.001	
0.001/0.001	The problem is joinable.
0.001/0.001	0.00user 0.00system 0:00.01elapsed 38%CPU (0avgtext+0avgdata 8576maxresident)k
0.001/0.001	0inputs+0outputs (0major+657minor)pagefaults 0swaps