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 xs:S:S) 0.001/0.001 (STRATEGY CONTEXTSENSITIVE 0.001/0.001 (cons_1 1) 0.001/0.001 (from_1) 0.001/0.001 (from_2) 0.001/0.001 (from_3) 0.001/0.001 (cons_0 1 2) 0.001/0.001 (fSNonEmpty) 0.001/0.001 (overflow_0) 0.001/0.001 (s_0) 0.001/0.001 ) 0.001/0.001 (RULES 0.001/0.001 cons_1(s_0(x:S:S),xs:S:S) -> overflow_0 0.001/0.001 from_1(x:S:S) -> cons_0(x:S:S,from_3(s_0(x:S:S))) 0.001/0.001 from_2(x:S:S) -> cons_0(x:S:S,from_3(s_0(x:S:S))) 0.001/0.001 from_3(x:S:S) -> cons_1(x:S:S,from_3(s_0(x:S: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 v_NonEmpty:S:S x:S:S xs:S:S) 0.001/0.001 (STRATEGY CONTEXTSENSITIVE 0.001/0.001 (cons_1 1) 0.001/0.001 (from_1) 0.001/0.001 (from_2) 0.001/0.001 (from_3) 0.001/0.001 (cons_0 1 2) 0.001/0.001 (fSNonEmpty) 0.001/0.001 (overflow_0) 0.001/0.001 (s_0) 0.001/0.001 ) 0.001/0.001 (RULES 0.001/0.001 cons_1(s_0(x:S:S),xs:S:S) -> overflow_0 0.001/0.001 from_1(x:S:S) -> cons_0(x:S:S,from_3(s_0(x:S:S))) 0.001/0.001 from_2(x:S:S) -> cons_0(x:S:S,from_3(s_0(x:S:S))) 0.001/0.001 from_3(x:S:S) -> cons_1(x:S:S,from_3(s_0(x:S: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 v_NonEmpty:S:S x:S:S xs:S:S) 0.001/0.001 (STRATEGY CONTEXTSENSITIVE 0.001/0.001 (cons_1 1) 0.001/0.001 (from_1) 0.001/0.001 (from_2) 0.001/0.001 (from_3) 0.001/0.001 (cons_0 1 2) 0.001/0.001 (fSNonEmpty) 0.001/0.001 (overflow_0) 0.001/0.001 (s_0) 0.001/0.001 ) 0.001/0.001 (RULES 0.001/0.001 cons_1(s_0(x:S:S),xs:S:S) -> overflow_0 0.001/0.001 from_1(x:S:S) -> cons_0(x:S:S,from_3(s_0(x:S:S))) 0.001/0.001 from_2(x:S:S) -> cons_0(x:S:S,from_3(s_0(x:S:S))) 0.001/0.001 from_3(x:S:S) -> cons_1(x:S:S,from_3(s_0(x:S: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 cons_1(s_0(x:S:S),xs:S:S) -> overflow_0 0.001/0.001 from_1(x:S:S) -> cons_0(x:S:S,from_3(s_0(x:S:S))) 0.001/0.001 from_2(x:S:S) -> cons_0(x:S:S,from_3(s_0(x:S:S))) 0.001/0.001 from_3(x:S:S) -> cons_1(x:S:S,from_3(s_0(x:S:S))) 0.001/0.001 -> Vars: 0.001/0.001 x:S, xs:S, x:S, x:S, x:S 0.001/0.001 -> UVars: 0.001/0.001 (UV-RuleId: 1, UV-LActive: [], UV-RActive: [], UV-LFrozen: [x:S, xs:S], UV-RFrozen: []) 0.001/0.001 (UV-RuleId: 2, UV-LActive: [], UV-RActive: [x:S], UV-LFrozen: [x:S], UV-RFrozen: [x:S]) 0.001/0.001 (UV-RuleId: 3, UV-LActive: [], UV-RActive: [x:S], UV-LFrozen: [x:S], UV-RFrozen: [x:S]) 0.001/0.001 (UV-RuleId: 4, UV-LActive: [], UV-RActive: [x:S], UV-LFrozen: [x:S], UV-RFrozen: [x:S]) 0.001/0.001 -> FVars: 0.001/0.001 x4, x5, x6, x7, x8 0.001/0.001 -> PVars: 0.001/0.001 x:S: [x4, x6, x7, x8], xs:S: [x5] 0.001/0.001 0.001/0.001 -> Rlps: 0.001/0.001 (rule: cons_1(s_0(x4:S),x5:S) -> overflow_0, id: 1, possubterms: cons_1(s_0(x4:S),x5:S)->[], s_0(x4:S)->[1]) 0.001/0.001 (rule: from_1(x6:S) -> cons_0(x6:S,from_3(s_0(x6:S))), id: 2, possubterms: from_1(x6:S)->[]) 0.001/0.001 (rule: from_2(x7:S) -> cons_0(x7:S,from_3(s_0(x7:S))), id: 3, possubterms: from_2(x7:S)->[]) 0.001/0.001 (rule: from_3(x8:S) -> cons_1(x8:S,from_3(s_0(x8:S))), id: 4, possubterms: from_3(x8: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 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 33%CPU (0avgtext+0avgdata 8228maxresident)k 0.001/0.001 8inputs+0outputs (0major+663minor)pagefaults 0swaps