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 v_NonEmpty:S:S X:S:S Y:S:S Z:S:S) 0.001/0.001 (STRATEGY CONTEXTSENSITIVE 0.001/0.001 (add 1) 0.001/0.001 (from) 0.001/0.001 (fst 1 2) 0.001/0.001 (len 1) 0.001/0.001 (cons) 0.001/0.001 (fSNonEmpty) 0.001/0.001 (nil) 0.001/0.001 (num0) 0.001/0.001 (s) 0.001/0.001 ) 0.001/0.001 (RULES 0.001/0.001 add(num0,X:S:S) -> X:S:S 0.001/0.001 add(s(X:S:S),Y:S:S) -> s(add(X:S:S,Y:S:S)) 0.001/0.001 from(X:S:S) -> cons(X:S:S,from(s(X:S:S))) 0.001/0.001 fst(num0,Z:S:S) -> nil 0.001/0.001 fst(s(X:S:S),cons(Y:S:S,Z:S:S)) -> cons(Y:S:S,fst(X:S:S,Z:S:S)) 0.001/0.001 len(cons(X:S:S,Z:S:S)) -> s(len(Z:S:S)) 0.001/0.001 len(nil) -> num0 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 v_NonEmpty:S:S X:S:S Y:S:S Z:S:S) 0.001/0.001 (STRATEGY CONTEXTSENSITIVE 0.001/0.001 (add 1) 0.001/0.001 (from) 0.001/0.001 (fst 1 2) 0.001/0.001 (len 1) 0.001/0.001 (cons) 0.001/0.001 (fSNonEmpty) 0.001/0.001 (nil) 0.001/0.001 (num0) 0.001/0.001 (s) 0.001/0.001 ) 0.001/0.001 (RULES 0.001/0.001 add(num0,X:S:S) -> X:S:S 0.001/0.001 add(s(X:S:S),Y:S:S) -> s(add(X:S:S,Y:S:S)) 0.001/0.001 from(X:S:S) -> cons(X:S:S,from(s(X:S:S))) 0.001/0.001 fst(num0,Z:S:S) -> nil 0.001/0.001 fst(s(X:S:S),cons(Y:S:S,Z:S:S)) -> cons(Y:S:S,fst(X:S:S,Z:S:S)) 0.001/0.001 len(cons(X:S:S,Z:S:S)) -> s(len(Z:S:S)) 0.001/0.001 len(nil) -> num0 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 v_NonEmpty:S:S X:S:S Y:S:S Z:S:S) 0.001/0.001 (STRATEGY CONTEXTSENSITIVE 0.001/0.001 (add 1) 0.001/0.001 (from) 0.001/0.001 (fst 1 2) 0.001/0.001 (len 1) 0.001/0.001 (cons) 0.001/0.001 (fSNonEmpty) 0.001/0.001 (nil) 0.001/0.001 (num0) 0.001/0.001 (s) 0.001/0.001 ) 0.001/0.001 (RULES 0.001/0.001 add(num0,X:S:S) -> X:S:S 0.001/0.001 add(s(X:S:S),Y:S:S) -> s(add(X:S:S,Y:S:S)) 0.001/0.001 from(X:S:S) -> cons(X:S:S,from(s(X:S:S))) 0.001/0.001 fst(num0,Z:S:S) -> nil 0.001/0.001 fst(s(X:S:S),cons(Y:S:S,Z:S:S)) -> cons(Y:S:S,fst(X:S:S,Z:S:S)) 0.001/0.001 len(cons(X:S:S,Z:S:S)) -> s(len(Z:S:S)) 0.001/0.001 len(nil) -> num0 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 add(num0,X:S:S) -> X:S:S 0.001/0.001 add(s(X:S:S),Y:S:S) -> s(add(X:S:S,Y:S:S)) 0.001/0.001 from(X:S:S) -> cons(X:S:S,from(s(X:S:S))) 0.001/0.001 fst(num0,Z:S:S) -> nil 0.001/0.001 fst(s(X:S:S),cons(Y:S:S,Z:S:S)) -> cons(Y:S:S,fst(X:S:S,Z:S:S)) 0.001/0.001 len(cons(X:S:S,Z:S:S)) -> s(len(Z:S:S)) 0.001/0.001 len(nil) -> num0 0.001/0.001 -> Vars: 0.001/0.001 X:S, X:S, Y:S, X:S, Z:S, X:S, Y:S, Z:S, X:S, Z:S 0.001/0.001 -> UVars: 0.001/0.001 (UV-RuleId: 1, UV-LActive: [], UV-RActive: [X:S], UV-LFrozen: [X:S], UV-RFrozen: []) 0.001/0.001 (UV-RuleId: 2, UV-LActive: [], UV-RActive: [], UV-LFrozen: [X:S, Y:S], UV-RFrozen: [X:S, Y:S]) 0.001/0.001 (UV-RuleId: 3, UV-LActive: [], UV-RActive: [], UV-LFrozen: [X:S], UV-RFrozen: [X:S]) 0.001/0.001 (UV-RuleId: 4, UV-LActive: [Z:S], UV-RActive: [], UV-LFrozen: [], UV-RFrozen: []) 0.001/0.001 (UV-RuleId: 5, UV-LActive: [], UV-RActive: [], UV-LFrozen: [X:S, Y:S, Z:S], UV-RFrozen: [X:S, Y:S, Z:S]) 0.001/0.001 (UV-RuleId: 6, UV-LActive: [], UV-RActive: [], UV-LFrozen: [X:S, Z:S], UV-RFrozen: [Z:S]) 0.001/0.001 (UV-RuleId: 7, UV-LActive: [], UV-RActive: [], UV-LFrozen: [], UV-RFrozen: []) 0.001/0.001 -> FVars: 0.001/0.001 x5, x6, x7, x8, x9, x10, x11, x12, x13, x14 0.001/0.001 -> PVars: 0.001/0.001 X:S: [x5, x6, x8, x10, x13], Y:S: [x7, x11], Z:S: [x9, x12, x14] 0.001/0.001 0.001/0.001 -> Rlps: 0.001/0.001 (rule: add(num0,x5:S) -> x5:S, id: 1, possubterms: add(num0,x5:S)->[], num0->[1]) 0.001/0.001 (rule: add(s(x6:S),x7:S) -> s(add(x6:S,x7:S)), id: 2, possubterms: add(s(x6:S),x7:S)->[], s(x6:S)->[1]) 0.001/0.001 (rule: from(x8:S) -> cons(x8:S,from(s(x8:S))), id: 3, possubterms: from(x8:S)->[]) 0.001/0.001 (rule: fst(num0,x9:S) -> nil, id: 4, possubterms: fst(num0,x9:S)->[], num0->[1]) 0.001/0.001 (rule: fst(s(x10:S),cons(x11:S,x12:S)) -> cons(x11:S,fst(x10:S,x12:S)), id: 5, possubterms: fst(s(x10:S),cons(x11:S,x12:S))->[], s(x10:S)->[1], cons(x11:S,x12:S)->[2]) 0.001/0.001 (rule: len(cons(x13:S,x14:S)) -> s(len(x14:S)), id: 6, possubterms: len(cons(x13:S,x14:S))->[], cons(x13:S,x14:S)->[1]) 0.001/0.001 (rule: len(nil) -> num0, id: 7, possubterms: len(nil)->[], nil->[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, Not right linear, Not 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 8536maxresident)k 0.001/0.001 8inputs+0outputs (0major+687minor)pagefaults 0swaps