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 L:S N:S)
0.001/0.001	(STRATEGY CONTEXTSENSITIVE
0.001/0.001	(U11 1)
0.001/0.001	(U12 1)
0.001/0.001	(length 1)
0.001/0.001	(zeros)
0.001/0.001	(0)
0.001/0.001	(cons 1)
0.001/0.001	(fSNonEmpty)
0.001/0.001	(nil)
0.001/0.001	(s 1)
0.001/0.001	(tt)
0.001/0.001	)
0.001/0.001	(RULES
0.001/0.001	U11(tt,L:S) -> U12(tt,L:S)
0.001/0.001	U12(tt,L:S) -> s(length(L:S))
0.001/0.001	length(cons(N:S,L:S)) -> U11(tt,L:S)
0.001/0.001	length(nil) -> 0
0.001/0.001	zeros -> cons(0,zeros)
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 L:S N:S)
0.001/0.001	(STRATEGY CONTEXTSENSITIVE
0.001/0.001	(U11 1)
0.001/0.001	(U12 1)
0.001/0.001	(length 1)
0.001/0.001	(zeros)
0.001/0.001	(0)
0.001/0.001	(cons 1)
0.001/0.001	(fSNonEmpty)
0.001/0.001	(nil)
0.001/0.001	(s 1)
0.001/0.001	(tt)
0.001/0.001	)
0.001/0.001	(RULES
0.001/0.001	U11(tt,L:S) -> U12(tt,L:S)
0.001/0.001	U12(tt,L:S) -> s(length(L:S))
0.001/0.001	length(cons(N:S,L:S)) -> U11(tt,L:S)
0.001/0.001	length(nil) -> 0
0.001/0.001	zeros -> cons(0,zeros)
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 L:S N:S)
0.001/0.001	(STRATEGY CONTEXTSENSITIVE
0.001/0.001	(U11 1)
0.001/0.001	(U12 1)
0.001/0.001	(length 1)
0.001/0.001	(zeros)
0.001/0.001	(0)
0.001/0.001	(cons 1)
0.001/0.001	(fSNonEmpty)
0.001/0.001	(nil)
0.001/0.001	(s 1)
0.001/0.001	(tt)
0.001/0.001	)
0.001/0.001	(RULES
0.001/0.001	U11(tt,L:S) -> U12(tt,L:S)
0.001/0.001	U12(tt,L:S) -> s(length(L:S))
0.001/0.001	length(cons(N:S,L:S)) -> U11(tt,L:S)
0.001/0.001	length(nil) -> 0
0.001/0.001	zeros -> cons(0,zeros)
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	 U11(tt,L:S) -> U12(tt,L:S)
0.001/0.001	 U12(tt,L:S) -> s(length(L:S))
0.001/0.001	 length(cons(N:S,L:S)) -> U11(tt,L:S)
0.001/0.001	 length(nil) -> 0
0.001/0.001	 zeros -> cons(0,zeros)
0.001/0.001	-> Vars:
0.001/0.001	 L, L, L, N
0.001/0.001	-> UVars:
0.001/0.001	 (UV-RuleId: 1, UV-LActive: [], UV-RActive: [], UV-LFrozen: [L], UV-RFrozen: [L])
0.001/0.001	 (UV-RuleId: 2, UV-LActive: [], UV-RActive: [L], UV-LFrozen: [L], UV-RFrozen: [])
0.001/0.001	 (UV-RuleId: 3, UV-LActive: [N], UV-RActive: [], UV-LFrozen: [L], UV-RFrozen: [L])
0.001/0.001	 (UV-RuleId: 4, UV-LActive: [], UV-RActive: [], UV-LFrozen: [], UV-RFrozen: [])
0.001/0.001	 (UV-RuleId: 5, UV-LActive: [], UV-RActive: [], UV-LFrozen: [], UV-RFrozen: [])
0.001/0.001	-> FVars:
0.001/0.001	 x3, x4, x5, x6
0.001/0.001	-> PVars:
0.001/0.001	 L: [x3, x4, x5], N: [x6]
0.001/0.001	
0.001/0.001	-> Rlps:
0.001/0.001	 (rule: U11(tt,x3:S) -> U12(tt,x3:S), id: 1, possubterms: U11(tt,x3:S)->[], tt->[1])
0.001/0.001	 (rule: U12(tt,x4:S) -> s(length(x4:S)), id: 2, possubterms: U12(tt,x4:S)->[], tt->[1])
0.001/0.001	 (rule: length(cons(x6:S,x5:S)) -> U11(tt,x5:S), id: 3, possubterms: length(cons(x6:S,x5:S))->[], cons(x6:S,x5:S)->[1])
0.001/0.001	 (rule: length(nil) -> 0, id: 4, possubterms: length(nil)->[], nil->[1])
0.001/0.001	 (rule: zeros -> cons(0,zeros), id: 5, possubterms: zeros->[])
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 41%CPU (0avgtext+0avgdata 8392maxresident)k
0.001/0.001	0inputs+0outputs (0major+661minor)pagefaults 0swaps