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 X:S Y:S)
0.001/0.001	(STRATEGY CONTEXTSENSITIVE
0.001/0.001	(f 1)
0.001/0.001	(if 1 2)
0.001/0.001	(c)
0.001/0.001	(fSNonEmpty)
0.001/0.001	(false)
0.001/0.001	(true)
0.001/0.001	)
0.001/0.001	(RULES
0.001/0.001	f(X:S) -> if(X:S,c,f(true))
0.001/0.001	if(false,X:S,Y:S) -> Y:S
0.001/0.001	if(true,X:S,Y:S) -> X:S
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 X:S Y:S)
0.001/0.001	(STRATEGY CONTEXTSENSITIVE
0.001/0.001	(f 1)
0.001/0.001	(if 1 2)
0.001/0.001	(c)
0.001/0.001	(fSNonEmpty)
0.001/0.001	(false)
0.001/0.001	(true)
0.001/0.001	)
0.001/0.001	(RULES
0.001/0.001	f(X:S) -> if(X:S,c,f(true))
0.001/0.001	if(false,X:S,Y:S) -> Y:S
0.001/0.001	if(true,X:S,Y:S) -> X:S
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 X:S Y:S)
0.001/0.001	(STRATEGY CONTEXTSENSITIVE
0.001/0.001	(f 1)
0.001/0.001	(if 1 2)
0.001/0.001	(c)
0.001/0.001	(fSNonEmpty)
0.001/0.001	(false)
0.001/0.001	(true)
0.001/0.001	)
0.001/0.001	(RULES
0.001/0.001	f(X:S) -> if(X:S,c,f(true))
0.001/0.001	if(false,X:S,Y:S) -> Y:S
0.001/0.001	if(true,X:S,Y:S) -> X:S
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(X:S) -> if(X:S,c,f(true))
0.001/0.001	 if(false,X:S,Y:S) -> Y:S
0.001/0.001	 if(true,X:S,Y:S) -> X:S
0.001/0.001	-> Vars:
0.001/0.001	 X, X, Y, X, Y
0.001/0.001	-> UVars:
0.001/0.001	 (UV-RuleId: 1, UV-LActive: [X], UV-RActive: [X], UV-LFrozen: [], UV-RFrozen: [])
0.001/0.001	 (UV-RuleId: 2, UV-LActive: [X], UV-RActive: [Y], UV-LFrozen: [Y], UV-RFrozen: [])
0.001/0.001	 (UV-RuleId: 3, UV-LActive: [X], UV-RActive: [X], UV-LFrozen: [Y], UV-RFrozen: [])
0.001/0.001	-> FVars:
0.001/0.001	 x3, x4, x5, x6, x7
0.001/0.001	-> PVars:
0.001/0.001	 X: [x3, x4, x6], Y: [x5, x7]
0.001/0.001	
0.001/0.001	-> Rlps:
0.001/0.001	 (rule: f(x3:S) -> if(x3:S,c,f(true)), id: 1, possubterms: f(x3:S)->[])
0.001/0.001	 (rule: if(false,x4:S,x5:S) -> x5:S, id: 2, possubterms: if(false,x4:S,x5:S)->[], false->[1])
0.001/0.001	 (rule: if(true,x6:S,x7:S) -> x6:S, id: 3, possubterms: if(true,x6:S,x7:S)->[], true->[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 8248maxresident)k
0.001/0.001	0inputs+0outputs (0major+654minor)pagefaults 0swaps