0.001/0.001	NO
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	(from 1)
0.001/0.001	(length)
0.001/0.001	(length1)
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	)
0.001/0.001	(RULES
0.001/0.001	from(X:S) -> cons(X:S,from(s(X:S)))
0.001/0.001	length(cons(X:S,Y:S)) -> s(length1(Y:S))
0.001/0.001	length(nil) -> 0
0.001/0.001	length1(X:S) -> length(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	(from 1)
0.001/0.001	(length)
0.001/0.001	(length1)
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	)
0.001/0.001	(RULES
0.001/0.001	from(X:S) -> cons(X:S,from(s(X:S)))
0.001/0.001	length(cons(X:S,Y:S)) -> s(length1(Y:S))
0.001/0.001	length(nil) -> 0
0.001/0.001	length1(X:S) -> length(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	CS-TRS Processor:
0.001/0.001	R is a CS-TRS
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	(from 1)
0.001/0.001	(length)
0.001/0.001	(length1)
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	)
0.001/0.001	(RULES
0.001/0.001	from(X:S) -> cons(X:S,from(s(X:S)))
0.001/0.001	length(cons(X:S,Y:S)) -> s(length1(Y:S))
0.001/0.001	length(nil) -> 0
0.001/0.001	length1(X:S) -> length(X:S)
0.001/0.001	)
0.001/0.001	:::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::
0.001/0.001	
0.001/0.001	Extended u-Critical Pairs NonLHRV Processor [JLAMP21]:
0.001/0.001	->Extended u-Critical Pair:
0.001/0.001	 Rule 1 (l :-> r) => from(x3:S) -> cons(x3:S,from(s(x3:S)))
0.001/0.001	 Rule 1 (l' :-> r') => from(X:S) -> cons(X:S,from(s(X:S)))
0.001/0.001	 Var => x3:S
0.001/0.001	 Pos x3:S in l => [1]
0.001/0.001	 Sigma => {x3:S -> from(X:S)}
0.001/0.001	 s => cons(from(X:S),from(s(from(X:S))))
0.001/0.001	 t => from(cons(X:S,from(s(X:S))))
0.001/0.001	 NW => 0
0.001/0.001	
0.001/0.001	
0.001/0.001	->Extended u-Critical Pair:
0.001/0.001	 Rule 1 (l :-> r) => from(x3:S) -> cons(x3:S,from(s(x3:S)))
0.001/0.001	 Rule 2 (l' :-> r') => length(cons(X:S,Y:S)) -> s(length1(Y:S))
0.001/0.001	 Var => x3:S
0.001/0.001	 Pos x3:S in l => [1]
0.001/0.001	 Sigma => {x3:S -> length(cons(X:S,Y:S))}
0.001/0.001	 s => cons(length(cons(X:S,Y:S)),from(s(length(cons(X:S,Y:S)))))
0.001/0.001	 t => from(s(length1(Y:S)))
0.001/0.001	 NW => 0
0.001/0.001	
0.001/0.001	
0.001/0.001	->Extended u-Critical Pair:
0.001/0.001	 Rule 1 (l :-> r) => from(x3:S) -> cons(x3:S,from(s(x3:S)))
0.001/0.001	 Rule 3 (l' :-> r') => length(nil) -> 0
0.001/0.001	 Var => x3:S
0.001/0.001	 Pos x3:S in l => [1]
0.001/0.001	 Sigma => {x3:S -> length(nil)}
0.001/0.001	 s => cons(length(nil),from(s(length(nil))))
0.001/0.001	 t => from(0)
0.001/0.001	 NW => 0
0.001/0.001	
0.001/0.001	
0.001/0.001	->Extended u-Critical Pair:
0.001/0.001	 Rule 1 (l :-> r) => from(x3:S) -> cons(x3:S,from(s(x3:S)))
0.001/0.001	 Rule 4 (l' :-> r') => length1(X:S) -> length(X:S)
0.001/0.001	 Var => x3:S
0.001/0.001	 Pos x3:S in l => [1]
0.001/0.001	 Sigma => {x3:S -> length1(X:S)}
0.001/0.001	 s => cons(length1(X:S),from(s(length1(X:S))))
0.001/0.001	 t => from(length(X:S))
0.001/0.001	 NW => 0
0.001/0.001	
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	(from 1)
0.001/0.001	(length)
0.001/0.001	(length1)
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	)
0.001/0.001	(RULES
0.001/0.001	from(X:S) -> cons(X:S,from(s(X:S)))
0.001/0.001	length(cons(X:S,Y:S)) -> s(length1(Y:S))
0.001/0.001	length(nil) -> 0
0.001/0.001	length1(X:S) -> length(X:S)
0.001/0.001	)
0.001/0.001	Critical Pairs:
0.001/0.001	<cons(from(X:S),from(s(from(X:S)))),from(cons(X:S,from(s(X:S))))>   =>  Not trivial, Not overlay, NW0, N1
0.001/0.001	<cons(length(cons(X:S,Y:S)),from(s(length(cons(X:S,Y:S))))),from(s(length1(Y:S)))>   =>  Not trivial, Not overlay, NW0, N2
0.001/0.001	<cons(length(nil),from(s(length(nil)))),from(0)>   =>  Not trivial, Not overlay, NW0, N3
0.001/0.001	<cons(length1(X:S),from(s(length1(X:S)))),from(length(X:S))>   =>  Not trivial, Not overlay, NW0, N4
0.001/0.001	:::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::
0.001/0.001	
0.001/0.001	Huet Levy Processor:
0.001/0.001	-> Rules:
0.001/0.001	 from(X:S) -> cons(X:S,from(s(X:S)))
0.001/0.001	 length(cons(X:S,Y:S)) -> s(length1(Y:S))
0.001/0.001	 length(nil) -> 0
0.001/0.001	 length1(X:S) -> length(X:S)
0.001/0.001	-> Vars:
0.001/0.001	 X, X, Y, X
0.001/0.001	-> UVars:
0.001/0.001	 (UV-RuleId: 1, UV-LActive: [X], UV-RActive: [X], UV-LFrozen: [], UV-RFrozen: [X])
0.001/0.001	 (UV-RuleId: 2, UV-LActive: [], UV-RActive: [], UV-LFrozen: [X, Y], UV-RFrozen: [Y])
0.001/0.001	 (UV-RuleId: 3, UV-LActive: [], UV-RActive: [], UV-LFrozen: [], UV-RFrozen: [])
0.001/0.001	 (UV-RuleId: 4, UV-LActive: [], UV-RActive: [], UV-LFrozen: [X], UV-RFrozen: [X])
0.001/0.001	-> FVars:
0.001/0.001	 x3, x4, x5, x6
0.001/0.001	-> PVars:
0.001/0.001	 X: [x3, x4, x6], Y: [x5]
0.001/0.001	
0.001/0.001	-> Rlps:
0.001/0.001	 (rule: from(x3:S) -> cons(x3:S,from(s(x3:S))), id: 1, possubterms: from(x3:S)->[])
0.001/0.001	 (rule: length(cons(x4:S,x5:S)) -> s(length1(x5:S)), id: 2, possubterms: length(cons(x4:S,x5:S))->[])
0.001/0.001	 (rule: length(nil) -> 0, id: 3, possubterms: length(nil)->[])
0.001/0.001	 (rule: length1(x6:S) -> length(x6:S), id: 4, possubterms: length1(x6:S)->[])
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	<cons(length1(X:S),from(s(length1(X:S)))),from(length(X:S))>   =>  Not trivial, Not overlay, NW0, N1
0.001/0.001	<cons(length(cons(X:S,Y:S)),from(s(length(cons(X:S,Y:S))))),from(s(length1(Y:S)))>   =>  Not trivial, Not overlay, NW0, N2
0.001/0.001	<cons(length(nil),from(s(length(nil)))),from(0)>   =>  Not trivial, Not overlay, NW0, N3
0.001/0.001	<cons(from(X:S),from(s(from(X:S)))),from(cons(X:S,from(s(X:S))))>   =>  Not trivial, Not overlay, NW0, N4
0.001/0.001	
0.001/0.001	-> Problem conclusions:
0.001/0.001	 Left linear, Not right linear, Not linear
0.001/0.001	 Not weakly orthogonal, Not almost orthogonal, Not orthogonal
0.001/0.001	 Not Huet-Levy confluent, Not Newman confluent
0.001/0.001	 R is a CS-TRS, Not left-homogeneous u-replacing variables
0.001/0.001	
0.001/0.001	
0.001/0.001	Problem 1:
0.001/0.001	No Convergence Brute Force Processor:
0.001/0.001	-> Rewritings:
0.001/0.001	s: cons(length1(X:S),from(s(length1(X:S))))
0.001/0.001	Nodes: [0,1]
0.001/0.001	Edges: [(0,1)]
0.001/0.001	ID: 0 => ('cons(length1(X:S),from(s(length1(X:S))))', D0)
0.001/0.001	ID: 1 => ('cons(length(X:S),from(s(length1(X:S))))', D1, R4, P[1], S{x6:S -> X:S}), NR: 'length(X:S)'
0.001/0.001	t: from(length(X:S))
0.001/0.001	Nodes: [0,1]
0.001/0.001	Edges: [(0,1)]
0.001/0.001	ID: 0 => ('from(length(X:S))', D0)
0.001/0.001	ID: 1 => ('cons(length(X:S),from(s(length(X:S))))', D1, R1, P[], S{x3:S -> length(X:S)}), NR: 'cons(length(X:S),from(s(length(X:S))))'
0.001/0.001	cons(length1(X:S),from(s(length1(X:S)))) ->* no union *<- from(length(X:S))
0.001/0.001	"Not joinable"
0.001/0.001	
0.001/0.001	The problem is not joinable.
0.001/0.001	0.00user 0.00system 0:00.01elapsed 50%CPU (0avgtext+0avgdata 9672maxresident)k
0.001/0.001	0inputs+0outputs (0major+774minor)pagefaults 0swaps