WORST_CASE(?,O(n^3)) * Step 1: DependencyPairs WORST_CASE(?,O(n^3)) + Considered Problem: - Strict TRS: 'cklt('EQ()) -> 'false() 'cklt('GT()) -> 'false() 'cklt('LT()) -> 'true() 'compare('0(),'0()) -> 'EQ() 'compare('0(),'neg(y)) -> 'GT() 'compare('0(),'pos(y)) -> 'LT() 'compare('0(),'s(y)) -> 'LT() 'compare('neg(x),'0()) -> 'LT() 'compare('neg(x),'neg(y)) -> 'compare(y,x) 'compare('neg(x),'pos(y)) -> 'LT() 'compare('pos(x),'0()) -> 'GT() 'compare('pos(x),'neg(y)) -> 'GT() 'compare('pos(x),'pos(y)) -> 'compare(x,y) 'compare('s(x),'0()) -> 'GT() 'compare('s(x),'s(y)) -> 'compare(x,y) 'less(x,y) -> 'cklt('compare(x,y)) merge(l1,l2) -> merge'1(l1,l2) merge'1(dd(x,xs),l2) -> merge'2(l2,x,xs) merge'1(nil(),l2) -> l2 merge'2(dd(y,ys),x,xs) -> merge'3('less(x,y),x,xs,y,ys) merge'2(nil(),x,xs) -> dd(x,xs) merge'3('false(),x,xs,y,ys) -> dd(y,merge(dd(x,xs),ys)) merge'3('true(),x,xs,y,ys) -> dd(x,merge(xs,dd(y,ys))) mergesort(l) -> mergesort'1(l) mergesort'1(dd(x1,xs)) -> mergesort'2(xs,x1) mergesort'1(nil()) -> nil() mergesort'2(dd(x2,xs'),x1) -> mergesort'3(msplit(dd(x1,dd(x2,xs')))) mergesort'2(nil(),x1) -> dd(x1,nil()) mergesort'3(tuple'2(l1,l2)) -> merge(mergesort(l1),mergesort(l2)) msplit(l) -> msplit'1(l) msplit'1(dd(x1,xs)) -> msplit'2(xs,x1) msplit'1(nil()) -> tuple'2(nil(),nil()) msplit'2(dd(x2,xs'),x1) -> msplit'3(msplit(xs'),x1,x2) msplit'2(nil(),x1) -> tuple'2(dd(x1,nil()),nil()) msplit'3(tuple'2(l1,l2),x1,x2) -> tuple'2(dd(x1,l1),dd(x2,l2)) - Signature: {'cklt/1,'compare/2,'less/2,merge/2,merge'1/2,merge'2/3,merge'3/5,mergesort/1,mergesort'1/1,mergesort'2/2 ,mergesort'3/1,msplit/1,msplit'1/1,msplit'2/2,msplit'3/3} / {'0/0,'EQ/0,'GT/0,'LT/0,'false/0,'neg/1,'pos/1 ,'s/1,'true/0,dd/2,nil/0,tuple'2/2} - Obligation: innermost runtime complexity wrt. defined symbols {'cklt,'compare,'less,merge,merge'1,merge'2,merge'3 ,mergesort,mergesort'1,mergesort'2,mergesort'3,msplit,msplit'1,msplit'2,msplit'3} and constructors {'0,'EQ ,'GT,'LT,'false,'neg,'pos,'s,'true,dd,nil,tuple'2} + Applied Processor: DependencyPairs {dpKind_ = DT} + Details: We add the following dependency tuples: Strict DPs 'cklt#('EQ()) -> c_1() 'cklt#('GT()) -> c_2() 'cklt#('LT()) -> c_3() 'compare#('0(),'0()) -> c_4() 'compare#('0(),'neg(y)) -> c_5() 'compare#('0(),'pos(y)) -> c_6() 'compare#('0(),'s(y)) -> c_7() 'compare#('neg(x),'0()) -> c_8() 'compare#('neg(x),'neg(y)) -> c_9('compare#(y,x)) 'compare#('neg(x),'pos(y)) -> c_10() 'compare#('pos(x),'0()) -> c_11() 'compare#('pos(x),'neg(y)) -> c_12() 'compare#('pos(x),'pos(y)) -> c_13('compare#(x,y)) 'compare#('s(x),'0()) -> c_14() 'compare#('s(x),'s(y)) -> c_15('compare#(x,y)) 'less#(x,y) -> c_16('cklt#('compare(x,y)),'compare#(x,y)) merge#(l1,l2) -> c_17(merge'1#(l1,l2)) merge'1#(dd(x,xs),l2) -> c_18(merge'2#(l2,x,xs)) merge'1#(nil(),l2) -> c_19() merge'2#(dd(y,ys),x,xs) -> c_20(merge'3#('less(x,y),x,xs,y,ys),'less#(x,y)) merge'2#(nil(),x,xs) -> c_21() merge'3#('false(),x,xs,y,ys) -> c_22(merge#(dd(x,xs),ys)) merge'3#('true(),x,xs,y,ys) -> c_23(merge#(xs,dd(y,ys))) mergesort#(l) -> c_24(mergesort'1#(l)) mergesort'1#(dd(x1,xs)) -> c_25(mergesort'2#(xs,x1)) mergesort'1#(nil()) -> c_26() mergesort'2#(dd(x2,xs'),x1) -> c_27(mergesort'3#(msplit(dd(x1,dd(x2,xs')))),msplit#(dd(x1,dd(x2,xs')))) mergesort'2#(nil(),x1) -> c_28() mergesort'3#(tuple'2(l1,l2)) -> c_29(merge#(mergesort(l1),mergesort(l2)),mergesort#(l1),mergesort#(l2)) msplit#(l) -> c_30(msplit'1#(l)) msplit'1#(dd(x1,xs)) -> c_31(msplit'2#(xs,x1)) msplit'1#(nil()) -> c_32() msplit'2#(dd(x2,xs'),x1) -> c_33(msplit'3#(msplit(xs'),x1,x2),msplit#(xs')) msplit'2#(nil(),x1) -> c_34() msplit'3#(tuple'2(l1,l2),x1,x2) -> c_35() Weak DPs and mark the set of starting terms. * Step 2: PredecessorEstimation WORST_CASE(?,O(n^3)) + Considered Problem: - Strict DPs: 'cklt#('EQ()) -> c_1() 'cklt#('GT()) -> c_2() 'cklt#('LT()) -> c_3() 'compare#('0(),'0()) -> c_4() 'compare#('0(),'neg(y)) -> c_5() 'compare#('0(),'pos(y)) -> c_6() 'compare#('0(),'s(y)) -> c_7() 'compare#('neg(x),'0()) -> c_8() 'compare#('neg(x),'neg(y)) -> c_9('compare#(y,x)) 'compare#('neg(x),'pos(y)) -> c_10() 'compare#('pos(x),'0()) -> c_11() 'compare#('pos(x),'neg(y)) -> c_12() 'compare#('pos(x),'pos(y)) -> c_13('compare#(x,y)) 'compare#('s(x),'0()) -> c_14() 'compare#('s(x),'s(y)) -> c_15('compare#(x,y)) 'less#(x,y) -> c_16('cklt#('compare(x,y)),'compare#(x,y)) merge#(l1,l2) -> c_17(merge'1#(l1,l2)) merge'1#(dd(x,xs),l2) -> c_18(merge'2#(l2,x,xs)) merge'1#(nil(),l2) -> c_19() merge'2#(dd(y,ys),x,xs) -> c_20(merge'3#('less(x,y),x,xs,y,ys),'less#(x,y)) merge'2#(nil(),x,xs) -> c_21() merge'3#('false(),x,xs,y,ys) -> c_22(merge#(dd(x,xs),ys)) merge'3#('true(),x,xs,y,ys) -> c_23(merge#(xs,dd(y,ys))) mergesort#(l) -> c_24(mergesort'1#(l)) mergesort'1#(dd(x1,xs)) -> c_25(mergesort'2#(xs,x1)) mergesort'1#(nil()) -> c_26() mergesort'2#(dd(x2,xs'),x1) -> c_27(mergesort'3#(msplit(dd(x1,dd(x2,xs')))),msplit#(dd(x1,dd(x2,xs')))) mergesort'2#(nil(),x1) -> c_28() mergesort'3#(tuple'2(l1,l2)) -> c_29(merge#(mergesort(l1),mergesort(l2)),mergesort#(l1),mergesort#(l2)) msplit#(l) -> c_30(msplit'1#(l)) msplit'1#(dd(x1,xs)) -> c_31(msplit'2#(xs,x1)) msplit'1#(nil()) -> c_32() msplit'2#(dd(x2,xs'),x1) -> c_33(msplit'3#(msplit(xs'),x1,x2),msplit#(xs')) msplit'2#(nil(),x1) -> c_34() msplit'3#(tuple'2(l1,l2),x1,x2) -> c_35() - Weak TRS: 'cklt('EQ()) -> 'false() 'cklt('GT()) -> 'false() 'cklt('LT()) -> 'true() 'compare('0(),'0()) -> 'EQ() 'compare('0(),'neg(y)) -> 'GT() 'compare('0(),'pos(y)) -> 'LT() 'compare('0(),'s(y)) -> 'LT() 'compare('neg(x),'0()) -> 'LT() 'compare('neg(x),'neg(y)) -> 'compare(y,x) 'compare('neg(x),'pos(y)) -> 'LT() 'compare('pos(x),'0()) -> 'GT() 'compare('pos(x),'neg(y)) -> 'GT() 'compare('pos(x),'pos(y)) -> 'compare(x,y) 'compare('s(x),'0()) -> 'GT() 'compare('s(x),'s(y)) -> 'compare(x,y) 'less(x,y) -> 'cklt('compare(x,y)) merge(l1,l2) -> merge'1(l1,l2) merge'1(dd(x,xs),l2) -> merge'2(l2,x,xs) merge'1(nil(),l2) -> l2 merge'2(dd(y,ys),x,xs) -> merge'3('less(x,y),x,xs,y,ys) merge'2(nil(),x,xs) -> dd(x,xs) merge'3('false(),x,xs,y,ys) -> dd(y,merge(dd(x,xs),ys)) merge'3('true(),x,xs,y,ys) -> dd(x,merge(xs,dd(y,ys))) mergesort(l) -> mergesort'1(l) mergesort'1(dd(x1,xs)) -> mergesort'2(xs,x1) mergesort'1(nil()) -> nil() mergesort'2(dd(x2,xs'),x1) -> mergesort'3(msplit(dd(x1,dd(x2,xs')))) mergesort'2(nil(),x1) -> dd(x1,nil()) mergesort'3(tuple'2(l1,l2)) -> merge(mergesort(l1),mergesort(l2)) msplit(l) -> msplit'1(l) msplit'1(dd(x1,xs)) -> msplit'2(xs,x1) msplit'1(nil()) -> tuple'2(nil(),nil()) msplit'2(dd(x2,xs'),x1) -> msplit'3(msplit(xs'),x1,x2) msplit'2(nil(),x1) -> tuple'2(dd(x1,nil()),nil()) msplit'3(tuple'2(l1,l2),x1,x2) -> tuple'2(dd(x1,l1),dd(x2,l2)) - Signature: {'cklt/1,'compare/2,'less/2,merge/2,merge'1/2,merge'2/3,merge'3/5,mergesort/1,mergesort'1/1,mergesort'2/2 ,mergesort'3/1,msplit/1,msplit'1/1,msplit'2/2,msplit'3/3,'cklt#/1,'compare#/2,'less#/2,merge#/2,merge'1#/2 ,merge'2#/3,merge'3#/5,mergesort#/1,mergesort'1#/1,mergesort'2#/2,mergesort'3#/1,msplit#/1,msplit'1#/1 ,msplit'2#/2,msplit'3#/3} / {'0/0,'EQ/0,'GT/0,'LT/0,'false/0,'neg/1,'pos/1,'s/1,'true/0,dd/2,nil/0,tuple'2/2 ,c_1/0,c_2/0,c_3/0,c_4/0,c_5/0,c_6/0,c_7/0,c_8/0,c_9/1,c_10/0,c_11/0,c_12/0,c_13/1,c_14/0,c_15/1,c_16/2 ,c_17/1,c_18/1,c_19/0,c_20/2,c_21/0,c_22/1,c_23/1,c_24/1,c_25/1,c_26/0,c_27/2,c_28/0,c_29/3,c_30/1,c_31/1 ,c_32/0,c_33/2,c_34/0,c_35/0} - Obligation: innermost runtime complexity wrt. defined symbols {'cklt#,'compare#,'less#,merge#,merge'1#,merge'2#,merge'3# ,mergesort#,mergesort'1#,mergesort'2#,mergesort'3#,msplit#,msplit'1#,msplit'2# ,msplit'3#} and constructors {'0,'EQ,'GT,'LT,'false,'neg,'pos,'s,'true,dd,nil,tuple'2} + Applied Processor: PredecessorEstimation {onSelection = all simple predecessor estimation selector} + Details: We estimate the number of application of {1,2,3,4,5,6,7,8,10,11,12,14,19,21,26,28,32,34,35} by application of Pre({1,2,3,4,5,6,7,8,10,11,12,14,19,21,26,28,32,34,35}) = {9,13,15,16,17,18,24,25,30,31,33}. Here rules are labelled as follows: 1: 'cklt#('EQ()) -> c_1() 2: 'cklt#('GT()) -> c_2() 3: 'cklt#('LT()) -> c_3() 4: 'compare#('0(),'0()) -> c_4() 5: 'compare#('0(),'neg(y)) -> c_5() 6: 'compare#('0(),'pos(y)) -> c_6() 7: 'compare#('0(),'s(y)) -> c_7() 8: 'compare#('neg(x),'0()) -> c_8() 9: 'compare#('neg(x),'neg(y)) -> c_9('compare#(y,x)) 10: 'compare#('neg(x),'pos(y)) -> c_10() 11: 'compare#('pos(x),'0()) -> c_11() 12: 'compare#('pos(x),'neg(y)) -> c_12() 13: 'compare#('pos(x),'pos(y)) -> c_13('compare#(x,y)) 14: 'compare#('s(x),'0()) -> c_14() 15: 'compare#('s(x),'s(y)) -> c_15('compare#(x,y)) 16: 'less#(x,y) -> c_16('cklt#('compare(x,y)),'compare#(x,y)) 17: merge#(l1,l2) -> c_17(merge'1#(l1,l2)) 18: merge'1#(dd(x,xs),l2) -> c_18(merge'2#(l2,x,xs)) 19: merge'1#(nil(),l2) -> c_19() 20: merge'2#(dd(y,ys),x,xs) -> c_20(merge'3#('less(x,y),x,xs,y,ys),'less#(x,y)) 21: merge'2#(nil(),x,xs) -> c_21() 22: merge'3#('false(),x,xs,y,ys) -> c_22(merge#(dd(x,xs),ys)) 23: merge'3#('true(),x,xs,y,ys) -> c_23(merge#(xs,dd(y,ys))) 24: mergesort#(l) -> c_24(mergesort'1#(l)) 25: mergesort'1#(dd(x1,xs)) -> c_25(mergesort'2#(xs,x1)) 26: mergesort'1#(nil()) -> c_26() 27: mergesort'2#(dd(x2,xs'),x1) -> c_27(mergesort'3#(msplit(dd(x1,dd(x2,xs')))),msplit#(dd(x1,dd(x2,xs')))) 28: mergesort'2#(nil(),x1) -> c_28() 29: mergesort'3#(tuple'2(l1,l2)) -> c_29(merge#(mergesort(l1),mergesort(l2)),mergesort#(l1),mergesort#(l2)) 30: msplit#(l) -> c_30(msplit'1#(l)) 31: msplit'1#(dd(x1,xs)) -> c_31(msplit'2#(xs,x1)) 32: msplit'1#(nil()) -> c_32() 33: msplit'2#(dd(x2,xs'),x1) -> c_33(msplit'3#(msplit(xs'),x1,x2),msplit#(xs')) 34: msplit'2#(nil(),x1) -> c_34() 35: msplit'3#(tuple'2(l1,l2),x1,x2) -> c_35() * Step 3: RemoveWeakSuffixes WORST_CASE(?,O(n^3)) + Considered Problem: - Strict DPs: 'compare#('neg(x),'neg(y)) -> c_9('compare#(y,x)) 'compare#('pos(x),'pos(y)) -> c_13('compare#(x,y)) 'compare#('s(x),'s(y)) -> c_15('compare#(x,y)) 'less#(x,y) -> c_16('cklt#('compare(x,y)),'compare#(x,y)) merge#(l1,l2) -> c_17(merge'1#(l1,l2)) merge'1#(dd(x,xs),l2) -> c_18(merge'2#(l2,x,xs)) merge'2#(dd(y,ys),x,xs) -> c_20(merge'3#('less(x,y),x,xs,y,ys),'less#(x,y)) merge'3#('false(),x,xs,y,ys) -> c_22(merge#(dd(x,xs),ys)) merge'3#('true(),x,xs,y,ys) -> c_23(merge#(xs,dd(y,ys))) mergesort#(l) -> c_24(mergesort'1#(l)) mergesort'1#(dd(x1,xs)) -> c_25(mergesort'2#(xs,x1)) mergesort'2#(dd(x2,xs'),x1) -> c_27(mergesort'3#(msplit(dd(x1,dd(x2,xs')))),msplit#(dd(x1,dd(x2,xs')))) mergesort'3#(tuple'2(l1,l2)) -> c_29(merge#(mergesort(l1),mergesort(l2)),mergesort#(l1),mergesort#(l2)) msplit#(l) -> c_30(msplit'1#(l)) msplit'1#(dd(x1,xs)) -> c_31(msplit'2#(xs,x1)) msplit'2#(dd(x2,xs'),x1) -> c_33(msplit'3#(msplit(xs'),x1,x2),msplit#(xs')) - Weak DPs: 'cklt#('EQ()) -> c_1() 'cklt#('GT()) -> c_2() 'cklt#('LT()) -> c_3() 'compare#('0(),'0()) -> c_4() 'compare#('0(),'neg(y)) -> c_5() 'compare#('0(),'pos(y)) -> c_6() 'compare#('0(),'s(y)) -> c_7() 'compare#('neg(x),'0()) -> c_8() 'compare#('neg(x),'pos(y)) -> c_10() 'compare#('pos(x),'0()) -> c_11() 'compare#('pos(x),'neg(y)) -> c_12() 'compare#('s(x),'0()) -> c_14() merge'1#(nil(),l2) -> c_19() merge'2#(nil(),x,xs) -> c_21() mergesort'1#(nil()) -> c_26() mergesort'2#(nil(),x1) -> c_28() msplit'1#(nil()) -> c_32() msplit'2#(nil(),x1) -> c_34() msplit'3#(tuple'2(l1,l2),x1,x2) -> c_35() - Weak TRS: 'cklt('EQ()) -> 'false() 'cklt('GT()) -> 'false() 'cklt('LT()) -> 'true() 'compare('0(),'0()) -> 'EQ() 'compare('0(),'neg(y)) -> 'GT() 'compare('0(),'pos(y)) -> 'LT() 'compare('0(),'s(y)) -> 'LT() 'compare('neg(x),'0()) -> 'LT() 'compare('neg(x),'neg(y)) -> 'compare(y,x) 'compare('neg(x),'pos(y)) -> 'LT() 'compare('pos(x),'0()) -> 'GT() 'compare('pos(x),'neg(y)) -> 'GT() 'compare('pos(x),'pos(y)) -> 'compare(x,y) 'compare('s(x),'0()) -> 'GT() 'compare('s(x),'s(y)) -> 'compare(x,y) 'less(x,y) -> 'cklt('compare(x,y)) merge(l1,l2) -> merge'1(l1,l2) merge'1(dd(x,xs),l2) -> merge'2(l2,x,xs) merge'1(nil(),l2) -> l2 merge'2(dd(y,ys),x,xs) -> merge'3('less(x,y),x,xs,y,ys) merge'2(nil(),x,xs) -> dd(x,xs) merge'3('false(),x,xs,y,ys) -> dd(y,merge(dd(x,xs),ys)) merge'3('true(),x,xs,y,ys) -> dd(x,merge(xs,dd(y,ys))) mergesort(l) -> mergesort'1(l) mergesort'1(dd(x1,xs)) -> mergesort'2(xs,x1) mergesort'1(nil()) -> nil() mergesort'2(dd(x2,xs'),x1) -> mergesort'3(msplit(dd(x1,dd(x2,xs')))) mergesort'2(nil(),x1) -> dd(x1,nil()) mergesort'3(tuple'2(l1,l2)) -> merge(mergesort(l1),mergesort(l2)) msplit(l) -> msplit'1(l) msplit'1(dd(x1,xs)) -> msplit'2(xs,x1) msplit'1(nil()) -> tuple'2(nil(),nil()) msplit'2(dd(x2,xs'),x1) -> msplit'3(msplit(xs'),x1,x2) msplit'2(nil(),x1) -> tuple'2(dd(x1,nil()),nil()) msplit'3(tuple'2(l1,l2),x1,x2) -> tuple'2(dd(x1,l1),dd(x2,l2)) - Signature: {'cklt/1,'compare/2,'less/2,merge/2,merge'1/2,merge'2/3,merge'3/5,mergesort/1,mergesort'1/1,mergesort'2/2 ,mergesort'3/1,msplit/1,msplit'1/1,msplit'2/2,msplit'3/3,'cklt#/1,'compare#/2,'less#/2,merge#/2,merge'1#/2 ,merge'2#/3,merge'3#/5,mergesort#/1,mergesort'1#/1,mergesort'2#/2,mergesort'3#/1,msplit#/1,msplit'1#/1 ,msplit'2#/2,msplit'3#/3} / {'0/0,'EQ/0,'GT/0,'LT/0,'false/0,'neg/1,'pos/1,'s/1,'true/0,dd/2,nil/0,tuple'2/2 ,c_1/0,c_2/0,c_3/0,c_4/0,c_5/0,c_6/0,c_7/0,c_8/0,c_9/1,c_10/0,c_11/0,c_12/0,c_13/1,c_14/0,c_15/1,c_16/2 ,c_17/1,c_18/1,c_19/0,c_20/2,c_21/0,c_22/1,c_23/1,c_24/1,c_25/1,c_26/0,c_27/2,c_28/0,c_29/3,c_30/1,c_31/1 ,c_32/0,c_33/2,c_34/0,c_35/0} - Obligation: innermost runtime complexity wrt. defined symbols {'cklt#,'compare#,'less#,merge#,merge'1#,merge'2#,merge'3# ,mergesort#,mergesort'1#,mergesort'2#,mergesort'3#,msplit#,msplit'1#,msplit'2# ,msplit'3#} and constructors {'0,'EQ,'GT,'LT,'false,'neg,'pos,'s,'true,dd,nil,tuple'2} + Applied Processor: RemoveWeakSuffixes + Details: Consider the dependency graph 1:S:'compare#('neg(x),'neg(y)) -> c_9('compare#(y,x)) -->_1 'compare#('s(x),'s(y)) -> c_15('compare#(x,y)):3 -->_1 'compare#('pos(x),'pos(y)) -> c_13('compare#(x,y)):2 -->_1 'compare#('s(x),'0()) -> c_14():28 -->_1 'compare#('pos(x),'neg(y)) -> c_12():27 -->_1 'compare#('pos(x),'0()) -> c_11():26 -->_1 'compare#('neg(x),'pos(y)) -> c_10():25 -->_1 'compare#('neg(x),'0()) -> c_8():24 -->_1 'compare#('0(),'s(y)) -> c_7():23 -->_1 'compare#('0(),'pos(y)) -> c_6():22 -->_1 'compare#('0(),'neg(y)) -> c_5():21 -->_1 'compare#('0(),'0()) -> c_4():20 -->_1 'compare#('neg(x),'neg(y)) -> c_9('compare#(y,x)):1 2:S:'compare#('pos(x),'pos(y)) -> c_13('compare#(x,y)) -->_1 'compare#('s(x),'s(y)) -> c_15('compare#(x,y)):3 -->_1 'compare#('s(x),'0()) -> c_14():28 -->_1 'compare#('pos(x),'neg(y)) -> c_12():27 -->_1 'compare#('pos(x),'0()) -> c_11():26 -->_1 'compare#('neg(x),'pos(y)) -> c_10():25 -->_1 'compare#('neg(x),'0()) -> c_8():24 -->_1 'compare#('0(),'s(y)) -> c_7():23 -->_1 'compare#('0(),'pos(y)) -> c_6():22 -->_1 'compare#('0(),'neg(y)) -> c_5():21 -->_1 'compare#('0(),'0()) -> c_4():20 -->_1 'compare#('pos(x),'pos(y)) -> c_13('compare#(x,y)):2 -->_1 'compare#('neg(x),'neg(y)) -> c_9('compare#(y,x)):1 3:S:'compare#('s(x),'s(y)) -> c_15('compare#(x,y)) -->_1 'compare#('s(x),'0()) -> c_14():28 -->_1 'compare#('pos(x),'neg(y)) -> c_12():27 -->_1 'compare#('pos(x),'0()) -> c_11():26 -->_1 'compare#('neg(x),'pos(y)) -> c_10():25 -->_1 'compare#('neg(x),'0()) -> c_8():24 -->_1 'compare#('0(),'s(y)) -> c_7():23 -->_1 'compare#('0(),'pos(y)) -> c_6():22 -->_1 'compare#('0(),'neg(y)) -> c_5():21 -->_1 'compare#('0(),'0()) -> c_4():20 -->_1 'compare#('s(x),'s(y)) -> c_15('compare#(x,y)):3 -->_1 'compare#('pos(x),'pos(y)) -> c_13('compare#(x,y)):2 -->_1 'compare#('neg(x),'neg(y)) -> c_9('compare#(y,x)):1 4:S:'less#(x,y) -> c_16('cklt#('compare(x,y)),'compare#(x,y)) -->_2 'compare#('s(x),'0()) -> c_14():28 -->_2 'compare#('pos(x),'neg(y)) -> c_12():27 -->_2 'compare#('pos(x),'0()) -> c_11():26 -->_2 'compare#('neg(x),'pos(y)) -> c_10():25 -->_2 'compare#('neg(x),'0()) -> c_8():24 -->_2 'compare#('0(),'s(y)) -> c_7():23 -->_2 'compare#('0(),'pos(y)) -> c_6():22 -->_2 'compare#('0(),'neg(y)) -> c_5():21 -->_2 'compare#('0(),'0()) -> c_4():20 -->_1 'cklt#('LT()) -> c_3():19 -->_1 'cklt#('GT()) -> c_2():18 -->_1 'cklt#('EQ()) -> c_1():17 -->_2 'compare#('s(x),'s(y)) -> c_15('compare#(x,y)):3 -->_2 'compare#('pos(x),'pos(y)) -> c_13('compare#(x,y)):2 -->_2 'compare#('neg(x),'neg(y)) -> c_9('compare#(y,x)):1 5:S:merge#(l1,l2) -> c_17(merge'1#(l1,l2)) -->_1 merge'1#(dd(x,xs),l2) -> c_18(merge'2#(l2,x,xs)):6 -->_1 merge'1#(nil(),l2) -> c_19():29 6:S:merge'1#(dd(x,xs),l2) -> c_18(merge'2#(l2,x,xs)) -->_1 merge'2#(dd(y,ys),x,xs) -> c_20(merge'3#('less(x,y),x,xs,y,ys),'less#(x,y)):7 -->_1 merge'2#(nil(),x,xs) -> c_21():30 7:S:merge'2#(dd(y,ys),x,xs) -> c_20(merge'3#('less(x,y),x,xs,y,ys),'less#(x,y)) -->_1 merge'3#('true(),x,xs,y,ys) -> c_23(merge#(xs,dd(y,ys))):9 -->_1 merge'3#('false(),x,xs,y,ys) -> c_22(merge#(dd(x,xs),ys)):8 -->_2 'less#(x,y) -> c_16('cklt#('compare(x,y)),'compare#(x,y)):4 8:S:merge'3#('false(),x,xs,y,ys) -> c_22(merge#(dd(x,xs),ys)) -->_1 merge#(l1,l2) -> c_17(merge'1#(l1,l2)):5 9:S:merge'3#('true(),x,xs,y,ys) -> c_23(merge#(xs,dd(y,ys))) -->_1 merge#(l1,l2) -> c_17(merge'1#(l1,l2)):5 10:S:mergesort#(l) -> c_24(mergesort'1#(l)) -->_1 mergesort'1#(dd(x1,xs)) -> c_25(mergesort'2#(xs,x1)):11 -->_1 mergesort'1#(nil()) -> c_26():31 11:S:mergesort'1#(dd(x1,xs)) -> c_25(mergesort'2#(xs,x1)) -->_1 mergesort'2#(dd(x2,xs'),x1) -> c_27(mergesort'3#(msplit(dd(x1,dd(x2,xs')))) ,msplit#(dd(x1,dd(x2,xs')))):12 -->_1 mergesort'2#(nil(),x1) -> c_28():32 12:S:mergesort'2#(dd(x2,xs'),x1) -> c_27(mergesort'3#(msplit(dd(x1,dd(x2,xs')))),msplit#(dd(x1,dd(x2,xs')))) -->_2 msplit#(l) -> c_30(msplit'1#(l)):14 -->_1 mergesort'3#(tuple'2(l1,l2)) -> c_29(merge#(mergesort(l1),mergesort(l2)) ,mergesort#(l1) ,mergesort#(l2)):13 13:S:mergesort'3#(tuple'2(l1,l2)) -> c_29(merge#(mergesort(l1),mergesort(l2)),mergesort#(l1),mergesort#(l2)) -->_3 mergesort#(l) -> c_24(mergesort'1#(l)):10 -->_2 mergesort#(l) -> c_24(mergesort'1#(l)):10 -->_1 merge#(l1,l2) -> c_17(merge'1#(l1,l2)):5 14:S:msplit#(l) -> c_30(msplit'1#(l)) -->_1 msplit'1#(dd(x1,xs)) -> c_31(msplit'2#(xs,x1)):15 -->_1 msplit'1#(nil()) -> c_32():33 15:S:msplit'1#(dd(x1,xs)) -> c_31(msplit'2#(xs,x1)) -->_1 msplit'2#(dd(x2,xs'),x1) -> c_33(msplit'3#(msplit(xs'),x1,x2),msplit#(xs')):16 -->_1 msplit'2#(nil(),x1) -> c_34():34 16:S:msplit'2#(dd(x2,xs'),x1) -> c_33(msplit'3#(msplit(xs'),x1,x2),msplit#(xs')) -->_1 msplit'3#(tuple'2(l1,l2),x1,x2) -> c_35():35 -->_2 msplit#(l) -> c_30(msplit'1#(l)):14 17:W:'cklt#('EQ()) -> c_1() 18:W:'cklt#('GT()) -> c_2() 19:W:'cklt#('LT()) -> c_3() 20:W:'compare#('0(),'0()) -> c_4() 21:W:'compare#('0(),'neg(y)) -> c_5() 22:W:'compare#('0(),'pos(y)) -> c_6() 23:W:'compare#('0(),'s(y)) -> c_7() 24:W:'compare#('neg(x),'0()) -> c_8() 25:W:'compare#('neg(x),'pos(y)) -> c_10() 26:W:'compare#('pos(x),'0()) -> c_11() 27:W:'compare#('pos(x),'neg(y)) -> c_12() 28:W:'compare#('s(x),'0()) -> c_14() 29:W:merge'1#(nil(),l2) -> c_19() 30:W:merge'2#(nil(),x,xs) -> c_21() 31:W:mergesort'1#(nil()) -> c_26() 32:W:mergesort'2#(nil(),x1) -> c_28() 33:W:msplit'1#(nil()) -> c_32() 34:W:msplit'2#(nil(),x1) -> c_34() 35:W:msplit'3#(tuple'2(l1,l2),x1,x2) -> c_35() The following weak DPs constitute a sub-graph of the DG that is closed under successors. The DPs are removed. 31: mergesort'1#(nil()) -> c_26() 32: mergesort'2#(nil(),x1) -> c_28() 33: msplit'1#(nil()) -> c_32() 34: msplit'2#(nil(),x1) -> c_34() 35: msplit'3#(tuple'2(l1,l2),x1,x2) -> c_35() 29: merge'1#(nil(),l2) -> c_19() 30: merge'2#(nil(),x,xs) -> c_21() 17: 'cklt#('EQ()) -> c_1() 18: 'cklt#('GT()) -> c_2() 19: 'cklt#('LT()) -> c_3() 20: 'compare#('0(),'0()) -> c_4() 21: 'compare#('0(),'neg(y)) -> c_5() 22: 'compare#('0(),'pos(y)) -> c_6() 23: 'compare#('0(),'s(y)) -> c_7() 24: 'compare#('neg(x),'0()) -> c_8() 25: 'compare#('neg(x),'pos(y)) -> c_10() 26: 'compare#('pos(x),'0()) -> c_11() 27: 'compare#('pos(x),'neg(y)) -> c_12() 28: 'compare#('s(x),'0()) -> c_14() * Step 4: SimplifyRHS WORST_CASE(?,O(n^3)) + Considered Problem: - Strict DPs: 'compare#('neg(x),'neg(y)) -> c_9('compare#(y,x)) 'compare#('pos(x),'pos(y)) -> c_13('compare#(x,y)) 'compare#('s(x),'s(y)) -> c_15('compare#(x,y)) 'less#(x,y) -> c_16('cklt#('compare(x,y)),'compare#(x,y)) merge#(l1,l2) -> c_17(merge'1#(l1,l2)) merge'1#(dd(x,xs),l2) -> c_18(merge'2#(l2,x,xs)) merge'2#(dd(y,ys),x,xs) -> c_20(merge'3#('less(x,y),x,xs,y,ys),'less#(x,y)) merge'3#('false(),x,xs,y,ys) -> c_22(merge#(dd(x,xs),ys)) merge'3#('true(),x,xs,y,ys) -> c_23(merge#(xs,dd(y,ys))) mergesort#(l) -> c_24(mergesort'1#(l)) mergesort'1#(dd(x1,xs)) -> c_25(mergesort'2#(xs,x1)) mergesort'2#(dd(x2,xs'),x1) -> c_27(mergesort'3#(msplit(dd(x1,dd(x2,xs')))),msplit#(dd(x1,dd(x2,xs')))) mergesort'3#(tuple'2(l1,l2)) -> c_29(merge#(mergesort(l1),mergesort(l2)),mergesort#(l1),mergesort#(l2)) msplit#(l) -> c_30(msplit'1#(l)) msplit'1#(dd(x1,xs)) -> c_31(msplit'2#(xs,x1)) msplit'2#(dd(x2,xs'),x1) -> c_33(msplit'3#(msplit(xs'),x1,x2),msplit#(xs')) - Weak TRS: 'cklt('EQ()) -> 'false() 'cklt('GT()) -> 'false() 'cklt('LT()) -> 'true() 'compare('0(),'0()) -> 'EQ() 'compare('0(),'neg(y)) -> 'GT() 'compare('0(),'pos(y)) -> 'LT() 'compare('0(),'s(y)) -> 'LT() 'compare('neg(x),'0()) -> 'LT() 'compare('neg(x),'neg(y)) -> 'compare(y,x) 'compare('neg(x),'pos(y)) -> 'LT() 'compare('pos(x),'0()) -> 'GT() 'compare('pos(x),'neg(y)) -> 'GT() 'compare('pos(x),'pos(y)) -> 'compare(x,y) 'compare('s(x),'0()) -> 'GT() 'compare('s(x),'s(y)) -> 'compare(x,y) 'less(x,y) -> 'cklt('compare(x,y)) merge(l1,l2) -> merge'1(l1,l2) merge'1(dd(x,xs),l2) -> merge'2(l2,x,xs) merge'1(nil(),l2) -> l2 merge'2(dd(y,ys),x,xs) -> merge'3('less(x,y),x,xs,y,ys) merge'2(nil(),x,xs) -> dd(x,xs) merge'3('false(),x,xs,y,ys) -> dd(y,merge(dd(x,xs),ys)) merge'3('true(),x,xs,y,ys) -> dd(x,merge(xs,dd(y,ys))) mergesort(l) -> mergesort'1(l) mergesort'1(dd(x1,xs)) -> mergesort'2(xs,x1) mergesort'1(nil()) -> nil() mergesort'2(dd(x2,xs'),x1) -> mergesort'3(msplit(dd(x1,dd(x2,xs')))) mergesort'2(nil(),x1) -> dd(x1,nil()) mergesort'3(tuple'2(l1,l2)) -> merge(mergesort(l1),mergesort(l2)) msplit(l) -> msplit'1(l) msplit'1(dd(x1,xs)) -> msplit'2(xs,x1) msplit'1(nil()) -> tuple'2(nil(),nil()) msplit'2(dd(x2,xs'),x1) -> msplit'3(msplit(xs'),x1,x2) msplit'2(nil(),x1) -> tuple'2(dd(x1,nil()),nil()) msplit'3(tuple'2(l1,l2),x1,x2) -> tuple'2(dd(x1,l1),dd(x2,l2)) - Signature: {'cklt/1,'compare/2,'less/2,merge/2,merge'1/2,merge'2/3,merge'3/5,mergesort/1,mergesort'1/1,mergesort'2/2 ,mergesort'3/1,msplit/1,msplit'1/1,msplit'2/2,msplit'3/3,'cklt#/1,'compare#/2,'less#/2,merge#/2,merge'1#/2 ,merge'2#/3,merge'3#/5,mergesort#/1,mergesort'1#/1,mergesort'2#/2,mergesort'3#/1,msplit#/1,msplit'1#/1 ,msplit'2#/2,msplit'3#/3} / {'0/0,'EQ/0,'GT/0,'LT/0,'false/0,'neg/1,'pos/1,'s/1,'true/0,dd/2,nil/0,tuple'2/2 ,c_1/0,c_2/0,c_3/0,c_4/0,c_5/0,c_6/0,c_7/0,c_8/0,c_9/1,c_10/0,c_11/0,c_12/0,c_13/1,c_14/0,c_15/1,c_16/2 ,c_17/1,c_18/1,c_19/0,c_20/2,c_21/0,c_22/1,c_23/1,c_24/1,c_25/1,c_26/0,c_27/2,c_28/0,c_29/3,c_30/1,c_31/1 ,c_32/0,c_33/2,c_34/0,c_35/0} - Obligation: innermost runtime complexity wrt. defined symbols {'cklt#,'compare#,'less#,merge#,merge'1#,merge'2#,merge'3# ,mergesort#,mergesort'1#,mergesort'2#,mergesort'3#,msplit#,msplit'1#,msplit'2# ,msplit'3#} and constructors {'0,'EQ,'GT,'LT,'false,'neg,'pos,'s,'true,dd,nil,tuple'2} + Applied Processor: SimplifyRHS + Details: Consider the dependency graph 1:S:'compare#('neg(x),'neg(y)) -> c_9('compare#(y,x)) -->_1 'compare#('s(x),'s(y)) -> c_15('compare#(x,y)):3 -->_1 'compare#('pos(x),'pos(y)) -> c_13('compare#(x,y)):2 -->_1 'compare#('neg(x),'neg(y)) -> c_9('compare#(y,x)):1 2:S:'compare#('pos(x),'pos(y)) -> c_13('compare#(x,y)) -->_1 'compare#('s(x),'s(y)) -> c_15('compare#(x,y)):3 -->_1 'compare#('pos(x),'pos(y)) -> c_13('compare#(x,y)):2 -->_1 'compare#('neg(x),'neg(y)) -> c_9('compare#(y,x)):1 3:S:'compare#('s(x),'s(y)) -> c_15('compare#(x,y)) -->_1 'compare#('s(x),'s(y)) -> c_15('compare#(x,y)):3 -->_1 'compare#('pos(x),'pos(y)) -> c_13('compare#(x,y)):2 -->_1 'compare#('neg(x),'neg(y)) -> c_9('compare#(y,x)):1 4:S:'less#(x,y) -> c_16('cklt#('compare(x,y)),'compare#(x,y)) -->_2 'compare#('s(x),'s(y)) -> c_15('compare#(x,y)):3 -->_2 'compare#('pos(x),'pos(y)) -> c_13('compare#(x,y)):2 -->_2 'compare#('neg(x),'neg(y)) -> c_9('compare#(y,x)):1 5:S:merge#(l1,l2) -> c_17(merge'1#(l1,l2)) -->_1 merge'1#(dd(x,xs),l2) -> c_18(merge'2#(l2,x,xs)):6 6:S:merge'1#(dd(x,xs),l2) -> c_18(merge'2#(l2,x,xs)) -->_1 merge'2#(dd(y,ys),x,xs) -> c_20(merge'3#('less(x,y),x,xs,y,ys),'less#(x,y)):7 7:S:merge'2#(dd(y,ys),x,xs) -> c_20(merge'3#('less(x,y),x,xs,y,ys),'less#(x,y)) -->_1 merge'3#('true(),x,xs,y,ys) -> c_23(merge#(xs,dd(y,ys))):9 -->_1 merge'3#('false(),x,xs,y,ys) -> c_22(merge#(dd(x,xs),ys)):8 -->_2 'less#(x,y) -> c_16('cklt#('compare(x,y)),'compare#(x,y)):4 8:S:merge'3#('false(),x,xs,y,ys) -> c_22(merge#(dd(x,xs),ys)) -->_1 merge#(l1,l2) -> c_17(merge'1#(l1,l2)):5 9:S:merge'3#('true(),x,xs,y,ys) -> c_23(merge#(xs,dd(y,ys))) -->_1 merge#(l1,l2) -> c_17(merge'1#(l1,l2)):5 10:S:mergesort#(l) -> c_24(mergesort'1#(l)) -->_1 mergesort'1#(dd(x1,xs)) -> c_25(mergesort'2#(xs,x1)):11 11:S:mergesort'1#(dd(x1,xs)) -> c_25(mergesort'2#(xs,x1)) -->_1 mergesort'2#(dd(x2,xs'),x1) -> c_27(mergesort'3#(msplit(dd(x1,dd(x2,xs')))) ,msplit#(dd(x1,dd(x2,xs')))):12 12:S:mergesort'2#(dd(x2,xs'),x1) -> c_27(mergesort'3#(msplit(dd(x1,dd(x2,xs')))),msplit#(dd(x1,dd(x2,xs')))) -->_2 msplit#(l) -> c_30(msplit'1#(l)):14 -->_1 mergesort'3#(tuple'2(l1,l2)) -> c_29(merge#(mergesort(l1),mergesort(l2)) ,mergesort#(l1) ,mergesort#(l2)):13 13:S:mergesort'3#(tuple'2(l1,l2)) -> c_29(merge#(mergesort(l1),mergesort(l2)),mergesort#(l1),mergesort#(l2)) -->_3 mergesort#(l) -> c_24(mergesort'1#(l)):10 -->_2 mergesort#(l) -> c_24(mergesort'1#(l)):10 -->_1 merge#(l1,l2) -> c_17(merge'1#(l1,l2)):5 14:S:msplit#(l) -> c_30(msplit'1#(l)) -->_1 msplit'1#(dd(x1,xs)) -> c_31(msplit'2#(xs,x1)):15 15:S:msplit'1#(dd(x1,xs)) -> c_31(msplit'2#(xs,x1)) -->_1 msplit'2#(dd(x2,xs'),x1) -> c_33(msplit'3#(msplit(xs'),x1,x2),msplit#(xs')):16 16:S:msplit'2#(dd(x2,xs'),x1) -> c_33(msplit'3#(msplit(xs'),x1,x2),msplit#(xs')) -->_2 msplit#(l) -> c_30(msplit'1#(l)):14 Due to missing edges in the depndency graph, the right-hand sides of following rules could be simplified: 'less#(x,y) -> c_16('compare#(x,y)) msplit'2#(dd(x2,xs'),x1) -> c_33(msplit#(xs')) * Step 5: Decompose WORST_CASE(?,O(n^3)) + Considered Problem: - Strict DPs: 'compare#('neg(x),'neg(y)) -> c_9('compare#(y,x)) 'compare#('pos(x),'pos(y)) -> c_13('compare#(x,y)) 'compare#('s(x),'s(y)) -> c_15('compare#(x,y)) 'less#(x,y) -> c_16('compare#(x,y)) merge#(l1,l2) -> c_17(merge'1#(l1,l2)) merge'1#(dd(x,xs),l2) -> c_18(merge'2#(l2,x,xs)) merge'2#(dd(y,ys),x,xs) -> c_20(merge'3#('less(x,y),x,xs,y,ys),'less#(x,y)) merge'3#('false(),x,xs,y,ys) -> c_22(merge#(dd(x,xs),ys)) merge'3#('true(),x,xs,y,ys) -> c_23(merge#(xs,dd(y,ys))) mergesort#(l) -> c_24(mergesort'1#(l)) mergesort'1#(dd(x1,xs)) -> c_25(mergesort'2#(xs,x1)) mergesort'2#(dd(x2,xs'),x1) -> c_27(mergesort'3#(msplit(dd(x1,dd(x2,xs')))),msplit#(dd(x1,dd(x2,xs')))) mergesort'3#(tuple'2(l1,l2)) -> c_29(merge#(mergesort(l1),mergesort(l2)),mergesort#(l1),mergesort#(l2)) msplit#(l) -> c_30(msplit'1#(l)) msplit'1#(dd(x1,xs)) -> c_31(msplit'2#(xs,x1)) msplit'2#(dd(x2,xs'),x1) -> c_33(msplit#(xs')) - Weak TRS: 'cklt('EQ()) -> 'false() 'cklt('GT()) -> 'false() 'cklt('LT()) -> 'true() 'compare('0(),'0()) -> 'EQ() 'compare('0(),'neg(y)) -> 'GT() 'compare('0(),'pos(y)) -> 'LT() 'compare('0(),'s(y)) -> 'LT() 'compare('neg(x),'0()) -> 'LT() 'compare('neg(x),'neg(y)) -> 'compare(y,x) 'compare('neg(x),'pos(y)) -> 'LT() 'compare('pos(x),'0()) -> 'GT() 'compare('pos(x),'neg(y)) -> 'GT() 'compare('pos(x),'pos(y)) -> 'compare(x,y) 'compare('s(x),'0()) -> 'GT() 'compare('s(x),'s(y)) -> 'compare(x,y) 'less(x,y) -> 'cklt('compare(x,y)) merge(l1,l2) -> merge'1(l1,l2) merge'1(dd(x,xs),l2) -> merge'2(l2,x,xs) merge'1(nil(),l2) -> l2 merge'2(dd(y,ys),x,xs) -> merge'3('less(x,y),x,xs,y,ys) merge'2(nil(),x,xs) -> dd(x,xs) merge'3('false(),x,xs,y,ys) -> dd(y,merge(dd(x,xs),ys)) merge'3('true(),x,xs,y,ys) -> dd(x,merge(xs,dd(y,ys))) mergesort(l) -> mergesort'1(l) mergesort'1(dd(x1,xs)) -> mergesort'2(xs,x1) mergesort'1(nil()) -> nil() mergesort'2(dd(x2,xs'),x1) -> mergesort'3(msplit(dd(x1,dd(x2,xs')))) mergesort'2(nil(),x1) -> dd(x1,nil()) mergesort'3(tuple'2(l1,l2)) -> merge(mergesort(l1),mergesort(l2)) msplit(l) -> msplit'1(l) msplit'1(dd(x1,xs)) -> msplit'2(xs,x1) msplit'1(nil()) -> tuple'2(nil(),nil()) msplit'2(dd(x2,xs'),x1) -> msplit'3(msplit(xs'),x1,x2) msplit'2(nil(),x1) -> tuple'2(dd(x1,nil()),nil()) msplit'3(tuple'2(l1,l2),x1,x2) -> tuple'2(dd(x1,l1),dd(x2,l2)) - Signature: {'cklt/1,'compare/2,'less/2,merge/2,merge'1/2,merge'2/3,merge'3/5,mergesort/1,mergesort'1/1,mergesort'2/2 ,mergesort'3/1,msplit/1,msplit'1/1,msplit'2/2,msplit'3/3,'cklt#/1,'compare#/2,'less#/2,merge#/2,merge'1#/2 ,merge'2#/3,merge'3#/5,mergesort#/1,mergesort'1#/1,mergesort'2#/2,mergesort'3#/1,msplit#/1,msplit'1#/1 ,msplit'2#/2,msplit'3#/3} / {'0/0,'EQ/0,'GT/0,'LT/0,'false/0,'neg/1,'pos/1,'s/1,'true/0,dd/2,nil/0,tuple'2/2 ,c_1/0,c_2/0,c_3/0,c_4/0,c_5/0,c_6/0,c_7/0,c_8/0,c_9/1,c_10/0,c_11/0,c_12/0,c_13/1,c_14/0,c_15/1,c_16/1 ,c_17/1,c_18/1,c_19/0,c_20/2,c_21/0,c_22/1,c_23/1,c_24/1,c_25/1,c_26/0,c_27/2,c_28/0,c_29/3,c_30/1,c_31/1 ,c_32/0,c_33/1,c_34/0,c_35/0} - Obligation: innermost runtime complexity wrt. defined symbols {'cklt#,'compare#,'less#,merge#,merge'1#,merge'2#,merge'3# ,mergesort#,mergesort'1#,mergesort'2#,mergesort'3#,msplit#,msplit'1#,msplit'2# ,msplit'3#} and constructors {'0,'EQ,'GT,'LT,'false,'neg,'pos,'s,'true,dd,nil,tuple'2} + Applied Processor: Decompose {onSelection = all cycle independent sub-graph, withBound = RelativeAdd} + Details: We analyse the complexity of following sub-problems (R) and (S). Problem (S) is obtained from the input problem by shifting strict rules from (R) into the weak component. Problem (R) - Strict DPs: 'compare#('neg(x),'neg(y)) -> c_9('compare#(y,x)) 'compare#('pos(x),'pos(y)) -> c_13('compare#(x,y)) 'compare#('s(x),'s(y)) -> c_15('compare#(x,y)) - Weak DPs: 'less#(x,y) -> c_16('compare#(x,y)) merge#(l1,l2) -> c_17(merge'1#(l1,l2)) merge'1#(dd(x,xs),l2) -> c_18(merge'2#(l2,x,xs)) merge'2#(dd(y,ys),x,xs) -> c_20(merge'3#('less(x,y),x,xs,y,ys),'less#(x,y)) merge'3#('false(),x,xs,y,ys) -> c_22(merge#(dd(x,xs),ys)) merge'3#('true(),x,xs,y,ys) -> c_23(merge#(xs,dd(y,ys))) mergesort#(l) -> c_24(mergesort'1#(l)) mergesort'1#(dd(x1,xs)) -> c_25(mergesort'2#(xs,x1)) mergesort'2#(dd(x2,xs'),x1) -> c_27(mergesort'3#(msplit(dd(x1,dd(x2,xs')))),msplit#(dd(x1,dd(x2,xs')))) mergesort'3#(tuple'2(l1,l2)) -> c_29(merge#(mergesort(l1),mergesort(l2)),mergesort#(l1),mergesort#(l2)) msplit#(l) -> c_30(msplit'1#(l)) msplit'1#(dd(x1,xs)) -> c_31(msplit'2#(xs,x1)) msplit'2#(dd(x2,xs'),x1) -> c_33(msplit#(xs')) - Weak TRS: 'cklt('EQ()) -> 'false() 'cklt('GT()) -> 'false() 'cklt('LT()) -> 'true() 'compare('0(),'0()) -> 'EQ() 'compare('0(),'neg(y)) -> 'GT() 'compare('0(),'pos(y)) -> 'LT() 'compare('0(),'s(y)) -> 'LT() 'compare('neg(x),'0()) -> 'LT() 'compare('neg(x),'neg(y)) -> 'compare(y,x) 'compare('neg(x),'pos(y)) -> 'LT() 'compare('pos(x),'0()) -> 'GT() 'compare('pos(x),'neg(y)) -> 'GT() 'compare('pos(x),'pos(y)) -> 'compare(x,y) 'compare('s(x),'0()) -> 'GT() 'compare('s(x),'s(y)) -> 'compare(x,y) 'less(x,y) -> 'cklt('compare(x,y)) merge(l1,l2) -> merge'1(l1,l2) merge'1(dd(x,xs),l2) -> merge'2(l2,x,xs) merge'1(nil(),l2) -> l2 merge'2(dd(y,ys),x,xs) -> merge'3('less(x,y),x,xs,y,ys) merge'2(nil(),x,xs) -> dd(x,xs) merge'3('false(),x,xs,y,ys) -> dd(y,merge(dd(x,xs),ys)) merge'3('true(),x,xs,y,ys) -> dd(x,merge(xs,dd(y,ys))) mergesort(l) -> mergesort'1(l) mergesort'1(dd(x1,xs)) -> mergesort'2(xs,x1) mergesort'1(nil()) -> nil() mergesort'2(dd(x2,xs'),x1) -> mergesort'3(msplit(dd(x1,dd(x2,xs')))) mergesort'2(nil(),x1) -> dd(x1,nil()) mergesort'3(tuple'2(l1,l2)) -> merge(mergesort(l1),mergesort(l2)) msplit(l) -> msplit'1(l) msplit'1(dd(x1,xs)) -> msplit'2(xs,x1) msplit'1(nil()) -> tuple'2(nil(),nil()) msplit'2(dd(x2,xs'),x1) -> msplit'3(msplit(xs'),x1,x2) msplit'2(nil(),x1) -> tuple'2(dd(x1,nil()),nil()) msplit'3(tuple'2(l1,l2),x1,x2) -> tuple'2(dd(x1,l1),dd(x2,l2)) - Signature: {'cklt/1,'compare/2,'less/2,merge/2,merge'1/2,merge'2/3,merge'3/5,mergesort/1,mergesort'1/1,mergesort'2/2 ,mergesort'3/1,msplit/1,msplit'1/1,msplit'2/2,msplit'3/3,'cklt#/1,'compare#/2,'less#/2,merge#/2,merge'1#/2 ,merge'2#/3,merge'3#/5,mergesort#/1,mergesort'1#/1,mergesort'2#/2,mergesort'3#/1,msplit#/1,msplit'1#/1 ,msplit'2#/2,msplit'3#/3} / {'0/0,'EQ/0,'GT/0,'LT/0,'false/0,'neg/1,'pos/1,'s/1,'true/0,dd/2,nil/0 ,tuple'2/2,c_1/0,c_2/0,c_3/0,c_4/0,c_5/0,c_6/0,c_7/0,c_8/0,c_9/1,c_10/0,c_11/0,c_12/0,c_13/1,c_14/0,c_15/1 ,c_16/1,c_17/1,c_18/1,c_19/0,c_20/2,c_21/0,c_22/1,c_23/1,c_24/1,c_25/1,c_26/0,c_27/2,c_28/0,c_29/3,c_30/1 ,c_31/1,c_32/0,c_33/1,c_34/0,c_35/0} - Obligation: innermost runtime complexity wrt. defined symbols {'cklt#,'compare#,'less#,merge#,merge'1#,merge'2# ,merge'3#,mergesort#,mergesort'1#,mergesort'2#,mergesort'3#,msplit#,msplit'1#,msplit'2# ,msplit'3#} and constructors {'0,'EQ,'GT,'LT,'false,'neg,'pos,'s,'true,dd,nil,tuple'2} Problem (S) - Strict DPs: 'less#(x,y) -> c_16('compare#(x,y)) merge#(l1,l2) -> c_17(merge'1#(l1,l2)) merge'1#(dd(x,xs),l2) -> c_18(merge'2#(l2,x,xs)) merge'2#(dd(y,ys),x,xs) -> c_20(merge'3#('less(x,y),x,xs,y,ys),'less#(x,y)) merge'3#('false(),x,xs,y,ys) -> c_22(merge#(dd(x,xs),ys)) merge'3#('true(),x,xs,y,ys) -> c_23(merge#(xs,dd(y,ys))) mergesort#(l) -> c_24(mergesort'1#(l)) mergesort'1#(dd(x1,xs)) -> c_25(mergesort'2#(xs,x1)) mergesort'2#(dd(x2,xs'),x1) -> c_27(mergesort'3#(msplit(dd(x1,dd(x2,xs')))),msplit#(dd(x1,dd(x2,xs')))) mergesort'3#(tuple'2(l1,l2)) -> c_29(merge#(mergesort(l1),mergesort(l2)),mergesort#(l1),mergesort#(l2)) msplit#(l) -> c_30(msplit'1#(l)) msplit'1#(dd(x1,xs)) -> c_31(msplit'2#(xs,x1)) msplit'2#(dd(x2,xs'),x1) -> c_33(msplit#(xs')) - Weak DPs: 'compare#('neg(x),'neg(y)) -> c_9('compare#(y,x)) 'compare#('pos(x),'pos(y)) -> c_13('compare#(x,y)) 'compare#('s(x),'s(y)) -> c_15('compare#(x,y)) - Weak TRS: 'cklt('EQ()) -> 'false() 'cklt('GT()) -> 'false() 'cklt('LT()) -> 'true() 'compare('0(),'0()) -> 'EQ() 'compare('0(),'neg(y)) -> 'GT() 'compare('0(),'pos(y)) -> 'LT() 'compare('0(),'s(y)) -> 'LT() 'compare('neg(x),'0()) -> 'LT() 'compare('neg(x),'neg(y)) -> 'compare(y,x) 'compare('neg(x),'pos(y)) -> 'LT() 'compare('pos(x),'0()) -> 'GT() 'compare('pos(x),'neg(y)) -> 'GT() 'compare('pos(x),'pos(y)) -> 'compare(x,y) 'compare('s(x),'0()) -> 'GT() 'compare('s(x),'s(y)) -> 'compare(x,y) 'less(x,y) -> 'cklt('compare(x,y)) merge(l1,l2) -> merge'1(l1,l2) merge'1(dd(x,xs),l2) -> merge'2(l2,x,xs) merge'1(nil(),l2) -> l2 merge'2(dd(y,ys),x,xs) -> merge'3('less(x,y),x,xs,y,ys) merge'2(nil(),x,xs) -> dd(x,xs) merge'3('false(),x,xs,y,ys) -> dd(y,merge(dd(x,xs),ys)) merge'3('true(),x,xs,y,ys) -> dd(x,merge(xs,dd(y,ys))) mergesort(l) -> mergesort'1(l) mergesort'1(dd(x1,xs)) -> mergesort'2(xs,x1) mergesort'1(nil()) -> nil() mergesort'2(dd(x2,xs'),x1) -> mergesort'3(msplit(dd(x1,dd(x2,xs')))) mergesort'2(nil(),x1) -> dd(x1,nil()) mergesort'3(tuple'2(l1,l2)) -> merge(mergesort(l1),mergesort(l2)) msplit(l) -> msplit'1(l) msplit'1(dd(x1,xs)) -> msplit'2(xs,x1) msplit'1(nil()) -> tuple'2(nil(),nil()) msplit'2(dd(x2,xs'),x1) -> msplit'3(msplit(xs'),x1,x2) msplit'2(nil(),x1) -> tuple'2(dd(x1,nil()),nil()) msplit'3(tuple'2(l1,l2),x1,x2) -> tuple'2(dd(x1,l1),dd(x2,l2)) - Signature: {'cklt/1,'compare/2,'less/2,merge/2,merge'1/2,merge'2/3,merge'3/5,mergesort/1,mergesort'1/1,mergesort'2/2 ,mergesort'3/1,msplit/1,msplit'1/1,msplit'2/2,msplit'3/3,'cklt#/1,'compare#/2,'less#/2,merge#/2,merge'1#/2 ,merge'2#/3,merge'3#/5,mergesort#/1,mergesort'1#/1,mergesort'2#/2,mergesort'3#/1,msplit#/1,msplit'1#/1 ,msplit'2#/2,msplit'3#/3} / {'0/0,'EQ/0,'GT/0,'LT/0,'false/0,'neg/1,'pos/1,'s/1,'true/0,dd/2,nil/0 ,tuple'2/2,c_1/0,c_2/0,c_3/0,c_4/0,c_5/0,c_6/0,c_7/0,c_8/0,c_9/1,c_10/0,c_11/0,c_12/0,c_13/1,c_14/0,c_15/1 ,c_16/1,c_17/1,c_18/1,c_19/0,c_20/2,c_21/0,c_22/1,c_23/1,c_24/1,c_25/1,c_26/0,c_27/2,c_28/0,c_29/3,c_30/1 ,c_31/1,c_32/0,c_33/1,c_34/0,c_35/0} - Obligation: innermost runtime complexity wrt. defined symbols {'cklt#,'compare#,'less#,merge#,merge'1#,merge'2# ,merge'3#,mergesort#,mergesort'1#,mergesort'2#,mergesort'3#,msplit#,msplit'1#,msplit'2# ,msplit'3#} and constructors {'0,'EQ,'GT,'LT,'false,'neg,'pos,'s,'true,dd,nil,tuple'2} ** Step 5.a:1: RemoveWeakSuffixes WORST_CASE(?,O(n^3)) + Considered Problem: - Strict DPs: 'compare#('neg(x),'neg(y)) -> c_9('compare#(y,x)) 'compare#('pos(x),'pos(y)) -> c_13('compare#(x,y)) 'compare#('s(x),'s(y)) -> c_15('compare#(x,y)) - Weak DPs: 'less#(x,y) -> c_16('compare#(x,y)) merge#(l1,l2) -> c_17(merge'1#(l1,l2)) merge'1#(dd(x,xs),l2) -> c_18(merge'2#(l2,x,xs)) merge'2#(dd(y,ys),x,xs) -> c_20(merge'3#('less(x,y),x,xs,y,ys),'less#(x,y)) merge'3#('false(),x,xs,y,ys) -> c_22(merge#(dd(x,xs),ys)) merge'3#('true(),x,xs,y,ys) -> c_23(merge#(xs,dd(y,ys))) mergesort#(l) -> c_24(mergesort'1#(l)) mergesort'1#(dd(x1,xs)) -> c_25(mergesort'2#(xs,x1)) mergesort'2#(dd(x2,xs'),x1) -> c_27(mergesort'3#(msplit(dd(x1,dd(x2,xs')))),msplit#(dd(x1,dd(x2,xs')))) mergesort'3#(tuple'2(l1,l2)) -> c_29(merge#(mergesort(l1),mergesort(l2)),mergesort#(l1),mergesort#(l2)) msplit#(l) -> c_30(msplit'1#(l)) msplit'1#(dd(x1,xs)) -> c_31(msplit'2#(xs,x1)) msplit'2#(dd(x2,xs'),x1) -> c_33(msplit#(xs')) - Weak TRS: 'cklt('EQ()) -> 'false() 'cklt('GT()) -> 'false() 'cklt('LT()) -> 'true() 'compare('0(),'0()) -> 'EQ() 'compare('0(),'neg(y)) -> 'GT() 'compare('0(),'pos(y)) -> 'LT() 'compare('0(),'s(y)) -> 'LT() 'compare('neg(x),'0()) -> 'LT() 'compare('neg(x),'neg(y)) -> 'compare(y,x) 'compare('neg(x),'pos(y)) -> 'LT() 'compare('pos(x),'0()) -> 'GT() 'compare('pos(x),'neg(y)) -> 'GT() 'compare('pos(x),'pos(y)) -> 'compare(x,y) 'compare('s(x),'0()) -> 'GT() 'compare('s(x),'s(y)) -> 'compare(x,y) 'less(x,y) -> 'cklt('compare(x,y)) merge(l1,l2) -> merge'1(l1,l2) merge'1(dd(x,xs),l2) -> merge'2(l2,x,xs) merge'1(nil(),l2) -> l2 merge'2(dd(y,ys),x,xs) -> merge'3('less(x,y),x,xs,y,ys) merge'2(nil(),x,xs) -> dd(x,xs) merge'3('false(),x,xs,y,ys) -> dd(y,merge(dd(x,xs),ys)) merge'3('true(),x,xs,y,ys) -> dd(x,merge(xs,dd(y,ys))) mergesort(l) -> mergesort'1(l) mergesort'1(dd(x1,xs)) -> mergesort'2(xs,x1) mergesort'1(nil()) -> nil() mergesort'2(dd(x2,xs'),x1) -> mergesort'3(msplit(dd(x1,dd(x2,xs')))) mergesort'2(nil(),x1) -> dd(x1,nil()) mergesort'3(tuple'2(l1,l2)) -> merge(mergesort(l1),mergesort(l2)) msplit(l) -> msplit'1(l) msplit'1(dd(x1,xs)) -> msplit'2(xs,x1) msplit'1(nil()) -> tuple'2(nil(),nil()) msplit'2(dd(x2,xs'),x1) -> msplit'3(msplit(xs'),x1,x2) msplit'2(nil(),x1) -> tuple'2(dd(x1,nil()),nil()) msplit'3(tuple'2(l1,l2),x1,x2) -> tuple'2(dd(x1,l1),dd(x2,l2)) - Signature: {'cklt/1,'compare/2,'less/2,merge/2,merge'1/2,merge'2/3,merge'3/5,mergesort/1,mergesort'1/1,mergesort'2/2 ,mergesort'3/1,msplit/1,msplit'1/1,msplit'2/2,msplit'3/3,'cklt#/1,'compare#/2,'less#/2,merge#/2,merge'1#/2 ,merge'2#/3,merge'3#/5,mergesort#/1,mergesort'1#/1,mergesort'2#/2,mergesort'3#/1,msplit#/1,msplit'1#/1 ,msplit'2#/2,msplit'3#/3} / {'0/0,'EQ/0,'GT/0,'LT/0,'false/0,'neg/1,'pos/1,'s/1,'true/0,dd/2,nil/0,tuple'2/2 ,c_1/0,c_2/0,c_3/0,c_4/0,c_5/0,c_6/0,c_7/0,c_8/0,c_9/1,c_10/0,c_11/0,c_12/0,c_13/1,c_14/0,c_15/1,c_16/1 ,c_17/1,c_18/1,c_19/0,c_20/2,c_21/0,c_22/1,c_23/1,c_24/1,c_25/1,c_26/0,c_27/2,c_28/0,c_29/3,c_30/1,c_31/1 ,c_32/0,c_33/1,c_34/0,c_35/0} - Obligation: innermost runtime complexity wrt. defined symbols {'cklt#,'compare#,'less#,merge#,merge'1#,merge'2#,merge'3# ,mergesort#,mergesort'1#,mergesort'2#,mergesort'3#,msplit#,msplit'1#,msplit'2# ,msplit'3#} and constructors {'0,'EQ,'GT,'LT,'false,'neg,'pos,'s,'true,dd,nil,tuple'2} + Applied Processor: RemoveWeakSuffixes + Details: Consider the dependency graph 1:S:'compare#('neg(x),'neg(y)) -> c_9('compare#(y,x)) -->_1 'compare#('s(x),'s(y)) -> c_15('compare#(x,y)):3 -->_1 'compare#('pos(x),'pos(y)) -> c_13('compare#(x,y)):2 -->_1 'compare#('neg(x),'neg(y)) -> c_9('compare#(y,x)):1 2:S:'compare#('pos(x),'pos(y)) -> c_13('compare#(x,y)) -->_1 'compare#('neg(x),'neg(y)) -> c_9('compare#(y,x)):1 -->_1 'compare#('s(x),'s(y)) -> c_15('compare#(x,y)):3 -->_1 'compare#('pos(x),'pos(y)) -> c_13('compare#(x,y)):2 3:S:'compare#('s(x),'s(y)) -> c_15('compare#(x,y)) -->_1 'compare#('neg(x),'neg(y)) -> c_9('compare#(y,x)):1 -->_1 'compare#('pos(x),'pos(y)) -> c_13('compare#(x,y)):2 -->_1 'compare#('s(x),'s(y)) -> c_15('compare#(x,y)):3 4:W:'less#(x,y) -> c_16('compare#(x,y)) -->_1 'compare#('neg(x),'neg(y)) -> c_9('compare#(y,x)):1 -->_1 'compare#('pos(x),'pos(y)) -> c_13('compare#(x,y)):2 -->_1 'compare#('s(x),'s(y)) -> c_15('compare#(x,y)):3 5:W:merge#(l1,l2) -> c_17(merge'1#(l1,l2)) -->_1 merge'1#(dd(x,xs),l2) -> c_18(merge'2#(l2,x,xs)):6 6:W:merge'1#(dd(x,xs),l2) -> c_18(merge'2#(l2,x,xs)) -->_1 merge'2#(dd(y,ys),x,xs) -> c_20(merge'3#('less(x,y),x,xs,y,ys),'less#(x,y)):7 7:W:merge'2#(dd(y,ys),x,xs) -> c_20(merge'3#('less(x,y),x,xs,y,ys),'less#(x,y)) -->_2 'less#(x,y) -> c_16('compare#(x,y)):4 -->_1 merge'3#('true(),x,xs,y,ys) -> c_23(merge#(xs,dd(y,ys))):9 -->_1 merge'3#('false(),x,xs,y,ys) -> c_22(merge#(dd(x,xs),ys)):8 8:W:merge'3#('false(),x,xs,y,ys) -> c_22(merge#(dd(x,xs),ys)) -->_1 merge#(l1,l2) -> c_17(merge'1#(l1,l2)):5 9:W:merge'3#('true(),x,xs,y,ys) -> c_23(merge#(xs,dd(y,ys))) -->_1 merge#(l1,l2) -> c_17(merge'1#(l1,l2)):5 10:W:mergesort#(l) -> c_24(mergesort'1#(l)) -->_1 mergesort'1#(dd(x1,xs)) -> c_25(mergesort'2#(xs,x1)):11 11:W:mergesort'1#(dd(x1,xs)) -> c_25(mergesort'2#(xs,x1)) -->_1 mergesort'2#(dd(x2,xs'),x1) -> c_27(mergesort'3#(msplit(dd(x1,dd(x2,xs')))) ,msplit#(dd(x1,dd(x2,xs')))):12 12:W:mergesort'2#(dd(x2,xs'),x1) -> c_27(mergesort'3#(msplit(dd(x1,dd(x2,xs')))),msplit#(dd(x1,dd(x2,xs')))) -->_2 msplit#(l) -> c_30(msplit'1#(l)):14 -->_1 mergesort'3#(tuple'2(l1,l2)) -> c_29(merge#(mergesort(l1),mergesort(l2)) ,mergesort#(l1) ,mergesort#(l2)):13 13:W:mergesort'3#(tuple'2(l1,l2)) -> c_29(merge#(mergesort(l1),mergesort(l2)),mergesort#(l1),mergesort#(l2)) -->_1 merge#(l1,l2) -> c_17(merge'1#(l1,l2)):5 -->_3 mergesort#(l) -> c_24(mergesort'1#(l)):10 -->_2 mergesort#(l) -> c_24(mergesort'1#(l)):10 14:W:msplit#(l) -> c_30(msplit'1#(l)) -->_1 msplit'1#(dd(x1,xs)) -> c_31(msplit'2#(xs,x1)):15 15:W:msplit'1#(dd(x1,xs)) -> c_31(msplit'2#(xs,x1)) -->_1 msplit'2#(dd(x2,xs'),x1) -> c_33(msplit#(xs')):16 16:W:msplit'2#(dd(x2,xs'),x1) -> c_33(msplit#(xs')) -->_1 msplit#(l) -> c_30(msplit'1#(l)):14 The following weak DPs constitute a sub-graph of the DG that is closed under successors. The DPs are removed. 14: msplit#(l) -> c_30(msplit'1#(l)) 16: msplit'2#(dd(x2,xs'),x1) -> c_33(msplit#(xs')) 15: msplit'1#(dd(x1,xs)) -> c_31(msplit'2#(xs,x1)) ** Step 5.a:2: SimplifyRHS WORST_CASE(?,O(n^3)) + Considered Problem: - Strict DPs: 'compare#('neg(x),'neg(y)) -> c_9('compare#(y,x)) 'compare#('pos(x),'pos(y)) -> c_13('compare#(x,y)) 'compare#('s(x),'s(y)) -> c_15('compare#(x,y)) - Weak DPs: 'less#(x,y) -> c_16('compare#(x,y)) merge#(l1,l2) -> c_17(merge'1#(l1,l2)) merge'1#(dd(x,xs),l2) -> c_18(merge'2#(l2,x,xs)) merge'2#(dd(y,ys),x,xs) -> c_20(merge'3#('less(x,y),x,xs,y,ys),'less#(x,y)) merge'3#('false(),x,xs,y,ys) -> c_22(merge#(dd(x,xs),ys)) merge'3#('true(),x,xs,y,ys) -> c_23(merge#(xs,dd(y,ys))) mergesort#(l) -> c_24(mergesort'1#(l)) mergesort'1#(dd(x1,xs)) -> c_25(mergesort'2#(xs,x1)) mergesort'2#(dd(x2,xs'),x1) -> c_27(mergesort'3#(msplit(dd(x1,dd(x2,xs')))),msplit#(dd(x1,dd(x2,xs')))) mergesort'3#(tuple'2(l1,l2)) -> c_29(merge#(mergesort(l1),mergesort(l2)),mergesort#(l1),mergesort#(l2)) - Weak TRS: 'cklt('EQ()) -> 'false() 'cklt('GT()) -> 'false() 'cklt('LT()) -> 'true() 'compare('0(),'0()) -> 'EQ() 'compare('0(),'neg(y)) -> 'GT() 'compare('0(),'pos(y)) -> 'LT() 'compare('0(),'s(y)) -> 'LT() 'compare('neg(x),'0()) -> 'LT() 'compare('neg(x),'neg(y)) -> 'compare(y,x) 'compare('neg(x),'pos(y)) -> 'LT() 'compare('pos(x),'0()) -> 'GT() 'compare('pos(x),'neg(y)) -> 'GT() 'compare('pos(x),'pos(y)) -> 'compare(x,y) 'compare('s(x),'0()) -> 'GT() 'compare('s(x),'s(y)) -> 'compare(x,y) 'less(x,y) -> 'cklt('compare(x,y)) merge(l1,l2) -> merge'1(l1,l2) merge'1(dd(x,xs),l2) -> merge'2(l2,x,xs) merge'1(nil(),l2) -> l2 merge'2(dd(y,ys),x,xs) -> merge'3('less(x,y),x,xs,y,ys) merge'2(nil(),x,xs) -> dd(x,xs) merge'3('false(),x,xs,y,ys) -> dd(y,merge(dd(x,xs),ys)) merge'3('true(),x,xs,y,ys) -> dd(x,merge(xs,dd(y,ys))) mergesort(l) -> mergesort'1(l) mergesort'1(dd(x1,xs)) -> mergesort'2(xs,x1) mergesort'1(nil()) -> nil() mergesort'2(dd(x2,xs'),x1) -> mergesort'3(msplit(dd(x1,dd(x2,xs')))) mergesort'2(nil(),x1) -> dd(x1,nil()) mergesort'3(tuple'2(l1,l2)) -> merge(mergesort(l1),mergesort(l2)) msplit(l) -> msplit'1(l) msplit'1(dd(x1,xs)) -> msplit'2(xs,x1) msplit'1(nil()) -> tuple'2(nil(),nil()) msplit'2(dd(x2,xs'),x1) -> msplit'3(msplit(xs'),x1,x2) msplit'2(nil(),x1) -> tuple'2(dd(x1,nil()),nil()) msplit'3(tuple'2(l1,l2),x1,x2) -> tuple'2(dd(x1,l1),dd(x2,l2)) - Signature: {'cklt/1,'compare/2,'less/2,merge/2,merge'1/2,merge'2/3,merge'3/5,mergesort/1,mergesort'1/1,mergesort'2/2 ,mergesort'3/1,msplit/1,msplit'1/1,msplit'2/2,msplit'3/3,'cklt#/1,'compare#/2,'less#/2,merge#/2,merge'1#/2 ,merge'2#/3,merge'3#/5,mergesort#/1,mergesort'1#/1,mergesort'2#/2,mergesort'3#/1,msplit#/1,msplit'1#/1 ,msplit'2#/2,msplit'3#/3} / {'0/0,'EQ/0,'GT/0,'LT/0,'false/0,'neg/1,'pos/1,'s/1,'true/0,dd/2,nil/0,tuple'2/2 ,c_1/0,c_2/0,c_3/0,c_4/0,c_5/0,c_6/0,c_7/0,c_8/0,c_9/1,c_10/0,c_11/0,c_12/0,c_13/1,c_14/0,c_15/1,c_16/1 ,c_17/1,c_18/1,c_19/0,c_20/2,c_21/0,c_22/1,c_23/1,c_24/1,c_25/1,c_26/0,c_27/2,c_28/0,c_29/3,c_30/1,c_31/1 ,c_32/0,c_33/1,c_34/0,c_35/0} - Obligation: innermost runtime complexity wrt. defined symbols {'cklt#,'compare#,'less#,merge#,merge'1#,merge'2#,merge'3# ,mergesort#,mergesort'1#,mergesort'2#,mergesort'3#,msplit#,msplit'1#,msplit'2# ,msplit'3#} and constructors {'0,'EQ,'GT,'LT,'false,'neg,'pos,'s,'true,dd,nil,tuple'2} + Applied Processor: SimplifyRHS + Details: Consider the dependency graph 1:S:'compare#('neg(x),'neg(y)) -> c_9('compare#(y,x)) -->_1 'compare#('s(x),'s(y)) -> c_15('compare#(x,y)):3 -->_1 'compare#('pos(x),'pos(y)) -> c_13('compare#(x,y)):2 -->_1 'compare#('neg(x),'neg(y)) -> c_9('compare#(y,x)):1 2:S:'compare#('pos(x),'pos(y)) -> c_13('compare#(x,y)) -->_1 'compare#('neg(x),'neg(y)) -> c_9('compare#(y,x)):1 -->_1 'compare#('s(x),'s(y)) -> c_15('compare#(x,y)):3 -->_1 'compare#('pos(x),'pos(y)) -> c_13('compare#(x,y)):2 3:S:'compare#('s(x),'s(y)) -> c_15('compare#(x,y)) -->_1 'compare#('neg(x),'neg(y)) -> c_9('compare#(y,x)):1 -->_1 'compare#('pos(x),'pos(y)) -> c_13('compare#(x,y)):2 -->_1 'compare#('s(x),'s(y)) -> c_15('compare#(x,y)):3 4:W:'less#(x,y) -> c_16('compare#(x,y)) -->_1 'compare#('neg(x),'neg(y)) -> c_9('compare#(y,x)):1 -->_1 'compare#('pos(x),'pos(y)) -> c_13('compare#(x,y)):2 -->_1 'compare#('s(x),'s(y)) -> c_15('compare#(x,y)):3 5:W:merge#(l1,l2) -> c_17(merge'1#(l1,l2)) -->_1 merge'1#(dd(x,xs),l2) -> c_18(merge'2#(l2,x,xs)):6 6:W:merge'1#(dd(x,xs),l2) -> c_18(merge'2#(l2,x,xs)) -->_1 merge'2#(dd(y,ys),x,xs) -> c_20(merge'3#('less(x,y),x,xs,y,ys),'less#(x,y)):7 7:W:merge'2#(dd(y,ys),x,xs) -> c_20(merge'3#('less(x,y),x,xs,y,ys),'less#(x,y)) -->_2 'less#(x,y) -> c_16('compare#(x,y)):4 -->_1 merge'3#('true(),x,xs,y,ys) -> c_23(merge#(xs,dd(y,ys))):9 -->_1 merge'3#('false(),x,xs,y,ys) -> c_22(merge#(dd(x,xs),ys)):8 8:W:merge'3#('false(),x,xs,y,ys) -> c_22(merge#(dd(x,xs),ys)) -->_1 merge#(l1,l2) -> c_17(merge'1#(l1,l2)):5 9:W:merge'3#('true(),x,xs,y,ys) -> c_23(merge#(xs,dd(y,ys))) -->_1 merge#(l1,l2) -> c_17(merge'1#(l1,l2)):5 10:W:mergesort#(l) -> c_24(mergesort'1#(l)) -->_1 mergesort'1#(dd(x1,xs)) -> c_25(mergesort'2#(xs,x1)):11 11:W:mergesort'1#(dd(x1,xs)) -> c_25(mergesort'2#(xs,x1)) -->_1 mergesort'2#(dd(x2,xs'),x1) -> c_27(mergesort'3#(msplit(dd(x1,dd(x2,xs')))) ,msplit#(dd(x1,dd(x2,xs')))):12 12:W:mergesort'2#(dd(x2,xs'),x1) -> c_27(mergesort'3#(msplit(dd(x1,dd(x2,xs')))),msplit#(dd(x1,dd(x2,xs')))) -->_1 mergesort'3#(tuple'2(l1,l2)) -> c_29(merge#(mergesort(l1),mergesort(l2)) ,mergesort#(l1) ,mergesort#(l2)):13 13:W:mergesort'3#(tuple'2(l1,l2)) -> c_29(merge#(mergesort(l1),mergesort(l2)),mergesort#(l1),mergesort#(l2)) -->_1 merge#(l1,l2) -> c_17(merge'1#(l1,l2)):5 -->_3 mergesort#(l) -> c_24(mergesort'1#(l)):10 -->_2 mergesort#(l) -> c_24(mergesort'1#(l)):10 Due to missing edges in the depndency graph, the right-hand sides of following rules could be simplified: mergesort'2#(dd(x2,xs'),x1) -> c_27(mergesort'3#(msplit(dd(x1,dd(x2,xs'))))) ** Step 5.a:3: DecomposeDG WORST_CASE(?,O(n^3)) + Considered Problem: - Strict DPs: 'compare#('neg(x),'neg(y)) -> c_9('compare#(y,x)) 'compare#('pos(x),'pos(y)) -> c_13('compare#(x,y)) 'compare#('s(x),'s(y)) -> c_15('compare#(x,y)) - Weak DPs: 'less#(x,y) -> c_16('compare#(x,y)) merge#(l1,l2) -> c_17(merge'1#(l1,l2)) merge'1#(dd(x,xs),l2) -> c_18(merge'2#(l2,x,xs)) merge'2#(dd(y,ys),x,xs) -> c_20(merge'3#('less(x,y),x,xs,y,ys),'less#(x,y)) merge'3#('false(),x,xs,y,ys) -> c_22(merge#(dd(x,xs),ys)) merge'3#('true(),x,xs,y,ys) -> c_23(merge#(xs,dd(y,ys))) mergesort#(l) -> c_24(mergesort'1#(l)) mergesort'1#(dd(x1,xs)) -> c_25(mergesort'2#(xs,x1)) mergesort'2#(dd(x2,xs'),x1) -> c_27(mergesort'3#(msplit(dd(x1,dd(x2,xs'))))) mergesort'3#(tuple'2(l1,l2)) -> c_29(merge#(mergesort(l1),mergesort(l2)),mergesort#(l1),mergesort#(l2)) - Weak TRS: 'cklt('EQ()) -> 'false() 'cklt('GT()) -> 'false() 'cklt('LT()) -> 'true() 'compare('0(),'0()) -> 'EQ() 'compare('0(),'neg(y)) -> 'GT() 'compare('0(),'pos(y)) -> 'LT() 'compare('0(),'s(y)) -> 'LT() 'compare('neg(x),'0()) -> 'LT() 'compare('neg(x),'neg(y)) -> 'compare(y,x) 'compare('neg(x),'pos(y)) -> 'LT() 'compare('pos(x),'0()) -> 'GT() 'compare('pos(x),'neg(y)) -> 'GT() 'compare('pos(x),'pos(y)) -> 'compare(x,y) 'compare('s(x),'0()) -> 'GT() 'compare('s(x),'s(y)) -> 'compare(x,y) 'less(x,y) -> 'cklt('compare(x,y)) merge(l1,l2) -> merge'1(l1,l2) merge'1(dd(x,xs),l2) -> merge'2(l2,x,xs) merge'1(nil(),l2) -> l2 merge'2(dd(y,ys),x,xs) -> merge'3('less(x,y),x,xs,y,ys) merge'2(nil(),x,xs) -> dd(x,xs) merge'3('false(),x,xs,y,ys) -> dd(y,merge(dd(x,xs),ys)) merge'3('true(),x,xs,y,ys) -> dd(x,merge(xs,dd(y,ys))) mergesort(l) -> mergesort'1(l) mergesort'1(dd(x1,xs)) -> mergesort'2(xs,x1) mergesort'1(nil()) -> nil() mergesort'2(dd(x2,xs'),x1) -> mergesort'3(msplit(dd(x1,dd(x2,xs')))) mergesort'2(nil(),x1) -> dd(x1,nil()) mergesort'3(tuple'2(l1,l2)) -> merge(mergesort(l1),mergesort(l2)) msplit(l) -> msplit'1(l) msplit'1(dd(x1,xs)) -> msplit'2(xs,x1) msplit'1(nil()) -> tuple'2(nil(),nil()) msplit'2(dd(x2,xs'),x1) -> msplit'3(msplit(xs'),x1,x2) msplit'2(nil(),x1) -> tuple'2(dd(x1,nil()),nil()) msplit'3(tuple'2(l1,l2),x1,x2) -> tuple'2(dd(x1,l1),dd(x2,l2)) - Signature: {'cklt/1,'compare/2,'less/2,merge/2,merge'1/2,merge'2/3,merge'3/5,mergesort/1,mergesort'1/1,mergesort'2/2 ,mergesort'3/1,msplit/1,msplit'1/1,msplit'2/2,msplit'3/3,'cklt#/1,'compare#/2,'less#/2,merge#/2,merge'1#/2 ,merge'2#/3,merge'3#/5,mergesort#/1,mergesort'1#/1,mergesort'2#/2,mergesort'3#/1,msplit#/1,msplit'1#/1 ,msplit'2#/2,msplit'3#/3} / {'0/0,'EQ/0,'GT/0,'LT/0,'false/0,'neg/1,'pos/1,'s/1,'true/0,dd/2,nil/0,tuple'2/2 ,c_1/0,c_2/0,c_3/0,c_4/0,c_5/0,c_6/0,c_7/0,c_8/0,c_9/1,c_10/0,c_11/0,c_12/0,c_13/1,c_14/0,c_15/1,c_16/1 ,c_17/1,c_18/1,c_19/0,c_20/2,c_21/0,c_22/1,c_23/1,c_24/1,c_25/1,c_26/0,c_27/1,c_28/0,c_29/3,c_30/1,c_31/1 ,c_32/0,c_33/1,c_34/0,c_35/0} - Obligation: innermost runtime complexity wrt. defined symbols {'cklt#,'compare#,'less#,merge#,merge'1#,merge'2#,merge'3# ,mergesort#,mergesort'1#,mergesort'2#,mergesort'3#,msplit#,msplit'1#,msplit'2# ,msplit'3#} and constructors {'0,'EQ,'GT,'LT,'false,'neg,'pos,'s,'true,dd,nil,tuple'2} + Applied Processor: DecomposeDG {onSelection = all below first cut in WDG, onUpper = Just someStrategy, onLower = Nothing} + Details: We decompose the input problem according to the dependency graph into the upper component mergesort#(l) -> c_24(mergesort'1#(l)) mergesort'1#(dd(x1,xs)) -> c_25(mergesort'2#(xs,x1)) mergesort'2#(dd(x2,xs'),x1) -> c_27(mergesort'3#(msplit(dd(x1,dd(x2,xs'))))) mergesort'3#(tuple'2(l1,l2)) -> c_29(merge#(mergesort(l1),mergesort(l2)),mergesort#(l1),mergesort#(l2)) and a lower component 'compare#('neg(x),'neg(y)) -> c_9('compare#(y,x)) 'compare#('pos(x),'pos(y)) -> c_13('compare#(x,y)) 'compare#('s(x),'s(y)) -> c_15('compare#(x,y)) 'less#(x,y) -> c_16('compare#(x,y)) merge#(l1,l2) -> c_17(merge'1#(l1,l2)) merge'1#(dd(x,xs),l2) -> c_18(merge'2#(l2,x,xs)) merge'2#(dd(y,ys),x,xs) -> c_20(merge'3#('less(x,y),x,xs,y,ys),'less#(x,y)) merge'3#('false(),x,xs,y,ys) -> c_22(merge#(dd(x,xs),ys)) merge'3#('true(),x,xs,y,ys) -> c_23(merge#(xs,dd(y,ys))) Further, following extension rules are added to the lower component. mergesort#(l) -> mergesort'1#(l) mergesort'1#(dd(x1,xs)) -> mergesort'2#(xs,x1) mergesort'2#(dd(x2,xs'),x1) -> mergesort'3#(msplit(dd(x1,dd(x2,xs')))) mergesort'3#(tuple'2(l1,l2)) -> merge#(mergesort(l1),mergesort(l2)) mergesort'3#(tuple'2(l1,l2)) -> mergesort#(l1) mergesort'3#(tuple'2(l1,l2)) -> mergesort#(l2) *** Step 5.a:3.a:1: PredecessorEstimationCP WORST_CASE(?,O(n^1)) + Considered Problem: - Strict DPs: mergesort'3#(tuple'2(l1,l2)) -> c_29(merge#(mergesort(l1),mergesort(l2)),mergesort#(l1),mergesort#(l2)) - Weak DPs: mergesort#(l) -> c_24(mergesort'1#(l)) mergesort'1#(dd(x1,xs)) -> c_25(mergesort'2#(xs,x1)) mergesort'2#(dd(x2,xs'),x1) -> c_27(mergesort'3#(msplit(dd(x1,dd(x2,xs'))))) - Weak TRS: 'cklt('EQ()) -> 'false() 'cklt('GT()) -> 'false() 'cklt('LT()) -> 'true() 'compare('0(),'0()) -> 'EQ() 'compare('0(),'neg(y)) -> 'GT() 'compare('0(),'pos(y)) -> 'LT() 'compare('0(),'s(y)) -> 'LT() 'compare('neg(x),'0()) -> 'LT() 'compare('neg(x),'neg(y)) -> 'compare(y,x) 'compare('neg(x),'pos(y)) -> 'LT() 'compare('pos(x),'0()) -> 'GT() 'compare('pos(x),'neg(y)) -> 'GT() 'compare('pos(x),'pos(y)) -> 'compare(x,y) 'compare('s(x),'0()) -> 'GT() 'compare('s(x),'s(y)) -> 'compare(x,y) 'less(x,y) -> 'cklt('compare(x,y)) merge(l1,l2) -> merge'1(l1,l2) merge'1(dd(x,xs),l2) -> merge'2(l2,x,xs) merge'1(nil(),l2) -> l2 merge'2(dd(y,ys),x,xs) -> merge'3('less(x,y),x,xs,y,ys) merge'2(nil(),x,xs) -> dd(x,xs) merge'3('false(),x,xs,y,ys) -> dd(y,merge(dd(x,xs),ys)) merge'3('true(),x,xs,y,ys) -> dd(x,merge(xs,dd(y,ys))) mergesort(l) -> mergesort'1(l) mergesort'1(dd(x1,xs)) -> mergesort'2(xs,x1) mergesort'1(nil()) -> nil() mergesort'2(dd(x2,xs'),x1) -> mergesort'3(msplit(dd(x1,dd(x2,xs')))) mergesort'2(nil(),x1) -> dd(x1,nil()) mergesort'3(tuple'2(l1,l2)) -> merge(mergesort(l1),mergesort(l2)) msplit(l) -> msplit'1(l) msplit'1(dd(x1,xs)) -> msplit'2(xs,x1) msplit'1(nil()) -> tuple'2(nil(),nil()) msplit'2(dd(x2,xs'),x1) -> msplit'3(msplit(xs'),x1,x2) msplit'2(nil(),x1) -> tuple'2(dd(x1,nil()),nil()) msplit'3(tuple'2(l1,l2),x1,x2) -> tuple'2(dd(x1,l1),dd(x2,l2)) - Signature: {'cklt/1,'compare/2,'less/2,merge/2,merge'1/2,merge'2/3,merge'3/5,mergesort/1,mergesort'1/1,mergesort'2/2 ,mergesort'3/1,msplit/1,msplit'1/1,msplit'2/2,msplit'3/3,'cklt#/1,'compare#/2,'less#/2,merge#/2,merge'1#/2 ,merge'2#/3,merge'3#/5,mergesort#/1,mergesort'1#/1,mergesort'2#/2,mergesort'3#/1,msplit#/1,msplit'1#/1 ,msplit'2#/2,msplit'3#/3} / {'0/0,'EQ/0,'GT/0,'LT/0,'false/0,'neg/1,'pos/1,'s/1,'true/0,dd/2,nil/0,tuple'2/2 ,c_1/0,c_2/0,c_3/0,c_4/0,c_5/0,c_6/0,c_7/0,c_8/0,c_9/1,c_10/0,c_11/0,c_12/0,c_13/1,c_14/0,c_15/1,c_16/1 ,c_17/1,c_18/1,c_19/0,c_20/2,c_21/0,c_22/1,c_23/1,c_24/1,c_25/1,c_26/0,c_27/1,c_28/0,c_29/3,c_30/1,c_31/1 ,c_32/0,c_33/1,c_34/0,c_35/0} - Obligation: innermost runtime complexity wrt. defined symbols {'cklt#,'compare#,'less#,merge#,merge'1#,merge'2#,merge'3# ,mergesort#,mergesort'1#,mergesort'2#,mergesort'3#,msplit#,msplit'1#,msplit'2# ,msplit'3#} and constructors {'0,'EQ,'GT,'LT,'false,'neg,'pos,'s,'true,dd,nil,tuple'2} + Applied Processor: PredecessorEstimationCP {onSelectionCP = any intersect of rules of CDG leaf and strict-rules, withComplexityPair = NaturalMI {miDimension = 3, miDegree = 1, miKind = Algebraic, uargs = UArgs, urules = URules, selector = Nothing}} + Details: We first use the processor NaturalMI {miDimension = 3, miDegree = 1, miKind = Algebraic, uargs = UArgs, urules = URules, selector = Nothing} to orient following rules strictly: 1: mergesort'3#(tuple'2(l1,l2)) -> c_29(merge#(mergesort(l1),mergesort(l2)),mergesort#(l1),mergesort#(l2)) Consider the set of all dependency pairs 1: mergesort'3#(tuple'2(l1,l2)) -> c_29(merge#(mergesort(l1),mergesort(l2)),mergesort#(l1),mergesort#(l2)) 2: mergesort#(l) -> c_24(mergesort'1#(l)) 3: mergesort'1#(dd(x1,xs)) -> c_25(mergesort'2#(xs,x1)) 4: mergesort'2#(dd(x2,xs'),x1) -> c_27(mergesort'3#(msplit(dd(x1,dd(x2,xs'))))) Processor NaturalMI {miDimension = 3, miDegree = 1, miKind = Algebraic, uargs = UArgs, urules = URules, selector = Nothing}induces the complexity certificateTIME (?,O(n^1)) SPACE(?,?)on application of the dependency pairs {1} These cover all (indirect) predecessors of dependency pairs {1,2,3,4} their number of applications is equally bounded. The dependency pairs are shifted into the weak component. **** Step 5.a:3.a:1.a:1: NaturalMI WORST_CASE(?,O(n^1)) + Considered Problem: - Strict DPs: mergesort'3#(tuple'2(l1,l2)) -> c_29(merge#(mergesort(l1),mergesort(l2)),mergesort#(l1),mergesort#(l2)) - Weak DPs: mergesort#(l) -> c_24(mergesort'1#(l)) mergesort'1#(dd(x1,xs)) -> c_25(mergesort'2#(xs,x1)) mergesort'2#(dd(x2,xs'),x1) -> c_27(mergesort'3#(msplit(dd(x1,dd(x2,xs'))))) - Weak TRS: 'cklt('EQ()) -> 'false() 'cklt('GT()) -> 'false() 'cklt('LT()) -> 'true() 'compare('0(),'0()) -> 'EQ() 'compare('0(),'neg(y)) -> 'GT() 'compare('0(),'pos(y)) -> 'LT() 'compare('0(),'s(y)) -> 'LT() 'compare('neg(x),'0()) -> 'LT() 'compare('neg(x),'neg(y)) -> 'compare(y,x) 'compare('neg(x),'pos(y)) -> 'LT() 'compare('pos(x),'0()) -> 'GT() 'compare('pos(x),'neg(y)) -> 'GT() 'compare('pos(x),'pos(y)) -> 'compare(x,y) 'compare('s(x),'0()) -> 'GT() 'compare('s(x),'s(y)) -> 'compare(x,y) 'less(x,y) -> 'cklt('compare(x,y)) merge(l1,l2) -> merge'1(l1,l2) merge'1(dd(x,xs),l2) -> merge'2(l2,x,xs) merge'1(nil(),l2) -> l2 merge'2(dd(y,ys),x,xs) -> merge'3('less(x,y),x,xs,y,ys) merge'2(nil(),x,xs) -> dd(x,xs) merge'3('false(),x,xs,y,ys) -> dd(y,merge(dd(x,xs),ys)) merge'3('true(),x,xs,y,ys) -> dd(x,merge(xs,dd(y,ys))) mergesort(l) -> mergesort'1(l) mergesort'1(dd(x1,xs)) -> mergesort'2(xs,x1) mergesort'1(nil()) -> nil() mergesort'2(dd(x2,xs'),x1) -> mergesort'3(msplit(dd(x1,dd(x2,xs')))) mergesort'2(nil(),x1) -> dd(x1,nil()) mergesort'3(tuple'2(l1,l2)) -> merge(mergesort(l1),mergesort(l2)) msplit(l) -> msplit'1(l) msplit'1(dd(x1,xs)) -> msplit'2(xs,x1) msplit'1(nil()) -> tuple'2(nil(),nil()) msplit'2(dd(x2,xs'),x1) -> msplit'3(msplit(xs'),x1,x2) msplit'2(nil(),x1) -> tuple'2(dd(x1,nil()),nil()) msplit'3(tuple'2(l1,l2),x1,x2) -> tuple'2(dd(x1,l1),dd(x2,l2)) - Signature: {'cklt/1,'compare/2,'less/2,merge/2,merge'1/2,merge'2/3,merge'3/5,mergesort/1,mergesort'1/1,mergesort'2/2 ,mergesort'3/1,msplit/1,msplit'1/1,msplit'2/2,msplit'3/3,'cklt#/1,'compare#/2,'less#/2,merge#/2,merge'1#/2 ,merge'2#/3,merge'3#/5,mergesort#/1,mergesort'1#/1,mergesort'2#/2,mergesort'3#/1,msplit#/1,msplit'1#/1 ,msplit'2#/2,msplit'3#/3} / {'0/0,'EQ/0,'GT/0,'LT/0,'false/0,'neg/1,'pos/1,'s/1,'true/0,dd/2,nil/0,tuple'2/2 ,c_1/0,c_2/0,c_3/0,c_4/0,c_5/0,c_6/0,c_7/0,c_8/0,c_9/1,c_10/0,c_11/0,c_12/0,c_13/1,c_14/0,c_15/1,c_16/1 ,c_17/1,c_18/1,c_19/0,c_20/2,c_21/0,c_22/1,c_23/1,c_24/1,c_25/1,c_26/0,c_27/1,c_28/0,c_29/3,c_30/1,c_31/1 ,c_32/0,c_33/1,c_34/0,c_35/0} - Obligation: innermost runtime complexity wrt. defined symbols {'cklt#,'compare#,'less#,merge#,merge'1#,merge'2#,merge'3# ,mergesort#,mergesort'1#,mergesort'2#,mergesort'3#,msplit#,msplit'1#,msplit'2# ,msplit'3#} and constructors {'0,'EQ,'GT,'LT,'false,'neg,'pos,'s,'true,dd,nil,tuple'2} + Applied Processor: NaturalMI {miDimension = 3, miDegree = 1, miKind = Algebraic, uargs = UArgs, urules = URules, selector = Just first alternative for predecessorEstimation on any intersect of rules of CDG leaf and strict-rules} + Details: We apply a matrix interpretation of kind constructor based matrix interpretation (containing no more than 1 non-zero interpretation-entries in the diagonal of the component-wise maxima): The following argument positions are considered usable: uargs(c_24) = {1}, uargs(c_25) = {1}, uargs(c_27) = {1}, uargs(c_29) = {1,2,3} Following symbols are considered usable: {msplit,msplit'1,msplit'2,msplit'3,'cklt#,'compare#,'less#,merge#,merge'1#,merge'2#,merge'3#,mergesort# ,mergesort'1#,mergesort'2#,mergesort'3#,msplit#,msplit'1#,msplit'2#,msplit'3#} TcT has computed the following interpretation: p('0) = [0] [0] [0] p('EQ) = [1] [0] [0] p('GT) = [0] [1] [0] p('LT) = [1] [1] [0] p('cklt) = [0 0 0] [0] [0 1 0] x1 + [1] [1 0 0] [0] p('compare) = [0 1 0] [1 0 0] [0] [1 0 1] x1 + [0 0 0] x2 + [0] [0 1 0] [0 0 0] [1] p('false) = [1] [1] [1] p('less) = [1 0 0] [0 0 0] [0] [0 0 0] x1 + [0 0 1] x2 + [1] [0 1 1] [1 0 0] [1] p('neg) = [0 0 0] [0] [0 0 1] x1 + [0] [0 0 0] [0] p('pos) = [0 0 0] [1] [0 0 1] x1 + [1] [0 0 0] [1] p('s) = [0 0 1] [0] [0 0 0] x1 + [0] [0 0 0] [1] p('true) = [1] [1] [0] p(dd) = [0 0 1] [0 1 0] [0] [0 0 1] x1 + [0 0 1] x2 + [0] [0 0 1] [0 0 1] [1] p(merge) = [1 0 0] [0 1 1] [0] [0 0 0] x1 + [1 0 0] x2 + [1] [0 0 1] [1 1 0] [0] p(merge'1) = [1 0 0] [0] [1 1 0] x1 + [0] [0 0 0] [0] p(merge'2) = [0 0 0] [0] [0 1 1] x1 + [0] [0 1 0] [1] p(merge'3) = [1 0 1] [0 0 0] [0] [0 1 0] x1 + [0 1 1] x4 + [0] [0 1 0] [0 1 1] [0] p(mergesort) = [1 0 0] [0] [1 0 0] x1 + [0] [1 0 0] [1] p(mergesort'1) = [0 0 0] [0] [0 0 1] x1 + [0] [0 0 0] [1] p(mergesort'2) = [0 1 0] [0] [0 1 0] x1 + [0] [0 0 0] [0] p(mergesort'3) = [0] [0] [0] p(msplit) = [1 0 0] [0] [0 0 1] x1 + [0] [0 0 0] [1] p(msplit'1) = [1 0 0] [0] [0 0 1] x1 + [0] [0 0 0] [1] p(msplit'2) = [0 1 0] [0 0 1] [0] [0 0 1] x1 + [0 0 1] x2 + [1] [0 0 0] [0 0 0] [1] p(msplit'3) = [0 1 0] [0 0 1] [0 0 1] [0] [0 1 1] x1 + [0 0 1] x2 + [0 0 1] x3 + [1] [0 0 0] [0 0 0] [0 0 0] [1] p(nil) = [0] [0] [0] p(tuple'2) = [0 1 0] [0 1 0] [0] [0 0 1] x1 + [0 0 1] x2 + [0] [0 0 0] [0 0 0] [1] p('cklt#) = [0] [0] [0] p('compare#) = [0] [0] [0] p('less#) = [0] [0] [0] p(merge#) = [0] [0] [0] p(merge'1#) = [0] [0] [0] p(merge'2#) = [0] [0] [0] p(merge'3#) = [0] [0] [0] p(mergesort#) = [0 1 0] [0] [0 0 0] x1 + [0] [0 0 1] [0] p(mergesort'1#) = [0 1 0] [0] [0 0 1] x1 + [1] [0 0 0] [0] p(mergesort'2#) = [0 0 1] [0 0 1] [0] [1 0 0] x1 + [1 0 1] x2 + [0] [0 0 0] [0 0 0] [0] p(mergesort'3#) = [1 0 1] [0] [0 1 0] x1 + [1] [0 0 0] [0] p(msplit#) = [0] [0] [0] p(msplit'1#) = [0] [0] [0] p(msplit'2#) = [0] [0] [0] p(msplit'3#) = [0] [0] [0] p(c_1) = [0] [0] [0] p(c_2) = [0] [0] [0] p(c_3) = [0] [0] [0] p(c_4) = [0] [0] [0] p(c_5) = [0] [0] [0] p(c_6) = [0] [0] [0] p(c_7) = [0] [0] [0] p(c_8) = [0] [0] [0] p(c_9) = [0] [0] [0] p(c_10) = [0] [0] [0] p(c_11) = [0] [0] [0] p(c_12) = [0] [0] [0] p(c_13) = [0] [0] [0] p(c_14) = [0] [0] [0] p(c_15) = [0] [0] [0] p(c_16) = [0] [0] [0] p(c_17) = [0] [0] [0] p(c_18) = [0] [0] [0] p(c_19) = [0] [0] [0] p(c_20) = [0] [0] [0] p(c_21) = [0] [0] [0] p(c_22) = [0] [0] [0] p(c_23) = [0] [0] [0] p(c_24) = [1 0 0] [0] [0 0 0] x1 + [0] [0 0 0] [0] p(c_25) = [1 0 0] [0] [0 0 0] x1 + [0] [0 0 0] [0] p(c_26) = [0] [0] [0] p(c_27) = [1 0 0] [0] [0 0 0] x1 + [0] [0 0 0] [0] p(c_28) = [0] [0] [0] p(c_29) = [1 0 0] [1 0 0] [1 0 0] [0] [0 0 0] x1 + [0 0 0] x2 + [0 0 1] x3 + [0] [0 0 0] [0 0 0] [0 0 0] [0] p(c_30) = [0] [0] [0] p(c_31) = [0] [0] [0] p(c_32) = [0] [0] [0] p(c_33) = [0] [0] [0] p(c_34) = [0] [0] [0] p(c_35) = [0] [0] [0] Following rules are strictly oriented: mergesort'3#(tuple'2(l1,l2)) = [0 1 0] [0 1 0] [1] [0 0 1] l1 + [0 0 1] l2 + [1] [0 0 0] [0 0 0] [0] > [0 1 0] [0 1 0] [0] [0 0 0] l1 + [0 0 1] l2 + [0] [0 0 0] [0 0 0] [0] = c_29(merge#(mergesort(l1),mergesort(l2)),mergesort#(l1),mergesort#(l2)) Following rules are (at-least) weakly oriented: mergesort#(l) = [0 1 0] [0] [0 0 0] l + [0] [0 0 1] [0] >= [0 1 0] [0] [0 0 0] l + [0] [0 0 0] [0] = c_24(mergesort'1#(l)) mergesort'1#(dd(x1,xs)) = [0 0 1] [0 0 1] [0] [0 0 1] x1 + [0 0 1] xs + [2] [0 0 0] [0 0 0] [0] >= [0 0 1] [0 0 1] [0] [0 0 0] x1 + [0 0 0] xs + [0] [0 0 0] [0 0 0] [0] = c_25(mergesort'2#(xs,x1)) mergesort'2#(dd(x2,xs'),x1) = [0 0 1] [0 0 1] [0 0 1] [1] [1 0 1] x1 + [0 0 1] x2 + [0 1 0] xs' + [0] [0 0 0] [0 0 0] [0 0 0] [0] >= [0 0 1] [0 0 1] [0 0 1] [1] [0 0 0] x1 + [0 0 0] x2 + [0 0 0] xs' + [0] [0 0 0] [0 0 0] [0 0 0] [0] = c_27(mergesort'3#(msplit(dd(x1,dd(x2,xs'))))) msplit(l) = [1 0 0] [0] [0 0 1] l + [0] [0 0 0] [1] >= [1 0 0] [0] [0 0 1] l + [0] [0 0 0] [1] = msplit'1(l) msplit'1(dd(x1,xs)) = [0 0 1] [0 1 0] [0] [0 0 1] x1 + [0 0 1] xs + [1] [0 0 0] [0 0 0] [1] >= [0 0 1] [0 1 0] [0] [0 0 1] x1 + [0 0 1] xs + [1] [0 0 0] [0 0 0] [1] = msplit'2(xs,x1) msplit'1(nil()) = [0] [0] [1] >= [0] [0] [1] = tuple'2(nil(),nil()) msplit'2(dd(x2,xs'),x1) = [0 0 1] [0 0 1] [0 0 1] [0] [0 0 1] x1 + [0 0 1] x2 + [0 0 1] xs' + [2] [0 0 0] [0 0 0] [0 0 0] [1] >= [0 0 1] [0 0 1] [0 0 1] [0] [0 0 1] x1 + [0 0 1] x2 + [0 0 1] xs' + [2] [0 0 0] [0 0 0] [0 0 0] [1] = msplit'3(msplit(xs'),x1,x2) msplit'2(nil(),x1) = [0 0 1] [0] [0 0 1] x1 + [1] [0 0 0] [1] >= [0 0 1] [0] [0 0 1] x1 + [1] [0 0 0] [1] = tuple'2(dd(x1,nil()),nil()) msplit'3(tuple'2(l1,l2),x1,x2) = [0 0 1] [0 0 1] [0 0 1] [0 0 1] [0] [0 0 1] l1 + [0 0 1] l2 + [0 0 1] x1 + [0 0 1] x2 + [2] [0 0 0] [0 0 0] [0 0 0] [0 0 0] [1] >= [0 0 1] [0 0 1] [0 0 1] [0 0 1] [0] [0 0 1] l1 + [0 0 1] l2 + [0 0 1] x1 + [0 0 1] x2 + [2] [0 0 0] [0 0 0] [0 0 0] [0 0 0] [1] = tuple'2(dd(x1,l1),dd(x2,l2)) **** Step 5.a:3.a:1.a:2: Assumption WORST_CASE(?,O(1)) + Considered Problem: - Weak DPs: mergesort#(l) -> c_24(mergesort'1#(l)) mergesort'1#(dd(x1,xs)) -> c_25(mergesort'2#(xs,x1)) mergesort'2#(dd(x2,xs'),x1) -> c_27(mergesort'3#(msplit(dd(x1,dd(x2,xs'))))) mergesort'3#(tuple'2(l1,l2)) -> c_29(merge#(mergesort(l1),mergesort(l2)),mergesort#(l1),mergesort#(l2)) - Weak TRS: 'cklt('EQ()) -> 'false() 'cklt('GT()) -> 'false() 'cklt('LT()) -> 'true() 'compare('0(),'0()) -> 'EQ() 'compare('0(),'neg(y)) -> 'GT() 'compare('0(),'pos(y)) -> 'LT() 'compare('0(),'s(y)) -> 'LT() 'compare('neg(x),'0()) -> 'LT() 'compare('neg(x),'neg(y)) -> 'compare(y,x) 'compare('neg(x),'pos(y)) -> 'LT() 'compare('pos(x),'0()) -> 'GT() 'compare('pos(x),'neg(y)) -> 'GT() 'compare('pos(x),'pos(y)) -> 'compare(x,y) 'compare('s(x),'0()) -> 'GT() 'compare('s(x),'s(y)) -> 'compare(x,y) 'less(x,y) -> 'cklt('compare(x,y)) merge(l1,l2) -> merge'1(l1,l2) merge'1(dd(x,xs),l2) -> merge'2(l2,x,xs) merge'1(nil(),l2) -> l2 merge'2(dd(y,ys),x,xs) -> merge'3('less(x,y),x,xs,y,ys) merge'2(nil(),x,xs) -> dd(x,xs) merge'3('false(),x,xs,y,ys) -> dd(y,merge(dd(x,xs),ys)) merge'3('true(),x,xs,y,ys) -> dd(x,merge(xs,dd(y,ys))) mergesort(l) -> mergesort'1(l) mergesort'1(dd(x1,xs)) -> mergesort'2(xs,x1) mergesort'1(nil()) -> nil() mergesort'2(dd(x2,xs'),x1) -> mergesort'3(msplit(dd(x1,dd(x2,xs')))) mergesort'2(nil(),x1) -> dd(x1,nil()) mergesort'3(tuple'2(l1,l2)) -> merge(mergesort(l1),mergesort(l2)) msplit(l) -> msplit'1(l) msplit'1(dd(x1,xs)) -> msplit'2(xs,x1) msplit'1(nil()) -> tuple'2(nil(),nil()) msplit'2(dd(x2,xs'),x1) -> msplit'3(msplit(xs'),x1,x2) msplit'2(nil(),x1) -> tuple'2(dd(x1,nil()),nil()) msplit'3(tuple'2(l1,l2),x1,x2) -> tuple'2(dd(x1,l1),dd(x2,l2)) - Signature: {'cklt/1,'compare/2,'less/2,merge/2,merge'1/2,merge'2/3,merge'3/5,mergesort/1,mergesort'1/1,mergesort'2/2 ,mergesort'3/1,msplit/1,msplit'1/1,msplit'2/2,msplit'3/3,'cklt#/1,'compare#/2,'less#/2,merge#/2,merge'1#/2 ,merge'2#/3,merge'3#/5,mergesort#/1,mergesort'1#/1,mergesort'2#/2,mergesort'3#/1,msplit#/1,msplit'1#/1 ,msplit'2#/2,msplit'3#/3} / {'0/0,'EQ/0,'GT/0,'LT/0,'false/0,'neg/1,'pos/1,'s/1,'true/0,dd/2,nil/0,tuple'2/2 ,c_1/0,c_2/0,c_3/0,c_4/0,c_5/0,c_6/0,c_7/0,c_8/0,c_9/1,c_10/0,c_11/0,c_12/0,c_13/1,c_14/0,c_15/1,c_16/1 ,c_17/1,c_18/1,c_19/0,c_20/2,c_21/0,c_22/1,c_23/1,c_24/1,c_25/1,c_26/0,c_27/1,c_28/0,c_29/3,c_30/1,c_31/1 ,c_32/0,c_33/1,c_34/0,c_35/0} - Obligation: innermost runtime complexity wrt. defined symbols {'cklt#,'compare#,'less#,merge#,merge'1#,merge'2#,merge'3# ,mergesort#,mergesort'1#,mergesort'2#,mergesort'3#,msplit#,msplit'1#,msplit'2# ,msplit'3#} and constructors {'0,'EQ,'GT,'LT,'false,'neg,'pos,'s,'true,dd,nil,tuple'2} + Applied Processor: Assumption {assumed = Certificate {spaceUB = Unknown, spaceLB = Unknown, timeUB = Poly (Just 0), timeLB = Unknown}} + Details: () **** Step 5.a:3.a:1.b:1: RemoveWeakSuffixes WORST_CASE(?,O(1)) + Considered Problem: - Weak DPs: mergesort#(l) -> c_24(mergesort'1#(l)) mergesort'1#(dd(x1,xs)) -> c_25(mergesort'2#(xs,x1)) mergesort'2#(dd(x2,xs'),x1) -> c_27(mergesort'3#(msplit(dd(x1,dd(x2,xs'))))) mergesort'3#(tuple'2(l1,l2)) -> c_29(merge#(mergesort(l1),mergesort(l2)),mergesort#(l1),mergesort#(l2)) - Weak TRS: 'cklt('EQ()) -> 'false() 'cklt('GT()) -> 'false() 'cklt('LT()) -> 'true() 'compare('0(),'0()) -> 'EQ() 'compare('0(),'neg(y)) -> 'GT() 'compare('0(),'pos(y)) -> 'LT() 'compare('0(),'s(y)) -> 'LT() 'compare('neg(x),'0()) -> 'LT() 'compare('neg(x),'neg(y)) -> 'compare(y,x) 'compare('neg(x),'pos(y)) -> 'LT() 'compare('pos(x),'0()) -> 'GT() 'compare('pos(x),'neg(y)) -> 'GT() 'compare('pos(x),'pos(y)) -> 'compare(x,y) 'compare('s(x),'0()) -> 'GT() 'compare('s(x),'s(y)) -> 'compare(x,y) 'less(x,y) -> 'cklt('compare(x,y)) merge(l1,l2) -> merge'1(l1,l2) merge'1(dd(x,xs),l2) -> merge'2(l2,x,xs) merge'1(nil(),l2) -> l2 merge'2(dd(y,ys),x,xs) -> merge'3('less(x,y),x,xs,y,ys) merge'2(nil(),x,xs) -> dd(x,xs) merge'3('false(),x,xs,y,ys) -> dd(y,merge(dd(x,xs),ys)) merge'3('true(),x,xs,y,ys) -> dd(x,merge(xs,dd(y,ys))) mergesort(l) -> mergesort'1(l) mergesort'1(dd(x1,xs)) -> mergesort'2(xs,x1) mergesort'1(nil()) -> nil() mergesort'2(dd(x2,xs'),x1) -> mergesort'3(msplit(dd(x1,dd(x2,xs')))) mergesort'2(nil(),x1) -> dd(x1,nil()) mergesort'3(tuple'2(l1,l2)) -> merge(mergesort(l1),mergesort(l2)) msplit(l) -> msplit'1(l) msplit'1(dd(x1,xs)) -> msplit'2(xs,x1) msplit'1(nil()) -> tuple'2(nil(),nil()) msplit'2(dd(x2,xs'),x1) -> msplit'3(msplit(xs'),x1,x2) msplit'2(nil(),x1) -> tuple'2(dd(x1,nil()),nil()) msplit'3(tuple'2(l1,l2),x1,x2) -> tuple'2(dd(x1,l1),dd(x2,l2)) - Signature: {'cklt/1,'compare/2,'less/2,merge/2,merge'1/2,merge'2/3,merge'3/5,mergesort/1,mergesort'1/1,mergesort'2/2 ,mergesort'3/1,msplit/1,msplit'1/1,msplit'2/2,msplit'3/3,'cklt#/1,'compare#/2,'less#/2,merge#/2,merge'1#/2 ,merge'2#/3,merge'3#/5,mergesort#/1,mergesort'1#/1,mergesort'2#/2,mergesort'3#/1,msplit#/1,msplit'1#/1 ,msplit'2#/2,msplit'3#/3} / {'0/0,'EQ/0,'GT/0,'LT/0,'false/0,'neg/1,'pos/1,'s/1,'true/0,dd/2,nil/0,tuple'2/2 ,c_1/0,c_2/0,c_3/0,c_4/0,c_5/0,c_6/0,c_7/0,c_8/0,c_9/1,c_10/0,c_11/0,c_12/0,c_13/1,c_14/0,c_15/1,c_16/1 ,c_17/1,c_18/1,c_19/0,c_20/2,c_21/0,c_22/1,c_23/1,c_24/1,c_25/1,c_26/0,c_27/1,c_28/0,c_29/3,c_30/1,c_31/1 ,c_32/0,c_33/1,c_34/0,c_35/0} - Obligation: innermost runtime complexity wrt. defined symbols {'cklt#,'compare#,'less#,merge#,merge'1#,merge'2#,merge'3# ,mergesort#,mergesort'1#,mergesort'2#,mergesort'3#,msplit#,msplit'1#,msplit'2# ,msplit'3#} and constructors {'0,'EQ,'GT,'LT,'false,'neg,'pos,'s,'true,dd,nil,tuple'2} + Applied Processor: RemoveWeakSuffixes + Details: Consider the dependency graph 1:W:mergesort#(l) -> c_24(mergesort'1#(l)) -->_1 mergesort'1#(dd(x1,xs)) -> c_25(mergesort'2#(xs,x1)):2 2:W:mergesort'1#(dd(x1,xs)) -> c_25(mergesort'2#(xs,x1)) -->_1 mergesort'2#(dd(x2,xs'),x1) -> c_27(mergesort'3#(msplit(dd(x1,dd(x2,xs'))))):3 3:W:mergesort'2#(dd(x2,xs'),x1) -> c_27(mergesort'3#(msplit(dd(x1,dd(x2,xs'))))) -->_1 mergesort'3#(tuple'2(l1,l2)) -> c_29(merge#(mergesort(l1),mergesort(l2)) ,mergesort#(l1) ,mergesort#(l2)):4 4:W:mergesort'3#(tuple'2(l1,l2)) -> c_29(merge#(mergesort(l1),mergesort(l2)),mergesort#(l1),mergesort#(l2)) -->_3 mergesort#(l) -> c_24(mergesort'1#(l)):1 -->_2 mergesort#(l) -> c_24(mergesort'1#(l)):1 The following weak DPs constitute a sub-graph of the DG that is closed under successors. The DPs are removed. 1: mergesort#(l) -> c_24(mergesort'1#(l)) 4: mergesort'3#(tuple'2(l1,l2)) -> c_29(merge#(mergesort(l1),mergesort(l2)),mergesort#(l1),mergesort#(l2)) 3: mergesort'2#(dd(x2,xs'),x1) -> c_27(mergesort'3#(msplit(dd(x1,dd(x2,xs'))))) 2: mergesort'1#(dd(x1,xs)) -> c_25(mergesort'2#(xs,x1)) **** Step 5.a:3.a:1.b:2: EmptyProcessor WORST_CASE(?,O(1)) + Considered Problem: - Weak TRS: 'cklt('EQ()) -> 'false() 'cklt('GT()) -> 'false() 'cklt('LT()) -> 'true() 'compare('0(),'0()) -> 'EQ() 'compare('0(),'neg(y)) -> 'GT() 'compare('0(),'pos(y)) -> 'LT() 'compare('0(),'s(y)) -> 'LT() 'compare('neg(x),'0()) -> 'LT() 'compare('neg(x),'neg(y)) -> 'compare(y,x) 'compare('neg(x),'pos(y)) -> 'LT() 'compare('pos(x),'0()) -> 'GT() 'compare('pos(x),'neg(y)) -> 'GT() 'compare('pos(x),'pos(y)) -> 'compare(x,y) 'compare('s(x),'0()) -> 'GT() 'compare('s(x),'s(y)) -> 'compare(x,y) 'less(x,y) -> 'cklt('compare(x,y)) merge(l1,l2) -> merge'1(l1,l2) merge'1(dd(x,xs),l2) -> merge'2(l2,x,xs) merge'1(nil(),l2) -> l2 merge'2(dd(y,ys),x,xs) -> merge'3('less(x,y),x,xs,y,ys) merge'2(nil(),x,xs) -> dd(x,xs) merge'3('false(),x,xs,y,ys) -> dd(y,merge(dd(x,xs),ys)) merge'3('true(),x,xs,y,ys) -> dd(x,merge(xs,dd(y,ys))) mergesort(l) -> mergesort'1(l) mergesort'1(dd(x1,xs)) -> mergesort'2(xs,x1) mergesort'1(nil()) -> nil() mergesort'2(dd(x2,xs'),x1) -> mergesort'3(msplit(dd(x1,dd(x2,xs')))) mergesort'2(nil(),x1) -> dd(x1,nil()) mergesort'3(tuple'2(l1,l2)) -> merge(mergesort(l1),mergesort(l2)) msplit(l) -> msplit'1(l) msplit'1(dd(x1,xs)) -> msplit'2(xs,x1) msplit'1(nil()) -> tuple'2(nil(),nil()) msplit'2(dd(x2,xs'),x1) -> msplit'3(msplit(xs'),x1,x2) msplit'2(nil(),x1) -> tuple'2(dd(x1,nil()),nil()) msplit'3(tuple'2(l1,l2),x1,x2) -> tuple'2(dd(x1,l1),dd(x2,l2)) - Signature: {'cklt/1,'compare/2,'less/2,merge/2,merge'1/2,merge'2/3,merge'3/5,mergesort/1,mergesort'1/1,mergesort'2/2 ,mergesort'3/1,msplit/1,msplit'1/1,msplit'2/2,msplit'3/3,'cklt#/1,'compare#/2,'less#/2,merge#/2,merge'1#/2 ,merge'2#/3,merge'3#/5,mergesort#/1,mergesort'1#/1,mergesort'2#/2,mergesort'3#/1,msplit#/1,msplit'1#/1 ,msplit'2#/2,msplit'3#/3} / {'0/0,'EQ/0,'GT/0,'LT/0,'false/0,'neg/1,'pos/1,'s/1,'true/0,dd/2,nil/0,tuple'2/2 ,c_1/0,c_2/0,c_3/0,c_4/0,c_5/0,c_6/0,c_7/0,c_8/0,c_9/1,c_10/0,c_11/0,c_12/0,c_13/1,c_14/0,c_15/1,c_16/1 ,c_17/1,c_18/1,c_19/0,c_20/2,c_21/0,c_22/1,c_23/1,c_24/1,c_25/1,c_26/0,c_27/1,c_28/0,c_29/3,c_30/1,c_31/1 ,c_32/0,c_33/1,c_34/0,c_35/0} - Obligation: innermost runtime complexity wrt. defined symbols {'cklt#,'compare#,'less#,merge#,merge'1#,merge'2#,merge'3# ,mergesort#,mergesort'1#,mergesort'2#,mergesort'3#,msplit#,msplit'1#,msplit'2# ,msplit'3#} and constructors {'0,'EQ,'GT,'LT,'false,'neg,'pos,'s,'true,dd,nil,tuple'2} + Applied Processor: EmptyProcessor + Details: The problem is already closed. The intended complexity is O(1). *** Step 5.a:3.b:1: DecomposeDG WORST_CASE(?,O(n^2)) + Considered Problem: - Strict DPs: 'compare#('neg(x),'neg(y)) -> c_9('compare#(y,x)) 'compare#('pos(x),'pos(y)) -> c_13('compare#(x,y)) 'compare#('s(x),'s(y)) -> c_15('compare#(x,y)) - Weak DPs: 'less#(x,y) -> c_16('compare#(x,y)) merge#(l1,l2) -> c_17(merge'1#(l1,l2)) merge'1#(dd(x,xs),l2) -> c_18(merge'2#(l2,x,xs)) merge'2#(dd(y,ys),x,xs) -> c_20(merge'3#('less(x,y),x,xs,y,ys),'less#(x,y)) merge'3#('false(),x,xs,y,ys) -> c_22(merge#(dd(x,xs),ys)) merge'3#('true(),x,xs,y,ys) -> c_23(merge#(xs,dd(y,ys))) mergesort#(l) -> mergesort'1#(l) mergesort'1#(dd(x1,xs)) -> mergesort'2#(xs,x1) mergesort'2#(dd(x2,xs'),x1) -> mergesort'3#(msplit(dd(x1,dd(x2,xs')))) mergesort'3#(tuple'2(l1,l2)) -> merge#(mergesort(l1),mergesort(l2)) mergesort'3#(tuple'2(l1,l2)) -> mergesort#(l1) mergesort'3#(tuple'2(l1,l2)) -> mergesort#(l2) - Weak TRS: 'cklt('EQ()) -> 'false() 'cklt('GT()) -> 'false() 'cklt('LT()) -> 'true() 'compare('0(),'0()) -> 'EQ() 'compare('0(),'neg(y)) -> 'GT() 'compare('0(),'pos(y)) -> 'LT() 'compare('0(),'s(y)) -> 'LT() 'compare('neg(x),'0()) -> 'LT() 'compare('neg(x),'neg(y)) -> 'compare(y,x) 'compare('neg(x),'pos(y)) -> 'LT() 'compare('pos(x),'0()) -> 'GT() 'compare('pos(x),'neg(y)) -> 'GT() 'compare('pos(x),'pos(y)) -> 'compare(x,y) 'compare('s(x),'0()) -> 'GT() 'compare('s(x),'s(y)) -> 'compare(x,y) 'less(x,y) -> 'cklt('compare(x,y)) merge(l1,l2) -> merge'1(l1,l2) merge'1(dd(x,xs),l2) -> merge'2(l2,x,xs) merge'1(nil(),l2) -> l2 merge'2(dd(y,ys),x,xs) -> merge'3('less(x,y),x,xs,y,ys) merge'2(nil(),x,xs) -> dd(x,xs) merge'3('false(),x,xs,y,ys) -> dd(y,merge(dd(x,xs),ys)) merge'3('true(),x,xs,y,ys) -> dd(x,merge(xs,dd(y,ys))) mergesort(l) -> mergesort'1(l) mergesort'1(dd(x1,xs)) -> mergesort'2(xs,x1) mergesort'1(nil()) -> nil() mergesort'2(dd(x2,xs'),x1) -> mergesort'3(msplit(dd(x1,dd(x2,xs')))) mergesort'2(nil(),x1) -> dd(x1,nil()) mergesort'3(tuple'2(l1,l2)) -> merge(mergesort(l1),mergesort(l2)) msplit(l) -> msplit'1(l) msplit'1(dd(x1,xs)) -> msplit'2(xs,x1) msplit'1(nil()) -> tuple'2(nil(),nil()) msplit'2(dd(x2,xs'),x1) -> msplit'3(msplit(xs'),x1,x2) msplit'2(nil(),x1) -> tuple'2(dd(x1,nil()),nil()) msplit'3(tuple'2(l1,l2),x1,x2) -> tuple'2(dd(x1,l1),dd(x2,l2)) - Signature: {'cklt/1,'compare/2,'less/2,merge/2,merge'1/2,merge'2/3,merge'3/5,mergesort/1,mergesort'1/1,mergesort'2/2 ,mergesort'3/1,msplit/1,msplit'1/1,msplit'2/2,msplit'3/3,'cklt#/1,'compare#/2,'less#/2,merge#/2,merge'1#/2 ,merge'2#/3,merge'3#/5,mergesort#/1,mergesort'1#/1,mergesort'2#/2,mergesort'3#/1,msplit#/1,msplit'1#/1 ,msplit'2#/2,msplit'3#/3} / {'0/0,'EQ/0,'GT/0,'LT/0,'false/0,'neg/1,'pos/1,'s/1,'true/0,dd/2,nil/0,tuple'2/2 ,c_1/0,c_2/0,c_3/0,c_4/0,c_5/0,c_6/0,c_7/0,c_8/0,c_9/1,c_10/0,c_11/0,c_12/0,c_13/1,c_14/0,c_15/1,c_16/1 ,c_17/1,c_18/1,c_19/0,c_20/2,c_21/0,c_22/1,c_23/1,c_24/1,c_25/1,c_26/0,c_27/1,c_28/0,c_29/3,c_30/1,c_31/1 ,c_32/0,c_33/1,c_34/0,c_35/0} - Obligation: innermost runtime complexity wrt. defined symbols {'cklt#,'compare#,'less#,merge#,merge'1#,merge'2#,merge'3# ,mergesort#,mergesort'1#,mergesort'2#,mergesort'3#,msplit#,msplit'1#,msplit'2# ,msplit'3#} and constructors {'0,'EQ,'GT,'LT,'false,'neg,'pos,'s,'true,dd,nil,tuple'2} + Applied Processor: DecomposeDG {onSelection = all below first cut in WDG, onUpper = Just someStrategy, onLower = Nothing} + Details: We decompose the input problem according to the dependency graph into the upper component merge#(l1,l2) -> c_17(merge'1#(l1,l2)) merge'1#(dd(x,xs),l2) -> c_18(merge'2#(l2,x,xs)) merge'2#(dd(y,ys),x,xs) -> c_20(merge'3#('less(x,y),x,xs,y,ys),'less#(x,y)) merge'3#('false(),x,xs,y,ys) -> c_22(merge#(dd(x,xs),ys)) merge'3#('true(),x,xs,y,ys) -> c_23(merge#(xs,dd(y,ys))) mergesort#(l) -> mergesort'1#(l) mergesort'1#(dd(x1,xs)) -> mergesort'2#(xs,x1) mergesort'2#(dd(x2,xs'),x1) -> mergesort'3#(msplit(dd(x1,dd(x2,xs')))) mergesort'3#(tuple'2(l1,l2)) -> merge#(mergesort(l1),mergesort(l2)) mergesort'3#(tuple'2(l1,l2)) -> mergesort#(l1) mergesort'3#(tuple'2(l1,l2)) -> mergesort#(l2) and a lower component 'compare#('neg(x),'neg(y)) -> c_9('compare#(y,x)) 'compare#('pos(x),'pos(y)) -> c_13('compare#(x,y)) 'compare#('s(x),'s(y)) -> c_15('compare#(x,y)) 'less#(x,y) -> c_16('compare#(x,y)) Further, following extension rules are added to the lower component. merge#(l1,l2) -> merge'1#(l1,l2) merge'1#(dd(x,xs),l2) -> merge'2#(l2,x,xs) merge'2#(dd(y,ys),x,xs) -> 'less#(x,y) merge'2#(dd(y,ys),x,xs) -> merge'3#('less(x,y),x,xs,y,ys) merge'3#('false(),x,xs,y,ys) -> merge#(dd(x,xs),ys) merge'3#('true(),x,xs,y,ys) -> merge#(xs,dd(y,ys)) mergesort#(l) -> mergesort'1#(l) mergesort'1#(dd(x1,xs)) -> mergesort'2#(xs,x1) mergesort'2#(dd(x2,xs'),x1) -> mergesort'3#(msplit(dd(x1,dd(x2,xs')))) mergesort'3#(tuple'2(l1,l2)) -> merge#(mergesort(l1),mergesort(l2)) mergesort'3#(tuple'2(l1,l2)) -> mergesort#(l1) mergesort'3#(tuple'2(l1,l2)) -> mergesort#(l2) **** Step 5.a:3.b:1.a:1: PredecessorEstimationCP WORST_CASE(?,O(n^1)) + Considered Problem: - Strict DPs: merge'2#(dd(y,ys),x,xs) -> c_20(merge'3#('less(x,y),x,xs,y,ys),'less#(x,y)) - Weak DPs: merge#(l1,l2) -> c_17(merge'1#(l1,l2)) merge'1#(dd(x,xs),l2) -> c_18(merge'2#(l2,x,xs)) merge'3#('false(),x,xs,y,ys) -> c_22(merge#(dd(x,xs),ys)) merge'3#('true(),x,xs,y,ys) -> c_23(merge#(xs,dd(y,ys))) mergesort#(l) -> mergesort'1#(l) mergesort'1#(dd(x1,xs)) -> mergesort'2#(xs,x1) mergesort'2#(dd(x2,xs'),x1) -> mergesort'3#(msplit(dd(x1,dd(x2,xs')))) mergesort'3#(tuple'2(l1,l2)) -> merge#(mergesort(l1),mergesort(l2)) mergesort'3#(tuple'2(l1,l2)) -> mergesort#(l1) mergesort'3#(tuple'2(l1,l2)) -> mergesort#(l2) - Weak TRS: 'cklt('EQ()) -> 'false() 'cklt('GT()) -> 'false() 'cklt('LT()) -> 'true() 'compare('0(),'0()) -> 'EQ() 'compare('0(),'neg(y)) -> 'GT() 'compare('0(),'pos(y)) -> 'LT() 'compare('0(),'s(y)) -> 'LT() 'compare('neg(x),'0()) -> 'LT() 'compare('neg(x),'neg(y)) -> 'compare(y,x) 'compare('neg(x),'pos(y)) -> 'LT() 'compare('pos(x),'0()) -> 'GT() 'compare('pos(x),'neg(y)) -> 'GT() 'compare('pos(x),'pos(y)) -> 'compare(x,y) 'compare('s(x),'0()) -> 'GT() 'compare('s(x),'s(y)) -> 'compare(x,y) 'less(x,y) -> 'cklt('compare(x,y)) merge(l1,l2) -> merge'1(l1,l2) merge'1(dd(x,xs),l2) -> merge'2(l2,x,xs) merge'1(nil(),l2) -> l2 merge'2(dd(y,ys),x,xs) -> merge'3('less(x,y),x,xs,y,ys) merge'2(nil(),x,xs) -> dd(x,xs) merge'3('false(),x,xs,y,ys) -> dd(y,merge(dd(x,xs),ys)) merge'3('true(),x,xs,y,ys) -> dd(x,merge(xs,dd(y,ys))) mergesort(l) -> mergesort'1(l) mergesort'1(dd(x1,xs)) -> mergesort'2(xs,x1) mergesort'1(nil()) -> nil() mergesort'2(dd(x2,xs'),x1) -> mergesort'3(msplit(dd(x1,dd(x2,xs')))) mergesort'2(nil(),x1) -> dd(x1,nil()) mergesort'3(tuple'2(l1,l2)) -> merge(mergesort(l1),mergesort(l2)) msplit(l) -> msplit'1(l) msplit'1(dd(x1,xs)) -> msplit'2(xs,x1) msplit'1(nil()) -> tuple'2(nil(),nil()) msplit'2(dd(x2,xs'),x1) -> msplit'3(msplit(xs'),x1,x2) msplit'2(nil(),x1) -> tuple'2(dd(x1,nil()),nil()) msplit'3(tuple'2(l1,l2),x1,x2) -> tuple'2(dd(x1,l1),dd(x2,l2)) - Signature: {'cklt/1,'compare/2,'less/2,merge/2,merge'1/2,merge'2/3,merge'3/5,mergesort/1,mergesort'1/1,mergesort'2/2 ,mergesort'3/1,msplit/1,msplit'1/1,msplit'2/2,msplit'3/3,'cklt#/1,'compare#/2,'less#/2,merge#/2,merge'1#/2 ,merge'2#/3,merge'3#/5,mergesort#/1,mergesort'1#/1,mergesort'2#/2,mergesort'3#/1,msplit#/1,msplit'1#/1 ,msplit'2#/2,msplit'3#/3} / {'0/0,'EQ/0,'GT/0,'LT/0,'false/0,'neg/1,'pos/1,'s/1,'true/0,dd/2,nil/0,tuple'2/2 ,c_1/0,c_2/0,c_3/0,c_4/0,c_5/0,c_6/0,c_7/0,c_8/0,c_9/1,c_10/0,c_11/0,c_12/0,c_13/1,c_14/0,c_15/1,c_16/1 ,c_17/1,c_18/1,c_19/0,c_20/2,c_21/0,c_22/1,c_23/1,c_24/1,c_25/1,c_26/0,c_27/1,c_28/0,c_29/3,c_30/1,c_31/1 ,c_32/0,c_33/1,c_34/0,c_35/0} - Obligation: innermost runtime complexity wrt. defined symbols {'cklt#,'compare#,'less#,merge#,merge'1#,merge'2#,merge'3# ,mergesort#,mergesort'1#,mergesort'2#,mergesort'3#,msplit#,msplit'1#,msplit'2# ,msplit'3#} and constructors {'0,'EQ,'GT,'LT,'false,'neg,'pos,'s,'true,dd,nil,tuple'2} + Applied Processor: PredecessorEstimationCP {onSelectionCP = any intersect of rules of CDG leaf and strict-rules, withComplexityPair = NaturalMI {miDimension = 1, miDegree = 1, miKind = Algebraic, uargs = UArgs, urules = URules, selector = Nothing}} + Details: We first use the processor NaturalMI {miDimension = 1, miDegree = 1, miKind = Algebraic, uargs = UArgs, urules = URules, selector = Nothing} to orient following rules strictly: 1: merge'2#(dd(y,ys),x,xs) -> c_20(merge'3#('less(x,y),x,xs,y,ys),'less#(x,y)) Consider the set of all dependency pairs 1: merge'2#(dd(y,ys),x,xs) -> c_20(merge'3#('less(x,y),x,xs,y,ys),'less#(x,y)) 2: merge#(l1,l2) -> c_17(merge'1#(l1,l2)) 3: merge'1#(dd(x,xs),l2) -> c_18(merge'2#(l2,x,xs)) 4: merge'3#('false(),x,xs,y,ys) -> c_22(merge#(dd(x,xs),ys)) 5: merge'3#('true(),x,xs,y,ys) -> c_23(merge#(xs,dd(y,ys))) 6: mergesort#(l) -> mergesort'1#(l) 7: mergesort'1#(dd(x1,xs)) -> mergesort'2#(xs,x1) 8: mergesort'2#(dd(x2,xs'),x1) -> mergesort'3#(msplit(dd(x1,dd(x2,xs')))) 9: mergesort'3#(tuple'2(l1,l2)) -> merge#(mergesort(l1),mergesort(l2)) 10: mergesort'3#(tuple'2(l1,l2)) -> mergesort#(l1) 11: mergesort'3#(tuple'2(l1,l2)) -> mergesort#(l2) Processor NaturalMI {miDimension = 1, miDegree = 1, miKind = Algebraic, uargs = UArgs, urules = URules, selector = Nothing}induces the complexity certificateTIME (?,O(n^1)) SPACE(?,?)on application of the dependency pairs {1} These cover all (indirect) predecessors of dependency pairs {1,4,5} their number of applications is equally bounded. The dependency pairs are shifted into the weak component. ***** Step 5.a:3.b:1.a:1.a:1: NaturalMI WORST_CASE(?,O(n^1)) + Considered Problem: - Strict DPs: merge'2#(dd(y,ys),x,xs) -> c_20(merge'3#('less(x,y),x,xs,y,ys),'less#(x,y)) - Weak DPs: merge#(l1,l2) -> c_17(merge'1#(l1,l2)) merge'1#(dd(x,xs),l2) -> c_18(merge'2#(l2,x,xs)) merge'3#('false(),x,xs,y,ys) -> c_22(merge#(dd(x,xs),ys)) merge'3#('true(),x,xs,y,ys) -> c_23(merge#(xs,dd(y,ys))) mergesort#(l) -> mergesort'1#(l) mergesort'1#(dd(x1,xs)) -> mergesort'2#(xs,x1) mergesort'2#(dd(x2,xs'),x1) -> mergesort'3#(msplit(dd(x1,dd(x2,xs')))) mergesort'3#(tuple'2(l1,l2)) -> merge#(mergesort(l1),mergesort(l2)) mergesort'3#(tuple'2(l1,l2)) -> mergesort#(l1) mergesort'3#(tuple'2(l1,l2)) -> mergesort#(l2) - Weak TRS: 'cklt('EQ()) -> 'false() 'cklt('GT()) -> 'false() 'cklt('LT()) -> 'true() 'compare('0(),'0()) -> 'EQ() 'compare('0(),'neg(y)) -> 'GT() 'compare('0(),'pos(y)) -> 'LT() 'compare('0(),'s(y)) -> 'LT() 'compare('neg(x),'0()) -> 'LT() 'compare('neg(x),'neg(y)) -> 'compare(y,x) 'compare('neg(x),'pos(y)) -> 'LT() 'compare('pos(x),'0()) -> 'GT() 'compare('pos(x),'neg(y)) -> 'GT() 'compare('pos(x),'pos(y)) -> 'compare(x,y) 'compare('s(x),'0()) -> 'GT() 'compare('s(x),'s(y)) -> 'compare(x,y) 'less(x,y) -> 'cklt('compare(x,y)) merge(l1,l2) -> merge'1(l1,l2) merge'1(dd(x,xs),l2) -> merge'2(l2,x,xs) merge'1(nil(),l2) -> l2 merge'2(dd(y,ys),x,xs) -> merge'3('less(x,y),x,xs,y,ys) merge'2(nil(),x,xs) -> dd(x,xs) merge'3('false(),x,xs,y,ys) -> dd(y,merge(dd(x,xs),ys)) merge'3('true(),x,xs,y,ys) -> dd(x,merge(xs,dd(y,ys))) mergesort(l) -> mergesort'1(l) mergesort'1(dd(x1,xs)) -> mergesort'2(xs,x1) mergesort'1(nil()) -> nil() mergesort'2(dd(x2,xs'),x1) -> mergesort'3(msplit(dd(x1,dd(x2,xs')))) mergesort'2(nil(),x1) -> dd(x1,nil()) mergesort'3(tuple'2(l1,l2)) -> merge(mergesort(l1),mergesort(l2)) msplit(l) -> msplit'1(l) msplit'1(dd(x1,xs)) -> msplit'2(xs,x1) msplit'1(nil()) -> tuple'2(nil(),nil()) msplit'2(dd(x2,xs'),x1) -> msplit'3(msplit(xs'),x1,x2) msplit'2(nil(),x1) -> tuple'2(dd(x1,nil()),nil()) msplit'3(tuple'2(l1,l2),x1,x2) -> tuple'2(dd(x1,l1),dd(x2,l2)) - Signature: {'cklt/1,'compare/2,'less/2,merge/2,merge'1/2,merge'2/3,merge'3/5,mergesort/1,mergesort'1/1,mergesort'2/2 ,mergesort'3/1,msplit/1,msplit'1/1,msplit'2/2,msplit'3/3,'cklt#/1,'compare#/2,'less#/2,merge#/2,merge'1#/2 ,merge'2#/3,merge'3#/5,mergesort#/1,mergesort'1#/1,mergesort'2#/2,mergesort'3#/1,msplit#/1,msplit'1#/1 ,msplit'2#/2,msplit'3#/3} / {'0/0,'EQ/0,'GT/0,'LT/0,'false/0,'neg/1,'pos/1,'s/1,'true/0,dd/2,nil/0,tuple'2/2 ,c_1/0,c_2/0,c_3/0,c_4/0,c_5/0,c_6/0,c_7/0,c_8/0,c_9/1,c_10/0,c_11/0,c_12/0,c_13/1,c_14/0,c_15/1,c_16/1 ,c_17/1,c_18/1,c_19/0,c_20/2,c_21/0,c_22/1,c_23/1,c_24/1,c_25/1,c_26/0,c_27/1,c_28/0,c_29/3,c_30/1,c_31/1 ,c_32/0,c_33/1,c_34/0,c_35/0} - Obligation: innermost runtime complexity wrt. defined symbols {'cklt#,'compare#,'less#,merge#,merge'1#,merge'2#,merge'3# ,mergesort#,mergesort'1#,mergesort'2#,mergesort'3#,msplit#,msplit'1#,msplit'2# ,msplit'3#} and constructors {'0,'EQ,'GT,'LT,'false,'neg,'pos,'s,'true,dd,nil,tuple'2} + Applied Processor: NaturalMI {miDimension = 1, miDegree = 1, miKind = Algebraic, uargs = UArgs, urules = URules, selector = Just first alternative for predecessorEstimation on any intersect of rules of CDG leaf and strict-rules} + Details: We apply a matrix interpretation of kind constructor based matrix interpretation: The following argument positions are considered usable: uargs(c_17) = {1}, uargs(c_18) = {1}, uargs(c_20) = {1}, uargs(c_22) = {1}, uargs(c_23) = {1} Following symbols are considered usable: {'cklt,'less,merge,merge'1,merge'2,merge'3,mergesort,mergesort'1,mergesort'2,mergesort'3,msplit,msplit'1 ,msplit'2,msplit'3,'cklt#,'compare#,'less#,merge#,merge'1#,merge'2#,merge'3#,mergesort#,mergesort'1# ,mergesort'2#,mergesort'3#,msplit#,msplit'1#,msplit'2#,msplit'3#} TcT has computed the following interpretation: p('0) = [0] p('EQ) = [0] p('GT) = [0] p('LT) = [0] p('cklt) = [1] p('compare) = [0] p('false) = [1] p('less) = [1] p('neg) = [0] p('pos) = [1] x1 + [0] p('s) = [1] p('true) = [1] p(dd) = [1] x2 + [2] p(merge) = [1] x1 + [1] x2 + [0] p(merge'1) = [1] x1 + [1] x2 + [0] p(merge'2) = [1] x1 + [1] x3 + [2] p(merge'3) = [4] x1 + [1] x3 + [1] x5 + [0] p(mergesort) = [1] x1 + [0] p(mergesort'1) = [1] x1 + [0] p(mergesort'2) = [1] x1 + [2] p(mergesort'3) = [1] x1 + [0] p(msplit) = [1] x1 + [0] p(msplit'1) = [1] x1 + [0] p(msplit'2) = [1] x1 + [2] p(msplit'3) = [1] x1 + [4] p(nil) = [0] p(tuple'2) = [1] x1 + [1] x2 + [0] p('cklt#) = [1] x1 + [2] p('compare#) = [2] x2 + [0] p('less#) = [0] p(merge#) = [1] x1 + [2] x2 + [3] p(merge'1#) = [1] x1 + [2] x2 + [3] p(merge'2#) = [2] x1 + [1] x3 + [5] p(merge'3#) = [5] x1 + [1] x3 + [2] x5 + [3] p(mergesort#) = [2] x1 + [3] p(mergesort'1#) = [2] x1 + [3] p(mergesort'2#) = [2] x1 + [7] p(mergesort'3#) = [2] x1 + [3] p(msplit#) = [0] p(msplit'1#) = [0] p(msplit'2#) = [4] x1 + [4] p(msplit'3#) = [1] x3 + [0] p(c_1) = [0] p(c_2) = [2] p(c_3) = [1] p(c_4) = [0] p(c_5) = [0] p(c_6) = [0] p(c_7) = [1] p(c_8) = [0] p(c_9) = [2] x1 + [0] p(c_10) = [0] p(c_11) = [4] p(c_12) = [1] p(c_13) = [0] p(c_14) = [0] p(c_15) = [0] p(c_16) = [1] p(c_17) = [1] x1 + [0] p(c_18) = [1] x1 + [0] p(c_19) = [2] p(c_20) = [1] x1 + [4] x2 + [0] p(c_21) = [1] p(c_22) = [1] x1 + [0] p(c_23) = [1] x1 + [0] p(c_24) = [4] x1 + [4] p(c_25) = [0] p(c_26) = [0] p(c_27) = [4] x1 + [2] p(c_28) = [1] p(c_29) = [2] x1 + [2] x2 + [1] x3 + [1] p(c_30) = [2] x1 + [0] p(c_31) = [1] x1 + [0] p(c_32) = [0] p(c_33) = [4] p(c_34) = [0] p(c_35) = [1] Following rules are strictly oriented: merge'2#(dd(y,ys),x,xs) = [1] xs + [2] ys + [9] > [1] xs + [2] ys + [8] = c_20(merge'3#('less(x,y),x,xs,y,ys),'less#(x,y)) Following rules are (at-least) weakly oriented: merge#(l1,l2) = [1] l1 + [2] l2 + [3] >= [1] l1 + [2] l2 + [3] = c_17(merge'1#(l1,l2)) merge'1#(dd(x,xs),l2) = [2] l2 + [1] xs + [5] >= [2] l2 + [1] xs + [5] = c_18(merge'2#(l2,x,xs)) merge'3#('false(),x,xs,y,ys) = [1] xs + [2] ys + [8] >= [1] xs + [2] ys + [5] = c_22(merge#(dd(x,xs),ys)) merge'3#('true(),x,xs,y,ys) = [1] xs + [2] ys + [8] >= [1] xs + [2] ys + [7] = c_23(merge#(xs,dd(y,ys))) mergesort#(l) = [2] l + [3] >= [2] l + [3] = mergesort'1#(l) mergesort'1#(dd(x1,xs)) = [2] xs + [7] >= [2] xs + [7] = mergesort'2#(xs,x1) mergesort'2#(dd(x2,xs'),x1) = [2] xs' + [11] >= [2] xs' + [11] = mergesort'3#(msplit(dd(x1,dd(x2,xs')))) mergesort'3#(tuple'2(l1,l2)) = [2] l1 + [2] l2 + [3] >= [1] l1 + [2] l2 + [3] = merge#(mergesort(l1),mergesort(l2)) mergesort'3#(tuple'2(l1,l2)) = [2] l1 + [2] l2 + [3] >= [2] l1 + [3] = mergesort#(l1) mergesort'3#(tuple'2(l1,l2)) = [2] l1 + [2] l2 + [3] >= [2] l2 + [3] = mergesort#(l2) 'cklt('EQ()) = [1] >= [1] = 'false() 'cklt('GT()) = [1] >= [1] = 'false() 'cklt('LT()) = [1] >= [1] = 'true() 'less(x,y) = [1] >= [1] = 'cklt('compare(x,y)) merge(l1,l2) = [1] l1 + [1] l2 + [0] >= [1] l1 + [1] l2 + [0] = merge'1(l1,l2) merge'1(dd(x,xs),l2) = [1] l2 + [1] xs + [2] >= [1] l2 + [1] xs + [2] = merge'2(l2,x,xs) merge'1(nil(),l2) = [1] l2 + [0] >= [1] l2 + [0] = l2 merge'2(dd(y,ys),x,xs) = [1] xs + [1] ys + [4] >= [1] xs + [1] ys + [4] = merge'3('less(x,y),x,xs,y,ys) merge'2(nil(),x,xs) = [1] xs + [2] >= [1] xs + [2] = dd(x,xs) merge'3('false(),x,xs,y,ys) = [1] xs + [1] ys + [4] >= [1] xs + [1] ys + [4] = dd(y,merge(dd(x,xs),ys)) merge'3('true(),x,xs,y,ys) = [1] xs + [1] ys + [4] >= [1] xs + [1] ys + [4] = dd(x,merge(xs,dd(y,ys))) mergesort(l) = [1] l + [0] >= [1] l + [0] = mergesort'1(l) mergesort'1(dd(x1,xs)) = [1] xs + [2] >= [1] xs + [2] = mergesort'2(xs,x1) mergesort'1(nil()) = [0] >= [0] = nil() mergesort'2(dd(x2,xs'),x1) = [1] xs' + [4] >= [1] xs' + [4] = mergesort'3(msplit(dd(x1,dd(x2,xs')))) mergesort'2(nil(),x1) = [2] >= [2] = dd(x1,nil()) mergesort'3(tuple'2(l1,l2)) = [1] l1 + [1] l2 + [0] >= [1] l1 + [1] l2 + [0] = merge(mergesort(l1),mergesort(l2)) msplit(l) = [1] l + [0] >= [1] l + [0] = msplit'1(l) msplit'1(dd(x1,xs)) = [1] xs + [2] >= [1] xs + [2] = msplit'2(xs,x1) msplit'1(nil()) = [0] >= [0] = tuple'2(nil(),nil()) msplit'2(dd(x2,xs'),x1) = [1] xs' + [4] >= [1] xs' + [4] = msplit'3(msplit(xs'),x1,x2) msplit'2(nil(),x1) = [2] >= [2] = tuple'2(dd(x1,nil()),nil()) msplit'3(tuple'2(l1,l2),x1,x2) = [1] l1 + [1] l2 + [4] >= [1] l1 + [1] l2 + [4] = tuple'2(dd(x1,l1),dd(x2,l2)) ***** Step 5.a:3.b:1.a:1.a:2: Assumption WORST_CASE(?,O(1)) + Considered Problem: - Weak DPs: merge#(l1,l2) -> c_17(merge'1#(l1,l2)) merge'1#(dd(x,xs),l2) -> c_18(merge'2#(l2,x,xs)) merge'2#(dd(y,ys),x,xs) -> c_20(merge'3#('less(x,y),x,xs,y,ys),'less#(x,y)) merge'3#('false(),x,xs,y,ys) -> c_22(merge#(dd(x,xs),ys)) merge'3#('true(),x,xs,y,ys) -> c_23(merge#(xs,dd(y,ys))) mergesort#(l) -> mergesort'1#(l) mergesort'1#(dd(x1,xs)) -> mergesort'2#(xs,x1) mergesort'2#(dd(x2,xs'),x1) -> mergesort'3#(msplit(dd(x1,dd(x2,xs')))) mergesort'3#(tuple'2(l1,l2)) -> merge#(mergesort(l1),mergesort(l2)) mergesort'3#(tuple'2(l1,l2)) -> mergesort#(l1) mergesort'3#(tuple'2(l1,l2)) -> mergesort#(l2) - Weak TRS: 'cklt('EQ()) -> 'false() 'cklt('GT()) -> 'false() 'cklt('LT()) -> 'true() 'compare('0(),'0()) -> 'EQ() 'compare('0(),'neg(y)) -> 'GT() 'compare('0(),'pos(y)) -> 'LT() 'compare('0(),'s(y)) -> 'LT() 'compare('neg(x),'0()) -> 'LT() 'compare('neg(x),'neg(y)) -> 'compare(y,x) 'compare('neg(x),'pos(y)) -> 'LT() 'compare('pos(x),'0()) -> 'GT() 'compare('pos(x),'neg(y)) -> 'GT() 'compare('pos(x),'pos(y)) -> 'compare(x,y) 'compare('s(x),'0()) -> 'GT() 'compare('s(x),'s(y)) -> 'compare(x,y) 'less(x,y) -> 'cklt('compare(x,y)) merge(l1,l2) -> merge'1(l1,l2) merge'1(dd(x,xs),l2) -> merge'2(l2,x,xs) merge'1(nil(),l2) -> l2 merge'2(dd(y,ys),x,xs) -> merge'3('less(x,y),x,xs,y,ys) merge'2(nil(),x,xs) -> dd(x,xs) merge'3('false(),x,xs,y,ys) -> dd(y,merge(dd(x,xs),ys)) merge'3('true(),x,xs,y,ys) -> dd(x,merge(xs,dd(y,ys))) mergesort(l) -> mergesort'1(l) mergesort'1(dd(x1,xs)) -> mergesort'2(xs,x1) mergesort'1(nil()) -> nil() mergesort'2(dd(x2,xs'),x1) -> mergesort'3(msplit(dd(x1,dd(x2,xs')))) mergesort'2(nil(),x1) -> dd(x1,nil()) mergesort'3(tuple'2(l1,l2)) -> merge(mergesort(l1),mergesort(l2)) msplit(l) -> msplit'1(l) msplit'1(dd(x1,xs)) -> msplit'2(xs,x1) msplit'1(nil()) -> tuple'2(nil(),nil()) msplit'2(dd(x2,xs'),x1) -> msplit'3(msplit(xs'),x1,x2) msplit'2(nil(),x1) -> tuple'2(dd(x1,nil()),nil()) msplit'3(tuple'2(l1,l2),x1,x2) -> tuple'2(dd(x1,l1),dd(x2,l2)) - Signature: {'cklt/1,'compare/2,'less/2,merge/2,merge'1/2,merge'2/3,merge'3/5,mergesort/1,mergesort'1/1,mergesort'2/2 ,mergesort'3/1,msplit/1,msplit'1/1,msplit'2/2,msplit'3/3,'cklt#/1,'compare#/2,'less#/2,merge#/2,merge'1#/2 ,merge'2#/3,merge'3#/5,mergesort#/1,mergesort'1#/1,mergesort'2#/2,mergesort'3#/1,msplit#/1,msplit'1#/1 ,msplit'2#/2,msplit'3#/3} / {'0/0,'EQ/0,'GT/0,'LT/0,'false/0,'neg/1,'pos/1,'s/1,'true/0,dd/2,nil/0,tuple'2/2 ,c_1/0,c_2/0,c_3/0,c_4/0,c_5/0,c_6/0,c_7/0,c_8/0,c_9/1,c_10/0,c_11/0,c_12/0,c_13/1,c_14/0,c_15/1,c_16/1 ,c_17/1,c_18/1,c_19/0,c_20/2,c_21/0,c_22/1,c_23/1,c_24/1,c_25/1,c_26/0,c_27/1,c_28/0,c_29/3,c_30/1,c_31/1 ,c_32/0,c_33/1,c_34/0,c_35/0} - Obligation: innermost runtime complexity wrt. defined symbols {'cklt#,'compare#,'less#,merge#,merge'1#,merge'2#,merge'3# ,mergesort#,mergesort'1#,mergesort'2#,mergesort'3#,msplit#,msplit'1#,msplit'2# ,msplit'3#} and constructors {'0,'EQ,'GT,'LT,'false,'neg,'pos,'s,'true,dd,nil,tuple'2} + Applied Processor: Assumption {assumed = Certificate {spaceUB = Unknown, spaceLB = Unknown, timeUB = Poly (Just 0), timeLB = Unknown}} + Details: () ***** Step 5.a:3.b:1.a:1.b:1: RemoveWeakSuffixes WORST_CASE(?,O(1)) + Considered Problem: - Weak DPs: merge#(l1,l2) -> c_17(merge'1#(l1,l2)) merge'1#(dd(x,xs),l2) -> c_18(merge'2#(l2,x,xs)) merge'2#(dd(y,ys),x,xs) -> c_20(merge'3#('less(x,y),x,xs,y,ys),'less#(x,y)) merge'3#('false(),x,xs,y,ys) -> c_22(merge#(dd(x,xs),ys)) merge'3#('true(),x,xs,y,ys) -> c_23(merge#(xs,dd(y,ys))) mergesort#(l) -> mergesort'1#(l) mergesort'1#(dd(x1,xs)) -> mergesort'2#(xs,x1) mergesort'2#(dd(x2,xs'),x1) -> mergesort'3#(msplit(dd(x1,dd(x2,xs')))) mergesort'3#(tuple'2(l1,l2)) -> merge#(mergesort(l1),mergesort(l2)) mergesort'3#(tuple'2(l1,l2)) -> mergesort#(l1) mergesort'3#(tuple'2(l1,l2)) -> mergesort#(l2) - Weak TRS: 'cklt('EQ()) -> 'false() 'cklt('GT()) -> 'false() 'cklt('LT()) -> 'true() 'compare('0(),'0()) -> 'EQ() 'compare('0(),'neg(y)) -> 'GT() 'compare('0(),'pos(y)) -> 'LT() 'compare('0(),'s(y)) -> 'LT() 'compare('neg(x),'0()) -> 'LT() 'compare('neg(x),'neg(y)) -> 'compare(y,x) 'compare('neg(x),'pos(y)) -> 'LT() 'compare('pos(x),'0()) -> 'GT() 'compare('pos(x),'neg(y)) -> 'GT() 'compare('pos(x),'pos(y)) -> 'compare(x,y) 'compare('s(x),'0()) -> 'GT() 'compare('s(x),'s(y)) -> 'compare(x,y) 'less(x,y) -> 'cklt('compare(x,y)) merge(l1,l2) -> merge'1(l1,l2) merge'1(dd(x,xs),l2) -> merge'2(l2,x,xs) merge'1(nil(),l2) -> l2 merge'2(dd(y,ys),x,xs) -> merge'3('less(x,y),x,xs,y,ys) merge'2(nil(),x,xs) -> dd(x,xs) merge'3('false(),x,xs,y,ys) -> dd(y,merge(dd(x,xs),ys)) merge'3('true(),x,xs,y,ys) -> dd(x,merge(xs,dd(y,ys))) mergesort(l) -> mergesort'1(l) mergesort'1(dd(x1,xs)) -> mergesort'2(xs,x1) mergesort'1(nil()) -> nil() mergesort'2(dd(x2,xs'),x1) -> mergesort'3(msplit(dd(x1,dd(x2,xs')))) mergesort'2(nil(),x1) -> dd(x1,nil()) mergesort'3(tuple'2(l1,l2)) -> merge(mergesort(l1),mergesort(l2)) msplit(l) -> msplit'1(l) msplit'1(dd(x1,xs)) -> msplit'2(xs,x1) msplit'1(nil()) -> tuple'2(nil(),nil()) msplit'2(dd(x2,xs'),x1) -> msplit'3(msplit(xs'),x1,x2) msplit'2(nil(),x1) -> tuple'2(dd(x1,nil()),nil()) msplit'3(tuple'2(l1,l2),x1,x2) -> tuple'2(dd(x1,l1),dd(x2,l2)) - Signature: {'cklt/1,'compare/2,'less/2,merge/2,merge'1/2,merge'2/3,merge'3/5,mergesort/1,mergesort'1/1,mergesort'2/2 ,mergesort'3/1,msplit/1,msplit'1/1,msplit'2/2,msplit'3/3,'cklt#/1,'compare#/2,'less#/2,merge#/2,merge'1#/2 ,merge'2#/3,merge'3#/5,mergesort#/1,mergesort'1#/1,mergesort'2#/2,mergesort'3#/1,msplit#/1,msplit'1#/1 ,msplit'2#/2,msplit'3#/3} / {'0/0,'EQ/0,'GT/0,'LT/0,'false/0,'neg/1,'pos/1,'s/1,'true/0,dd/2,nil/0,tuple'2/2 ,c_1/0,c_2/0,c_3/0,c_4/0,c_5/0,c_6/0,c_7/0,c_8/0,c_9/1,c_10/0,c_11/0,c_12/0,c_13/1,c_14/0,c_15/1,c_16/1 ,c_17/1,c_18/1,c_19/0,c_20/2,c_21/0,c_22/1,c_23/1,c_24/1,c_25/1,c_26/0,c_27/1,c_28/0,c_29/3,c_30/1,c_31/1 ,c_32/0,c_33/1,c_34/0,c_35/0} - Obligation: innermost runtime complexity wrt. defined symbols {'cklt#,'compare#,'less#,merge#,merge'1#,merge'2#,merge'3# ,mergesort#,mergesort'1#,mergesort'2#,mergesort'3#,msplit#,msplit'1#,msplit'2# ,msplit'3#} and constructors {'0,'EQ,'GT,'LT,'false,'neg,'pos,'s,'true,dd,nil,tuple'2} + Applied Processor: RemoveWeakSuffixes + Details: Consider the dependency graph 1:W:merge#(l1,l2) -> c_17(merge'1#(l1,l2)) -->_1 merge'1#(dd(x,xs),l2) -> c_18(merge'2#(l2,x,xs)):2 2:W:merge'1#(dd(x,xs),l2) -> c_18(merge'2#(l2,x,xs)) -->_1 merge'2#(dd(y,ys),x,xs) -> c_20(merge'3#('less(x,y),x,xs,y,ys),'less#(x,y)):3 3:W:merge'2#(dd(y,ys),x,xs) -> c_20(merge'3#('less(x,y),x,xs,y,ys),'less#(x,y)) -->_1 merge'3#('true(),x,xs,y,ys) -> c_23(merge#(xs,dd(y,ys))):5 -->_1 merge'3#('false(),x,xs,y,ys) -> c_22(merge#(dd(x,xs),ys)):4 4:W:merge'3#('false(),x,xs,y,ys) -> c_22(merge#(dd(x,xs),ys)) -->_1 merge#(l1,l2) -> c_17(merge'1#(l1,l2)):1 5:W:merge'3#('true(),x,xs,y,ys) -> c_23(merge#(xs,dd(y,ys))) -->_1 merge#(l1,l2) -> c_17(merge'1#(l1,l2)):1 6:W:mergesort#(l) -> mergesort'1#(l) -->_1 mergesort'1#(dd(x1,xs)) -> mergesort'2#(xs,x1):7 7:W:mergesort'1#(dd(x1,xs)) -> mergesort'2#(xs,x1) -->_1 mergesort'2#(dd(x2,xs'),x1) -> mergesort'3#(msplit(dd(x1,dd(x2,xs')))):8 8:W:mergesort'2#(dd(x2,xs'),x1) -> mergesort'3#(msplit(dd(x1,dd(x2,xs')))) -->_1 mergesort'3#(tuple'2(l1,l2)) -> mergesort#(l2):11 -->_1 mergesort'3#(tuple'2(l1,l2)) -> mergesort#(l1):10 -->_1 mergesort'3#(tuple'2(l1,l2)) -> merge#(mergesort(l1),mergesort(l2)):9 9:W:mergesort'3#(tuple'2(l1,l2)) -> merge#(mergesort(l1),mergesort(l2)) -->_1 merge#(l1,l2) -> c_17(merge'1#(l1,l2)):1 10:W:mergesort'3#(tuple'2(l1,l2)) -> mergesort#(l1) -->_1 mergesort#(l) -> mergesort'1#(l):6 11:W:mergesort'3#(tuple'2(l1,l2)) -> mergesort#(l2) -->_1 mergesort#(l) -> mergesort'1#(l):6 The following weak DPs constitute a sub-graph of the DG that is closed under successors. The DPs are removed. 6: mergesort#(l) -> mergesort'1#(l) 11: mergesort'3#(tuple'2(l1,l2)) -> mergesort#(l2) 8: mergesort'2#(dd(x2,xs'),x1) -> mergesort'3#(msplit(dd(x1,dd(x2,xs')))) 7: mergesort'1#(dd(x1,xs)) -> mergesort'2#(xs,x1) 10: mergesort'3#(tuple'2(l1,l2)) -> mergesort#(l1) 9: mergesort'3#(tuple'2(l1,l2)) -> merge#(mergesort(l1),mergesort(l2)) 1: merge#(l1,l2) -> c_17(merge'1#(l1,l2)) 5: merge'3#('true(),x,xs,y,ys) -> c_23(merge#(xs,dd(y,ys))) 3: merge'2#(dd(y,ys),x,xs) -> c_20(merge'3#('less(x,y),x,xs,y,ys),'less#(x,y)) 2: merge'1#(dd(x,xs),l2) -> c_18(merge'2#(l2,x,xs)) 4: merge'3#('false(),x,xs,y,ys) -> c_22(merge#(dd(x,xs),ys)) ***** Step 5.a:3.b:1.a:1.b:2: EmptyProcessor WORST_CASE(?,O(1)) + Considered Problem: - Weak TRS: 'cklt('EQ()) -> 'false() 'cklt('GT()) -> 'false() 'cklt('LT()) -> 'true() 'compare('0(),'0()) -> 'EQ() 'compare('0(),'neg(y)) -> 'GT() 'compare('0(),'pos(y)) -> 'LT() 'compare('0(),'s(y)) -> 'LT() 'compare('neg(x),'0()) -> 'LT() 'compare('neg(x),'neg(y)) -> 'compare(y,x) 'compare('neg(x),'pos(y)) -> 'LT() 'compare('pos(x),'0()) -> 'GT() 'compare('pos(x),'neg(y)) -> 'GT() 'compare('pos(x),'pos(y)) -> 'compare(x,y) 'compare('s(x),'0()) -> 'GT() 'compare('s(x),'s(y)) -> 'compare(x,y) 'less(x,y) -> 'cklt('compare(x,y)) merge(l1,l2) -> merge'1(l1,l2) merge'1(dd(x,xs),l2) -> merge'2(l2,x,xs) merge'1(nil(),l2) -> l2 merge'2(dd(y,ys),x,xs) -> merge'3('less(x,y),x,xs,y,ys) merge'2(nil(),x,xs) -> dd(x,xs) merge'3('false(),x,xs,y,ys) -> dd(y,merge(dd(x,xs),ys)) merge'3('true(),x,xs,y,ys) -> dd(x,merge(xs,dd(y,ys))) mergesort(l) -> mergesort'1(l) mergesort'1(dd(x1,xs)) -> mergesort'2(xs,x1) mergesort'1(nil()) -> nil() mergesort'2(dd(x2,xs'),x1) -> mergesort'3(msplit(dd(x1,dd(x2,xs')))) mergesort'2(nil(),x1) -> dd(x1,nil()) mergesort'3(tuple'2(l1,l2)) -> merge(mergesort(l1),mergesort(l2)) msplit(l) -> msplit'1(l) msplit'1(dd(x1,xs)) -> msplit'2(xs,x1) msplit'1(nil()) -> tuple'2(nil(),nil()) msplit'2(dd(x2,xs'),x1) -> msplit'3(msplit(xs'),x1,x2) msplit'2(nil(),x1) -> tuple'2(dd(x1,nil()),nil()) msplit'3(tuple'2(l1,l2),x1,x2) -> tuple'2(dd(x1,l1),dd(x2,l2)) - Signature: {'cklt/1,'compare/2,'less/2,merge/2,merge'1/2,merge'2/3,merge'3/5,mergesort/1,mergesort'1/1,mergesort'2/2 ,mergesort'3/1,msplit/1,msplit'1/1,msplit'2/2,msplit'3/3,'cklt#/1,'compare#/2,'less#/2,merge#/2,merge'1#/2 ,merge'2#/3,merge'3#/5,mergesort#/1,mergesort'1#/1,mergesort'2#/2,mergesort'3#/1,msplit#/1,msplit'1#/1 ,msplit'2#/2,msplit'3#/3} / {'0/0,'EQ/0,'GT/0,'LT/0,'false/0,'neg/1,'pos/1,'s/1,'true/0,dd/2,nil/0,tuple'2/2 ,c_1/0,c_2/0,c_3/0,c_4/0,c_5/0,c_6/0,c_7/0,c_8/0,c_9/1,c_10/0,c_11/0,c_12/0,c_13/1,c_14/0,c_15/1,c_16/1 ,c_17/1,c_18/1,c_19/0,c_20/2,c_21/0,c_22/1,c_23/1,c_24/1,c_25/1,c_26/0,c_27/1,c_28/0,c_29/3,c_30/1,c_31/1 ,c_32/0,c_33/1,c_34/0,c_35/0} - Obligation: innermost runtime complexity wrt. defined symbols {'cklt#,'compare#,'less#,merge#,merge'1#,merge'2#,merge'3# ,mergesort#,mergesort'1#,mergesort'2#,mergesort'3#,msplit#,msplit'1#,msplit'2# ,msplit'3#} and constructors {'0,'EQ,'GT,'LT,'false,'neg,'pos,'s,'true,dd,nil,tuple'2} + Applied Processor: EmptyProcessor + Details: The problem is already closed. The intended complexity is O(1). **** Step 5.a:3.b:1.b:1: PredecessorEstimationCP WORST_CASE(?,O(n^1)) + Considered Problem: - Strict DPs: 'compare#('neg(x),'neg(y)) -> c_9('compare#(y,x)) 'compare#('pos(x),'pos(y)) -> c_13('compare#(x,y)) 'compare#('s(x),'s(y)) -> c_15('compare#(x,y)) - Weak DPs: 'less#(x,y) -> c_16('compare#(x,y)) merge#(l1,l2) -> merge'1#(l1,l2) merge'1#(dd(x,xs),l2) -> merge'2#(l2,x,xs) merge'2#(dd(y,ys),x,xs) -> 'less#(x,y) merge'2#(dd(y,ys),x,xs) -> merge'3#('less(x,y),x,xs,y,ys) merge'3#('false(),x,xs,y,ys) -> merge#(dd(x,xs),ys) merge'3#('true(),x,xs,y,ys) -> merge#(xs,dd(y,ys)) mergesort#(l) -> mergesort'1#(l) mergesort'1#(dd(x1,xs)) -> mergesort'2#(xs,x1) mergesort'2#(dd(x2,xs'),x1) -> mergesort'3#(msplit(dd(x1,dd(x2,xs')))) mergesort'3#(tuple'2(l1,l2)) -> merge#(mergesort(l1),mergesort(l2)) mergesort'3#(tuple'2(l1,l2)) -> mergesort#(l1) mergesort'3#(tuple'2(l1,l2)) -> mergesort#(l2) - Weak TRS: 'cklt('EQ()) -> 'false() 'cklt('GT()) -> 'false() 'cklt('LT()) -> 'true() 'compare('0(),'0()) -> 'EQ() 'compare('0(),'neg(y)) -> 'GT() 'compare('0(),'pos(y)) -> 'LT() 'compare('0(),'s(y)) -> 'LT() 'compare('neg(x),'0()) -> 'LT() 'compare('neg(x),'neg(y)) -> 'compare(y,x) 'compare('neg(x),'pos(y)) -> 'LT() 'compare('pos(x),'0()) -> 'GT() 'compare('pos(x),'neg(y)) -> 'GT() 'compare('pos(x),'pos(y)) -> 'compare(x,y) 'compare('s(x),'0()) -> 'GT() 'compare('s(x),'s(y)) -> 'compare(x,y) 'less(x,y) -> 'cklt('compare(x,y)) merge(l1,l2) -> merge'1(l1,l2) merge'1(dd(x,xs),l2) -> merge'2(l2,x,xs) merge'1(nil(),l2) -> l2 merge'2(dd(y,ys),x,xs) -> merge'3('less(x,y),x,xs,y,ys) merge'2(nil(),x,xs) -> dd(x,xs) merge'3('false(),x,xs,y,ys) -> dd(y,merge(dd(x,xs),ys)) merge'3('true(),x,xs,y,ys) -> dd(x,merge(xs,dd(y,ys))) mergesort(l) -> mergesort'1(l) mergesort'1(dd(x1,xs)) -> mergesort'2(xs,x1) mergesort'1(nil()) -> nil() mergesort'2(dd(x2,xs'),x1) -> mergesort'3(msplit(dd(x1,dd(x2,xs')))) mergesort'2(nil(),x1) -> dd(x1,nil()) mergesort'3(tuple'2(l1,l2)) -> merge(mergesort(l1),mergesort(l2)) msplit(l) -> msplit'1(l) msplit'1(dd(x1,xs)) -> msplit'2(xs,x1) msplit'1(nil()) -> tuple'2(nil(),nil()) msplit'2(dd(x2,xs'),x1) -> msplit'3(msplit(xs'),x1,x2) msplit'2(nil(),x1) -> tuple'2(dd(x1,nil()),nil()) msplit'3(tuple'2(l1,l2),x1,x2) -> tuple'2(dd(x1,l1),dd(x2,l2)) - Signature: {'cklt/1,'compare/2,'less/2,merge/2,merge'1/2,merge'2/3,merge'3/5,mergesort/1,mergesort'1/1,mergesort'2/2 ,mergesort'3/1,msplit/1,msplit'1/1,msplit'2/2,msplit'3/3,'cklt#/1,'compare#/2,'less#/2,merge#/2,merge'1#/2 ,merge'2#/3,merge'3#/5,mergesort#/1,mergesort'1#/1,mergesort'2#/2,mergesort'3#/1,msplit#/1,msplit'1#/1 ,msplit'2#/2,msplit'3#/3} / {'0/0,'EQ/0,'GT/0,'LT/0,'false/0,'neg/1,'pos/1,'s/1,'true/0,dd/2,nil/0,tuple'2/2 ,c_1/0,c_2/0,c_3/0,c_4/0,c_5/0,c_6/0,c_7/0,c_8/0,c_9/1,c_10/0,c_11/0,c_12/0,c_13/1,c_14/0,c_15/1,c_16/1 ,c_17/1,c_18/1,c_19/0,c_20/2,c_21/0,c_22/1,c_23/1,c_24/1,c_25/1,c_26/0,c_27/1,c_28/0,c_29/3,c_30/1,c_31/1 ,c_32/0,c_33/1,c_34/0,c_35/0} - Obligation: innermost runtime complexity wrt. defined symbols {'cklt#,'compare#,'less#,merge#,merge'1#,merge'2#,merge'3# ,mergesort#,mergesort'1#,mergesort'2#,mergesort'3#,msplit#,msplit'1#,msplit'2# ,msplit'3#} and constructors {'0,'EQ,'GT,'LT,'false,'neg,'pos,'s,'true,dd,nil,tuple'2} + Applied Processor: PredecessorEstimationCP {onSelectionCP = any intersect of rules of CDG leaf and strict-rules, withComplexityPair = NaturalMI {miDimension = 1, miDegree = 1, miKind = Algebraic, uargs = UArgs, urules = URules, selector = Nothing}} + Details: We first use the processor NaturalMI {miDimension = 1, miDegree = 1, miKind = Algebraic, uargs = UArgs, urules = URules, selector = Nothing} to orient following rules strictly: 2: 'compare#('pos(x),'pos(y)) -> c_13('compare#(x,y)) The strictly oriented rules are moved into the weak component. ***** Step 5.a:3.b:1.b:1.a:1: NaturalMI WORST_CASE(?,O(n^1)) + Considered Problem: - Strict DPs: 'compare#('neg(x),'neg(y)) -> c_9('compare#(y,x)) 'compare#('pos(x),'pos(y)) -> c_13('compare#(x,y)) 'compare#('s(x),'s(y)) -> c_15('compare#(x,y)) - Weak DPs: 'less#(x,y) -> c_16('compare#(x,y)) merge#(l1,l2) -> merge'1#(l1,l2) merge'1#(dd(x,xs),l2) -> merge'2#(l2,x,xs) merge'2#(dd(y,ys),x,xs) -> 'less#(x,y) merge'2#(dd(y,ys),x,xs) -> merge'3#('less(x,y),x,xs,y,ys) merge'3#('false(),x,xs,y,ys) -> merge#(dd(x,xs),ys) merge'3#('true(),x,xs,y,ys) -> merge#(xs,dd(y,ys)) mergesort#(l) -> mergesort'1#(l) mergesort'1#(dd(x1,xs)) -> mergesort'2#(xs,x1) mergesort'2#(dd(x2,xs'),x1) -> mergesort'3#(msplit(dd(x1,dd(x2,xs')))) mergesort'3#(tuple'2(l1,l2)) -> merge#(mergesort(l1),mergesort(l2)) mergesort'3#(tuple'2(l1,l2)) -> mergesort#(l1) mergesort'3#(tuple'2(l1,l2)) -> mergesort#(l2) - Weak TRS: 'cklt('EQ()) -> 'false() 'cklt('GT()) -> 'false() 'cklt('LT()) -> 'true() 'compare('0(),'0()) -> 'EQ() 'compare('0(),'neg(y)) -> 'GT() 'compare('0(),'pos(y)) -> 'LT() 'compare('0(),'s(y)) -> 'LT() 'compare('neg(x),'0()) -> 'LT() 'compare('neg(x),'neg(y)) -> 'compare(y,x) 'compare('neg(x),'pos(y)) -> 'LT() 'compare('pos(x),'0()) -> 'GT() 'compare('pos(x),'neg(y)) -> 'GT() 'compare('pos(x),'pos(y)) -> 'compare(x,y) 'compare('s(x),'0()) -> 'GT() 'compare('s(x),'s(y)) -> 'compare(x,y) 'less(x,y) -> 'cklt('compare(x,y)) merge(l1,l2) -> merge'1(l1,l2) merge'1(dd(x,xs),l2) -> merge'2(l2,x,xs) merge'1(nil(),l2) -> l2 merge'2(dd(y,ys),x,xs) -> merge'3('less(x,y),x,xs,y,ys) merge'2(nil(),x,xs) -> dd(x,xs) merge'3('false(),x,xs,y,ys) -> dd(y,merge(dd(x,xs),ys)) merge'3('true(),x,xs,y,ys) -> dd(x,merge(xs,dd(y,ys))) mergesort(l) -> mergesort'1(l) mergesort'1(dd(x1,xs)) -> mergesort'2(xs,x1) mergesort'1(nil()) -> nil() mergesort'2(dd(x2,xs'),x1) -> mergesort'3(msplit(dd(x1,dd(x2,xs')))) mergesort'2(nil(),x1) -> dd(x1,nil()) mergesort'3(tuple'2(l1,l2)) -> merge(mergesort(l1),mergesort(l2)) msplit(l) -> msplit'1(l) msplit'1(dd(x1,xs)) -> msplit'2(xs,x1) msplit'1(nil()) -> tuple'2(nil(),nil()) msplit'2(dd(x2,xs'),x1) -> msplit'3(msplit(xs'),x1,x2) msplit'2(nil(),x1) -> tuple'2(dd(x1,nil()),nil()) msplit'3(tuple'2(l1,l2),x1,x2) -> tuple'2(dd(x1,l1),dd(x2,l2)) - Signature: {'cklt/1,'compare/2,'less/2,merge/2,merge'1/2,merge'2/3,merge'3/5,mergesort/1,mergesort'1/1,mergesort'2/2 ,mergesort'3/1,msplit/1,msplit'1/1,msplit'2/2,msplit'3/3,'cklt#/1,'compare#/2,'less#/2,merge#/2,merge'1#/2 ,merge'2#/3,merge'3#/5,mergesort#/1,mergesort'1#/1,mergesort'2#/2,mergesort'3#/1,msplit#/1,msplit'1#/1 ,msplit'2#/2,msplit'3#/3} / {'0/0,'EQ/0,'GT/0,'LT/0,'false/0,'neg/1,'pos/1,'s/1,'true/0,dd/2,nil/0,tuple'2/2 ,c_1/0,c_2/0,c_3/0,c_4/0,c_5/0,c_6/0,c_7/0,c_8/0,c_9/1,c_10/0,c_11/0,c_12/0,c_13/1,c_14/0,c_15/1,c_16/1 ,c_17/1,c_18/1,c_19/0,c_20/2,c_21/0,c_22/1,c_23/1,c_24/1,c_25/1,c_26/0,c_27/1,c_28/0,c_29/3,c_30/1,c_31/1 ,c_32/0,c_33/1,c_34/0,c_35/0} - Obligation: innermost runtime complexity wrt. defined symbols {'cklt#,'compare#,'less#,merge#,merge'1#,merge'2#,merge'3# ,mergesort#,mergesort'1#,mergesort'2#,mergesort'3#,msplit#,msplit'1#,msplit'2# ,msplit'3#} and constructors {'0,'EQ,'GT,'LT,'false,'neg,'pos,'s,'true,dd,nil,tuple'2} + Applied Processor: NaturalMI {miDimension = 1, miDegree = 1, miKind = Algebraic, uargs = UArgs, urules = URules, selector = Just first alternative for predecessorEstimation on any intersect of rules of CDG leaf and strict-rules} + Details: We apply a matrix interpretation of kind constructor based matrix interpretation: The following argument positions are considered usable: uargs(c_9) = {1}, uargs(c_13) = {1}, uargs(c_15) = {1}, uargs(c_16) = {1} Following symbols are considered usable: {merge,merge'1,merge'2,merge'3,mergesort,mergesort'1,mergesort'2,mergesort'3,msplit,msplit'1,msplit'2 ,msplit'3,'cklt#,'compare#,'less#,merge#,merge'1#,merge'2#,merge'3#,mergesort#,mergesort'1#,mergesort'2# ,mergesort'3#,msplit#,msplit'1#,msplit'2#,msplit'3#} TcT has computed the following interpretation: p('0) = [2] p('EQ) = [2] p('GT) = [1] p('LT) = [2] p('cklt) = [4] x1 + [0] p('compare) = [2] x1 + [0] p('false) = [0] p('less) = [0] p('neg) = [1] x1 + [0] p('pos) = [1] x1 + [2] p('s) = [1] x1 + [0] p('true) = [1] p(dd) = [1] x1 + [1] x2 + [0] p(merge) = [1] x1 + [1] x2 + [0] p(merge'1) = [1] x1 + [1] x2 + [0] p(merge'2) = [1] x1 + [1] x2 + [1] x3 + [0] p(merge'3) = [1] x2 + [1] x3 + [1] x4 + [1] x5 + [0] p(mergesort) = [4] x1 + [0] p(mergesort'1) = [4] x1 + [0] p(mergesort'2) = [4] x1 + [4] x2 + [0] p(mergesort'3) = [4] x1 + [0] p(msplit) = [1] x1 + [0] p(msplit'1) = [1] x1 + [0] p(msplit'2) = [1] x1 + [1] x2 + [0] p(msplit'3) = [1] x1 + [1] x2 + [1] x3 + [0] p(nil) = [0] p(tuple'2) = [1] x1 + [1] x2 + [0] p('cklt#) = [1] x1 + [4] p('compare#) = [1] x1 + [1] x2 + [0] p('less#) = [1] x1 + [1] x2 + [0] p(merge#) = [1] x1 + [1] x2 + [0] p(merge'1#) = [1] x1 + [1] x2 + [0] p(merge'2#) = [1] x1 + [1] x2 + [1] x3 + [0] p(merge'3#) = [1] x2 + [1] x3 + [1] x4 + [1] x5 + [0] p(mergesort#) = [4] x1 + [0] p(mergesort'1#) = [4] x1 + [0] p(mergesort'2#) = [4] x1 + [4] x2 + [0] p(mergesort'3#) = [4] x1 + [0] p(msplit#) = [0] p(msplit'1#) = [1] p(msplit'2#) = [1] x2 + [2] p(msplit'3#) = [1] x1 + [1] x3 + [0] p(c_1) = [0] p(c_2) = [2] p(c_3) = [2] p(c_4) = [1] p(c_5) = [0] p(c_6) = [1] p(c_7) = [0] p(c_8) = [1] p(c_9) = [1] x1 + [0] p(c_10) = [0] p(c_11) = [1] p(c_12) = [1] p(c_13) = [1] x1 + [2] p(c_14) = [0] p(c_15) = [1] x1 + [0] p(c_16) = [1] x1 + [0] p(c_17) = [1] x1 + [1] p(c_18) = [4] p(c_19) = [0] p(c_20) = [2] x1 + [1] x2 + [0] p(c_21) = [1] p(c_22) = [1] p(c_23) = [1] x1 + [0] p(c_24) = [1] x1 + [2] p(c_25) = [1] x1 + [0] p(c_26) = [0] p(c_27) = [4] p(c_28) = [1] p(c_29) = [1] x1 + [1] x2 + [1] x3 + [1] p(c_30) = [0] p(c_31) = [0] p(c_32) = [1] p(c_33) = [1] x1 + [0] p(c_34) = [0] p(c_35) = [1] Following rules are strictly oriented: 'compare#('pos(x),'pos(y)) = [1] x + [1] y + [4] > [1] x + [1] y + [2] = c_13('compare#(x,y)) Following rules are (at-least) weakly oriented: 'compare#('neg(x),'neg(y)) = [1] x + [1] y + [0] >= [1] x + [1] y + [0] = c_9('compare#(y,x)) 'compare#('s(x),'s(y)) = [1] x + [1] y + [0] >= [1] x + [1] y + [0] = c_15('compare#(x,y)) 'less#(x,y) = [1] x + [1] y + [0] >= [1] x + [1] y + [0] = c_16('compare#(x,y)) merge#(l1,l2) = [1] l1 + [1] l2 + [0] >= [1] l1 + [1] l2 + [0] = merge'1#(l1,l2) merge'1#(dd(x,xs),l2) = [1] l2 + [1] x + [1] xs + [0] >= [1] l2 + [1] x + [1] xs + [0] = merge'2#(l2,x,xs) merge'2#(dd(y,ys),x,xs) = [1] x + [1] xs + [1] y + [1] ys + [0] >= [1] x + [1] y + [0] = 'less#(x,y) merge'2#(dd(y,ys),x,xs) = [1] x + [1] xs + [1] y + [1] ys + [0] >= [1] x + [1] xs + [1] y + [1] ys + [0] = merge'3#('less(x,y),x,xs,y,ys) merge'3#('false(),x,xs,y,ys) = [1] x + [1] xs + [1] y + [1] ys + [0] >= [1] x + [1] xs + [1] ys + [0] = merge#(dd(x,xs),ys) merge'3#('true(),x,xs,y,ys) = [1] x + [1] xs + [1] y + [1] ys + [0] >= [1] xs + [1] y + [1] ys + [0] = merge#(xs,dd(y,ys)) mergesort#(l) = [4] l + [0] >= [4] l + [0] = mergesort'1#(l) mergesort'1#(dd(x1,xs)) = [4] x1 + [4] xs + [0] >= [4] x1 + [4] xs + [0] = mergesort'2#(xs,x1) mergesort'2#(dd(x2,xs'),x1) = [4] x1 + [4] x2 + [4] xs' + [0] >= [4] x1 + [4] x2 + [4] xs' + [0] = mergesort'3#(msplit(dd(x1,dd(x2,xs')))) mergesort'3#(tuple'2(l1,l2)) = [4] l1 + [4] l2 + [0] >= [4] l1 + [4] l2 + [0] = merge#(mergesort(l1),mergesort(l2)) mergesort'3#(tuple'2(l1,l2)) = [4] l1 + [4] l2 + [0] >= [4] l1 + [0] = mergesort#(l1) mergesort'3#(tuple'2(l1,l2)) = [4] l1 + [4] l2 + [0] >= [4] l2 + [0] = mergesort#(l2) merge(l1,l2) = [1] l1 + [1] l2 + [0] >= [1] l1 + [1] l2 + [0] = merge'1(l1,l2) merge'1(dd(x,xs),l2) = [1] l2 + [1] x + [1] xs + [0] >= [1] l2 + [1] x + [1] xs + [0] = merge'2(l2,x,xs) merge'1(nil(),l2) = [1] l2 + [0] >= [1] l2 + [0] = l2 merge'2(dd(y,ys),x,xs) = [1] x + [1] xs + [1] y + [1] ys + [0] >= [1] x + [1] xs + [1] y + [1] ys + [0] = merge'3('less(x,y),x,xs,y,ys) merge'2(nil(),x,xs) = [1] x + [1] xs + [0] >= [1] x + [1] xs + [0] = dd(x,xs) merge'3('false(),x,xs,y,ys) = [1] x + [1] xs + [1] y + [1] ys + [0] >= [1] x + [1] xs + [1] y + [1] ys + [0] = dd(y,merge(dd(x,xs),ys)) merge'3('true(),x,xs,y,ys) = [1] x + [1] xs + [1] y + [1] ys + [0] >= [1] x + [1] xs + [1] y + [1] ys + [0] = dd(x,merge(xs,dd(y,ys))) mergesort(l) = [4] l + [0] >= [4] l + [0] = mergesort'1(l) mergesort'1(dd(x1,xs)) = [4] x1 + [4] xs + [0] >= [4] x1 + [4] xs + [0] = mergesort'2(xs,x1) mergesort'1(nil()) = [0] >= [0] = nil() mergesort'2(dd(x2,xs'),x1) = [4] x1 + [4] x2 + [4] xs' + [0] >= [4] x1 + [4] x2 + [4] xs' + [0] = mergesort'3(msplit(dd(x1,dd(x2,xs')))) mergesort'2(nil(),x1) = [4] x1 + [0] >= [1] x1 + [0] = dd(x1,nil()) mergesort'3(tuple'2(l1,l2)) = [4] l1 + [4] l2 + [0] >= [4] l1 + [4] l2 + [0] = merge(mergesort(l1),mergesort(l2)) msplit(l) = [1] l + [0] >= [1] l + [0] = msplit'1(l) msplit'1(dd(x1,xs)) = [1] x1 + [1] xs + [0] >= [1] x1 + [1] xs + [0] = msplit'2(xs,x1) msplit'1(nil()) = [0] >= [0] = tuple'2(nil(),nil()) msplit'2(dd(x2,xs'),x1) = [1] x1 + [1] x2 + [1] xs' + [0] >= [1] x1 + [1] x2 + [1] xs' + [0] = msplit'3(msplit(xs'),x1,x2) msplit'2(nil(),x1) = [1] x1 + [0] >= [1] x1 + [0] = tuple'2(dd(x1,nil()),nil()) msplit'3(tuple'2(l1,l2),x1,x2) = [1] l1 + [1] l2 + [1] x1 + [1] x2 + [0] >= [1] l1 + [1] l2 + [1] x1 + [1] x2 + [0] = tuple'2(dd(x1,l1),dd(x2,l2)) ***** Step 5.a:3.b:1.b:1.a:2: Assumption WORST_CASE(?,O(1)) + Considered Problem: - Strict DPs: 'compare#('neg(x),'neg(y)) -> c_9('compare#(y,x)) 'compare#('s(x),'s(y)) -> c_15('compare#(x,y)) - Weak DPs: 'compare#('pos(x),'pos(y)) -> c_13('compare#(x,y)) 'less#(x,y) -> c_16('compare#(x,y)) merge#(l1,l2) -> merge'1#(l1,l2) merge'1#(dd(x,xs),l2) -> merge'2#(l2,x,xs) merge'2#(dd(y,ys),x,xs) -> 'less#(x,y) merge'2#(dd(y,ys),x,xs) -> merge'3#('less(x,y),x,xs,y,ys) merge'3#('false(),x,xs,y,ys) -> merge#(dd(x,xs),ys) merge'3#('true(),x,xs,y,ys) -> merge#(xs,dd(y,ys)) mergesort#(l) -> mergesort'1#(l) mergesort'1#(dd(x1,xs)) -> mergesort'2#(xs,x1) mergesort'2#(dd(x2,xs'),x1) -> mergesort'3#(msplit(dd(x1,dd(x2,xs')))) mergesort'3#(tuple'2(l1,l2)) -> merge#(mergesort(l1),mergesort(l2)) mergesort'3#(tuple'2(l1,l2)) -> mergesort#(l1) mergesort'3#(tuple'2(l1,l2)) -> mergesort#(l2) - Weak TRS: 'cklt('EQ()) -> 'false() 'cklt('GT()) -> 'false() 'cklt('LT()) -> 'true() 'compare('0(),'0()) -> 'EQ() 'compare('0(),'neg(y)) -> 'GT() 'compare('0(),'pos(y)) -> 'LT() 'compare('0(),'s(y)) -> 'LT() 'compare('neg(x),'0()) -> 'LT() 'compare('neg(x),'neg(y)) -> 'compare(y,x) 'compare('neg(x),'pos(y)) -> 'LT() 'compare('pos(x),'0()) -> 'GT() 'compare('pos(x),'neg(y)) -> 'GT() 'compare('pos(x),'pos(y)) -> 'compare(x,y) 'compare('s(x),'0()) -> 'GT() 'compare('s(x),'s(y)) -> 'compare(x,y) 'less(x,y) -> 'cklt('compare(x,y)) merge(l1,l2) -> merge'1(l1,l2) merge'1(dd(x,xs),l2) -> merge'2(l2,x,xs) merge'1(nil(),l2) -> l2 merge'2(dd(y,ys),x,xs) -> merge'3('less(x,y),x,xs,y,ys) merge'2(nil(),x,xs) -> dd(x,xs) merge'3('false(),x,xs,y,ys) -> dd(y,merge(dd(x,xs),ys)) merge'3('true(),x,xs,y,ys) -> dd(x,merge(xs,dd(y,ys))) mergesort(l) -> mergesort'1(l) mergesort'1(dd(x1,xs)) -> mergesort'2(xs,x1) mergesort'1(nil()) -> nil() mergesort'2(dd(x2,xs'),x1) -> mergesort'3(msplit(dd(x1,dd(x2,xs')))) mergesort'2(nil(),x1) -> dd(x1,nil()) mergesort'3(tuple'2(l1,l2)) -> merge(mergesort(l1),mergesort(l2)) msplit(l) -> msplit'1(l) msplit'1(dd(x1,xs)) -> msplit'2(xs,x1) msplit'1(nil()) -> tuple'2(nil(),nil()) msplit'2(dd(x2,xs'),x1) -> msplit'3(msplit(xs'),x1,x2) msplit'2(nil(),x1) -> tuple'2(dd(x1,nil()),nil()) msplit'3(tuple'2(l1,l2),x1,x2) -> tuple'2(dd(x1,l1),dd(x2,l2)) - Signature: {'cklt/1,'compare/2,'less/2,merge/2,merge'1/2,merge'2/3,merge'3/5,mergesort/1,mergesort'1/1,mergesort'2/2 ,mergesort'3/1,msplit/1,msplit'1/1,msplit'2/2,msplit'3/3,'cklt#/1,'compare#/2,'less#/2,merge#/2,merge'1#/2 ,merge'2#/3,merge'3#/5,mergesort#/1,mergesort'1#/1,mergesort'2#/2,mergesort'3#/1,msplit#/1,msplit'1#/1 ,msplit'2#/2,msplit'3#/3} / {'0/0,'EQ/0,'GT/0,'LT/0,'false/0,'neg/1,'pos/1,'s/1,'true/0,dd/2,nil/0,tuple'2/2 ,c_1/0,c_2/0,c_3/0,c_4/0,c_5/0,c_6/0,c_7/0,c_8/0,c_9/1,c_10/0,c_11/0,c_12/0,c_13/1,c_14/0,c_15/1,c_16/1 ,c_17/1,c_18/1,c_19/0,c_20/2,c_21/0,c_22/1,c_23/1,c_24/1,c_25/1,c_26/0,c_27/1,c_28/0,c_29/3,c_30/1,c_31/1 ,c_32/0,c_33/1,c_34/0,c_35/0} - Obligation: innermost runtime complexity wrt. defined symbols {'cklt#,'compare#,'less#,merge#,merge'1#,merge'2#,merge'3# ,mergesort#,mergesort'1#,mergesort'2#,mergesort'3#,msplit#,msplit'1#,msplit'2# ,msplit'3#} and constructors {'0,'EQ,'GT,'LT,'false,'neg,'pos,'s,'true,dd,nil,tuple'2} + Applied Processor: Assumption {assumed = Certificate {spaceUB = Unknown, spaceLB = Unknown, timeUB = Poly (Just 0), timeLB = Unknown}} + Details: () ***** Step 5.a:3.b:1.b:1.b:1: PredecessorEstimationCP WORST_CASE(?,O(n^1)) + Considered Problem: - Strict DPs: 'compare#('neg(x),'neg(y)) -> c_9('compare#(y,x)) 'compare#('s(x),'s(y)) -> c_15('compare#(x,y)) - Weak DPs: 'compare#('pos(x),'pos(y)) -> c_13('compare#(x,y)) 'less#(x,y) -> c_16('compare#(x,y)) merge#(l1,l2) -> merge'1#(l1,l2) merge'1#(dd(x,xs),l2) -> merge'2#(l2,x,xs) merge'2#(dd(y,ys),x,xs) -> 'less#(x,y) merge'2#(dd(y,ys),x,xs) -> merge'3#('less(x,y),x,xs,y,ys) merge'3#('false(),x,xs,y,ys) -> merge#(dd(x,xs),ys) merge'3#('true(),x,xs,y,ys) -> merge#(xs,dd(y,ys)) mergesort#(l) -> mergesort'1#(l) mergesort'1#(dd(x1,xs)) -> mergesort'2#(xs,x1) mergesort'2#(dd(x2,xs'),x1) -> mergesort'3#(msplit(dd(x1,dd(x2,xs')))) mergesort'3#(tuple'2(l1,l2)) -> merge#(mergesort(l1),mergesort(l2)) mergesort'3#(tuple'2(l1,l2)) -> mergesort#(l1) mergesort'3#(tuple'2(l1,l2)) -> mergesort#(l2) - Weak TRS: 'cklt('EQ()) -> 'false() 'cklt('GT()) -> 'false() 'cklt('LT()) -> 'true() 'compare('0(),'0()) -> 'EQ() 'compare('0(),'neg(y)) -> 'GT() 'compare('0(),'pos(y)) -> 'LT() 'compare('0(),'s(y)) -> 'LT() 'compare('neg(x),'0()) -> 'LT() 'compare('neg(x),'neg(y)) -> 'compare(y,x) 'compare('neg(x),'pos(y)) -> 'LT() 'compare('pos(x),'0()) -> 'GT() 'compare('pos(x),'neg(y)) -> 'GT() 'compare('pos(x),'pos(y)) -> 'compare(x,y) 'compare('s(x),'0()) -> 'GT() 'compare('s(x),'s(y)) -> 'compare(x,y) 'less(x,y) -> 'cklt('compare(x,y)) merge(l1,l2) -> merge'1(l1,l2) merge'1(dd(x,xs),l2) -> merge'2(l2,x,xs) merge'1(nil(),l2) -> l2 merge'2(dd(y,ys),x,xs) -> merge'3('less(x,y),x,xs,y,ys) merge'2(nil(),x,xs) -> dd(x,xs) merge'3('false(),x,xs,y,ys) -> dd(y,merge(dd(x,xs),ys)) merge'3('true(),x,xs,y,ys) -> dd(x,merge(xs,dd(y,ys))) mergesort(l) -> mergesort'1(l) mergesort'1(dd(x1,xs)) -> mergesort'2(xs,x1) mergesort'1(nil()) -> nil() mergesort'2(dd(x2,xs'),x1) -> mergesort'3(msplit(dd(x1,dd(x2,xs')))) mergesort'2(nil(),x1) -> dd(x1,nil()) mergesort'3(tuple'2(l1,l2)) -> merge(mergesort(l1),mergesort(l2)) msplit(l) -> msplit'1(l) msplit'1(dd(x1,xs)) -> msplit'2(xs,x1) msplit'1(nil()) -> tuple'2(nil(),nil()) msplit'2(dd(x2,xs'),x1) -> msplit'3(msplit(xs'),x1,x2) msplit'2(nil(),x1) -> tuple'2(dd(x1,nil()),nil()) msplit'3(tuple'2(l1,l2),x1,x2) -> tuple'2(dd(x1,l1),dd(x2,l2)) - Signature: {'cklt/1,'compare/2,'less/2,merge/2,merge'1/2,merge'2/3,merge'3/5,mergesort/1,mergesort'1/1,mergesort'2/2 ,mergesort'3/1,msplit/1,msplit'1/1,msplit'2/2,msplit'3/3,'cklt#/1,'compare#/2,'less#/2,merge#/2,merge'1#/2 ,merge'2#/3,merge'3#/5,mergesort#/1,mergesort'1#/1,mergesort'2#/2,mergesort'3#/1,msplit#/1,msplit'1#/1 ,msplit'2#/2,msplit'3#/3} / {'0/0,'EQ/0,'GT/0,'LT/0,'false/0,'neg/1,'pos/1,'s/1,'true/0,dd/2,nil/0,tuple'2/2 ,c_1/0,c_2/0,c_3/0,c_4/0,c_5/0,c_6/0,c_7/0,c_8/0,c_9/1,c_10/0,c_11/0,c_12/0,c_13/1,c_14/0,c_15/1,c_16/1 ,c_17/1,c_18/1,c_19/0,c_20/2,c_21/0,c_22/1,c_23/1,c_24/1,c_25/1,c_26/0,c_27/1,c_28/0,c_29/3,c_30/1,c_31/1 ,c_32/0,c_33/1,c_34/0,c_35/0} - Obligation: innermost runtime complexity wrt. defined symbols {'cklt#,'compare#,'less#,merge#,merge'1#,merge'2#,merge'3# ,mergesort#,mergesort'1#,mergesort'2#,mergesort'3#,msplit#,msplit'1#,msplit'2# ,msplit'3#} and constructors {'0,'EQ,'GT,'LT,'false,'neg,'pos,'s,'true,dd,nil,tuple'2} + Applied Processor: PredecessorEstimationCP {onSelectionCP = any intersect of rules of CDG leaf and strict-rules, withComplexityPair = NaturalMI {miDimension = 1, miDegree = 1, miKind = Algebraic, uargs = UArgs, urules = URules, selector = Nothing}} + Details: We first use the processor NaturalMI {miDimension = 1, miDegree = 1, miKind = Algebraic, uargs = UArgs, urules = URules, selector = Nothing} to orient following rules strictly: 2: 'compare#('s(x),'s(y)) -> c_15('compare#(x,y)) The strictly oriented rules are moved into the weak component. ****** Step 5.a:3.b:1.b:1.b:1.a:1: NaturalMI WORST_CASE(?,O(n^1)) + Considered Problem: - Strict DPs: 'compare#('neg(x),'neg(y)) -> c_9('compare#(y,x)) 'compare#('s(x),'s(y)) -> c_15('compare#(x,y)) - Weak DPs: 'compare#('pos(x),'pos(y)) -> c_13('compare#(x,y)) 'less#(x,y) -> c_16('compare#(x,y)) merge#(l1,l2) -> merge'1#(l1,l2) merge'1#(dd(x,xs),l2) -> merge'2#(l2,x,xs) merge'2#(dd(y,ys),x,xs) -> 'less#(x,y) merge'2#(dd(y,ys),x,xs) -> merge'3#('less(x,y),x,xs,y,ys) merge'3#('false(),x,xs,y,ys) -> merge#(dd(x,xs),ys) merge'3#('true(),x,xs,y,ys) -> merge#(xs,dd(y,ys)) mergesort#(l) -> mergesort'1#(l) mergesort'1#(dd(x1,xs)) -> mergesort'2#(xs,x1) mergesort'2#(dd(x2,xs'),x1) -> mergesort'3#(msplit(dd(x1,dd(x2,xs')))) mergesort'3#(tuple'2(l1,l2)) -> merge#(mergesort(l1),mergesort(l2)) mergesort'3#(tuple'2(l1,l2)) -> mergesort#(l1) mergesort'3#(tuple'2(l1,l2)) -> mergesort#(l2) - Weak TRS: 'cklt('EQ()) -> 'false() 'cklt('GT()) -> 'false() 'cklt('LT()) -> 'true() 'compare('0(),'0()) -> 'EQ() 'compare('0(),'neg(y)) -> 'GT() 'compare('0(),'pos(y)) -> 'LT() 'compare('0(),'s(y)) -> 'LT() 'compare('neg(x),'0()) -> 'LT() 'compare('neg(x),'neg(y)) -> 'compare(y,x) 'compare('neg(x),'pos(y)) -> 'LT() 'compare('pos(x),'0()) -> 'GT() 'compare('pos(x),'neg(y)) -> 'GT() 'compare('pos(x),'pos(y)) -> 'compare(x,y) 'compare('s(x),'0()) -> 'GT() 'compare('s(x),'s(y)) -> 'compare(x,y) 'less(x,y) -> 'cklt('compare(x,y)) merge(l1,l2) -> merge'1(l1,l2) merge'1(dd(x,xs),l2) -> merge'2(l2,x,xs) merge'1(nil(),l2) -> l2 merge'2(dd(y,ys),x,xs) -> merge'3('less(x,y),x,xs,y,ys) merge'2(nil(),x,xs) -> dd(x,xs) merge'3('false(),x,xs,y,ys) -> dd(y,merge(dd(x,xs),ys)) merge'3('true(),x,xs,y,ys) -> dd(x,merge(xs,dd(y,ys))) mergesort(l) -> mergesort'1(l) mergesort'1(dd(x1,xs)) -> mergesort'2(xs,x1) mergesort'1(nil()) -> nil() mergesort'2(dd(x2,xs'),x1) -> mergesort'3(msplit(dd(x1,dd(x2,xs')))) mergesort'2(nil(),x1) -> dd(x1,nil()) mergesort'3(tuple'2(l1,l2)) -> merge(mergesort(l1),mergesort(l2)) msplit(l) -> msplit'1(l) msplit'1(dd(x1,xs)) -> msplit'2(xs,x1) msplit'1(nil()) -> tuple'2(nil(),nil()) msplit'2(dd(x2,xs'),x1) -> msplit'3(msplit(xs'),x1,x2) msplit'2(nil(),x1) -> tuple'2(dd(x1,nil()),nil()) msplit'3(tuple'2(l1,l2),x1,x2) -> tuple'2(dd(x1,l1),dd(x2,l2)) - Signature: {'cklt/1,'compare/2,'less/2,merge/2,merge'1/2,merge'2/3,merge'3/5,mergesort/1,mergesort'1/1,mergesort'2/2 ,mergesort'3/1,msplit/1,msplit'1/1,msplit'2/2,msplit'3/3,'cklt#/1,'compare#/2,'less#/2,merge#/2,merge'1#/2 ,merge'2#/3,merge'3#/5,mergesort#/1,mergesort'1#/1,mergesort'2#/2,mergesort'3#/1,msplit#/1,msplit'1#/1 ,msplit'2#/2,msplit'3#/3} / {'0/0,'EQ/0,'GT/0,'LT/0,'false/0,'neg/1,'pos/1,'s/1,'true/0,dd/2,nil/0,tuple'2/2 ,c_1/0,c_2/0,c_3/0,c_4/0,c_5/0,c_6/0,c_7/0,c_8/0,c_9/1,c_10/0,c_11/0,c_12/0,c_13/1,c_14/0,c_15/1,c_16/1 ,c_17/1,c_18/1,c_19/0,c_20/2,c_21/0,c_22/1,c_23/1,c_24/1,c_25/1,c_26/0,c_27/1,c_28/0,c_29/3,c_30/1,c_31/1 ,c_32/0,c_33/1,c_34/0,c_35/0} - Obligation: innermost runtime complexity wrt. defined symbols {'cklt#,'compare#,'less#,merge#,merge'1#,merge'2#,merge'3# ,mergesort#,mergesort'1#,mergesort'2#,mergesort'3#,msplit#,msplit'1#,msplit'2# ,msplit'3#} and constructors {'0,'EQ,'GT,'LT,'false,'neg,'pos,'s,'true,dd,nil,tuple'2} + Applied Processor: NaturalMI {miDimension = 1, miDegree = 1, miKind = Algebraic, uargs = UArgs, urules = URules, selector = Just first alternative for predecessorEstimation on any intersect of rules of CDG leaf and strict-rules} + Details: We apply a matrix interpretation of kind constructor based matrix interpretation: The following argument positions are considered usable: uargs(c_9) = {1}, uargs(c_13) = {1}, uargs(c_15) = {1}, uargs(c_16) = {1} Following symbols are considered usable: {merge,merge'1,merge'2,merge'3,mergesort,mergesort'1,mergesort'2,mergesort'3,msplit,msplit'1,msplit'2 ,msplit'3,'cklt#,'compare#,'less#,merge#,merge'1#,merge'2#,merge'3#,mergesort#,mergesort'1#,mergesort'2# ,mergesort'3#,msplit#,msplit'1#,msplit'2#,msplit'3#} TcT has computed the following interpretation: p('0) = [0] p('EQ) = [0] p('GT) = [1] p('LT) = [2] p('cklt) = [6] p('compare) = [4] x1 + [0] p('false) = [0] p('less) = [1] x1 + [0] p('neg) = [1] x1 + [0] p('pos) = [1] x1 + [0] p('s) = [1] x1 + [2] p('true) = [0] p(dd) = [1] x1 + [1] x2 + [0] p(merge) = [1] x1 + [1] x2 + [0] p(merge'1) = [1] x1 + [1] x2 + [0] p(merge'2) = [1] x1 + [1] x2 + [1] x3 + [0] p(merge'3) = [1] x2 + [1] x3 + [1] x4 + [1] x5 + [0] p(mergesort) = [1] x1 + [0] p(mergesort'1) = [1] x1 + [0] p(mergesort'2) = [1] x1 + [1] x2 + [0] p(mergesort'3) = [1] x1 + [0] p(msplit) = [1] x1 + [0] p(msplit'1) = [1] x1 + [0] p(msplit'2) = [1] x1 + [1] x2 + [0] p(msplit'3) = [1] x1 + [1] x2 + [1] x3 + [0] p(nil) = [0] p(tuple'2) = [1] x1 + [1] x2 + [0] p('cklt#) = [2] p('compare#) = [2] x1 + [2] x2 + [0] p('less#) = [5] x1 + [4] x2 + [0] p(merge#) = [5] x1 + [4] x2 + [0] p(merge'1#) = [5] x1 + [4] x2 + [0] p(merge'2#) = [4] x1 + [5] x2 + [5] x3 + [0] p(merge'3#) = [5] x2 + [5] x3 + [4] x4 + [4] x5 + [0] p(mergesort#) = [5] x1 + [0] p(mergesort'1#) = [5] x1 + [0] p(mergesort'2#) = [5] x1 + [5] x2 + [0] p(mergesort'3#) = [5] x1 + [0] p(msplit#) = [2] x1 + [0] p(msplit'1#) = [1] p(msplit'2#) = [1] x1 + [1] p(msplit'3#) = [1] x2 + [4] p(c_1) = [0] p(c_2) = [1] p(c_3) = [2] p(c_4) = [1] p(c_5) = [1] p(c_6) = [1] p(c_7) = [2] p(c_8) = [4] p(c_9) = [1] x1 + [0] p(c_10) = [1] p(c_11) = [1] p(c_12) = [1] p(c_13) = [1] x1 + [0] p(c_14) = [1] p(c_15) = [1] x1 + [7] p(c_16) = [2] x1 + [0] p(c_17) = [0] p(c_18) = [4] p(c_19) = [1] p(c_20) = [4] x1 + [0] p(c_21) = [0] p(c_22) = [1] x1 + [4] p(c_23) = [2] x1 + [0] p(c_24) = [4] p(c_25) = [1] x1 + [0] p(c_26) = [0] p(c_27) = [4] x1 + [2] p(c_28) = [2] p(c_29) = [0] p(c_30) = [1] p(c_31) = [1] x1 + [0] p(c_32) = [0] p(c_33) = [4] x1 + [2] p(c_34) = [1] p(c_35) = [4] Following rules are strictly oriented: 'compare#('s(x),'s(y)) = [2] x + [2] y + [8] > [2] x + [2] y + [7] = c_15('compare#(x,y)) Following rules are (at-least) weakly oriented: 'compare#('neg(x),'neg(y)) = [2] x + [2] y + [0] >= [2] x + [2] y + [0] = c_9('compare#(y,x)) 'compare#('pos(x),'pos(y)) = [2] x + [2] y + [0] >= [2] x + [2] y + [0] = c_13('compare#(x,y)) 'less#(x,y) = [5] x + [4] y + [0] >= [4] x + [4] y + [0] = c_16('compare#(x,y)) merge#(l1,l2) = [5] l1 + [4] l2 + [0] >= [5] l1 + [4] l2 + [0] = merge'1#(l1,l2) merge'1#(dd(x,xs),l2) = [4] l2 + [5] x + [5] xs + [0] >= [4] l2 + [5] x + [5] xs + [0] = merge'2#(l2,x,xs) merge'2#(dd(y,ys),x,xs) = [5] x + [5] xs + [4] y + [4] ys + [0] >= [5] x + [4] y + [0] = 'less#(x,y) merge'2#(dd(y,ys),x,xs) = [5] x + [5] xs + [4] y + [4] ys + [0] >= [5] x + [5] xs + [4] y + [4] ys + [0] = merge'3#('less(x,y),x,xs,y,ys) merge'3#('false(),x,xs,y,ys) = [5] x + [5] xs + [4] y + [4] ys + [0] >= [5] x + [5] xs + [4] ys + [0] = merge#(dd(x,xs),ys) merge'3#('true(),x,xs,y,ys) = [5] x + [5] xs + [4] y + [4] ys + [0] >= [5] xs + [4] y + [4] ys + [0] = merge#(xs,dd(y,ys)) mergesort#(l) = [5] l + [0] >= [5] l + [0] = mergesort'1#(l) mergesort'1#(dd(x1,xs)) = [5] x1 + [5] xs + [0] >= [5] x1 + [5] xs + [0] = mergesort'2#(xs,x1) mergesort'2#(dd(x2,xs'),x1) = [5] x1 + [5] x2 + [5] xs' + [0] >= [5] x1 + [5] x2 + [5] xs' + [0] = mergesort'3#(msplit(dd(x1,dd(x2,xs')))) mergesort'3#(tuple'2(l1,l2)) = [5] l1 + [5] l2 + [0] >= [5] l1 + [4] l2 + [0] = merge#(mergesort(l1),mergesort(l2)) mergesort'3#(tuple'2(l1,l2)) = [5] l1 + [5] l2 + [0] >= [5] l1 + [0] = mergesort#(l1) mergesort'3#(tuple'2(l1,l2)) = [5] l1 + [5] l2 + [0] >= [5] l2 + [0] = mergesort#(l2) merge(l1,l2) = [1] l1 + [1] l2 + [0] >= [1] l1 + [1] l2 + [0] = merge'1(l1,l2) merge'1(dd(x,xs),l2) = [1] l2 + [1] x + [1] xs + [0] >= [1] l2 + [1] x + [1] xs + [0] = merge'2(l2,x,xs) merge'1(nil(),l2) = [1] l2 + [0] >= [1] l2 + [0] = l2 merge'2(dd(y,ys),x,xs) = [1] x + [1] xs + [1] y + [1] ys + [0] >= [1] x + [1] xs + [1] y + [1] ys + [0] = merge'3('less(x,y),x,xs,y,ys) merge'2(nil(),x,xs) = [1] x + [1] xs + [0] >= [1] x + [1] xs + [0] = dd(x,xs) merge'3('false(),x,xs,y,ys) = [1] x + [1] xs + [1] y + [1] ys + [0] >= [1] x + [1] xs + [1] y + [1] ys + [0] = dd(y,merge(dd(x,xs),ys)) merge'3('true(),x,xs,y,ys) = [1] x + [1] xs + [1] y + [1] ys + [0] >= [1] x + [1] xs + [1] y + [1] ys + [0] = dd(x,merge(xs,dd(y,ys))) mergesort(l) = [1] l + [0] >= [1] l + [0] = mergesort'1(l) mergesort'1(dd(x1,xs)) = [1] x1 + [1] xs + [0] >= [1] x1 + [1] xs + [0] = mergesort'2(xs,x1) mergesort'1(nil()) = [0] >= [0] = nil() mergesort'2(dd(x2,xs'),x1) = [1] x1 + [1] x2 + [1] xs' + [0] >= [1] x1 + [1] x2 + [1] xs' + [0] = mergesort'3(msplit(dd(x1,dd(x2,xs')))) mergesort'2(nil(),x1) = [1] x1 + [0] >= [1] x1 + [0] = dd(x1,nil()) mergesort'3(tuple'2(l1,l2)) = [1] l1 + [1] l2 + [0] >= [1] l1 + [1] l2 + [0] = merge(mergesort(l1),mergesort(l2)) msplit(l) = [1] l + [0] >= [1] l + [0] = msplit'1(l) msplit'1(dd(x1,xs)) = [1] x1 + [1] xs + [0] >= [1] x1 + [1] xs + [0] = msplit'2(xs,x1) msplit'1(nil()) = [0] >= [0] = tuple'2(nil(),nil()) msplit'2(dd(x2,xs'),x1) = [1] x1 + [1] x2 + [1] xs' + [0] >= [1] x1 + [1] x2 + [1] xs' + [0] = msplit'3(msplit(xs'),x1,x2) msplit'2(nil(),x1) = [1] x1 + [0] >= [1] x1 + [0] = tuple'2(dd(x1,nil()),nil()) msplit'3(tuple'2(l1,l2),x1,x2) = [1] l1 + [1] l2 + [1] x1 + [1] x2 + [0] >= [1] l1 + [1] l2 + [1] x1 + [1] x2 + [0] = tuple'2(dd(x1,l1),dd(x2,l2)) ****** Step 5.a:3.b:1.b:1.b:1.a:2: Assumption WORST_CASE(?,O(1)) + Considered Problem: - Strict DPs: 'compare#('neg(x),'neg(y)) -> c_9('compare#(y,x)) - Weak DPs: 'compare#('pos(x),'pos(y)) -> c_13('compare#(x,y)) 'compare#('s(x),'s(y)) -> c_15('compare#(x,y)) 'less#(x,y) -> c_16('compare#(x,y)) merge#(l1,l2) -> merge'1#(l1,l2) merge'1#(dd(x,xs),l2) -> merge'2#(l2,x,xs) merge'2#(dd(y,ys),x,xs) -> 'less#(x,y) merge'2#(dd(y,ys),x,xs) -> merge'3#('less(x,y),x,xs,y,ys) merge'3#('false(),x,xs,y,ys) -> merge#(dd(x,xs),ys) merge'3#('true(),x,xs,y,ys) -> merge#(xs,dd(y,ys)) mergesort#(l) -> mergesort'1#(l) mergesort'1#(dd(x1,xs)) -> mergesort'2#(xs,x1) mergesort'2#(dd(x2,xs'),x1) -> mergesort'3#(msplit(dd(x1,dd(x2,xs')))) mergesort'3#(tuple'2(l1,l2)) -> merge#(mergesort(l1),mergesort(l2)) mergesort'3#(tuple'2(l1,l2)) -> mergesort#(l1) mergesort'3#(tuple'2(l1,l2)) -> mergesort#(l2) - Weak TRS: 'cklt('EQ()) -> 'false() 'cklt('GT()) -> 'false() 'cklt('LT()) -> 'true() 'compare('0(),'0()) -> 'EQ() 'compare('0(),'neg(y)) -> 'GT() 'compare('0(),'pos(y)) -> 'LT() 'compare('0(),'s(y)) -> 'LT() 'compare('neg(x),'0()) -> 'LT() 'compare('neg(x),'neg(y)) -> 'compare(y,x) 'compare('neg(x),'pos(y)) -> 'LT() 'compare('pos(x),'0()) -> 'GT() 'compare('pos(x),'neg(y)) -> 'GT() 'compare('pos(x),'pos(y)) -> 'compare(x,y) 'compare('s(x),'0()) -> 'GT() 'compare('s(x),'s(y)) -> 'compare(x,y) 'less(x,y) -> 'cklt('compare(x,y)) merge(l1,l2) -> merge'1(l1,l2) merge'1(dd(x,xs),l2) -> merge'2(l2,x,xs) merge'1(nil(),l2) -> l2 merge'2(dd(y,ys),x,xs) -> merge'3('less(x,y),x,xs,y,ys) merge'2(nil(),x,xs) -> dd(x,xs) merge'3('false(),x,xs,y,ys) -> dd(y,merge(dd(x,xs),ys)) merge'3('true(),x,xs,y,ys) -> dd(x,merge(xs,dd(y,ys))) mergesort(l) -> mergesort'1(l) mergesort'1(dd(x1,xs)) -> mergesort'2(xs,x1) mergesort'1(nil()) -> nil() mergesort'2(dd(x2,xs'),x1) -> mergesort'3(msplit(dd(x1,dd(x2,xs')))) mergesort'2(nil(),x1) -> dd(x1,nil()) mergesort'3(tuple'2(l1,l2)) -> merge(mergesort(l1),mergesort(l2)) msplit(l) -> msplit'1(l) msplit'1(dd(x1,xs)) -> msplit'2(xs,x1) msplit'1(nil()) -> tuple'2(nil(),nil()) msplit'2(dd(x2,xs'),x1) -> msplit'3(msplit(xs'),x1,x2) msplit'2(nil(),x1) -> tuple'2(dd(x1,nil()),nil()) msplit'3(tuple'2(l1,l2),x1,x2) -> tuple'2(dd(x1,l1),dd(x2,l2)) - Signature: {'cklt/1,'compare/2,'less/2,merge/2,merge'1/2,merge'2/3,merge'3/5,mergesort/1,mergesort'1/1,mergesort'2/2 ,mergesort'3/1,msplit/1,msplit'1/1,msplit'2/2,msplit'3/3,'cklt#/1,'compare#/2,'less#/2,merge#/2,merge'1#/2 ,merge'2#/3,merge'3#/5,mergesort#/1,mergesort'1#/1,mergesort'2#/2,mergesort'3#/1,msplit#/1,msplit'1#/1 ,msplit'2#/2,msplit'3#/3} / {'0/0,'EQ/0,'GT/0,'LT/0,'false/0,'neg/1,'pos/1,'s/1,'true/0,dd/2,nil/0,tuple'2/2 ,c_1/0,c_2/0,c_3/0,c_4/0,c_5/0,c_6/0,c_7/0,c_8/0,c_9/1,c_10/0,c_11/0,c_12/0,c_13/1,c_14/0,c_15/1,c_16/1 ,c_17/1,c_18/1,c_19/0,c_20/2,c_21/0,c_22/1,c_23/1,c_24/1,c_25/1,c_26/0,c_27/1,c_28/0,c_29/3,c_30/1,c_31/1 ,c_32/0,c_33/1,c_34/0,c_35/0} - Obligation: innermost runtime complexity wrt. defined symbols {'cklt#,'compare#,'less#,merge#,merge'1#,merge'2#,merge'3# ,mergesort#,mergesort'1#,mergesort'2#,mergesort'3#,msplit#,msplit'1#,msplit'2# ,msplit'3#} and constructors {'0,'EQ,'GT,'LT,'false,'neg,'pos,'s,'true,dd,nil,tuple'2} + Applied Processor: Assumption {assumed = Certificate {spaceUB = Unknown, spaceLB = Unknown, timeUB = Poly (Just 0), timeLB = Unknown}} + Details: () ****** Step 5.a:3.b:1.b:1.b:1.b:1: PredecessorEstimationCP WORST_CASE(?,O(n^1)) + Considered Problem: - Strict DPs: 'compare#('neg(x),'neg(y)) -> c_9('compare#(y,x)) - Weak DPs: 'compare#('pos(x),'pos(y)) -> c_13('compare#(x,y)) 'compare#('s(x),'s(y)) -> c_15('compare#(x,y)) 'less#(x,y) -> c_16('compare#(x,y)) merge#(l1,l2) -> merge'1#(l1,l2) merge'1#(dd(x,xs),l2) -> merge'2#(l2,x,xs) merge'2#(dd(y,ys),x,xs) -> 'less#(x,y) merge'2#(dd(y,ys),x,xs) -> merge'3#('less(x,y),x,xs,y,ys) merge'3#('false(),x,xs,y,ys) -> merge#(dd(x,xs),ys) merge'3#('true(),x,xs,y,ys) -> merge#(xs,dd(y,ys)) mergesort#(l) -> mergesort'1#(l) mergesort'1#(dd(x1,xs)) -> mergesort'2#(xs,x1) mergesort'2#(dd(x2,xs'),x1) -> mergesort'3#(msplit(dd(x1,dd(x2,xs')))) mergesort'3#(tuple'2(l1,l2)) -> merge#(mergesort(l1),mergesort(l2)) mergesort'3#(tuple'2(l1,l2)) -> mergesort#(l1) mergesort'3#(tuple'2(l1,l2)) -> mergesort#(l2) - Weak TRS: 'cklt('EQ()) -> 'false() 'cklt('GT()) -> 'false() 'cklt('LT()) -> 'true() 'compare('0(),'0()) -> 'EQ() 'compare('0(),'neg(y)) -> 'GT() 'compare('0(),'pos(y)) -> 'LT() 'compare('0(),'s(y)) -> 'LT() 'compare('neg(x),'0()) -> 'LT() 'compare('neg(x),'neg(y)) -> 'compare(y,x) 'compare('neg(x),'pos(y)) -> 'LT() 'compare('pos(x),'0()) -> 'GT() 'compare('pos(x),'neg(y)) -> 'GT() 'compare('pos(x),'pos(y)) -> 'compare(x,y) 'compare('s(x),'0()) -> 'GT() 'compare('s(x),'s(y)) -> 'compare(x,y) 'less(x,y) -> 'cklt('compare(x,y)) merge(l1,l2) -> merge'1(l1,l2) merge'1(dd(x,xs),l2) -> merge'2(l2,x,xs) merge'1(nil(),l2) -> l2 merge'2(dd(y,ys),x,xs) -> merge'3('less(x,y),x,xs,y,ys) merge'2(nil(),x,xs) -> dd(x,xs) merge'3('false(),x,xs,y,ys) -> dd(y,merge(dd(x,xs),ys)) merge'3('true(),x,xs,y,ys) -> dd(x,merge(xs,dd(y,ys))) mergesort(l) -> mergesort'1(l) mergesort'1(dd(x1,xs)) -> mergesort'2(xs,x1) mergesort'1(nil()) -> nil() mergesort'2(dd(x2,xs'),x1) -> mergesort'3(msplit(dd(x1,dd(x2,xs')))) mergesort'2(nil(),x1) -> dd(x1,nil()) mergesort'3(tuple'2(l1,l2)) -> merge(mergesort(l1),mergesort(l2)) msplit(l) -> msplit'1(l) msplit'1(dd(x1,xs)) -> msplit'2(xs,x1) msplit'1(nil()) -> tuple'2(nil(),nil()) msplit'2(dd(x2,xs'),x1) -> msplit'3(msplit(xs'),x1,x2) msplit'2(nil(),x1) -> tuple'2(dd(x1,nil()),nil()) msplit'3(tuple'2(l1,l2),x1,x2) -> tuple'2(dd(x1,l1),dd(x2,l2)) - Signature: {'cklt/1,'compare/2,'less/2,merge/2,merge'1/2,merge'2/3,merge'3/5,mergesort/1,mergesort'1/1,mergesort'2/2 ,mergesort'3/1,msplit/1,msplit'1/1,msplit'2/2,msplit'3/3,'cklt#/1,'compare#/2,'less#/2,merge#/2,merge'1#/2 ,merge'2#/3,merge'3#/5,mergesort#/1,mergesort'1#/1,mergesort'2#/2,mergesort'3#/1,msplit#/1,msplit'1#/1 ,msplit'2#/2,msplit'3#/3} / {'0/0,'EQ/0,'GT/0,'LT/0,'false/0,'neg/1,'pos/1,'s/1,'true/0,dd/2,nil/0,tuple'2/2 ,c_1/0,c_2/0,c_3/0,c_4/0,c_5/0,c_6/0,c_7/0,c_8/0,c_9/1,c_10/0,c_11/0,c_12/0,c_13/1,c_14/0,c_15/1,c_16/1 ,c_17/1,c_18/1,c_19/0,c_20/2,c_21/0,c_22/1,c_23/1,c_24/1,c_25/1,c_26/0,c_27/1,c_28/0,c_29/3,c_30/1,c_31/1 ,c_32/0,c_33/1,c_34/0,c_35/0} - Obligation: innermost runtime complexity wrt. defined symbols {'cklt#,'compare#,'less#,merge#,merge'1#,merge'2#,merge'3# ,mergesort#,mergesort'1#,mergesort'2#,mergesort'3#,msplit#,msplit'1#,msplit'2# ,msplit'3#} and constructors {'0,'EQ,'GT,'LT,'false,'neg,'pos,'s,'true,dd,nil,tuple'2} + Applied Processor: PredecessorEstimationCP {onSelectionCP = any intersect of rules of CDG leaf and strict-rules, withComplexityPair = NaturalMI {miDimension = 1, miDegree = 1, miKind = Algebraic, uargs = UArgs, urules = URules, selector = Nothing}} + Details: We first use the processor NaturalMI {miDimension = 1, miDegree = 1, miKind = Algebraic, uargs = UArgs, urules = URules, selector = Nothing} to orient following rules strictly: 1: 'compare#('neg(x),'neg(y)) -> c_9('compare#(y,x)) The strictly oriented rules are moved into the weak component. ******* Step 5.a:3.b:1.b:1.b:1.b:1.a:1: NaturalMI WORST_CASE(?,O(n^1)) + Considered Problem: - Strict DPs: 'compare#('neg(x),'neg(y)) -> c_9('compare#(y,x)) - Weak DPs: 'compare#('pos(x),'pos(y)) -> c_13('compare#(x,y)) 'compare#('s(x),'s(y)) -> c_15('compare#(x,y)) 'less#(x,y) -> c_16('compare#(x,y)) merge#(l1,l2) -> merge'1#(l1,l2) merge'1#(dd(x,xs),l2) -> merge'2#(l2,x,xs) merge'2#(dd(y,ys),x,xs) -> 'less#(x,y) merge'2#(dd(y,ys),x,xs) -> merge'3#('less(x,y),x,xs,y,ys) merge'3#('false(),x,xs,y,ys) -> merge#(dd(x,xs),ys) merge'3#('true(),x,xs,y,ys) -> merge#(xs,dd(y,ys)) mergesort#(l) -> mergesort'1#(l) mergesort'1#(dd(x1,xs)) -> mergesort'2#(xs,x1) mergesort'2#(dd(x2,xs'),x1) -> mergesort'3#(msplit(dd(x1,dd(x2,xs')))) mergesort'3#(tuple'2(l1,l2)) -> merge#(mergesort(l1),mergesort(l2)) mergesort'3#(tuple'2(l1,l2)) -> mergesort#(l1) mergesort'3#(tuple'2(l1,l2)) -> mergesort#(l2) - Weak TRS: 'cklt('EQ()) -> 'false() 'cklt('GT()) -> 'false() 'cklt('LT()) -> 'true() 'compare('0(),'0()) -> 'EQ() 'compare('0(),'neg(y)) -> 'GT() 'compare('0(),'pos(y)) -> 'LT() 'compare('0(),'s(y)) -> 'LT() 'compare('neg(x),'0()) -> 'LT() 'compare('neg(x),'neg(y)) -> 'compare(y,x) 'compare('neg(x),'pos(y)) -> 'LT() 'compare('pos(x),'0()) -> 'GT() 'compare('pos(x),'neg(y)) -> 'GT() 'compare('pos(x),'pos(y)) -> 'compare(x,y) 'compare('s(x),'0()) -> 'GT() 'compare('s(x),'s(y)) -> 'compare(x,y) 'less(x,y) -> 'cklt('compare(x,y)) merge(l1,l2) -> merge'1(l1,l2) merge'1(dd(x,xs),l2) -> merge'2(l2,x,xs) merge'1(nil(),l2) -> l2 merge'2(dd(y,ys),x,xs) -> merge'3('less(x,y),x,xs,y,ys) merge'2(nil(),x,xs) -> dd(x,xs) merge'3('false(),x,xs,y,ys) -> dd(y,merge(dd(x,xs),ys)) merge'3('true(),x,xs,y,ys) -> dd(x,merge(xs,dd(y,ys))) mergesort(l) -> mergesort'1(l) mergesort'1(dd(x1,xs)) -> mergesort'2(xs,x1) mergesort'1(nil()) -> nil() mergesort'2(dd(x2,xs'),x1) -> mergesort'3(msplit(dd(x1,dd(x2,xs')))) mergesort'2(nil(),x1) -> dd(x1,nil()) mergesort'3(tuple'2(l1,l2)) -> merge(mergesort(l1),mergesort(l2)) msplit(l) -> msplit'1(l) msplit'1(dd(x1,xs)) -> msplit'2(xs,x1) msplit'1(nil()) -> tuple'2(nil(),nil()) msplit'2(dd(x2,xs'),x1) -> msplit'3(msplit(xs'),x1,x2) msplit'2(nil(),x1) -> tuple'2(dd(x1,nil()),nil()) msplit'3(tuple'2(l1,l2),x1,x2) -> tuple'2(dd(x1,l1),dd(x2,l2)) - Signature: {'cklt/1,'compare/2,'less/2,merge/2,merge'1/2,merge'2/3,merge'3/5,mergesort/1,mergesort'1/1,mergesort'2/2 ,mergesort'3/1,msplit/1,msplit'1/1,msplit'2/2,msplit'3/3,'cklt#/1,'compare#/2,'less#/2,merge#/2,merge'1#/2 ,merge'2#/3,merge'3#/5,mergesort#/1,mergesort'1#/1,mergesort'2#/2,mergesort'3#/1,msplit#/1,msplit'1#/1 ,msplit'2#/2,msplit'3#/3} / {'0/0,'EQ/0,'GT/0,'LT/0,'false/0,'neg/1,'pos/1,'s/1,'true/0,dd/2,nil/0,tuple'2/2 ,c_1/0,c_2/0,c_3/0,c_4/0,c_5/0,c_6/0,c_7/0,c_8/0,c_9/1,c_10/0,c_11/0,c_12/0,c_13/1,c_14/0,c_15/1,c_16/1 ,c_17/1,c_18/1,c_19/0,c_20/2,c_21/0,c_22/1,c_23/1,c_24/1,c_25/1,c_26/0,c_27/1,c_28/0,c_29/3,c_30/1,c_31/1 ,c_32/0,c_33/1,c_34/0,c_35/0} - Obligation: innermost runtime complexity wrt. defined symbols {'cklt#,'compare#,'less#,merge#,merge'1#,merge'2#,merge'3# ,mergesort#,mergesort'1#,mergesort'2#,mergesort'3#,msplit#,msplit'1#,msplit'2# ,msplit'3#} and constructors {'0,'EQ,'GT,'LT,'false,'neg,'pos,'s,'true,dd,nil,tuple'2} + Applied Processor: NaturalMI {miDimension = 1, miDegree = 1, miKind = Algebraic, uargs = UArgs, urules = URules, selector = Just first alternative for predecessorEstimation on any intersect of rules of CDG leaf and strict-rules} + Details: We apply a matrix interpretation of kind constructor based matrix interpretation: The following argument positions are considered usable: uargs(c_9) = {1}, uargs(c_13) = {1}, uargs(c_15) = {1}, uargs(c_16) = {1} Following symbols are considered usable: {merge,merge'1,merge'2,merge'3,mergesort,mergesort'1,mergesort'2,mergesort'3,msplit,msplit'1,msplit'2 ,msplit'3,'cklt#,'compare#,'less#,merge#,merge'1#,merge'2#,merge'3#,mergesort#,mergesort'1#,mergesort'2# ,mergesort'3#,msplit#,msplit'1#,msplit'2#,msplit'3#} TcT has computed the following interpretation: p('0) = [2] p('EQ) = [1] p('GT) = [0] p('LT) = [0] p('cklt) = [3] p('compare) = [4] x1 + [0] p('false) = [0] p('less) = [0] p('neg) = [1] x1 + [1] p('pos) = [1] x1 + [3] p('s) = [1] x1 + [0] p('true) = [0] p(dd) = [1] x1 + [1] x2 + [0] p(merge) = [1] x1 + [1] x2 + [0] p(merge'1) = [1] x1 + [1] x2 + [0] p(merge'2) = [1] x1 + [1] x2 + [1] x3 + [0] p(merge'3) = [1] x2 + [1] x3 + [1] x4 + [1] x5 + [0] p(mergesort) = [1] x1 + [0] p(mergesort'1) = [1] x1 + [0] p(mergesort'2) = [1] x1 + [1] x2 + [0] p(mergesort'3) = [1] x1 + [0] p(msplit) = [1] x1 + [0] p(msplit'1) = [1] x1 + [0] p(msplit'2) = [1] x1 + [1] x2 + [0] p(msplit'3) = [1] x1 + [1] x2 + [1] x3 + [0] p(nil) = [0] p(tuple'2) = [1] x1 + [1] x2 + [0] p('cklt#) = [4] p('compare#) = [2] x1 + [2] x2 + [0] p('less#) = [6] x1 + [6] x2 + [0] p(merge#) = [6] x1 + [6] x2 + [2] p(merge'1#) = [6] x1 + [6] x2 + [2] p(merge'2#) = [6] x1 + [6] x2 + [6] x3 + [2] p(merge'3#) = [6] x2 + [6] x3 + [6] x4 + [6] x5 + [2] p(mergesort#) = [6] x1 + [2] p(mergesort'1#) = [6] x1 + [2] p(mergesort'2#) = [6] x1 + [6] x2 + [2] p(mergesort'3#) = [6] x1 + [2] p(msplit#) = [4] p(msplit'1#) = [0] p(msplit'2#) = [4] x1 + [4] x2 + [0] p(msplit'3#) = [1] x2 + [2] x3 + [0] p(c_1) = [1] p(c_2) = [4] p(c_3) = [4] p(c_4) = [0] p(c_5) = [1] p(c_6) = [1] p(c_7) = [0] p(c_8) = [1] p(c_9) = [1] x1 + [0] p(c_10) = [0] p(c_11) = [1] p(c_12) = [4] p(c_13) = [1] x1 + [2] p(c_14) = [1] p(c_15) = [1] x1 + [0] p(c_16) = [3] x1 + [0] p(c_17) = [0] p(c_18) = [1] p(c_19) = [1] p(c_20) = [4] x2 + [1] p(c_21) = [0] p(c_22) = [0] p(c_23) = [1] p(c_24) = [1] x1 + [2] p(c_25) = [0] p(c_26) = [0] p(c_27) = [1] x1 + [1] p(c_28) = [0] p(c_29) = [1] p(c_30) = [2] x1 + [4] p(c_31) = [4] p(c_32) = [2] p(c_33) = [0] p(c_34) = [0] p(c_35) = [2] Following rules are strictly oriented: 'compare#('neg(x),'neg(y)) = [2] x + [2] y + [4] > [2] x + [2] y + [0] = c_9('compare#(y,x)) Following rules are (at-least) weakly oriented: 'compare#('pos(x),'pos(y)) = [2] x + [2] y + [12] >= [2] x + [2] y + [2] = c_13('compare#(x,y)) 'compare#('s(x),'s(y)) = [2] x + [2] y + [0] >= [2] x + [2] y + [0] = c_15('compare#(x,y)) 'less#(x,y) = [6] x + [6] y + [0] >= [6] x + [6] y + [0] = c_16('compare#(x,y)) merge#(l1,l2) = [6] l1 + [6] l2 + [2] >= [6] l1 + [6] l2 + [2] = merge'1#(l1,l2) merge'1#(dd(x,xs),l2) = [6] l2 + [6] x + [6] xs + [2] >= [6] l2 + [6] x + [6] xs + [2] = merge'2#(l2,x,xs) merge'2#(dd(y,ys),x,xs) = [6] x + [6] xs + [6] y + [6] ys + [2] >= [6] x + [6] y + [0] = 'less#(x,y) merge'2#(dd(y,ys),x,xs) = [6] x + [6] xs + [6] y + [6] ys + [2] >= [6] x + [6] xs + [6] y + [6] ys + [2] = merge'3#('less(x,y),x,xs,y,ys) merge'3#('false(),x,xs,y,ys) = [6] x + [6] xs + [6] y + [6] ys + [2] >= [6] x + [6] xs + [6] ys + [2] = merge#(dd(x,xs),ys) merge'3#('true(),x,xs,y,ys) = [6] x + [6] xs + [6] y + [6] ys + [2] >= [6] xs + [6] y + [6] ys + [2] = merge#(xs,dd(y,ys)) mergesort#(l) = [6] l + [2] >= [6] l + [2] = mergesort'1#(l) mergesort'1#(dd(x1,xs)) = [6] x1 + [6] xs + [2] >= [6] x1 + [6] xs + [2] = mergesort'2#(xs,x1) mergesort'2#(dd(x2,xs'),x1) = [6] x1 + [6] x2 + [6] xs' + [2] >= [6] x1 + [6] x2 + [6] xs' + [2] = mergesort'3#(msplit(dd(x1,dd(x2,xs')))) mergesort'3#(tuple'2(l1,l2)) = [6] l1 + [6] l2 + [2] >= [6] l1 + [6] l2 + [2] = merge#(mergesort(l1),mergesort(l2)) mergesort'3#(tuple'2(l1,l2)) = [6] l1 + [6] l2 + [2] >= [6] l1 + [2] = mergesort#(l1) mergesort'3#(tuple'2(l1,l2)) = [6] l1 + [6] l2 + [2] >= [6] l2 + [2] = mergesort#(l2) merge(l1,l2) = [1] l1 + [1] l2 + [0] >= [1] l1 + [1] l2 + [0] = merge'1(l1,l2) merge'1(dd(x,xs),l2) = [1] l2 + [1] x + [1] xs + [0] >= [1] l2 + [1] x + [1] xs + [0] = merge'2(l2,x,xs) merge'1(nil(),l2) = [1] l2 + [0] >= [1] l2 + [0] = l2 merge'2(dd(y,ys),x,xs) = [1] x + [1] xs + [1] y + [1] ys + [0] >= [1] x + [1] xs + [1] y + [1] ys + [0] = merge'3('less(x,y),x,xs,y,ys) merge'2(nil(),x,xs) = [1] x + [1] xs + [0] >= [1] x + [1] xs + [0] = dd(x,xs) merge'3('false(),x,xs,y,ys) = [1] x + [1] xs + [1] y + [1] ys + [0] >= [1] x + [1] xs + [1] y + [1] ys + [0] = dd(y,merge(dd(x,xs),ys)) merge'3('true(),x,xs,y,ys) = [1] x + [1] xs + [1] y + [1] ys + [0] >= [1] x + [1] xs + [1] y + [1] ys + [0] = dd(x,merge(xs,dd(y,ys))) mergesort(l) = [1] l + [0] >= [1] l + [0] = mergesort'1(l) mergesort'1(dd(x1,xs)) = [1] x1 + [1] xs + [0] >= [1] x1 + [1] xs + [0] = mergesort'2(xs,x1) mergesort'1(nil()) = [0] >= [0] = nil() mergesort'2(dd(x2,xs'),x1) = [1] x1 + [1] x2 + [1] xs' + [0] >= [1] x1 + [1] x2 + [1] xs' + [0] = mergesort'3(msplit(dd(x1,dd(x2,xs')))) mergesort'2(nil(),x1) = [1] x1 + [0] >= [1] x1 + [0] = dd(x1,nil()) mergesort'3(tuple'2(l1,l2)) = [1] l1 + [1] l2 + [0] >= [1] l1 + [1] l2 + [0] = merge(mergesort(l1),mergesort(l2)) msplit(l) = [1] l + [0] >= [1] l + [0] = msplit'1(l) msplit'1(dd(x1,xs)) = [1] x1 + [1] xs + [0] >= [1] x1 + [1] xs + [0] = msplit'2(xs,x1) msplit'1(nil()) = [0] >= [0] = tuple'2(nil(),nil()) msplit'2(dd(x2,xs'),x1) = [1] x1 + [1] x2 + [1] xs' + [0] >= [1] x1 + [1] x2 + [1] xs' + [0] = msplit'3(msplit(xs'),x1,x2) msplit'2(nil(),x1) = [1] x1 + [0] >= [1] x1 + [0] = tuple'2(dd(x1,nil()),nil()) msplit'3(tuple'2(l1,l2),x1,x2) = [1] l1 + [1] l2 + [1] x1 + [1] x2 + [0] >= [1] l1 + [1] l2 + [1] x1 + [1] x2 + [0] = tuple'2(dd(x1,l1),dd(x2,l2)) ******* Step 5.a:3.b:1.b:1.b:1.b:1.a:2: Assumption WORST_CASE(?,O(1)) + Considered Problem: - Weak DPs: 'compare#('neg(x),'neg(y)) -> c_9('compare#(y,x)) 'compare#('pos(x),'pos(y)) -> c_13('compare#(x,y)) 'compare#('s(x),'s(y)) -> c_15('compare#(x,y)) 'less#(x,y) -> c_16('compare#(x,y)) merge#(l1,l2) -> merge'1#(l1,l2) merge'1#(dd(x,xs),l2) -> merge'2#(l2,x,xs) merge'2#(dd(y,ys),x,xs) -> 'less#(x,y) merge'2#(dd(y,ys),x,xs) -> merge'3#('less(x,y),x,xs,y,ys) merge'3#('false(),x,xs,y,ys) -> merge#(dd(x,xs),ys) merge'3#('true(),x,xs,y,ys) -> merge#(xs,dd(y,ys)) mergesort#(l) -> mergesort'1#(l) mergesort'1#(dd(x1,xs)) -> mergesort'2#(xs,x1) mergesort'2#(dd(x2,xs'),x1) -> mergesort'3#(msplit(dd(x1,dd(x2,xs')))) mergesort'3#(tuple'2(l1,l2)) -> merge#(mergesort(l1),mergesort(l2)) mergesort'3#(tuple'2(l1,l2)) -> mergesort#(l1) mergesort'3#(tuple'2(l1,l2)) -> mergesort#(l2) - Weak TRS: 'cklt('EQ()) -> 'false() 'cklt('GT()) -> 'false() 'cklt('LT()) -> 'true() 'compare('0(),'0()) -> 'EQ() 'compare('0(),'neg(y)) -> 'GT() 'compare('0(),'pos(y)) -> 'LT() 'compare('0(),'s(y)) -> 'LT() 'compare('neg(x),'0()) -> 'LT() 'compare('neg(x),'neg(y)) -> 'compare(y,x) 'compare('neg(x),'pos(y)) -> 'LT() 'compare('pos(x),'0()) -> 'GT() 'compare('pos(x),'neg(y)) -> 'GT() 'compare('pos(x),'pos(y)) -> 'compare(x,y) 'compare('s(x),'0()) -> 'GT() 'compare('s(x),'s(y)) -> 'compare(x,y) 'less(x,y) -> 'cklt('compare(x,y)) merge(l1,l2) -> merge'1(l1,l2) merge'1(dd(x,xs),l2) -> merge'2(l2,x,xs) merge'1(nil(),l2) -> l2 merge'2(dd(y,ys),x,xs) -> merge'3('less(x,y),x,xs,y,ys) merge'2(nil(),x,xs) -> dd(x,xs) merge'3('false(),x,xs,y,ys) -> dd(y,merge(dd(x,xs),ys)) merge'3('true(),x,xs,y,ys) -> dd(x,merge(xs,dd(y,ys))) mergesort(l) -> mergesort'1(l) mergesort'1(dd(x1,xs)) -> mergesort'2(xs,x1) mergesort'1(nil()) -> nil() mergesort'2(dd(x2,xs'),x1) -> mergesort'3(msplit(dd(x1,dd(x2,xs')))) mergesort'2(nil(),x1) -> dd(x1,nil()) mergesort'3(tuple'2(l1,l2)) -> merge(mergesort(l1),mergesort(l2)) msplit(l) -> msplit'1(l) msplit'1(dd(x1,xs)) -> msplit'2(xs,x1) msplit'1(nil()) -> tuple'2(nil(),nil()) msplit'2(dd(x2,xs'),x1) -> msplit'3(msplit(xs'),x1,x2) msplit'2(nil(),x1) -> tuple'2(dd(x1,nil()),nil()) msplit'3(tuple'2(l1,l2),x1,x2) -> tuple'2(dd(x1,l1),dd(x2,l2)) - Signature: {'cklt/1,'compare/2,'less/2,merge/2,merge'1/2,merge'2/3,merge'3/5,mergesort/1,mergesort'1/1,mergesort'2/2 ,mergesort'3/1,msplit/1,msplit'1/1,msplit'2/2,msplit'3/3,'cklt#/1,'compare#/2,'less#/2,merge#/2,merge'1#/2 ,merge'2#/3,merge'3#/5,mergesort#/1,mergesort'1#/1,mergesort'2#/2,mergesort'3#/1,msplit#/1,msplit'1#/1 ,msplit'2#/2,msplit'3#/3} / {'0/0,'EQ/0,'GT/0,'LT/0,'false/0,'neg/1,'pos/1,'s/1,'true/0,dd/2,nil/0,tuple'2/2 ,c_1/0,c_2/0,c_3/0,c_4/0,c_5/0,c_6/0,c_7/0,c_8/0,c_9/1,c_10/0,c_11/0,c_12/0,c_13/1,c_14/0,c_15/1,c_16/1 ,c_17/1,c_18/1,c_19/0,c_20/2,c_21/0,c_22/1,c_23/1,c_24/1,c_25/1,c_26/0,c_27/1,c_28/0,c_29/3,c_30/1,c_31/1 ,c_32/0,c_33/1,c_34/0,c_35/0} - Obligation: innermost runtime complexity wrt. defined symbols {'cklt#,'compare#,'less#,merge#,merge'1#,merge'2#,merge'3# ,mergesort#,mergesort'1#,mergesort'2#,mergesort'3#,msplit#,msplit'1#,msplit'2# ,msplit'3#} and constructors {'0,'EQ,'GT,'LT,'false,'neg,'pos,'s,'true,dd,nil,tuple'2} + Applied Processor: Assumption {assumed = Certificate {spaceUB = Unknown, spaceLB = Unknown, timeUB = Poly (Just 0), timeLB = Unknown}} + Details: () ******* Step 5.a:3.b:1.b:1.b:1.b:1.b:1: RemoveWeakSuffixes WORST_CASE(?,O(1)) + Considered Problem: - Weak DPs: 'compare#('neg(x),'neg(y)) -> c_9('compare#(y,x)) 'compare#('pos(x),'pos(y)) -> c_13('compare#(x,y)) 'compare#('s(x),'s(y)) -> c_15('compare#(x,y)) 'less#(x,y) -> c_16('compare#(x,y)) merge#(l1,l2) -> merge'1#(l1,l2) merge'1#(dd(x,xs),l2) -> merge'2#(l2,x,xs) merge'2#(dd(y,ys),x,xs) -> 'less#(x,y) merge'2#(dd(y,ys),x,xs) -> merge'3#('less(x,y),x,xs,y,ys) merge'3#('false(),x,xs,y,ys) -> merge#(dd(x,xs),ys) merge'3#('true(),x,xs,y,ys) -> merge#(xs,dd(y,ys)) mergesort#(l) -> mergesort'1#(l) mergesort'1#(dd(x1,xs)) -> mergesort'2#(xs,x1) mergesort'2#(dd(x2,xs'),x1) -> mergesort'3#(msplit(dd(x1,dd(x2,xs')))) mergesort'3#(tuple'2(l1,l2)) -> merge#(mergesort(l1),mergesort(l2)) mergesort'3#(tuple'2(l1,l2)) -> mergesort#(l1) mergesort'3#(tuple'2(l1,l2)) -> mergesort#(l2) - Weak TRS: 'cklt('EQ()) -> 'false() 'cklt('GT()) -> 'false() 'cklt('LT()) -> 'true() 'compare('0(),'0()) -> 'EQ() 'compare('0(),'neg(y)) -> 'GT() 'compare('0(),'pos(y)) -> 'LT() 'compare('0(),'s(y)) -> 'LT() 'compare('neg(x),'0()) -> 'LT() 'compare('neg(x),'neg(y)) -> 'compare(y,x) 'compare('neg(x),'pos(y)) -> 'LT() 'compare('pos(x),'0()) -> 'GT() 'compare('pos(x),'neg(y)) -> 'GT() 'compare('pos(x),'pos(y)) -> 'compare(x,y) 'compare('s(x),'0()) -> 'GT() 'compare('s(x),'s(y)) -> 'compare(x,y) 'less(x,y) -> 'cklt('compare(x,y)) merge(l1,l2) -> merge'1(l1,l2) merge'1(dd(x,xs),l2) -> merge'2(l2,x,xs) merge'1(nil(),l2) -> l2 merge'2(dd(y,ys),x,xs) -> merge'3('less(x,y),x,xs,y,ys) merge'2(nil(),x,xs) -> dd(x,xs) merge'3('false(),x,xs,y,ys) -> dd(y,merge(dd(x,xs),ys)) merge'3('true(),x,xs,y,ys) -> dd(x,merge(xs,dd(y,ys))) mergesort(l) -> mergesort'1(l) mergesort'1(dd(x1,xs)) -> mergesort'2(xs,x1) mergesort'1(nil()) -> nil() mergesort'2(dd(x2,xs'),x1) -> mergesort'3(msplit(dd(x1,dd(x2,xs')))) mergesort'2(nil(),x1) -> dd(x1,nil()) mergesort'3(tuple'2(l1,l2)) -> merge(mergesort(l1),mergesort(l2)) msplit(l) -> msplit'1(l) msplit'1(dd(x1,xs)) -> msplit'2(xs,x1) msplit'1(nil()) -> tuple'2(nil(),nil()) msplit'2(dd(x2,xs'),x1) -> msplit'3(msplit(xs'),x1,x2) msplit'2(nil(),x1) -> tuple'2(dd(x1,nil()),nil()) msplit'3(tuple'2(l1,l2),x1,x2) -> tuple'2(dd(x1,l1),dd(x2,l2)) - Signature: {'cklt/1,'compare/2,'less/2,merge/2,merge'1/2,merge'2/3,merge'3/5,mergesort/1,mergesort'1/1,mergesort'2/2 ,mergesort'3/1,msplit/1,msplit'1/1,msplit'2/2,msplit'3/3,'cklt#/1,'compare#/2,'less#/2,merge#/2,merge'1#/2 ,merge'2#/3,merge'3#/5,mergesort#/1,mergesort'1#/1,mergesort'2#/2,mergesort'3#/1,msplit#/1,msplit'1#/1 ,msplit'2#/2,msplit'3#/3} / {'0/0,'EQ/0,'GT/0,'LT/0,'false/0,'neg/1,'pos/1,'s/1,'true/0,dd/2,nil/0,tuple'2/2 ,c_1/0,c_2/0,c_3/0,c_4/0,c_5/0,c_6/0,c_7/0,c_8/0,c_9/1,c_10/0,c_11/0,c_12/0,c_13/1,c_14/0,c_15/1,c_16/1 ,c_17/1,c_18/1,c_19/0,c_20/2,c_21/0,c_22/1,c_23/1,c_24/1,c_25/1,c_26/0,c_27/1,c_28/0,c_29/3,c_30/1,c_31/1 ,c_32/0,c_33/1,c_34/0,c_35/0} - Obligation: innermost runtime complexity wrt. defined symbols {'cklt#,'compare#,'less#,merge#,merge'1#,merge'2#,merge'3# ,mergesort#,mergesort'1#,mergesort'2#,mergesort'3#,msplit#,msplit'1#,msplit'2# ,msplit'3#} and constructors {'0,'EQ,'GT,'LT,'false,'neg,'pos,'s,'true,dd,nil,tuple'2} + Applied Processor: RemoveWeakSuffixes + Details: Consider the dependency graph 1:W:'compare#('neg(x),'neg(y)) -> c_9('compare#(y,x)) -->_1 'compare#('s(x),'s(y)) -> c_15('compare#(x,y)):3 -->_1 'compare#('pos(x),'pos(y)) -> c_13('compare#(x,y)):2 -->_1 'compare#('neg(x),'neg(y)) -> c_9('compare#(y,x)):1 2:W:'compare#('pos(x),'pos(y)) -> c_13('compare#(x,y)) -->_1 'compare#('s(x),'s(y)) -> c_15('compare#(x,y)):3 -->_1 'compare#('pos(x),'pos(y)) -> c_13('compare#(x,y)):2 -->_1 'compare#('neg(x),'neg(y)) -> c_9('compare#(y,x)):1 3:W:'compare#('s(x),'s(y)) -> c_15('compare#(x,y)) -->_1 'compare#('s(x),'s(y)) -> c_15('compare#(x,y)):3 -->_1 'compare#('pos(x),'pos(y)) -> c_13('compare#(x,y)):2 -->_1 'compare#('neg(x),'neg(y)) -> c_9('compare#(y,x)):1 4:W:'less#(x,y) -> c_16('compare#(x,y)) -->_1 'compare#('s(x),'s(y)) -> c_15('compare#(x,y)):3 -->_1 'compare#('pos(x),'pos(y)) -> c_13('compare#(x,y)):2 -->_1 'compare#('neg(x),'neg(y)) -> c_9('compare#(y,x)):1 5:W:merge#(l1,l2) -> merge'1#(l1,l2) -->_1 merge'1#(dd(x,xs),l2) -> merge'2#(l2,x,xs):6 6:W:merge'1#(dd(x,xs),l2) -> merge'2#(l2,x,xs) -->_1 merge'2#(dd(y,ys),x,xs) -> merge'3#('less(x,y),x,xs,y,ys):8 -->_1 merge'2#(dd(y,ys),x,xs) -> 'less#(x,y):7 7:W:merge'2#(dd(y,ys),x,xs) -> 'less#(x,y) -->_1 'less#(x,y) -> c_16('compare#(x,y)):4 8:W:merge'2#(dd(y,ys),x,xs) -> merge'3#('less(x,y),x,xs,y,ys) -->_1 merge'3#('true(),x,xs,y,ys) -> merge#(xs,dd(y,ys)):10 -->_1 merge'3#('false(),x,xs,y,ys) -> merge#(dd(x,xs),ys):9 9:W:merge'3#('false(),x,xs,y,ys) -> merge#(dd(x,xs),ys) -->_1 merge#(l1,l2) -> merge'1#(l1,l2):5 10:W:merge'3#('true(),x,xs,y,ys) -> merge#(xs,dd(y,ys)) -->_1 merge#(l1,l2) -> merge'1#(l1,l2):5 11:W:mergesort#(l) -> mergesort'1#(l) -->_1 mergesort'1#(dd(x1,xs)) -> mergesort'2#(xs,x1):12 12:W:mergesort'1#(dd(x1,xs)) -> mergesort'2#(xs,x1) -->_1 mergesort'2#(dd(x2,xs'),x1) -> mergesort'3#(msplit(dd(x1,dd(x2,xs')))):13 13:W:mergesort'2#(dd(x2,xs'),x1) -> mergesort'3#(msplit(dd(x1,dd(x2,xs')))) -->_1 mergesort'3#(tuple'2(l1,l2)) -> mergesort#(l2):16 -->_1 mergesort'3#(tuple'2(l1,l2)) -> mergesort#(l1):15 -->_1 mergesort'3#(tuple'2(l1,l2)) -> merge#(mergesort(l1),mergesort(l2)):14 14:W:mergesort'3#(tuple'2(l1,l2)) -> merge#(mergesort(l1),mergesort(l2)) -->_1 merge#(l1,l2) -> merge'1#(l1,l2):5 15:W:mergesort'3#(tuple'2(l1,l2)) -> mergesort#(l1) -->_1 mergesort#(l) -> mergesort'1#(l):11 16:W:mergesort'3#(tuple'2(l1,l2)) -> mergesort#(l2) -->_1 mergesort#(l) -> mergesort'1#(l):11 The following weak DPs constitute a sub-graph of the DG that is closed under successors. The DPs are removed. 11: mergesort#(l) -> mergesort'1#(l) 16: mergesort'3#(tuple'2(l1,l2)) -> mergesort#(l2) 13: mergesort'2#(dd(x2,xs'),x1) -> mergesort'3#(msplit(dd(x1,dd(x2,xs')))) 12: mergesort'1#(dd(x1,xs)) -> mergesort'2#(xs,x1) 15: mergesort'3#(tuple'2(l1,l2)) -> mergesort#(l1) 14: mergesort'3#(tuple'2(l1,l2)) -> merge#(mergesort(l1),mergesort(l2)) 5: merge#(l1,l2) -> merge'1#(l1,l2) 10: merge'3#('true(),x,xs,y,ys) -> merge#(xs,dd(y,ys)) 8: merge'2#(dd(y,ys),x,xs) -> merge'3#('less(x,y),x,xs,y,ys) 6: merge'1#(dd(x,xs),l2) -> merge'2#(l2,x,xs) 9: merge'3#('false(),x,xs,y,ys) -> merge#(dd(x,xs),ys) 7: merge'2#(dd(y,ys),x,xs) -> 'less#(x,y) 4: 'less#(x,y) -> c_16('compare#(x,y)) 1: 'compare#('neg(x),'neg(y)) -> c_9('compare#(y,x)) 3: 'compare#('s(x),'s(y)) -> c_15('compare#(x,y)) 2: 'compare#('pos(x),'pos(y)) -> c_13('compare#(x,y)) ******* Step 5.a:3.b:1.b:1.b:1.b:1.b:2: EmptyProcessor WORST_CASE(?,O(1)) + Considered Problem: - Weak TRS: 'cklt('EQ()) -> 'false() 'cklt('GT()) -> 'false() 'cklt('LT()) -> 'true() 'compare('0(),'0()) -> 'EQ() 'compare('0(),'neg(y)) -> 'GT() 'compare('0(),'pos(y)) -> 'LT() 'compare('0(),'s(y)) -> 'LT() 'compare('neg(x),'0()) -> 'LT() 'compare('neg(x),'neg(y)) -> 'compare(y,x) 'compare('neg(x),'pos(y)) -> 'LT() 'compare('pos(x),'0()) -> 'GT() 'compare('pos(x),'neg(y)) -> 'GT() 'compare('pos(x),'pos(y)) -> 'compare(x,y) 'compare('s(x),'0()) -> 'GT() 'compare('s(x),'s(y)) -> 'compare(x,y) 'less(x,y) -> 'cklt('compare(x,y)) merge(l1,l2) -> merge'1(l1,l2) merge'1(dd(x,xs),l2) -> merge'2(l2,x,xs) merge'1(nil(),l2) -> l2 merge'2(dd(y,ys),x,xs) -> merge'3('less(x,y),x,xs,y,ys) merge'2(nil(),x,xs) -> dd(x,xs) merge'3('false(),x,xs,y,ys) -> dd(y,merge(dd(x,xs),ys)) merge'3('true(),x,xs,y,ys) -> dd(x,merge(xs,dd(y,ys))) mergesort(l) -> mergesort'1(l) mergesort'1(dd(x1,xs)) -> mergesort'2(xs,x1) mergesort'1(nil()) -> nil() mergesort'2(dd(x2,xs'),x1) -> mergesort'3(msplit(dd(x1,dd(x2,xs')))) mergesort'2(nil(),x1) -> dd(x1,nil()) mergesort'3(tuple'2(l1,l2)) -> merge(mergesort(l1),mergesort(l2)) msplit(l) -> msplit'1(l) msplit'1(dd(x1,xs)) -> msplit'2(xs,x1) msplit'1(nil()) -> tuple'2(nil(),nil()) msplit'2(dd(x2,xs'),x1) -> msplit'3(msplit(xs'),x1,x2) msplit'2(nil(),x1) -> tuple'2(dd(x1,nil()),nil()) msplit'3(tuple'2(l1,l2),x1,x2) -> tuple'2(dd(x1,l1),dd(x2,l2)) - Signature: {'cklt/1,'compare/2,'less/2,merge/2,merge'1/2,merge'2/3,merge'3/5,mergesort/1,mergesort'1/1,mergesort'2/2 ,mergesort'3/1,msplit/1,msplit'1/1,msplit'2/2,msplit'3/3,'cklt#/1,'compare#/2,'less#/2,merge#/2,merge'1#/2 ,merge'2#/3,merge'3#/5,mergesort#/1,mergesort'1#/1,mergesort'2#/2,mergesort'3#/1,msplit#/1,msplit'1#/1 ,msplit'2#/2,msplit'3#/3} / {'0/0,'EQ/0,'GT/0,'LT/0,'false/0,'neg/1,'pos/1,'s/1,'true/0,dd/2,nil/0,tuple'2/2 ,c_1/0,c_2/0,c_3/0,c_4/0,c_5/0,c_6/0,c_7/0,c_8/0,c_9/1,c_10/0,c_11/0,c_12/0,c_13/1,c_14/0,c_15/1,c_16/1 ,c_17/1,c_18/1,c_19/0,c_20/2,c_21/0,c_22/1,c_23/1,c_24/1,c_25/1,c_26/0,c_27/1,c_28/0,c_29/3,c_30/1,c_31/1 ,c_32/0,c_33/1,c_34/0,c_35/0} - Obligation: innermost runtime complexity wrt. defined symbols {'cklt#,'compare#,'less#,merge#,merge'1#,merge'2#,merge'3# ,mergesort#,mergesort'1#,mergesort'2#,mergesort'3#,msplit#,msplit'1#,msplit'2# ,msplit'3#} and constructors {'0,'EQ,'GT,'LT,'false,'neg,'pos,'s,'true,dd,nil,tuple'2} + Applied Processor: EmptyProcessor + Details: The problem is already closed. The intended complexity is O(1). ** Step 5.b:1: PredecessorEstimation WORST_CASE(?,O(n^2)) + Considered Problem: - Strict DPs: 'less#(x,y) -> c_16('compare#(x,y)) merge#(l1,l2) -> c_17(merge'1#(l1,l2)) merge'1#(dd(x,xs),l2) -> c_18(merge'2#(l2,x,xs)) merge'2#(dd(y,ys),x,xs) -> c_20(merge'3#('less(x,y),x,xs,y,ys),'less#(x,y)) merge'3#('false(),x,xs,y,ys) -> c_22(merge#(dd(x,xs),ys)) merge'3#('true(),x,xs,y,ys) -> c_23(merge#(xs,dd(y,ys))) mergesort#(l) -> c_24(mergesort'1#(l)) mergesort'1#(dd(x1,xs)) -> c_25(mergesort'2#(xs,x1)) mergesort'2#(dd(x2,xs'),x1) -> c_27(mergesort'3#(msplit(dd(x1,dd(x2,xs')))),msplit#(dd(x1,dd(x2,xs')))) mergesort'3#(tuple'2(l1,l2)) -> c_29(merge#(mergesort(l1),mergesort(l2)),mergesort#(l1),mergesort#(l2)) msplit#(l) -> c_30(msplit'1#(l)) msplit'1#(dd(x1,xs)) -> c_31(msplit'2#(xs,x1)) msplit'2#(dd(x2,xs'),x1) -> c_33(msplit#(xs')) - Weak DPs: 'compare#('neg(x),'neg(y)) -> c_9('compare#(y,x)) 'compare#('pos(x),'pos(y)) -> c_13('compare#(x,y)) 'compare#('s(x),'s(y)) -> c_15('compare#(x,y)) - Weak TRS: 'cklt('EQ()) -> 'false() 'cklt('GT()) -> 'false() 'cklt('LT()) -> 'true() 'compare('0(),'0()) -> 'EQ() 'compare('0(),'neg(y)) -> 'GT() 'compare('0(),'pos(y)) -> 'LT() 'compare('0(),'s(y)) -> 'LT() 'compare('neg(x),'0()) -> 'LT() 'compare('neg(x),'neg(y)) -> 'compare(y,x) 'compare('neg(x),'pos(y)) -> 'LT() 'compare('pos(x),'0()) -> 'GT() 'compare('pos(x),'neg(y)) -> 'GT() 'compare('pos(x),'pos(y)) -> 'compare(x,y) 'compare('s(x),'0()) -> 'GT() 'compare('s(x),'s(y)) -> 'compare(x,y) 'less(x,y) -> 'cklt('compare(x,y)) merge(l1,l2) -> merge'1(l1,l2) merge'1(dd(x,xs),l2) -> merge'2(l2,x,xs) merge'1(nil(),l2) -> l2 merge'2(dd(y,ys),x,xs) -> merge'3('less(x,y),x,xs,y,ys) merge'2(nil(),x,xs) -> dd(x,xs) merge'3('false(),x,xs,y,ys) -> dd(y,merge(dd(x,xs),ys)) merge'3('true(),x,xs,y,ys) -> dd(x,merge(xs,dd(y,ys))) mergesort(l) -> mergesort'1(l) mergesort'1(dd(x1,xs)) -> mergesort'2(xs,x1) mergesort'1(nil()) -> nil() mergesort'2(dd(x2,xs'),x1) -> mergesort'3(msplit(dd(x1,dd(x2,xs')))) mergesort'2(nil(),x1) -> dd(x1,nil()) mergesort'3(tuple'2(l1,l2)) -> merge(mergesort(l1),mergesort(l2)) msplit(l) -> msplit'1(l) msplit'1(dd(x1,xs)) -> msplit'2(xs,x1) msplit'1(nil()) -> tuple'2(nil(),nil()) msplit'2(dd(x2,xs'),x1) -> msplit'3(msplit(xs'),x1,x2) msplit'2(nil(),x1) -> tuple'2(dd(x1,nil()),nil()) msplit'3(tuple'2(l1,l2),x1,x2) -> tuple'2(dd(x1,l1),dd(x2,l2)) - Signature: {'cklt/1,'compare/2,'less/2,merge/2,merge'1/2,merge'2/3,merge'3/5,mergesort/1,mergesort'1/1,mergesort'2/2 ,mergesort'3/1,msplit/1,msplit'1/1,msplit'2/2,msplit'3/3,'cklt#/1,'compare#/2,'less#/2,merge#/2,merge'1#/2 ,merge'2#/3,merge'3#/5,mergesort#/1,mergesort'1#/1,mergesort'2#/2,mergesort'3#/1,msplit#/1,msplit'1#/1 ,msplit'2#/2,msplit'3#/3} / {'0/0,'EQ/0,'GT/0,'LT/0,'false/0,'neg/1,'pos/1,'s/1,'true/0,dd/2,nil/0,tuple'2/2 ,c_1/0,c_2/0,c_3/0,c_4/0,c_5/0,c_6/0,c_7/0,c_8/0,c_9/1,c_10/0,c_11/0,c_12/0,c_13/1,c_14/0,c_15/1,c_16/1 ,c_17/1,c_18/1,c_19/0,c_20/2,c_21/0,c_22/1,c_23/1,c_24/1,c_25/1,c_26/0,c_27/2,c_28/0,c_29/3,c_30/1,c_31/1 ,c_32/0,c_33/1,c_34/0,c_35/0} - Obligation: innermost runtime complexity wrt. defined symbols {'cklt#,'compare#,'less#,merge#,merge'1#,merge'2#,merge'3# ,mergesort#,mergesort'1#,mergesort'2#,mergesort'3#,msplit#,msplit'1#,msplit'2# ,msplit'3#} and constructors {'0,'EQ,'GT,'LT,'false,'neg,'pos,'s,'true,dd,nil,tuple'2} + Applied Processor: PredecessorEstimation {onSelection = all simple predecessor estimation selector} + Details: We estimate the number of application of {1} by application of Pre({1}) = {4}. Here rules are labelled as follows: 1: 'less#(x,y) -> c_16('compare#(x,y)) 2: merge#(l1,l2) -> c_17(merge'1#(l1,l2)) 3: merge'1#(dd(x,xs),l2) -> c_18(merge'2#(l2,x,xs)) 4: merge'2#(dd(y,ys),x,xs) -> c_20(merge'3#('less(x,y),x,xs,y,ys),'less#(x,y)) 5: merge'3#('false(),x,xs,y,ys) -> c_22(merge#(dd(x,xs),ys)) 6: merge'3#('true(),x,xs,y,ys) -> c_23(merge#(xs,dd(y,ys))) 7: mergesort#(l) -> c_24(mergesort'1#(l)) 8: mergesort'1#(dd(x1,xs)) -> c_25(mergesort'2#(xs,x1)) 9: mergesort'2#(dd(x2,xs'),x1) -> c_27(mergesort'3#(msplit(dd(x1,dd(x2,xs')))),msplit#(dd(x1,dd(x2,xs')))) 10: mergesort'3#(tuple'2(l1,l2)) -> c_29(merge#(mergesort(l1),mergesort(l2)),mergesort#(l1),mergesort#(l2)) 11: msplit#(l) -> c_30(msplit'1#(l)) 12: msplit'1#(dd(x1,xs)) -> c_31(msplit'2#(xs,x1)) 13: msplit'2#(dd(x2,xs'),x1) -> c_33(msplit#(xs')) 14: 'compare#('neg(x),'neg(y)) -> c_9('compare#(y,x)) 15: 'compare#('pos(x),'pos(y)) -> c_13('compare#(x,y)) 16: 'compare#('s(x),'s(y)) -> c_15('compare#(x,y)) ** Step 5.b:2: RemoveWeakSuffixes WORST_CASE(?,O(n^2)) + Considered Problem: - Strict DPs: merge#(l1,l2) -> c_17(merge'1#(l1,l2)) merge'1#(dd(x,xs),l2) -> c_18(merge'2#(l2,x,xs)) merge'2#(dd(y,ys),x,xs) -> c_20(merge'3#('less(x,y),x,xs,y,ys),'less#(x,y)) merge'3#('false(),x,xs,y,ys) -> c_22(merge#(dd(x,xs),ys)) merge'3#('true(),x,xs,y,ys) -> c_23(merge#(xs,dd(y,ys))) mergesort#(l) -> c_24(mergesort'1#(l)) mergesort'1#(dd(x1,xs)) -> c_25(mergesort'2#(xs,x1)) mergesort'2#(dd(x2,xs'),x1) -> c_27(mergesort'3#(msplit(dd(x1,dd(x2,xs')))),msplit#(dd(x1,dd(x2,xs')))) mergesort'3#(tuple'2(l1,l2)) -> c_29(merge#(mergesort(l1),mergesort(l2)),mergesort#(l1),mergesort#(l2)) msplit#(l) -> c_30(msplit'1#(l)) msplit'1#(dd(x1,xs)) -> c_31(msplit'2#(xs,x1)) msplit'2#(dd(x2,xs'),x1) -> c_33(msplit#(xs')) - Weak DPs: 'compare#('neg(x),'neg(y)) -> c_9('compare#(y,x)) 'compare#('pos(x),'pos(y)) -> c_13('compare#(x,y)) 'compare#('s(x),'s(y)) -> c_15('compare#(x,y)) 'less#(x,y) -> c_16('compare#(x,y)) - Weak TRS: 'cklt('EQ()) -> 'false() 'cklt('GT()) -> 'false() 'cklt('LT()) -> 'true() 'compare('0(),'0()) -> 'EQ() 'compare('0(),'neg(y)) -> 'GT() 'compare('0(),'pos(y)) -> 'LT() 'compare('0(),'s(y)) -> 'LT() 'compare('neg(x),'0()) -> 'LT() 'compare('neg(x),'neg(y)) -> 'compare(y,x) 'compare('neg(x),'pos(y)) -> 'LT() 'compare('pos(x),'0()) -> 'GT() 'compare('pos(x),'neg(y)) -> 'GT() 'compare('pos(x),'pos(y)) -> 'compare(x,y) 'compare('s(x),'0()) -> 'GT() 'compare('s(x),'s(y)) -> 'compare(x,y) 'less(x,y) -> 'cklt('compare(x,y)) merge(l1,l2) -> merge'1(l1,l2) merge'1(dd(x,xs),l2) -> merge'2(l2,x,xs) merge'1(nil(),l2) -> l2 merge'2(dd(y,ys),x,xs) -> merge'3('less(x,y),x,xs,y,ys) merge'2(nil(),x,xs) -> dd(x,xs) merge'3('false(),x,xs,y,ys) -> dd(y,merge(dd(x,xs),ys)) merge'3('true(),x,xs,y,ys) -> dd(x,merge(xs,dd(y,ys))) mergesort(l) -> mergesort'1(l) mergesort'1(dd(x1,xs)) -> mergesort'2(xs,x1) mergesort'1(nil()) -> nil() mergesort'2(dd(x2,xs'),x1) -> mergesort'3(msplit(dd(x1,dd(x2,xs')))) mergesort'2(nil(),x1) -> dd(x1,nil()) mergesort'3(tuple'2(l1,l2)) -> merge(mergesort(l1),mergesort(l2)) msplit(l) -> msplit'1(l) msplit'1(dd(x1,xs)) -> msplit'2(xs,x1) msplit'1(nil()) -> tuple'2(nil(),nil()) msplit'2(dd(x2,xs'),x1) -> msplit'3(msplit(xs'),x1,x2) msplit'2(nil(),x1) -> tuple'2(dd(x1,nil()),nil()) msplit'3(tuple'2(l1,l2),x1,x2) -> tuple'2(dd(x1,l1),dd(x2,l2)) - Signature: {'cklt/1,'compare/2,'less/2,merge/2,merge'1/2,merge'2/3,merge'3/5,mergesort/1,mergesort'1/1,mergesort'2/2 ,mergesort'3/1,msplit/1,msplit'1/1,msplit'2/2,msplit'3/3,'cklt#/1,'compare#/2,'less#/2,merge#/2,merge'1#/2 ,merge'2#/3,merge'3#/5,mergesort#/1,mergesort'1#/1,mergesort'2#/2,mergesort'3#/1,msplit#/1,msplit'1#/1 ,msplit'2#/2,msplit'3#/3} / {'0/0,'EQ/0,'GT/0,'LT/0,'false/0,'neg/1,'pos/1,'s/1,'true/0,dd/2,nil/0,tuple'2/2 ,c_1/0,c_2/0,c_3/0,c_4/0,c_5/0,c_6/0,c_7/0,c_8/0,c_9/1,c_10/0,c_11/0,c_12/0,c_13/1,c_14/0,c_15/1,c_16/1 ,c_17/1,c_18/1,c_19/0,c_20/2,c_21/0,c_22/1,c_23/1,c_24/1,c_25/1,c_26/0,c_27/2,c_28/0,c_29/3,c_30/1,c_31/1 ,c_32/0,c_33/1,c_34/0,c_35/0} - Obligation: innermost runtime complexity wrt. defined symbols {'cklt#,'compare#,'less#,merge#,merge'1#,merge'2#,merge'3# ,mergesort#,mergesort'1#,mergesort'2#,mergesort'3#,msplit#,msplit'1#,msplit'2# ,msplit'3#} and constructors {'0,'EQ,'GT,'LT,'false,'neg,'pos,'s,'true,dd,nil,tuple'2} + Applied Processor: RemoveWeakSuffixes + Details: Consider the dependency graph 1:S:merge#(l1,l2) -> c_17(merge'1#(l1,l2)) -->_1 merge'1#(dd(x,xs),l2) -> c_18(merge'2#(l2,x,xs)):2 2:S:merge'1#(dd(x,xs),l2) -> c_18(merge'2#(l2,x,xs)) -->_1 merge'2#(dd(y,ys),x,xs) -> c_20(merge'3#('less(x,y),x,xs,y,ys),'less#(x,y)):3 3:S:merge'2#(dd(y,ys),x,xs) -> c_20(merge'3#('less(x,y),x,xs,y,ys),'less#(x,y)) -->_2 'less#(x,y) -> c_16('compare#(x,y)):16 -->_1 merge'3#('true(),x,xs,y,ys) -> c_23(merge#(xs,dd(y,ys))):5 -->_1 merge'3#('false(),x,xs,y,ys) -> c_22(merge#(dd(x,xs),ys)):4 4:S:merge'3#('false(),x,xs,y,ys) -> c_22(merge#(dd(x,xs),ys)) -->_1 merge#(l1,l2) -> c_17(merge'1#(l1,l2)):1 5:S:merge'3#('true(),x,xs,y,ys) -> c_23(merge#(xs,dd(y,ys))) -->_1 merge#(l1,l2) -> c_17(merge'1#(l1,l2)):1 6:S:mergesort#(l) -> c_24(mergesort'1#(l)) -->_1 mergesort'1#(dd(x1,xs)) -> c_25(mergesort'2#(xs,x1)):7 7:S:mergesort'1#(dd(x1,xs)) -> c_25(mergesort'2#(xs,x1)) -->_1 mergesort'2#(dd(x2,xs'),x1) -> c_27(mergesort'3#(msplit(dd(x1,dd(x2,xs')))) ,msplit#(dd(x1,dd(x2,xs')))):8 8:S:mergesort'2#(dd(x2,xs'),x1) -> c_27(mergesort'3#(msplit(dd(x1,dd(x2,xs')))),msplit#(dd(x1,dd(x2,xs')))) -->_2 msplit#(l) -> c_30(msplit'1#(l)):10 -->_1 mergesort'3#(tuple'2(l1,l2)) -> c_29(merge#(mergesort(l1),mergesort(l2)) ,mergesort#(l1) ,mergesort#(l2)):9 9:S:mergesort'3#(tuple'2(l1,l2)) -> c_29(merge#(mergesort(l1),mergesort(l2)),mergesort#(l1),mergesort#(l2)) -->_3 mergesort#(l) -> c_24(mergesort'1#(l)):6 -->_2 mergesort#(l) -> c_24(mergesort'1#(l)):6 -->_1 merge#(l1,l2) -> c_17(merge'1#(l1,l2)):1 10:S:msplit#(l) -> c_30(msplit'1#(l)) -->_1 msplit'1#(dd(x1,xs)) -> c_31(msplit'2#(xs,x1)):11 11:S:msplit'1#(dd(x1,xs)) -> c_31(msplit'2#(xs,x1)) -->_1 msplit'2#(dd(x2,xs'),x1) -> c_33(msplit#(xs')):12 12:S:msplit'2#(dd(x2,xs'),x1) -> c_33(msplit#(xs')) -->_1 msplit#(l) -> c_30(msplit'1#(l)):10 13:W:'compare#('neg(x),'neg(y)) -> c_9('compare#(y,x)) -->_1 'compare#('s(x),'s(y)) -> c_15('compare#(x,y)):15 -->_1 'compare#('pos(x),'pos(y)) -> c_13('compare#(x,y)):14 -->_1 'compare#('neg(x),'neg(y)) -> c_9('compare#(y,x)):13 14:W:'compare#('pos(x),'pos(y)) -> c_13('compare#(x,y)) -->_1 'compare#('s(x),'s(y)) -> c_15('compare#(x,y)):15 -->_1 'compare#('pos(x),'pos(y)) -> c_13('compare#(x,y)):14 -->_1 'compare#('neg(x),'neg(y)) -> c_9('compare#(y,x)):13 15:W:'compare#('s(x),'s(y)) -> c_15('compare#(x,y)) -->_1 'compare#('s(x),'s(y)) -> c_15('compare#(x,y)):15 -->_1 'compare#('pos(x),'pos(y)) -> c_13('compare#(x,y)):14 -->_1 'compare#('neg(x),'neg(y)) -> c_9('compare#(y,x)):13 16:W:'less#(x,y) -> c_16('compare#(x,y)) -->_1 'compare#('s(x),'s(y)) -> c_15('compare#(x,y)):15 -->_1 'compare#('pos(x),'pos(y)) -> c_13('compare#(x,y)):14 -->_1 'compare#('neg(x),'neg(y)) -> c_9('compare#(y,x)):13 The following weak DPs constitute a sub-graph of the DG that is closed under successors. The DPs are removed. 16: 'less#(x,y) -> c_16('compare#(x,y)) 15: 'compare#('s(x),'s(y)) -> c_15('compare#(x,y)) 14: 'compare#('pos(x),'pos(y)) -> c_13('compare#(x,y)) 13: 'compare#('neg(x),'neg(y)) -> c_9('compare#(y,x)) ** Step 5.b:3: SimplifyRHS WORST_CASE(?,O(n^2)) + Considered Problem: - Strict DPs: merge#(l1,l2) -> c_17(merge'1#(l1,l2)) merge'1#(dd(x,xs),l2) -> c_18(merge'2#(l2,x,xs)) merge'2#(dd(y,ys),x,xs) -> c_20(merge'3#('less(x,y),x,xs,y,ys),'less#(x,y)) merge'3#('false(),x,xs,y,ys) -> c_22(merge#(dd(x,xs),ys)) merge'3#('true(),x,xs,y,ys) -> c_23(merge#(xs,dd(y,ys))) mergesort#(l) -> c_24(mergesort'1#(l)) mergesort'1#(dd(x1,xs)) -> c_25(mergesort'2#(xs,x1)) mergesort'2#(dd(x2,xs'),x1) -> c_27(mergesort'3#(msplit(dd(x1,dd(x2,xs')))),msplit#(dd(x1,dd(x2,xs')))) mergesort'3#(tuple'2(l1,l2)) -> c_29(merge#(mergesort(l1),mergesort(l2)),mergesort#(l1),mergesort#(l2)) msplit#(l) -> c_30(msplit'1#(l)) msplit'1#(dd(x1,xs)) -> c_31(msplit'2#(xs,x1)) msplit'2#(dd(x2,xs'),x1) -> c_33(msplit#(xs')) - Weak TRS: 'cklt('EQ()) -> 'false() 'cklt('GT()) -> 'false() 'cklt('LT()) -> 'true() 'compare('0(),'0()) -> 'EQ() 'compare('0(),'neg(y)) -> 'GT() 'compare('0(),'pos(y)) -> 'LT() 'compare('0(),'s(y)) -> 'LT() 'compare('neg(x),'0()) -> 'LT() 'compare('neg(x),'neg(y)) -> 'compare(y,x) 'compare('neg(x),'pos(y)) -> 'LT() 'compare('pos(x),'0()) -> 'GT() 'compare('pos(x),'neg(y)) -> 'GT() 'compare('pos(x),'pos(y)) -> 'compare(x,y) 'compare('s(x),'0()) -> 'GT() 'compare('s(x),'s(y)) -> 'compare(x,y) 'less(x,y) -> 'cklt('compare(x,y)) merge(l1,l2) -> merge'1(l1,l2) merge'1(dd(x,xs),l2) -> merge'2(l2,x,xs) merge'1(nil(),l2) -> l2 merge'2(dd(y,ys),x,xs) -> merge'3('less(x,y),x,xs,y,ys) merge'2(nil(),x,xs) -> dd(x,xs) merge'3('false(),x,xs,y,ys) -> dd(y,merge(dd(x,xs),ys)) merge'3('true(),x,xs,y,ys) -> dd(x,merge(xs,dd(y,ys))) mergesort(l) -> mergesort'1(l) mergesort'1(dd(x1,xs)) -> mergesort'2(xs,x1) mergesort'1(nil()) -> nil() mergesort'2(dd(x2,xs'),x1) -> mergesort'3(msplit(dd(x1,dd(x2,xs')))) mergesort'2(nil(),x1) -> dd(x1,nil()) mergesort'3(tuple'2(l1,l2)) -> merge(mergesort(l1),mergesort(l2)) msplit(l) -> msplit'1(l) msplit'1(dd(x1,xs)) -> msplit'2(xs,x1) msplit'1(nil()) -> tuple'2(nil(),nil()) msplit'2(dd(x2,xs'),x1) -> msplit'3(msplit(xs'),x1,x2) msplit'2(nil(),x1) -> tuple'2(dd(x1,nil()),nil()) msplit'3(tuple'2(l1,l2),x1,x2) -> tuple'2(dd(x1,l1),dd(x2,l2)) - Signature: {'cklt/1,'compare/2,'less/2,merge/2,merge'1/2,merge'2/3,merge'3/5,mergesort/1,mergesort'1/1,mergesort'2/2 ,mergesort'3/1,msplit/1,msplit'1/1,msplit'2/2,msplit'3/3,'cklt#/1,'compare#/2,'less#/2,merge#/2,merge'1#/2 ,merge'2#/3,merge'3#/5,mergesort#/1,mergesort'1#/1,mergesort'2#/2,mergesort'3#/1,msplit#/1,msplit'1#/1 ,msplit'2#/2,msplit'3#/3} / {'0/0,'EQ/0,'GT/0,'LT/0,'false/0,'neg/1,'pos/1,'s/1,'true/0,dd/2,nil/0,tuple'2/2 ,c_1/0,c_2/0,c_3/0,c_4/0,c_5/0,c_6/0,c_7/0,c_8/0,c_9/1,c_10/0,c_11/0,c_12/0,c_13/1,c_14/0,c_15/1,c_16/1 ,c_17/1,c_18/1,c_19/0,c_20/2,c_21/0,c_22/1,c_23/1,c_24/1,c_25/1,c_26/0,c_27/2,c_28/0,c_29/3,c_30/1,c_31/1 ,c_32/0,c_33/1,c_34/0,c_35/0} - Obligation: innermost runtime complexity wrt. defined symbols {'cklt#,'compare#,'less#,merge#,merge'1#,merge'2#,merge'3# ,mergesort#,mergesort'1#,mergesort'2#,mergesort'3#,msplit#,msplit'1#,msplit'2# ,msplit'3#} and constructors {'0,'EQ,'GT,'LT,'false,'neg,'pos,'s,'true,dd,nil,tuple'2} + Applied Processor: SimplifyRHS + Details: Consider the dependency graph 1:S:merge#(l1,l2) -> c_17(merge'1#(l1,l2)) -->_1 merge'1#(dd(x,xs),l2) -> c_18(merge'2#(l2,x,xs)):2 2:S:merge'1#(dd(x,xs),l2) -> c_18(merge'2#(l2,x,xs)) -->_1 merge'2#(dd(y,ys),x,xs) -> c_20(merge'3#('less(x,y),x,xs,y,ys),'less#(x,y)):3 3:S:merge'2#(dd(y,ys),x,xs) -> c_20(merge'3#('less(x,y),x,xs,y,ys),'less#(x,y)) -->_1 merge'3#('true(),x,xs,y,ys) -> c_23(merge#(xs,dd(y,ys))):5 -->_1 merge'3#('false(),x,xs,y,ys) -> c_22(merge#(dd(x,xs),ys)):4 4:S:merge'3#('false(),x,xs,y,ys) -> c_22(merge#(dd(x,xs),ys)) -->_1 merge#(l1,l2) -> c_17(merge'1#(l1,l2)):1 5:S:merge'3#('true(),x,xs,y,ys) -> c_23(merge#(xs,dd(y,ys))) -->_1 merge#(l1,l2) -> c_17(merge'1#(l1,l2)):1 6:S:mergesort#(l) -> c_24(mergesort'1#(l)) -->_1 mergesort'1#(dd(x1,xs)) -> c_25(mergesort'2#(xs,x1)):7 7:S:mergesort'1#(dd(x1,xs)) -> c_25(mergesort'2#(xs,x1)) -->_1 mergesort'2#(dd(x2,xs'),x1) -> c_27(mergesort'3#(msplit(dd(x1,dd(x2,xs')))) ,msplit#(dd(x1,dd(x2,xs')))):8 8:S:mergesort'2#(dd(x2,xs'),x1) -> c_27(mergesort'3#(msplit(dd(x1,dd(x2,xs')))),msplit#(dd(x1,dd(x2,xs')))) -->_2 msplit#(l) -> c_30(msplit'1#(l)):10 -->_1 mergesort'3#(tuple'2(l1,l2)) -> c_29(merge#(mergesort(l1),mergesort(l2)) ,mergesort#(l1) ,mergesort#(l2)):9 9:S:mergesort'3#(tuple'2(l1,l2)) -> c_29(merge#(mergesort(l1),mergesort(l2)),mergesort#(l1),mergesort#(l2)) -->_3 mergesort#(l) -> c_24(mergesort'1#(l)):6 -->_2 mergesort#(l) -> c_24(mergesort'1#(l)):6 -->_1 merge#(l1,l2) -> c_17(merge'1#(l1,l2)):1 10:S:msplit#(l) -> c_30(msplit'1#(l)) -->_1 msplit'1#(dd(x1,xs)) -> c_31(msplit'2#(xs,x1)):11 11:S:msplit'1#(dd(x1,xs)) -> c_31(msplit'2#(xs,x1)) -->_1 msplit'2#(dd(x2,xs'),x1) -> c_33(msplit#(xs')):12 12:S:msplit'2#(dd(x2,xs'),x1) -> c_33(msplit#(xs')) -->_1 msplit#(l) -> c_30(msplit'1#(l)):10 Due to missing edges in the depndency graph, the right-hand sides of following rules could be simplified: merge'2#(dd(y,ys),x,xs) -> c_20(merge'3#('less(x,y),x,xs,y,ys)) ** Step 5.b:4: Decompose WORST_CASE(?,O(n^2)) + Considered Problem: - Strict DPs: merge#(l1,l2) -> c_17(merge'1#(l1,l2)) merge'1#(dd(x,xs),l2) -> c_18(merge'2#(l2,x,xs)) merge'2#(dd(y,ys),x,xs) -> c_20(merge'3#('less(x,y),x,xs,y,ys)) merge'3#('false(),x,xs,y,ys) -> c_22(merge#(dd(x,xs),ys)) merge'3#('true(),x,xs,y,ys) -> c_23(merge#(xs,dd(y,ys))) mergesort#(l) -> c_24(mergesort'1#(l)) mergesort'1#(dd(x1,xs)) -> c_25(mergesort'2#(xs,x1)) mergesort'2#(dd(x2,xs'),x1) -> c_27(mergesort'3#(msplit(dd(x1,dd(x2,xs')))),msplit#(dd(x1,dd(x2,xs')))) mergesort'3#(tuple'2(l1,l2)) -> c_29(merge#(mergesort(l1),mergesort(l2)),mergesort#(l1),mergesort#(l2)) msplit#(l) -> c_30(msplit'1#(l)) msplit'1#(dd(x1,xs)) -> c_31(msplit'2#(xs,x1)) msplit'2#(dd(x2,xs'),x1) -> c_33(msplit#(xs')) - Weak TRS: 'cklt('EQ()) -> 'false() 'cklt('GT()) -> 'false() 'cklt('LT()) -> 'true() 'compare('0(),'0()) -> 'EQ() 'compare('0(),'neg(y)) -> 'GT() 'compare('0(),'pos(y)) -> 'LT() 'compare('0(),'s(y)) -> 'LT() 'compare('neg(x),'0()) -> 'LT() 'compare('neg(x),'neg(y)) -> 'compare(y,x) 'compare('neg(x),'pos(y)) -> 'LT() 'compare('pos(x),'0()) -> 'GT() 'compare('pos(x),'neg(y)) -> 'GT() 'compare('pos(x),'pos(y)) -> 'compare(x,y) 'compare('s(x),'0()) -> 'GT() 'compare('s(x),'s(y)) -> 'compare(x,y) 'less(x,y) -> 'cklt('compare(x,y)) merge(l1,l2) -> merge'1(l1,l2) merge'1(dd(x,xs),l2) -> merge'2(l2,x,xs) merge'1(nil(),l2) -> l2 merge'2(dd(y,ys),x,xs) -> merge'3('less(x,y),x,xs,y,ys) merge'2(nil(),x,xs) -> dd(x,xs) merge'3('false(),x,xs,y,ys) -> dd(y,merge(dd(x,xs),ys)) merge'3('true(),x,xs,y,ys) -> dd(x,merge(xs,dd(y,ys))) mergesort(l) -> mergesort'1(l) mergesort'1(dd(x1,xs)) -> mergesort'2(xs,x1) mergesort'1(nil()) -> nil() mergesort'2(dd(x2,xs'),x1) -> mergesort'3(msplit(dd(x1,dd(x2,xs')))) mergesort'2(nil(),x1) -> dd(x1,nil()) mergesort'3(tuple'2(l1,l2)) -> merge(mergesort(l1),mergesort(l2)) msplit(l) -> msplit'1(l) msplit'1(dd(x1,xs)) -> msplit'2(xs,x1) msplit'1(nil()) -> tuple'2(nil(),nil()) msplit'2(dd(x2,xs'),x1) -> msplit'3(msplit(xs'),x1,x2) msplit'2(nil(),x1) -> tuple'2(dd(x1,nil()),nil()) msplit'3(tuple'2(l1,l2),x1,x2) -> tuple'2(dd(x1,l1),dd(x2,l2)) - Signature: {'cklt/1,'compare/2,'less/2,merge/2,merge'1/2,merge'2/3,merge'3/5,mergesort/1,mergesort'1/1,mergesort'2/2 ,mergesort'3/1,msplit/1,msplit'1/1,msplit'2/2,msplit'3/3,'cklt#/1,'compare#/2,'less#/2,merge#/2,merge'1#/2 ,merge'2#/3,merge'3#/5,mergesort#/1,mergesort'1#/1,mergesort'2#/2,mergesort'3#/1,msplit#/1,msplit'1#/1 ,msplit'2#/2,msplit'3#/3} / {'0/0,'EQ/0,'GT/0,'LT/0,'false/0,'neg/1,'pos/1,'s/1,'true/0,dd/2,nil/0,tuple'2/2 ,c_1/0,c_2/0,c_3/0,c_4/0,c_5/0,c_6/0,c_7/0,c_8/0,c_9/1,c_10/0,c_11/0,c_12/0,c_13/1,c_14/0,c_15/1,c_16/1 ,c_17/1,c_18/1,c_19/0,c_20/1,c_21/0,c_22/1,c_23/1,c_24/1,c_25/1,c_26/0,c_27/2,c_28/0,c_29/3,c_30/1,c_31/1 ,c_32/0,c_33/1,c_34/0,c_35/0} - Obligation: innermost runtime complexity wrt. defined symbols {'cklt#,'compare#,'less#,merge#,merge'1#,merge'2#,merge'3# ,mergesort#,mergesort'1#,mergesort'2#,mergesort'3#,msplit#,msplit'1#,msplit'2# ,msplit'3#} and constructors {'0,'EQ,'GT,'LT,'false,'neg,'pos,'s,'true,dd,nil,tuple'2} + Applied Processor: Decompose {onSelection = all cycle independent sub-graph, withBound = RelativeAdd} + Details: We analyse the complexity of following sub-problems (R) and (S). Problem (S) is obtained from the input problem by shifting strict rules from (R) into the weak component. Problem (R) - Strict DPs: merge#(l1,l2) -> c_17(merge'1#(l1,l2)) merge'1#(dd(x,xs),l2) -> c_18(merge'2#(l2,x,xs)) merge'2#(dd(y,ys),x,xs) -> c_20(merge'3#('less(x,y),x,xs,y,ys)) merge'3#('false(),x,xs,y,ys) -> c_22(merge#(dd(x,xs),ys)) merge'3#('true(),x,xs,y,ys) -> c_23(merge#(xs,dd(y,ys))) - Weak DPs: mergesort#(l) -> c_24(mergesort'1#(l)) mergesort'1#(dd(x1,xs)) -> c_25(mergesort'2#(xs,x1)) mergesort'2#(dd(x2,xs'),x1) -> c_27(mergesort'3#(msplit(dd(x1,dd(x2,xs')))),msplit#(dd(x1,dd(x2,xs')))) mergesort'3#(tuple'2(l1,l2)) -> c_29(merge#(mergesort(l1),mergesort(l2)),mergesort#(l1),mergesort#(l2)) msplit#(l) -> c_30(msplit'1#(l)) msplit'1#(dd(x1,xs)) -> c_31(msplit'2#(xs,x1)) msplit'2#(dd(x2,xs'),x1) -> c_33(msplit#(xs')) - Weak TRS: 'cklt('EQ()) -> 'false() 'cklt('GT()) -> 'false() 'cklt('LT()) -> 'true() 'compare('0(),'0()) -> 'EQ() 'compare('0(),'neg(y)) -> 'GT() 'compare('0(),'pos(y)) -> 'LT() 'compare('0(),'s(y)) -> 'LT() 'compare('neg(x),'0()) -> 'LT() 'compare('neg(x),'neg(y)) -> 'compare(y,x) 'compare('neg(x),'pos(y)) -> 'LT() 'compare('pos(x),'0()) -> 'GT() 'compare('pos(x),'neg(y)) -> 'GT() 'compare('pos(x),'pos(y)) -> 'compare(x,y) 'compare('s(x),'0()) -> 'GT() 'compare('s(x),'s(y)) -> 'compare(x,y) 'less(x,y) -> 'cklt('compare(x,y)) merge(l1,l2) -> merge'1(l1,l2) merge'1(dd(x,xs),l2) -> merge'2(l2,x,xs) merge'1(nil(),l2) -> l2 merge'2(dd(y,ys),x,xs) -> merge'3('less(x,y),x,xs,y,ys) merge'2(nil(),x,xs) -> dd(x,xs) merge'3('false(),x,xs,y,ys) -> dd(y,merge(dd(x,xs),ys)) merge'3('true(),x,xs,y,ys) -> dd(x,merge(xs,dd(y,ys))) mergesort(l) -> mergesort'1(l) mergesort'1(dd(x1,xs)) -> mergesort'2(xs,x1) mergesort'1(nil()) -> nil() mergesort'2(dd(x2,xs'),x1) -> mergesort'3(msplit(dd(x1,dd(x2,xs')))) mergesort'2(nil(),x1) -> dd(x1,nil()) mergesort'3(tuple'2(l1,l2)) -> merge(mergesort(l1),mergesort(l2)) msplit(l) -> msplit'1(l) msplit'1(dd(x1,xs)) -> msplit'2(xs,x1) msplit'1(nil()) -> tuple'2(nil(),nil()) msplit'2(dd(x2,xs'),x1) -> msplit'3(msplit(xs'),x1,x2) msplit'2(nil(),x1) -> tuple'2(dd(x1,nil()),nil()) msplit'3(tuple'2(l1,l2),x1,x2) -> tuple'2(dd(x1,l1),dd(x2,l2)) - Signature: {'cklt/1,'compare/2,'less/2,merge/2,merge'1/2,merge'2/3,merge'3/5,mergesort/1,mergesort'1/1,mergesort'2/2 ,mergesort'3/1,msplit/1,msplit'1/1,msplit'2/2,msplit'3/3,'cklt#/1,'compare#/2,'less#/2,merge#/2,merge'1#/2 ,merge'2#/3,merge'3#/5,mergesort#/1,mergesort'1#/1,mergesort'2#/2,mergesort'3#/1,msplit#/1,msplit'1#/1 ,msplit'2#/2,msplit'3#/3} / {'0/0,'EQ/0,'GT/0,'LT/0,'false/0,'neg/1,'pos/1,'s/1,'true/0,dd/2,nil/0 ,tuple'2/2,c_1/0,c_2/0,c_3/0,c_4/0,c_5/0,c_6/0,c_7/0,c_8/0,c_9/1,c_10/0,c_11/0,c_12/0,c_13/1,c_14/0,c_15/1 ,c_16/1,c_17/1,c_18/1,c_19/0,c_20/1,c_21/0,c_22/1,c_23/1,c_24/1,c_25/1,c_26/0,c_27/2,c_28/0,c_29/3,c_30/1 ,c_31/1,c_32/0,c_33/1,c_34/0,c_35/0} - Obligation: innermost runtime complexity wrt. defined symbols {'cklt#,'compare#,'less#,merge#,merge'1#,merge'2# ,merge'3#,mergesort#,mergesort'1#,mergesort'2#,mergesort'3#,msplit#,msplit'1#,msplit'2# ,msplit'3#} and constructors {'0,'EQ,'GT,'LT,'false,'neg,'pos,'s,'true,dd,nil,tuple'2} Problem (S) - Strict DPs: mergesort#(l) -> c_24(mergesort'1#(l)) mergesort'1#(dd(x1,xs)) -> c_25(mergesort'2#(xs,x1)) mergesort'2#(dd(x2,xs'),x1) -> c_27(mergesort'3#(msplit(dd(x1,dd(x2,xs')))),msplit#(dd(x1,dd(x2,xs')))) mergesort'3#(tuple'2(l1,l2)) -> c_29(merge#(mergesort(l1),mergesort(l2)),mergesort#(l1),mergesort#(l2)) msplit#(l) -> c_30(msplit'1#(l)) msplit'1#(dd(x1,xs)) -> c_31(msplit'2#(xs,x1)) msplit'2#(dd(x2,xs'),x1) -> c_33(msplit#(xs')) - Weak DPs: merge#(l1,l2) -> c_17(merge'1#(l1,l2)) merge'1#(dd(x,xs),l2) -> c_18(merge'2#(l2,x,xs)) merge'2#(dd(y,ys),x,xs) -> c_20(merge'3#('less(x,y),x,xs,y,ys)) merge'3#('false(),x,xs,y,ys) -> c_22(merge#(dd(x,xs),ys)) merge'3#('true(),x,xs,y,ys) -> c_23(merge#(xs,dd(y,ys))) - Weak TRS: 'cklt('EQ()) -> 'false() 'cklt('GT()) -> 'false() 'cklt('LT()) -> 'true() 'compare('0(),'0()) -> 'EQ() 'compare('0(),'neg(y)) -> 'GT() 'compare('0(),'pos(y)) -> 'LT() 'compare('0(),'s(y)) -> 'LT() 'compare('neg(x),'0()) -> 'LT() 'compare('neg(x),'neg(y)) -> 'compare(y,x) 'compare('neg(x),'pos(y)) -> 'LT() 'compare('pos(x),'0()) -> 'GT() 'compare('pos(x),'neg(y)) -> 'GT() 'compare('pos(x),'pos(y)) -> 'compare(x,y) 'compare('s(x),'0()) -> 'GT() 'compare('s(x),'s(y)) -> 'compare(x,y) 'less(x,y) -> 'cklt('compare(x,y)) merge(l1,l2) -> merge'1(l1,l2) merge'1(dd(x,xs),l2) -> merge'2(l2,x,xs) merge'1(nil(),l2) -> l2 merge'2(dd(y,ys),x,xs) -> merge'3('less(x,y),x,xs,y,ys) merge'2(nil(),x,xs) -> dd(x,xs) merge'3('false(),x,xs,y,ys) -> dd(y,merge(dd(x,xs),ys)) merge'3('true(),x,xs,y,ys) -> dd(x,merge(xs,dd(y,ys))) mergesort(l) -> mergesort'1(l) mergesort'1(dd(x1,xs)) -> mergesort'2(xs,x1) mergesort'1(nil()) -> nil() mergesort'2(dd(x2,xs'),x1) -> mergesort'3(msplit(dd(x1,dd(x2,xs')))) mergesort'2(nil(),x1) -> dd(x1,nil()) mergesort'3(tuple'2(l1,l2)) -> merge(mergesort(l1),mergesort(l2)) msplit(l) -> msplit'1(l) msplit'1(dd(x1,xs)) -> msplit'2(xs,x1) msplit'1(nil()) -> tuple'2(nil(),nil()) msplit'2(dd(x2,xs'),x1) -> msplit'3(msplit(xs'),x1,x2) msplit'2(nil(),x1) -> tuple'2(dd(x1,nil()),nil()) msplit'3(tuple'2(l1,l2),x1,x2) -> tuple'2(dd(x1,l1),dd(x2,l2)) - Signature: {'cklt/1,'compare/2,'less/2,merge/2,merge'1/2,merge'2/3,merge'3/5,mergesort/1,mergesort'1/1,mergesort'2/2 ,mergesort'3/1,msplit/1,msplit'1/1,msplit'2/2,msplit'3/3,'cklt#/1,'compare#/2,'less#/2,merge#/2,merge'1#/2 ,merge'2#/3,merge'3#/5,mergesort#/1,mergesort'1#/1,mergesort'2#/2,mergesort'3#/1,msplit#/1,msplit'1#/1 ,msplit'2#/2,msplit'3#/3} / {'0/0,'EQ/0,'GT/0,'LT/0,'false/0,'neg/1,'pos/1,'s/1,'true/0,dd/2,nil/0 ,tuple'2/2,c_1/0,c_2/0,c_3/0,c_4/0,c_5/0,c_6/0,c_7/0,c_8/0,c_9/1,c_10/0,c_11/0,c_12/0,c_13/1,c_14/0,c_15/1 ,c_16/1,c_17/1,c_18/1,c_19/0,c_20/1,c_21/0,c_22/1,c_23/1,c_24/1,c_25/1,c_26/0,c_27/2,c_28/0,c_29/3,c_30/1 ,c_31/1,c_32/0,c_33/1,c_34/0,c_35/0} - Obligation: innermost runtime complexity wrt. defined symbols {'cklt#,'compare#,'less#,merge#,merge'1#,merge'2# ,merge'3#,mergesort#,mergesort'1#,mergesort'2#,mergesort'3#,msplit#,msplit'1#,msplit'2# ,msplit'3#} and constructors {'0,'EQ,'GT,'LT,'false,'neg,'pos,'s,'true,dd,nil,tuple'2} *** Step 5.b:4.a:1: RemoveWeakSuffixes WORST_CASE(?,O(n^2)) + Considered Problem: - Strict DPs: merge#(l1,l2) -> c_17(merge'1#(l1,l2)) merge'1#(dd(x,xs),l2) -> c_18(merge'2#(l2,x,xs)) merge'2#(dd(y,ys),x,xs) -> c_20(merge'3#('less(x,y),x,xs,y,ys)) merge'3#('false(),x,xs,y,ys) -> c_22(merge#(dd(x,xs),ys)) merge'3#('true(),x,xs,y,ys) -> c_23(merge#(xs,dd(y,ys))) - Weak DPs: mergesort#(l) -> c_24(mergesort'1#(l)) mergesort'1#(dd(x1,xs)) -> c_25(mergesort'2#(xs,x1)) mergesort'2#(dd(x2,xs'),x1) -> c_27(mergesort'3#(msplit(dd(x1,dd(x2,xs')))),msplit#(dd(x1,dd(x2,xs')))) mergesort'3#(tuple'2(l1,l2)) -> c_29(merge#(mergesort(l1),mergesort(l2)),mergesort#(l1),mergesort#(l2)) msplit#(l) -> c_30(msplit'1#(l)) msplit'1#(dd(x1,xs)) -> c_31(msplit'2#(xs,x1)) msplit'2#(dd(x2,xs'),x1) -> c_33(msplit#(xs')) - Weak TRS: 'cklt('EQ()) -> 'false() 'cklt('GT()) -> 'false() 'cklt('LT()) -> 'true() 'compare('0(),'0()) -> 'EQ() 'compare('0(),'neg(y)) -> 'GT() 'compare('0(),'pos(y)) -> 'LT() 'compare('0(),'s(y)) -> 'LT() 'compare('neg(x),'0()) -> 'LT() 'compare('neg(x),'neg(y)) -> 'compare(y,x) 'compare('neg(x),'pos(y)) -> 'LT() 'compare('pos(x),'0()) -> 'GT() 'compare('pos(x),'neg(y)) -> 'GT() 'compare('pos(x),'pos(y)) -> 'compare(x,y) 'compare('s(x),'0()) -> 'GT() 'compare('s(x),'s(y)) -> 'compare(x,y) 'less(x,y) -> 'cklt('compare(x,y)) merge(l1,l2) -> merge'1(l1,l2) merge'1(dd(x,xs),l2) -> merge'2(l2,x,xs) merge'1(nil(),l2) -> l2 merge'2(dd(y,ys),x,xs) -> merge'3('less(x,y),x,xs,y,ys) merge'2(nil(),x,xs) -> dd(x,xs) merge'3('false(),x,xs,y,ys) -> dd(y,merge(dd(x,xs),ys)) merge'3('true(),x,xs,y,ys) -> dd(x,merge(xs,dd(y,ys))) mergesort(l) -> mergesort'1(l) mergesort'1(dd(x1,xs)) -> mergesort'2(xs,x1) mergesort'1(nil()) -> nil() mergesort'2(dd(x2,xs'),x1) -> mergesort'3(msplit(dd(x1,dd(x2,xs')))) mergesort'2(nil(),x1) -> dd(x1,nil()) mergesort'3(tuple'2(l1,l2)) -> merge(mergesort(l1),mergesort(l2)) msplit(l) -> msplit'1(l) msplit'1(dd(x1,xs)) -> msplit'2(xs,x1) msplit'1(nil()) -> tuple'2(nil(),nil()) msplit'2(dd(x2,xs'),x1) -> msplit'3(msplit(xs'),x1,x2) msplit'2(nil(),x1) -> tuple'2(dd(x1,nil()),nil()) msplit'3(tuple'2(l1,l2),x1,x2) -> tuple'2(dd(x1,l1),dd(x2,l2)) - Signature: {'cklt/1,'compare/2,'less/2,merge/2,merge'1/2,merge'2/3,merge'3/5,mergesort/1,mergesort'1/1,mergesort'2/2 ,mergesort'3/1,msplit/1,msplit'1/1,msplit'2/2,msplit'3/3,'cklt#/1,'compare#/2,'less#/2,merge#/2,merge'1#/2 ,merge'2#/3,merge'3#/5,mergesort#/1,mergesort'1#/1,mergesort'2#/2,mergesort'3#/1,msplit#/1,msplit'1#/1 ,msplit'2#/2,msplit'3#/3} / {'0/0,'EQ/0,'GT/0,'LT/0,'false/0,'neg/1,'pos/1,'s/1,'true/0,dd/2,nil/0,tuple'2/2 ,c_1/0,c_2/0,c_3/0,c_4/0,c_5/0,c_6/0,c_7/0,c_8/0,c_9/1,c_10/0,c_11/0,c_12/0,c_13/1,c_14/0,c_15/1,c_16/1 ,c_17/1,c_18/1,c_19/0,c_20/1,c_21/0,c_22/1,c_23/1,c_24/1,c_25/1,c_26/0,c_27/2,c_28/0,c_29/3,c_30/1,c_31/1 ,c_32/0,c_33/1,c_34/0,c_35/0} - Obligation: innermost runtime complexity wrt. defined symbols {'cklt#,'compare#,'less#,merge#,merge'1#,merge'2#,merge'3# ,mergesort#,mergesort'1#,mergesort'2#,mergesort'3#,msplit#,msplit'1#,msplit'2# ,msplit'3#} and constructors {'0,'EQ,'GT,'LT,'false,'neg,'pos,'s,'true,dd,nil,tuple'2} + Applied Processor: RemoveWeakSuffixes + Details: Consider the dependency graph 1:S:merge#(l1,l2) -> c_17(merge'1#(l1,l2)) -->_1 merge'1#(dd(x,xs),l2) -> c_18(merge'2#(l2,x,xs)):2 2:S:merge'1#(dd(x,xs),l2) -> c_18(merge'2#(l2,x,xs)) -->_1 merge'2#(dd(y,ys),x,xs) -> c_20(merge'3#('less(x,y),x,xs,y,ys)):3 3:S:merge'2#(dd(y,ys),x,xs) -> c_20(merge'3#('less(x,y),x,xs,y,ys)) -->_1 merge'3#('true(),x,xs,y,ys) -> c_23(merge#(xs,dd(y,ys))):5 -->_1 merge'3#('false(),x,xs,y,ys) -> c_22(merge#(dd(x,xs),ys)):4 4:S:merge'3#('false(),x,xs,y,ys) -> c_22(merge#(dd(x,xs),ys)) -->_1 merge#(l1,l2) -> c_17(merge'1#(l1,l2)):1 5:S:merge'3#('true(),x,xs,y,ys) -> c_23(merge#(xs,dd(y,ys))) -->_1 merge#(l1,l2) -> c_17(merge'1#(l1,l2)):1 6:W:mergesort#(l) -> c_24(mergesort'1#(l)) -->_1 mergesort'1#(dd(x1,xs)) -> c_25(mergesort'2#(xs,x1)):7 7:W:mergesort'1#(dd(x1,xs)) -> c_25(mergesort'2#(xs,x1)) -->_1 mergesort'2#(dd(x2,xs'),x1) -> c_27(mergesort'3#(msplit(dd(x1,dd(x2,xs')))) ,msplit#(dd(x1,dd(x2,xs')))):8 8:W:mergesort'2#(dd(x2,xs'),x1) -> c_27(mergesort'3#(msplit(dd(x1,dd(x2,xs')))),msplit#(dd(x1,dd(x2,xs')))) -->_2 msplit#(l) -> c_30(msplit'1#(l)):10 -->_1 mergesort'3#(tuple'2(l1,l2)) -> c_29(merge#(mergesort(l1),mergesort(l2)) ,mergesort#(l1) ,mergesort#(l2)):9 9:W:mergesort'3#(tuple'2(l1,l2)) -> c_29(merge#(mergesort(l1),mergesort(l2)),mergesort#(l1),mergesort#(l2)) -->_1 merge#(l1,l2) -> c_17(merge'1#(l1,l2)):1 -->_3 mergesort#(l) -> c_24(mergesort'1#(l)):6 -->_2 mergesort#(l) -> c_24(mergesort'1#(l)):6 10:W:msplit#(l) -> c_30(msplit'1#(l)) -->_1 msplit'1#(dd(x1,xs)) -> c_31(msplit'2#(xs,x1)):11 11:W:msplit'1#(dd(x1,xs)) -> c_31(msplit'2#(xs,x1)) -->_1 msplit'2#(dd(x2,xs'),x1) -> c_33(msplit#(xs')):12 12:W:msplit'2#(dd(x2,xs'),x1) -> c_33(msplit#(xs')) -->_1 msplit#(l) -> c_30(msplit'1#(l)):10 The following weak DPs constitute a sub-graph of the DG that is closed under successors. The DPs are removed. 10: msplit#(l) -> c_30(msplit'1#(l)) 12: msplit'2#(dd(x2,xs'),x1) -> c_33(msplit#(xs')) 11: msplit'1#(dd(x1,xs)) -> c_31(msplit'2#(xs,x1)) *** Step 5.b:4.a:2: SimplifyRHS WORST_CASE(?,O(n^2)) + Considered Problem: - Strict DPs: merge#(l1,l2) -> c_17(merge'1#(l1,l2)) merge'1#(dd(x,xs),l2) -> c_18(merge'2#(l2,x,xs)) merge'2#(dd(y,ys),x,xs) -> c_20(merge'3#('less(x,y),x,xs,y,ys)) merge'3#('false(),x,xs,y,ys) -> c_22(merge#(dd(x,xs),ys)) merge'3#('true(),x,xs,y,ys) -> c_23(merge#(xs,dd(y,ys))) - Weak DPs: mergesort#(l) -> c_24(mergesort'1#(l)) mergesort'1#(dd(x1,xs)) -> c_25(mergesort'2#(xs,x1)) mergesort'2#(dd(x2,xs'),x1) -> c_27(mergesort'3#(msplit(dd(x1,dd(x2,xs')))),msplit#(dd(x1,dd(x2,xs')))) mergesort'3#(tuple'2(l1,l2)) -> c_29(merge#(mergesort(l1),mergesort(l2)),mergesort#(l1),mergesort#(l2)) - Weak TRS: 'cklt('EQ()) -> 'false() 'cklt('GT()) -> 'false() 'cklt('LT()) -> 'true() 'compare('0(),'0()) -> 'EQ() 'compare('0(),'neg(y)) -> 'GT() 'compare('0(),'pos(y)) -> 'LT() 'compare('0(),'s(y)) -> 'LT() 'compare('neg(x),'0()) -> 'LT() 'compare('neg(x),'neg(y)) -> 'compare(y,x) 'compare('neg(x),'pos(y)) -> 'LT() 'compare('pos(x),'0()) -> 'GT() 'compare('pos(x),'neg(y)) -> 'GT() 'compare('pos(x),'pos(y)) -> 'compare(x,y) 'compare('s(x),'0()) -> 'GT() 'compare('s(x),'s(y)) -> 'compare(x,y) 'less(x,y) -> 'cklt('compare(x,y)) merge(l1,l2) -> merge'1(l1,l2) merge'1(dd(x,xs),l2) -> merge'2(l2,x,xs) merge'1(nil(),l2) -> l2 merge'2(dd(y,ys),x,xs) -> merge'3('less(x,y),x,xs,y,ys) merge'2(nil(),x,xs) -> dd(x,xs) merge'3('false(),x,xs,y,ys) -> dd(y,merge(dd(x,xs),ys)) merge'3('true(),x,xs,y,ys) -> dd(x,merge(xs,dd(y,ys))) mergesort(l) -> mergesort'1(l) mergesort'1(dd(x1,xs)) -> mergesort'2(xs,x1) mergesort'1(nil()) -> nil() mergesort'2(dd(x2,xs'),x1) -> mergesort'3(msplit(dd(x1,dd(x2,xs')))) mergesort'2(nil(),x1) -> dd(x1,nil()) mergesort'3(tuple'2(l1,l2)) -> merge(mergesort(l1),mergesort(l2)) msplit(l) -> msplit'1(l) msplit'1(dd(x1,xs)) -> msplit'2(xs,x1) msplit'1(nil()) -> tuple'2(nil(),nil()) msplit'2(dd(x2,xs'),x1) -> msplit'3(msplit(xs'),x1,x2) msplit'2(nil(),x1) -> tuple'2(dd(x1,nil()),nil()) msplit'3(tuple'2(l1,l2),x1,x2) -> tuple'2(dd(x1,l1),dd(x2,l2)) - Signature: {'cklt/1,'compare/2,'less/2,merge/2,merge'1/2,merge'2/3,merge'3/5,mergesort/1,mergesort'1/1,mergesort'2/2 ,mergesort'3/1,msplit/1,msplit'1/1,msplit'2/2,msplit'3/3,'cklt#/1,'compare#/2,'less#/2,merge#/2,merge'1#/2 ,merge'2#/3,merge'3#/5,mergesort#/1,mergesort'1#/1,mergesort'2#/2,mergesort'3#/1,msplit#/1,msplit'1#/1 ,msplit'2#/2,msplit'3#/3} / {'0/0,'EQ/0,'GT/0,'LT/0,'false/0,'neg/1,'pos/1,'s/1,'true/0,dd/2,nil/0,tuple'2/2 ,c_1/0,c_2/0,c_3/0,c_4/0,c_5/0,c_6/0,c_7/0,c_8/0,c_9/1,c_10/0,c_11/0,c_12/0,c_13/1,c_14/0,c_15/1,c_16/1 ,c_17/1,c_18/1,c_19/0,c_20/1,c_21/0,c_22/1,c_23/1,c_24/1,c_25/1,c_26/0,c_27/2,c_28/0,c_29/3,c_30/1,c_31/1 ,c_32/0,c_33/1,c_34/0,c_35/0} - Obligation: innermost runtime complexity wrt. defined symbols {'cklt#,'compare#,'less#,merge#,merge'1#,merge'2#,merge'3# ,mergesort#,mergesort'1#,mergesort'2#,mergesort'3#,msplit#,msplit'1#,msplit'2# ,msplit'3#} and constructors {'0,'EQ,'GT,'LT,'false,'neg,'pos,'s,'true,dd,nil,tuple'2} + Applied Processor: SimplifyRHS + Details: Consider the dependency graph 1:S:merge#(l1,l2) -> c_17(merge'1#(l1,l2)) -->_1 merge'1#(dd(x,xs),l2) -> c_18(merge'2#(l2,x,xs)):2 2:S:merge'1#(dd(x,xs),l2) -> c_18(merge'2#(l2,x,xs)) -->_1 merge'2#(dd(y,ys),x,xs) -> c_20(merge'3#('less(x,y),x,xs,y,ys)):3 3:S:merge'2#(dd(y,ys),x,xs) -> c_20(merge'3#('less(x,y),x,xs,y,ys)) -->_1 merge'3#('true(),x,xs,y,ys) -> c_23(merge#(xs,dd(y,ys))):5 -->_1 merge'3#('false(),x,xs,y,ys) -> c_22(merge#(dd(x,xs),ys)):4 4:S:merge'3#('false(),x,xs,y,ys) -> c_22(merge#(dd(x,xs),ys)) -->_1 merge#(l1,l2) -> c_17(merge'1#(l1,l2)):1 5:S:merge'3#('true(),x,xs,y,ys) -> c_23(merge#(xs,dd(y,ys))) -->_1 merge#(l1,l2) -> c_17(merge'1#(l1,l2)):1 6:W:mergesort#(l) -> c_24(mergesort'1#(l)) -->_1 mergesort'1#(dd(x1,xs)) -> c_25(mergesort'2#(xs,x1)):7 7:W:mergesort'1#(dd(x1,xs)) -> c_25(mergesort'2#(xs,x1)) -->_1 mergesort'2#(dd(x2,xs'),x1) -> c_27(mergesort'3#(msplit(dd(x1,dd(x2,xs')))) ,msplit#(dd(x1,dd(x2,xs')))):8 8:W:mergesort'2#(dd(x2,xs'),x1) -> c_27(mergesort'3#(msplit(dd(x1,dd(x2,xs')))),msplit#(dd(x1,dd(x2,xs')))) -->_1 mergesort'3#(tuple'2(l1,l2)) -> c_29(merge#(mergesort(l1),mergesort(l2)) ,mergesort#(l1) ,mergesort#(l2)):9 9:W:mergesort'3#(tuple'2(l1,l2)) -> c_29(merge#(mergesort(l1),mergesort(l2)),mergesort#(l1),mergesort#(l2)) -->_1 merge#(l1,l2) -> c_17(merge'1#(l1,l2)):1 -->_3 mergesort#(l) -> c_24(mergesort'1#(l)):6 -->_2 mergesort#(l) -> c_24(mergesort'1#(l)):6 Due to missing edges in the depndency graph, the right-hand sides of following rules could be simplified: mergesort'2#(dd(x2,xs'),x1) -> c_27(mergesort'3#(msplit(dd(x1,dd(x2,xs'))))) *** Step 5.b:4.a:3: DecomposeDG WORST_CASE(?,O(n^2)) + Considered Problem: - Strict DPs: merge#(l1,l2) -> c_17(merge'1#(l1,l2)) merge'1#(dd(x,xs),l2) -> c_18(merge'2#(l2,x,xs)) merge'2#(dd(y,ys),x,xs) -> c_20(merge'3#('less(x,y),x,xs,y,ys)) merge'3#('false(),x,xs,y,ys) -> c_22(merge#(dd(x,xs),ys)) merge'3#('true(),x,xs,y,ys) -> c_23(merge#(xs,dd(y,ys))) - Weak DPs: mergesort#(l) -> c_24(mergesort'1#(l)) mergesort'1#(dd(x1,xs)) -> c_25(mergesort'2#(xs,x1)) mergesort'2#(dd(x2,xs'),x1) -> c_27(mergesort'3#(msplit(dd(x1,dd(x2,xs'))))) mergesort'3#(tuple'2(l1,l2)) -> c_29(merge#(mergesort(l1),mergesort(l2)),mergesort#(l1),mergesort#(l2)) - Weak TRS: 'cklt('EQ()) -> 'false() 'cklt('GT()) -> 'false() 'cklt('LT()) -> 'true() 'compare('0(),'0()) -> 'EQ() 'compare('0(),'neg(y)) -> 'GT() 'compare('0(),'pos(y)) -> 'LT() 'compare('0(),'s(y)) -> 'LT() 'compare('neg(x),'0()) -> 'LT() 'compare('neg(x),'neg(y)) -> 'compare(y,x) 'compare('neg(x),'pos(y)) -> 'LT() 'compare('pos(x),'0()) -> 'GT() 'compare('pos(x),'neg(y)) -> 'GT() 'compare('pos(x),'pos(y)) -> 'compare(x,y) 'compare('s(x),'0()) -> 'GT() 'compare('s(x),'s(y)) -> 'compare(x,y) 'less(x,y) -> 'cklt('compare(x,y)) merge(l1,l2) -> merge'1(l1,l2) merge'1(dd(x,xs),l2) -> merge'2(l2,x,xs) merge'1(nil(),l2) -> l2 merge'2(dd(y,ys),x,xs) -> merge'3('less(x,y),x,xs,y,ys) merge'2(nil(),x,xs) -> dd(x,xs) merge'3('false(),x,xs,y,ys) -> dd(y,merge(dd(x,xs),ys)) merge'3('true(),x,xs,y,ys) -> dd(x,merge(xs,dd(y,ys))) mergesort(l) -> mergesort'1(l) mergesort'1(dd(x1,xs)) -> mergesort'2(xs,x1) mergesort'1(nil()) -> nil() mergesort'2(dd(x2,xs'),x1) -> mergesort'3(msplit(dd(x1,dd(x2,xs')))) mergesort'2(nil(),x1) -> dd(x1,nil()) mergesort'3(tuple'2(l1,l2)) -> merge(mergesort(l1),mergesort(l2)) msplit(l) -> msplit'1(l) msplit'1(dd(x1,xs)) -> msplit'2(xs,x1) msplit'1(nil()) -> tuple'2(nil(),nil()) msplit'2(dd(x2,xs'),x1) -> msplit'3(msplit(xs'),x1,x2) msplit'2(nil(),x1) -> tuple'2(dd(x1,nil()),nil()) msplit'3(tuple'2(l1,l2),x1,x2) -> tuple'2(dd(x1,l1),dd(x2,l2)) - Signature: {'cklt/1,'compare/2,'less/2,merge/2,merge'1/2,merge'2/3,merge'3/5,mergesort/1,mergesort'1/1,mergesort'2/2 ,mergesort'3/1,msplit/1,msplit'1/1,msplit'2/2,msplit'3/3,'cklt#/1,'compare#/2,'less#/2,merge#/2,merge'1#/2 ,merge'2#/3,merge'3#/5,mergesort#/1,mergesort'1#/1,mergesort'2#/2,mergesort'3#/1,msplit#/1,msplit'1#/1 ,msplit'2#/2,msplit'3#/3} / {'0/0,'EQ/0,'GT/0,'LT/0,'false/0,'neg/1,'pos/1,'s/1,'true/0,dd/2,nil/0,tuple'2/2 ,c_1/0,c_2/0,c_3/0,c_4/0,c_5/0,c_6/0,c_7/0,c_8/0,c_9/1,c_10/0,c_11/0,c_12/0,c_13/1,c_14/0,c_15/1,c_16/1 ,c_17/1,c_18/1,c_19/0,c_20/1,c_21/0,c_22/1,c_23/1,c_24/1,c_25/1,c_26/0,c_27/1,c_28/0,c_29/3,c_30/1,c_31/1 ,c_32/0,c_33/1,c_34/0,c_35/0} - Obligation: innermost runtime complexity wrt. defined symbols {'cklt#,'compare#,'less#,merge#,merge'1#,merge'2#,merge'3# ,mergesort#,mergesort'1#,mergesort'2#,mergesort'3#,msplit#,msplit'1#,msplit'2# ,msplit'3#} and constructors {'0,'EQ,'GT,'LT,'false,'neg,'pos,'s,'true,dd,nil,tuple'2} + Applied Processor: DecomposeDG {onSelection = all below first cut in WDG, onUpper = Just someStrategy, onLower = Nothing} + Details: We decompose the input problem according to the dependency graph into the upper component mergesort#(l) -> c_24(mergesort'1#(l)) mergesort'1#(dd(x1,xs)) -> c_25(mergesort'2#(xs,x1)) mergesort'2#(dd(x2,xs'),x1) -> c_27(mergesort'3#(msplit(dd(x1,dd(x2,xs'))))) mergesort'3#(tuple'2(l1,l2)) -> c_29(merge#(mergesort(l1),mergesort(l2)),mergesort#(l1),mergesort#(l2)) and a lower component merge#(l1,l2) -> c_17(merge'1#(l1,l2)) merge'1#(dd(x,xs),l2) -> c_18(merge'2#(l2,x,xs)) merge'2#(dd(y,ys),x,xs) -> c_20(merge'3#('less(x,y),x,xs,y,ys)) merge'3#('false(),x,xs,y,ys) -> c_22(merge#(dd(x,xs),ys)) merge'3#('true(),x,xs,y,ys) -> c_23(merge#(xs,dd(y,ys))) Further, following extension rules are added to the lower component. mergesort#(l) -> mergesort'1#(l) mergesort'1#(dd(x1,xs)) -> mergesort'2#(xs,x1) mergesort'2#(dd(x2,xs'),x1) -> mergesort'3#(msplit(dd(x1,dd(x2,xs')))) mergesort'3#(tuple'2(l1,l2)) -> merge#(mergesort(l1),mergesort(l2)) mergesort'3#(tuple'2(l1,l2)) -> mergesort#(l1) mergesort'3#(tuple'2(l1,l2)) -> mergesort#(l2) **** Step 5.b:4.a:3.a:1: PredecessorEstimationCP WORST_CASE(?,O(n^1)) + Considered Problem: - Strict DPs: mergesort'3#(tuple'2(l1,l2)) -> c_29(merge#(mergesort(l1),mergesort(l2)),mergesort#(l1),mergesort#(l2)) - Weak DPs: mergesort#(l) -> c_24(mergesort'1#(l)) mergesort'1#(dd(x1,xs)) -> c_25(mergesort'2#(xs,x1)) mergesort'2#(dd(x2,xs'),x1) -> c_27(mergesort'3#(msplit(dd(x1,dd(x2,xs'))))) - Weak TRS: 'cklt('EQ()) -> 'false() 'cklt('GT()) -> 'false() 'cklt('LT()) -> 'true() 'compare('0(),'0()) -> 'EQ() 'compare('0(),'neg(y)) -> 'GT() 'compare('0(),'pos(y)) -> 'LT() 'compare('0(),'s(y)) -> 'LT() 'compare('neg(x),'0()) -> 'LT() 'compare('neg(x),'neg(y)) -> 'compare(y,x) 'compare('neg(x),'pos(y)) -> 'LT() 'compare('pos(x),'0()) -> 'GT() 'compare('pos(x),'neg(y)) -> 'GT() 'compare('pos(x),'pos(y)) -> 'compare(x,y) 'compare('s(x),'0()) -> 'GT() 'compare('s(x),'s(y)) -> 'compare(x,y) 'less(x,y) -> 'cklt('compare(x,y)) merge(l1,l2) -> merge'1(l1,l2) merge'1(dd(x,xs),l2) -> merge'2(l2,x,xs) merge'1(nil(),l2) -> l2 merge'2(dd(y,ys),x,xs) -> merge'3('less(x,y),x,xs,y,ys) merge'2(nil(),x,xs) -> dd(x,xs) merge'3('false(),x,xs,y,ys) -> dd(y,merge(dd(x,xs),ys)) merge'3('true(),x,xs,y,ys) -> dd(x,merge(xs,dd(y,ys))) mergesort(l) -> mergesort'1(l) mergesort'1(dd(x1,xs)) -> mergesort'2(xs,x1) mergesort'1(nil()) -> nil() mergesort'2(dd(x2,xs'),x1) -> mergesort'3(msplit(dd(x1,dd(x2,xs')))) mergesort'2(nil(),x1) -> dd(x1,nil()) mergesort'3(tuple'2(l1,l2)) -> merge(mergesort(l1),mergesort(l2)) msplit(l) -> msplit'1(l) msplit'1(dd(x1,xs)) -> msplit'2(xs,x1) msplit'1(nil()) -> tuple'2(nil(),nil()) msplit'2(dd(x2,xs'),x1) -> msplit'3(msplit(xs'),x1,x2) msplit'2(nil(),x1) -> tuple'2(dd(x1,nil()),nil()) msplit'3(tuple'2(l1,l2),x1,x2) -> tuple'2(dd(x1,l1),dd(x2,l2)) - Signature: {'cklt/1,'compare/2,'less/2,merge/2,merge'1/2,merge'2/3,merge'3/5,mergesort/1,mergesort'1/1,mergesort'2/2 ,mergesort'3/1,msplit/1,msplit'1/1,msplit'2/2,msplit'3/3,'cklt#/1,'compare#/2,'less#/2,merge#/2,merge'1#/2 ,merge'2#/3,merge'3#/5,mergesort#/1,mergesort'1#/1,mergesort'2#/2,mergesort'3#/1,msplit#/1,msplit'1#/1 ,msplit'2#/2,msplit'3#/3} / {'0/0,'EQ/0,'GT/0,'LT/0,'false/0,'neg/1,'pos/1,'s/1,'true/0,dd/2,nil/0,tuple'2/2 ,c_1/0,c_2/0,c_3/0,c_4/0,c_5/0,c_6/0,c_7/0,c_8/0,c_9/1,c_10/0,c_11/0,c_12/0,c_13/1,c_14/0,c_15/1,c_16/1 ,c_17/1,c_18/1,c_19/0,c_20/1,c_21/0,c_22/1,c_23/1,c_24/1,c_25/1,c_26/0,c_27/1,c_28/0,c_29/3,c_30/1,c_31/1 ,c_32/0,c_33/1,c_34/0,c_35/0} - Obligation: innermost runtime complexity wrt. defined symbols {'cklt#,'compare#,'less#,merge#,merge'1#,merge'2#,merge'3# ,mergesort#,mergesort'1#,mergesort'2#,mergesort'3#,msplit#,msplit'1#,msplit'2# ,msplit'3#} and constructors {'0,'EQ,'GT,'LT,'false,'neg,'pos,'s,'true,dd,nil,tuple'2} + Applied Processor: PredecessorEstimationCP {onSelectionCP = any intersect of rules of CDG leaf and strict-rules, withComplexityPair = NaturalMI {miDimension = 3, miDegree = 1, miKind = Algebraic, uargs = UArgs, urules = URules, selector = Nothing}} + Details: We first use the processor NaturalMI {miDimension = 3, miDegree = 1, miKind = Algebraic, uargs = UArgs, urules = URules, selector = Nothing} to orient following rules strictly: 1: mergesort'3#(tuple'2(l1,l2)) -> c_29(merge#(mergesort(l1),mergesort(l2)),mergesort#(l1),mergesort#(l2)) Consider the set of all dependency pairs 1: mergesort'3#(tuple'2(l1,l2)) -> c_29(merge#(mergesort(l1),mergesort(l2)),mergesort#(l1),mergesort#(l2)) 2: mergesort#(l) -> c_24(mergesort'1#(l)) 3: mergesort'1#(dd(x1,xs)) -> c_25(mergesort'2#(xs,x1)) 4: mergesort'2#(dd(x2,xs'),x1) -> c_27(mergesort'3#(msplit(dd(x1,dd(x2,xs'))))) Processor NaturalMI {miDimension = 3, miDegree = 1, miKind = Algebraic, uargs = UArgs, urules = URules, selector = Nothing}induces the complexity certificateTIME (?,O(n^1)) SPACE(?,?)on application of the dependency pairs {1} These cover all (indirect) predecessors of dependency pairs {1,2,3,4} their number of applications is equally bounded. The dependency pairs are shifted into the weak component. ***** Step 5.b:4.a:3.a:1.a:1: NaturalMI WORST_CASE(?,O(n^1)) + Considered Problem: - Strict DPs: mergesort'3#(tuple'2(l1,l2)) -> c_29(merge#(mergesort(l1),mergesort(l2)),mergesort#(l1),mergesort#(l2)) - Weak DPs: mergesort#(l) -> c_24(mergesort'1#(l)) mergesort'1#(dd(x1,xs)) -> c_25(mergesort'2#(xs,x1)) mergesort'2#(dd(x2,xs'),x1) -> c_27(mergesort'3#(msplit(dd(x1,dd(x2,xs'))))) - Weak TRS: 'cklt('EQ()) -> 'false() 'cklt('GT()) -> 'false() 'cklt('LT()) -> 'true() 'compare('0(),'0()) -> 'EQ() 'compare('0(),'neg(y)) -> 'GT() 'compare('0(),'pos(y)) -> 'LT() 'compare('0(),'s(y)) -> 'LT() 'compare('neg(x),'0()) -> 'LT() 'compare('neg(x),'neg(y)) -> 'compare(y,x) 'compare('neg(x),'pos(y)) -> 'LT() 'compare('pos(x),'0()) -> 'GT() 'compare('pos(x),'neg(y)) -> 'GT() 'compare('pos(x),'pos(y)) -> 'compare(x,y) 'compare('s(x),'0()) -> 'GT() 'compare('s(x),'s(y)) -> 'compare(x,y) 'less(x,y) -> 'cklt('compare(x,y)) merge(l1,l2) -> merge'1(l1,l2) merge'1(dd(x,xs),l2) -> merge'2(l2,x,xs) merge'1(nil(),l2) -> l2 merge'2(dd(y,ys),x,xs) -> merge'3('less(x,y),x,xs,y,ys) merge'2(nil(),x,xs) -> dd(x,xs) merge'3('false(),x,xs,y,ys) -> dd(y,merge(dd(x,xs),ys)) merge'3('true(),x,xs,y,ys) -> dd(x,merge(xs,dd(y,ys))) mergesort(l) -> mergesort'1(l) mergesort'1(dd(x1,xs)) -> mergesort'2(xs,x1) mergesort'1(nil()) -> nil() mergesort'2(dd(x2,xs'),x1) -> mergesort'3(msplit(dd(x1,dd(x2,xs')))) mergesort'2(nil(),x1) -> dd(x1,nil()) mergesort'3(tuple'2(l1,l2)) -> merge(mergesort(l1),mergesort(l2)) msplit(l) -> msplit'1(l) msplit'1(dd(x1,xs)) -> msplit'2(xs,x1) msplit'1(nil()) -> tuple'2(nil(),nil()) msplit'2(dd(x2,xs'),x1) -> msplit'3(msplit(xs'),x1,x2) msplit'2(nil(),x1) -> tuple'2(dd(x1,nil()),nil()) msplit'3(tuple'2(l1,l2),x1,x2) -> tuple'2(dd(x1,l1),dd(x2,l2)) - Signature: {'cklt/1,'compare/2,'less/2,merge/2,merge'1/2,merge'2/3,merge'3/5,mergesort/1,mergesort'1/1,mergesort'2/2 ,mergesort'3/1,msplit/1,msplit'1/1,msplit'2/2,msplit'3/3,'cklt#/1,'compare#/2,'less#/2,merge#/2,merge'1#/2 ,merge'2#/3,merge'3#/5,mergesort#/1,mergesort'1#/1,mergesort'2#/2,mergesort'3#/1,msplit#/1,msplit'1#/1 ,msplit'2#/2,msplit'3#/3} / {'0/0,'EQ/0,'GT/0,'LT/0,'false/0,'neg/1,'pos/1,'s/1,'true/0,dd/2,nil/0,tuple'2/2 ,c_1/0,c_2/0,c_3/0,c_4/0,c_5/0,c_6/0,c_7/0,c_8/0,c_9/1,c_10/0,c_11/0,c_12/0,c_13/1,c_14/0,c_15/1,c_16/1 ,c_17/1,c_18/1,c_19/0,c_20/1,c_21/0,c_22/1,c_23/1,c_24/1,c_25/1,c_26/0,c_27/1,c_28/0,c_29/3,c_30/1,c_31/1 ,c_32/0,c_33/1,c_34/0,c_35/0} - Obligation: innermost runtime complexity wrt. defined symbols {'cklt#,'compare#,'less#,merge#,merge'1#,merge'2#,merge'3# ,mergesort#,mergesort'1#,mergesort'2#,mergesort'3#,msplit#,msplit'1#,msplit'2# ,msplit'3#} and constructors {'0,'EQ,'GT,'LT,'false,'neg,'pos,'s,'true,dd,nil,tuple'2} + Applied Processor: NaturalMI {miDimension = 3, miDegree = 1, miKind = Algebraic, uargs = UArgs, urules = URules, selector = Just first alternative for predecessorEstimation on any intersect of rules of CDG leaf and strict-rules} + Details: We apply a matrix interpretation of kind constructor based matrix interpretation (containing no more than 1 non-zero interpretation-entries in the diagonal of the component-wise maxima): The following argument positions are considered usable: uargs(c_24) = {1}, uargs(c_25) = {1}, uargs(c_27) = {1}, uargs(c_29) = {1,2,3} Following symbols are considered usable: {msplit,msplit'1,msplit'2,msplit'3,'cklt#,'compare#,'less#,merge#,merge'1#,merge'2#,merge'3#,mergesort# ,mergesort'1#,mergesort'2#,mergesort'3#,msplit#,msplit'1#,msplit'2#,msplit'3#} TcT has computed the following interpretation: p('0) = [0] [1] [0] p('EQ) = [0] [0] [0] p('GT) = [0] [0] [0] p('LT) = [0] [0] [0] p('cklt) = [0 0 0] [1] [0 0 1] x1 + [1] [0 0 0] [0] p('compare) = [0 0 1] [1 1 1] [0] [0 0 0] x1 + [0 1 0] x2 + [0] [0 0 0] [0 0 0] [1] p('false) = [1] [1] [0] p('less) = [0 0 1] [0 1 0] [0] [0 0 0] x1 + [0 0 0] x2 + [1] [0 1 0] [0 0 0] [0] p('neg) = [0] [0] [0] p('pos) = [0] [0] [0] p('s) = [0 0 1] [0] [0 0 0] x1 + [1] [0 0 1] [1] p('true) = [0] [0] [0] p(dd) = [0 1 0] [0] [0 0 1] x2 + [0] [0 0 1] [1] p(merge) = [0 0 1] [1 0 0] [1] [0 1 0] x1 + [0 0 0] x2 + [1] [1 0 0] [0 0 0] [0] p(merge'1) = [1 0 1] [0] [0 0 0] x1 + [0] [0 0 0] [0] p(merge'2) = [1] [0] [0] p(merge'3) = [1 0 0] [0 0 0] [0 0 0] [0] [1 0 0] x1 + [0 0 1] x2 + [1 0 0] x4 + [1] [1 1 1] [0 1 0] [0 0 0] [0] p(mergesort) = [1] [0] [1] p(mergesort'1) = [0 0 0] [0] [1 0 1] x1 + [0] [0 0 0] [1] p(mergesort'2) = [0 0 0] [1] [0 0 1] x1 + [1] [0 0 0] [1] p(mergesort'3) = [0 0 0] [0] [0 0 0] x1 + [1] [1 1 0] [0] p(msplit) = [1 0 0] [0] [0 0 1] x1 + [0] [0 0 0] [1] p(msplit'1) = [1 0 0] [0] [0 0 1] x1 + [0] [0 0 0] [1] p(msplit'2) = [0 1 0] [0] [0 0 1] x1 + [1] [0 0 0] [1] p(msplit'3) = [0 1 0] [0] [0 1 1] x1 + [1] [0 0 0] [1] p(nil) = [0] [0] [0] p(tuple'2) = [0 1 0] [0 1 0] [0] [0 0 1] x1 + [0 0 1] x2 + [0] [0 0 0] [0 0 0] [1] p('cklt#) = [0] [0] [0] p('compare#) = [0] [0] [0] p('less#) = [0] [0] [0] p(merge#) = [0] [1] [1] p(merge'1#) = [0] [0] [0] p(merge'2#) = [0] [0] [0] p(merge'3#) = [0] [0] [0] p(mergesort#) = [0 1 0] [0] [0 0 0] x1 + [1] [0 1 0] [1] p(mergesort'1#) = [0 1 0] [0] [1 0 0] x1 + [1] [1 1 1] [1] p(mergesort'2#) = [0 0 1] [0 0 0] [0] [1 0 0] x1 + [0 0 1] x2 + [0] [0 1 0] [0 0 0] [1] p(mergesort'3#) = [1 0 1] [0] [0 0 0] x1 + [0] [1 1 0] [1] p(msplit#) = [0] [0] [0] p(msplit'1#) = [0] [0] [0] p(msplit'2#) = [0] [0] [0] p(msplit'3#) = [0] [0] [0] p(c_1) = [0] [0] [0] p(c_2) = [0] [0] [0] p(c_3) = [0] [0] [0] p(c_4) = [0] [0] [0] p(c_5) = [0] [0] [0] p(c_6) = [0] [0] [0] p(c_7) = [0] [0] [0] p(c_8) = [0] [0] [0] p(c_9) = [0] [0] [0] p(c_10) = [0] [0] [0] p(c_11) = [0] [0] [0] p(c_12) = [0] [0] [0] p(c_13) = [0] [0] [0] p(c_14) = [0] [0] [0] p(c_15) = [0] [0] [0] p(c_16) = [0] [0] [0] p(c_17) = [0] [0] [0] p(c_18) = [0] [0] [0] p(c_19) = [0] [0] [0] p(c_20) = [0] [0] [0] p(c_21) = [0] [0] [0] p(c_22) = [0] [0] [0] p(c_23) = [0] [0] [0] p(c_24) = [1 0 0] [0] [0 0 0] x1 + [1] [0 0 0] [0] p(c_25) = [1 0 0] [0] [0 0 0] x1 + [0] [0 0 1] [0] p(c_26) = [0] [0] [0] p(c_27) = [1 0 0] [0] [0 0 0] x1 + [0] [0 0 0] [0] p(c_28) = [0] [0] [0] p(c_29) = [1 0 0] [1 0 0] [1 0 0] [0] [0 0 0] x1 + [0 0 0] x2 + [0 0 0] x3 + [0] [0 0 0] [0 1 0] [1 0 0] [0] p(c_30) = [0] [0] [0] p(c_31) = [0] [0] [0] p(c_32) = [0] [0] [0] p(c_33) = [0] [0] [0] p(c_34) = [0] [0] [0] p(c_35) = [0] [0] [0] Following rules are strictly oriented: mergesort'3#(tuple'2(l1,l2)) = [0 1 0] [0 1 0] [1] [0 0 0] l1 + [0 0 0] l2 + [0] [0 1 1] [0 1 1] [1] > [0 1 0] [0 1 0] [0] [0 0 0] l1 + [0 0 0] l2 + [0] [0 0 0] [0 1 0] [1] = c_29(merge#(mergesort(l1),mergesort(l2)),mergesort#(l1),mergesort#(l2)) Following rules are (at-least) weakly oriented: mergesort#(l) = [0 1 0] [0] [0 0 0] l + [1] [0 1 0] [1] >= [0 1 0] [0] [0 0 0] l + [1] [0 0 0] [0] = c_24(mergesort'1#(l)) mergesort'1#(dd(x1,xs)) = [0 0 1] [0] [0 1 0] xs + [1] [0 1 2] [2] >= [0 0 1] [0] [0 0 0] xs + [0] [0 1 0] [1] = c_25(mergesort'2#(xs,x1)) mergesort'2#(dd(x2,xs'),x1) = [0 0 0] [0 0 1] [1] [0 0 1] x1 + [0 1 0] xs' + [0] [0 0 0] [0 0 1] [1] >= [0 0 1] [1] [0 0 0] xs' + [0] [0 0 0] [0] = c_27(mergesort'3#(msplit(dd(x1,dd(x2,xs'))))) msplit(l) = [1 0 0] [0] [0 0 1] l + [0] [0 0 0] [1] >= [1 0 0] [0] [0 0 1] l + [0] [0 0 0] [1] = msplit'1(l) msplit'1(dd(x1,xs)) = [0 1 0] [0] [0 0 1] xs + [1] [0 0 0] [1] >= [0 1 0] [0] [0 0 1] xs + [1] [0 0 0] [1] = msplit'2(xs,x1) msplit'1(nil()) = [0] [0] [1] >= [0] [0] [1] = tuple'2(nil(),nil()) msplit'2(dd(x2,xs'),x1) = [0 0 1] [0] [0 0 1] xs' + [2] [0 0 0] [1] >= [0 0 1] [0] [0 0 1] xs' + [2] [0 0 0] [1] = msplit'3(msplit(xs'),x1,x2) msplit'2(nil(),x1) = [0] [1] [1] >= [0] [1] [1] = tuple'2(dd(x1,nil()),nil()) msplit'3(tuple'2(l1,l2),x1,x2) = [0 0 1] [0 0 1] [0] [0 0 1] l1 + [0 0 1] l2 + [2] [0 0 0] [0 0 0] [1] >= [0 0 1] [0 0 1] [0] [0 0 1] l1 + [0 0 1] l2 + [2] [0 0 0] [0 0 0] [1] = tuple'2(dd(x1,l1),dd(x2,l2)) ***** Step 5.b:4.a:3.a:1.a:2: Assumption WORST_CASE(?,O(1)) + Considered Problem: - Weak DPs: mergesort#(l) -> c_24(mergesort'1#(l)) mergesort'1#(dd(x1,xs)) -> c_25(mergesort'2#(xs,x1)) mergesort'2#(dd(x2,xs'),x1) -> c_27(mergesort'3#(msplit(dd(x1,dd(x2,xs'))))) mergesort'3#(tuple'2(l1,l2)) -> c_29(merge#(mergesort(l1),mergesort(l2)),mergesort#(l1),mergesort#(l2)) - Weak TRS: 'cklt('EQ()) -> 'false() 'cklt('GT()) -> 'false() 'cklt('LT()) -> 'true() 'compare('0(),'0()) -> 'EQ() 'compare('0(),'neg(y)) -> 'GT() 'compare('0(),'pos(y)) -> 'LT() 'compare('0(),'s(y)) -> 'LT() 'compare('neg(x),'0()) -> 'LT() 'compare('neg(x),'neg(y)) -> 'compare(y,x) 'compare('neg(x),'pos(y)) -> 'LT() 'compare('pos(x),'0()) -> 'GT() 'compare('pos(x),'neg(y)) -> 'GT() 'compare('pos(x),'pos(y)) -> 'compare(x,y) 'compare('s(x),'0()) -> 'GT() 'compare('s(x),'s(y)) -> 'compare(x,y) 'less(x,y) -> 'cklt('compare(x,y)) merge(l1,l2) -> merge'1(l1,l2) merge'1(dd(x,xs),l2) -> merge'2(l2,x,xs) merge'1(nil(),l2) -> l2 merge'2(dd(y,ys),x,xs) -> merge'3('less(x,y),x,xs,y,ys) merge'2(nil(),x,xs) -> dd(x,xs) merge'3('false(),x,xs,y,ys) -> dd(y,merge(dd(x,xs),ys)) merge'3('true(),x,xs,y,ys) -> dd(x,merge(xs,dd(y,ys))) mergesort(l) -> mergesort'1(l) mergesort'1(dd(x1,xs)) -> mergesort'2(xs,x1) mergesort'1(nil()) -> nil() mergesort'2(dd(x2,xs'),x1) -> mergesort'3(msplit(dd(x1,dd(x2,xs')))) mergesort'2(nil(),x1) -> dd(x1,nil()) mergesort'3(tuple'2(l1,l2)) -> merge(mergesort(l1),mergesort(l2)) msplit(l) -> msplit'1(l) msplit'1(dd(x1,xs)) -> msplit'2(xs,x1) msplit'1(nil()) -> tuple'2(nil(),nil()) msplit'2(dd(x2,xs'),x1) -> msplit'3(msplit(xs'),x1,x2) msplit'2(nil(),x1) -> tuple'2(dd(x1,nil()),nil()) msplit'3(tuple'2(l1,l2),x1,x2) -> tuple'2(dd(x1,l1),dd(x2,l2)) - Signature: {'cklt/1,'compare/2,'less/2,merge/2,merge'1/2,merge'2/3,merge'3/5,mergesort/1,mergesort'1/1,mergesort'2/2 ,mergesort'3/1,msplit/1,msplit'1/1,msplit'2/2,msplit'3/3,'cklt#/1,'compare#/2,'less#/2,merge#/2,merge'1#/2 ,merge'2#/3,merge'3#/5,mergesort#/1,mergesort'1#/1,mergesort'2#/2,mergesort'3#/1,msplit#/1,msplit'1#/1 ,msplit'2#/2,msplit'3#/3} / {'0/0,'EQ/0,'GT/0,'LT/0,'false/0,'neg/1,'pos/1,'s/1,'true/0,dd/2,nil/0,tuple'2/2 ,c_1/0,c_2/0,c_3/0,c_4/0,c_5/0,c_6/0,c_7/0,c_8/0,c_9/1,c_10/0,c_11/0,c_12/0,c_13/1,c_14/0,c_15/1,c_16/1 ,c_17/1,c_18/1,c_19/0,c_20/1,c_21/0,c_22/1,c_23/1,c_24/1,c_25/1,c_26/0,c_27/1,c_28/0,c_29/3,c_30/1,c_31/1 ,c_32/0,c_33/1,c_34/0,c_35/0} - Obligation: innermost runtime complexity wrt. defined symbols {'cklt#,'compare#,'less#,merge#,merge'1#,merge'2#,merge'3# ,mergesort#,mergesort'1#,mergesort'2#,mergesort'3#,msplit#,msplit'1#,msplit'2# ,msplit'3#} and constructors {'0,'EQ,'GT,'LT,'false,'neg,'pos,'s,'true,dd,nil,tuple'2} + Applied Processor: Assumption {assumed = Certificate {spaceUB = Unknown, spaceLB = Unknown, timeUB = Poly (Just 0), timeLB = Unknown}} + Details: () ***** Step 5.b:4.a:3.a:1.b:1: RemoveWeakSuffixes WORST_CASE(?,O(1)) + Considered Problem: - Weak DPs: mergesort#(l) -> c_24(mergesort'1#(l)) mergesort'1#(dd(x1,xs)) -> c_25(mergesort'2#(xs,x1)) mergesort'2#(dd(x2,xs'),x1) -> c_27(mergesort'3#(msplit(dd(x1,dd(x2,xs'))))) mergesort'3#(tuple'2(l1,l2)) -> c_29(merge#(mergesort(l1),mergesort(l2)),mergesort#(l1),mergesort#(l2)) - Weak TRS: 'cklt('EQ()) -> 'false() 'cklt('GT()) -> 'false() 'cklt('LT()) -> 'true() 'compare('0(),'0()) -> 'EQ() 'compare('0(),'neg(y)) -> 'GT() 'compare('0(),'pos(y)) -> 'LT() 'compare('0(),'s(y)) -> 'LT() 'compare('neg(x),'0()) -> 'LT() 'compare('neg(x),'neg(y)) -> 'compare(y,x) 'compare('neg(x),'pos(y)) -> 'LT() 'compare('pos(x),'0()) -> 'GT() 'compare('pos(x),'neg(y)) -> 'GT() 'compare('pos(x),'pos(y)) -> 'compare(x,y) 'compare('s(x),'0()) -> 'GT() 'compare('s(x),'s(y)) -> 'compare(x,y) 'less(x,y) -> 'cklt('compare(x,y)) merge(l1,l2) -> merge'1(l1,l2) merge'1(dd(x,xs),l2) -> merge'2(l2,x,xs) merge'1(nil(),l2) -> l2 merge'2(dd(y,ys),x,xs) -> merge'3('less(x,y),x,xs,y,ys) merge'2(nil(),x,xs) -> dd(x,xs) merge'3('false(),x,xs,y,ys) -> dd(y,merge(dd(x,xs),ys)) merge'3('true(),x,xs,y,ys) -> dd(x,merge(xs,dd(y,ys))) mergesort(l) -> mergesort'1(l) mergesort'1(dd(x1,xs)) -> mergesort'2(xs,x1) mergesort'1(nil()) -> nil() mergesort'2(dd(x2,xs'),x1) -> mergesort'3(msplit(dd(x1,dd(x2,xs')))) mergesort'2(nil(),x1) -> dd(x1,nil()) mergesort'3(tuple'2(l1,l2)) -> merge(mergesort(l1),mergesort(l2)) msplit(l) -> msplit'1(l) msplit'1(dd(x1,xs)) -> msplit'2(xs,x1) msplit'1(nil()) -> tuple'2(nil(),nil()) msplit'2(dd(x2,xs'),x1) -> msplit'3(msplit(xs'),x1,x2) msplit'2(nil(),x1) -> tuple'2(dd(x1,nil()),nil()) msplit'3(tuple'2(l1,l2),x1,x2) -> tuple'2(dd(x1,l1),dd(x2,l2)) - Signature: {'cklt/1,'compare/2,'less/2,merge/2,merge'1/2,merge'2/3,merge'3/5,mergesort/1,mergesort'1/1,mergesort'2/2 ,mergesort'3/1,msplit/1,msplit'1/1,msplit'2/2,msplit'3/3,'cklt#/1,'compare#/2,'less#/2,merge#/2,merge'1#/2 ,merge'2#/3,merge'3#/5,mergesort#/1,mergesort'1#/1,mergesort'2#/2,mergesort'3#/1,msplit#/1,msplit'1#/1 ,msplit'2#/2,msplit'3#/3} / {'0/0,'EQ/0,'GT/0,'LT/0,'false/0,'neg/1,'pos/1,'s/1,'true/0,dd/2,nil/0,tuple'2/2 ,c_1/0,c_2/0,c_3/0,c_4/0,c_5/0,c_6/0,c_7/0,c_8/0,c_9/1,c_10/0,c_11/0,c_12/0,c_13/1,c_14/0,c_15/1,c_16/1 ,c_17/1,c_18/1,c_19/0,c_20/1,c_21/0,c_22/1,c_23/1,c_24/1,c_25/1,c_26/0,c_27/1,c_28/0,c_29/3,c_30/1,c_31/1 ,c_32/0,c_33/1,c_34/0,c_35/0} - Obligation: innermost runtime complexity wrt. defined symbols {'cklt#,'compare#,'less#,merge#,merge'1#,merge'2#,merge'3# ,mergesort#,mergesort'1#,mergesort'2#,mergesort'3#,msplit#,msplit'1#,msplit'2# ,msplit'3#} and constructors {'0,'EQ,'GT,'LT,'false,'neg,'pos,'s,'true,dd,nil,tuple'2} + Applied Processor: RemoveWeakSuffixes + Details: Consider the dependency graph 1:W:mergesort#(l) -> c_24(mergesort'1#(l)) -->_1 mergesort'1#(dd(x1,xs)) -> c_25(mergesort'2#(xs,x1)):2 2:W:mergesort'1#(dd(x1,xs)) -> c_25(mergesort'2#(xs,x1)) -->_1 mergesort'2#(dd(x2,xs'),x1) -> c_27(mergesort'3#(msplit(dd(x1,dd(x2,xs'))))):3 3:W:mergesort'2#(dd(x2,xs'),x1) -> c_27(mergesort'3#(msplit(dd(x1,dd(x2,xs'))))) -->_1 mergesort'3#(tuple'2(l1,l2)) -> c_29(merge#(mergesort(l1),mergesort(l2)) ,mergesort#(l1) ,mergesort#(l2)):4 4:W:mergesort'3#(tuple'2(l1,l2)) -> c_29(merge#(mergesort(l1),mergesort(l2)),mergesort#(l1),mergesort#(l2)) -->_3 mergesort#(l) -> c_24(mergesort'1#(l)):1 -->_2 mergesort#(l) -> c_24(mergesort'1#(l)):1 The following weak DPs constitute a sub-graph of the DG that is closed under successors. The DPs are removed. 1: mergesort#(l) -> c_24(mergesort'1#(l)) 4: mergesort'3#(tuple'2(l1,l2)) -> c_29(merge#(mergesort(l1),mergesort(l2)),mergesort#(l1),mergesort#(l2)) 3: mergesort'2#(dd(x2,xs'),x1) -> c_27(mergesort'3#(msplit(dd(x1,dd(x2,xs'))))) 2: mergesort'1#(dd(x1,xs)) -> c_25(mergesort'2#(xs,x1)) ***** Step 5.b:4.a:3.a:1.b:2: EmptyProcessor WORST_CASE(?,O(1)) + Considered Problem: - Weak TRS: 'cklt('EQ()) -> 'false() 'cklt('GT()) -> 'false() 'cklt('LT()) -> 'true() 'compare('0(),'0()) -> 'EQ() 'compare('0(),'neg(y)) -> 'GT() 'compare('0(),'pos(y)) -> 'LT() 'compare('0(),'s(y)) -> 'LT() 'compare('neg(x),'0()) -> 'LT() 'compare('neg(x),'neg(y)) -> 'compare(y,x) 'compare('neg(x),'pos(y)) -> 'LT() 'compare('pos(x),'0()) -> 'GT() 'compare('pos(x),'neg(y)) -> 'GT() 'compare('pos(x),'pos(y)) -> 'compare(x,y) 'compare('s(x),'0()) -> 'GT() 'compare('s(x),'s(y)) -> 'compare(x,y) 'less(x,y) -> 'cklt('compare(x,y)) merge(l1,l2) -> merge'1(l1,l2) merge'1(dd(x,xs),l2) -> merge'2(l2,x,xs) merge'1(nil(),l2) -> l2 merge'2(dd(y,ys),x,xs) -> merge'3('less(x,y),x,xs,y,ys) merge'2(nil(),x,xs) -> dd(x,xs) merge'3('false(),x,xs,y,ys) -> dd(y,merge(dd(x,xs),ys)) merge'3('true(),x,xs,y,ys) -> dd(x,merge(xs,dd(y,ys))) mergesort(l) -> mergesort'1(l) mergesort'1(dd(x1,xs)) -> mergesort'2(xs,x1) mergesort'1(nil()) -> nil() mergesort'2(dd(x2,xs'),x1) -> mergesort'3(msplit(dd(x1,dd(x2,xs')))) mergesort'2(nil(),x1) -> dd(x1,nil()) mergesort'3(tuple'2(l1,l2)) -> merge(mergesort(l1),mergesort(l2)) msplit(l) -> msplit'1(l) msplit'1(dd(x1,xs)) -> msplit'2(xs,x1) msplit'1(nil()) -> tuple'2(nil(),nil()) msplit'2(dd(x2,xs'),x1) -> msplit'3(msplit(xs'),x1,x2) msplit'2(nil(),x1) -> tuple'2(dd(x1,nil()),nil()) msplit'3(tuple'2(l1,l2),x1,x2) -> tuple'2(dd(x1,l1),dd(x2,l2)) - Signature: {'cklt/1,'compare/2,'less/2,merge/2,merge'1/2,merge'2/3,merge'3/5,mergesort/1,mergesort'1/1,mergesort'2/2 ,mergesort'3/1,msplit/1,msplit'1/1,msplit'2/2,msplit'3/3,'cklt#/1,'compare#/2,'less#/2,merge#/2,merge'1#/2 ,merge'2#/3,merge'3#/5,mergesort#/1,mergesort'1#/1,mergesort'2#/2,mergesort'3#/1,msplit#/1,msplit'1#/1 ,msplit'2#/2,msplit'3#/3} / {'0/0,'EQ/0,'GT/0,'LT/0,'false/0,'neg/1,'pos/1,'s/1,'true/0,dd/2,nil/0,tuple'2/2 ,c_1/0,c_2/0,c_3/0,c_4/0,c_5/0,c_6/0,c_7/0,c_8/0,c_9/1,c_10/0,c_11/0,c_12/0,c_13/1,c_14/0,c_15/1,c_16/1 ,c_17/1,c_18/1,c_19/0,c_20/1,c_21/0,c_22/1,c_23/1,c_24/1,c_25/1,c_26/0,c_27/1,c_28/0,c_29/3,c_30/1,c_31/1 ,c_32/0,c_33/1,c_34/0,c_35/0} - Obligation: innermost runtime complexity wrt. defined symbols {'cklt#,'compare#,'less#,merge#,merge'1#,merge'2#,merge'3# ,mergesort#,mergesort'1#,mergesort'2#,mergesort'3#,msplit#,msplit'1#,msplit'2# ,msplit'3#} and constructors {'0,'EQ,'GT,'LT,'false,'neg,'pos,'s,'true,dd,nil,tuple'2} + Applied Processor: EmptyProcessor + Details: The problem is already closed. The intended complexity is O(1). **** Step 5.b:4.a:3.b:1: PredecessorEstimationCP WORST_CASE(?,O(n^1)) + Considered Problem: - Strict DPs: merge#(l1,l2) -> c_17(merge'1#(l1,l2)) merge'1#(dd(x,xs),l2) -> c_18(merge'2#(l2,x,xs)) merge'2#(dd(y,ys),x,xs) -> c_20(merge'3#('less(x,y),x,xs,y,ys)) merge'3#('false(),x,xs,y,ys) -> c_22(merge#(dd(x,xs),ys)) merge'3#('true(),x,xs,y,ys) -> c_23(merge#(xs,dd(y,ys))) - Weak DPs: mergesort#(l) -> mergesort'1#(l) mergesort'1#(dd(x1,xs)) -> mergesort'2#(xs,x1) mergesort'2#(dd(x2,xs'),x1) -> mergesort'3#(msplit(dd(x1,dd(x2,xs')))) mergesort'3#(tuple'2(l1,l2)) -> merge#(mergesort(l1),mergesort(l2)) mergesort'3#(tuple'2(l1,l2)) -> mergesort#(l1) mergesort'3#(tuple'2(l1,l2)) -> mergesort#(l2) - Weak TRS: 'cklt('EQ()) -> 'false() 'cklt('GT()) -> 'false() 'cklt('LT()) -> 'true() 'compare('0(),'0()) -> 'EQ() 'compare('0(),'neg(y)) -> 'GT() 'compare('0(),'pos(y)) -> 'LT() 'compare('0(),'s(y)) -> 'LT() 'compare('neg(x),'0()) -> 'LT() 'compare('neg(x),'neg(y)) -> 'compare(y,x) 'compare('neg(x),'pos(y)) -> 'LT() 'compare('pos(x),'0()) -> 'GT() 'compare('pos(x),'neg(y)) -> 'GT() 'compare('pos(x),'pos(y)) -> 'compare(x,y) 'compare('s(x),'0()) -> 'GT() 'compare('s(x),'s(y)) -> 'compare(x,y) 'less(x,y) -> 'cklt('compare(x,y)) merge(l1,l2) -> merge'1(l1,l2) merge'1(dd(x,xs),l2) -> merge'2(l2,x,xs) merge'1(nil(),l2) -> l2 merge'2(dd(y,ys),x,xs) -> merge'3('less(x,y),x,xs,y,ys) merge'2(nil(),x,xs) -> dd(x,xs) merge'3('false(),x,xs,y,ys) -> dd(y,merge(dd(x,xs),ys)) merge'3('true(),x,xs,y,ys) -> dd(x,merge(xs,dd(y,ys))) mergesort(l) -> mergesort'1(l) mergesort'1(dd(x1,xs)) -> mergesort'2(xs,x1) mergesort'1(nil()) -> nil() mergesort'2(dd(x2,xs'),x1) -> mergesort'3(msplit(dd(x1,dd(x2,xs')))) mergesort'2(nil(),x1) -> dd(x1,nil()) mergesort'3(tuple'2(l1,l2)) -> merge(mergesort(l1),mergesort(l2)) msplit(l) -> msplit'1(l) msplit'1(dd(x1,xs)) -> msplit'2(xs,x1) msplit'1(nil()) -> tuple'2(nil(),nil()) msplit'2(dd(x2,xs'),x1) -> msplit'3(msplit(xs'),x1,x2) msplit'2(nil(),x1) -> tuple'2(dd(x1,nil()),nil()) msplit'3(tuple'2(l1,l2),x1,x2) -> tuple'2(dd(x1,l1),dd(x2,l2)) - Signature: {'cklt/1,'compare/2,'less/2,merge/2,merge'1/2,merge'2/3,merge'3/5,mergesort/1,mergesort'1/1,mergesort'2/2 ,mergesort'3/1,msplit/1,msplit'1/1,msplit'2/2,msplit'3/3,'cklt#/1,'compare#/2,'less#/2,merge#/2,merge'1#/2 ,merge'2#/3,merge'3#/5,mergesort#/1,mergesort'1#/1,mergesort'2#/2,mergesort'3#/1,msplit#/1,msplit'1#/1 ,msplit'2#/2,msplit'3#/3} / {'0/0,'EQ/0,'GT/0,'LT/0,'false/0,'neg/1,'pos/1,'s/1,'true/0,dd/2,nil/0,tuple'2/2 ,c_1/0,c_2/0,c_3/0,c_4/0,c_5/0,c_6/0,c_7/0,c_8/0,c_9/1,c_10/0,c_11/0,c_12/0,c_13/1,c_14/0,c_15/1,c_16/1 ,c_17/1,c_18/1,c_19/0,c_20/1,c_21/0,c_22/1,c_23/1,c_24/1,c_25/1,c_26/0,c_27/1,c_28/0,c_29/3,c_30/1,c_31/1 ,c_32/0,c_33/1,c_34/0,c_35/0} - Obligation: innermost runtime complexity wrt. defined symbols {'cklt#,'compare#,'less#,merge#,merge'1#,merge'2#,merge'3# ,mergesort#,mergesort'1#,mergesort'2#,mergesort'3#,msplit#,msplit'1#,msplit'2# ,msplit'3#} and constructors {'0,'EQ,'GT,'LT,'false,'neg,'pos,'s,'true,dd,nil,tuple'2} + Applied Processor: PredecessorEstimationCP {onSelectionCP = any intersect of rules of CDG leaf and strict-rules, withComplexityPair = NaturalMI {miDimension = 1, miDegree = 1, miKind = Algebraic, uargs = UArgs, urules = URules, selector = Nothing}} + Details: We first use the processor NaturalMI {miDimension = 1, miDegree = 1, miKind = Algebraic, uargs = UArgs, urules = URules, selector = Nothing} to orient following rules strictly: 3: merge'2#(dd(y,ys),x,xs) -> c_20(merge'3#('less(x,y),x,xs,y,ys)) Consider the set of all dependency pairs 1: merge#(l1,l2) -> c_17(merge'1#(l1,l2)) 2: merge'1#(dd(x,xs),l2) -> c_18(merge'2#(l2,x,xs)) 3: merge'2#(dd(y,ys),x,xs) -> c_20(merge'3#('less(x,y),x,xs,y,ys)) 4: merge'3#('false(),x,xs,y,ys) -> c_22(merge#(dd(x,xs),ys)) 5: merge'3#('true(),x,xs,y,ys) -> c_23(merge#(xs,dd(y,ys))) 6: mergesort#(l) -> mergesort'1#(l) 7: mergesort'1#(dd(x1,xs)) -> mergesort'2#(xs,x1) 8: mergesort'2#(dd(x2,xs'),x1) -> mergesort'3#(msplit(dd(x1,dd(x2,xs')))) 9: mergesort'3#(tuple'2(l1,l2)) -> merge#(mergesort(l1),mergesort(l2)) 10: mergesort'3#(tuple'2(l1,l2)) -> mergesort#(l1) 11: mergesort'3#(tuple'2(l1,l2)) -> mergesort#(l2) Processor NaturalMI {miDimension = 1, miDegree = 1, miKind = Algebraic, uargs = UArgs, urules = URules, selector = Nothing}induces the complexity certificateTIME (?,O(n^1)) SPACE(?,?)on application of the dependency pairs {3} These cover all (indirect) predecessors of dependency pairs {3,4,5} their number of applications is equally bounded. The dependency pairs are shifted into the weak component. ***** Step 5.b:4.a:3.b:1.a:1: NaturalMI WORST_CASE(?,O(n^1)) + Considered Problem: - Strict DPs: merge#(l1,l2) -> c_17(merge'1#(l1,l2)) merge'1#(dd(x,xs),l2) -> c_18(merge'2#(l2,x,xs)) merge'2#(dd(y,ys),x,xs) -> c_20(merge'3#('less(x,y),x,xs,y,ys)) merge'3#('false(),x,xs,y,ys) -> c_22(merge#(dd(x,xs),ys)) merge'3#('true(),x,xs,y,ys) -> c_23(merge#(xs,dd(y,ys))) - Weak DPs: mergesort#(l) -> mergesort'1#(l) mergesort'1#(dd(x1,xs)) -> mergesort'2#(xs,x1) mergesort'2#(dd(x2,xs'),x1) -> mergesort'3#(msplit(dd(x1,dd(x2,xs')))) mergesort'3#(tuple'2(l1,l2)) -> merge#(mergesort(l1),mergesort(l2)) mergesort'3#(tuple'2(l1,l2)) -> mergesort#(l1) mergesort'3#(tuple'2(l1,l2)) -> mergesort#(l2) - Weak TRS: 'cklt('EQ()) -> 'false() 'cklt('GT()) -> 'false() 'cklt('LT()) -> 'true() 'compare('0(),'0()) -> 'EQ() 'compare('0(),'neg(y)) -> 'GT() 'compare('0(),'pos(y)) -> 'LT() 'compare('0(),'s(y)) -> 'LT() 'compare('neg(x),'0()) -> 'LT() 'compare('neg(x),'neg(y)) -> 'compare(y,x) 'compare('neg(x),'pos(y)) -> 'LT() 'compare('pos(x),'0()) -> 'GT() 'compare('pos(x),'neg(y)) -> 'GT() 'compare('pos(x),'pos(y)) -> 'compare(x,y) 'compare('s(x),'0()) -> 'GT() 'compare('s(x),'s(y)) -> 'compare(x,y) 'less(x,y) -> 'cklt('compare(x,y)) merge(l1,l2) -> merge'1(l1,l2) merge'1(dd(x,xs),l2) -> merge'2(l2,x,xs) merge'1(nil(),l2) -> l2 merge'2(dd(y,ys),x,xs) -> merge'3('less(x,y),x,xs,y,ys) merge'2(nil(),x,xs) -> dd(x,xs) merge'3('false(),x,xs,y,ys) -> dd(y,merge(dd(x,xs),ys)) merge'3('true(),x,xs,y,ys) -> dd(x,merge(xs,dd(y,ys))) mergesort(l) -> mergesort'1(l) mergesort'1(dd(x1,xs)) -> mergesort'2(xs,x1) mergesort'1(nil()) -> nil() mergesort'2(dd(x2,xs'),x1) -> mergesort'3(msplit(dd(x1,dd(x2,xs')))) mergesort'2(nil(),x1) -> dd(x1,nil()) mergesort'3(tuple'2(l1,l2)) -> merge(mergesort(l1),mergesort(l2)) msplit(l) -> msplit'1(l) msplit'1(dd(x1,xs)) -> msplit'2(xs,x1) msplit'1(nil()) -> tuple'2(nil(),nil()) msplit'2(dd(x2,xs'),x1) -> msplit'3(msplit(xs'),x1,x2) msplit'2(nil(),x1) -> tuple'2(dd(x1,nil()),nil()) msplit'3(tuple'2(l1,l2),x1,x2) -> tuple'2(dd(x1,l1),dd(x2,l2)) - Signature: {'cklt/1,'compare/2,'less/2,merge/2,merge'1/2,merge'2/3,merge'3/5,mergesort/1,mergesort'1/1,mergesort'2/2 ,mergesort'3/1,msplit/1,msplit'1/1,msplit'2/2,msplit'3/3,'cklt#/1,'compare#/2,'less#/2,merge#/2,merge'1#/2 ,merge'2#/3,merge'3#/5,mergesort#/1,mergesort'1#/1,mergesort'2#/2,mergesort'3#/1,msplit#/1,msplit'1#/1 ,msplit'2#/2,msplit'3#/3} / {'0/0,'EQ/0,'GT/0,'LT/0,'false/0,'neg/1,'pos/1,'s/1,'true/0,dd/2,nil/0,tuple'2/2 ,c_1/0,c_2/0,c_3/0,c_4/0,c_5/0,c_6/0,c_7/0,c_8/0,c_9/1,c_10/0,c_11/0,c_12/0,c_13/1,c_14/0,c_15/1,c_16/1 ,c_17/1,c_18/1,c_19/0,c_20/1,c_21/0,c_22/1,c_23/1,c_24/1,c_25/1,c_26/0,c_27/1,c_28/0,c_29/3,c_30/1,c_31/1 ,c_32/0,c_33/1,c_34/0,c_35/0} - Obligation: innermost runtime complexity wrt. defined symbols {'cklt#,'compare#,'less#,merge#,merge'1#,merge'2#,merge'3# ,mergesort#,mergesort'1#,mergesort'2#,mergesort'3#,msplit#,msplit'1#,msplit'2# ,msplit'3#} and constructors {'0,'EQ,'GT,'LT,'false,'neg,'pos,'s,'true,dd,nil,tuple'2} + Applied Processor: NaturalMI {miDimension = 1, miDegree = 1, miKind = Algebraic, uargs = UArgs, urules = URules, selector = Just first alternative for predecessorEstimation on any intersect of rules of CDG leaf and strict-rules} + Details: We apply a matrix interpretation of kind constructor based matrix interpretation: The following argument positions are considered usable: uargs(c_17) = {1}, uargs(c_18) = {1}, uargs(c_20) = {1}, uargs(c_22) = {1}, uargs(c_23) = {1} Following symbols are considered usable: {merge,merge'1,merge'2,merge'3,mergesort,mergesort'1,mergesort'2,mergesort'3,msplit,msplit'1,msplit'2 ,msplit'3,'cklt#,'compare#,'less#,merge#,merge'1#,merge'2#,merge'3#,mergesort#,mergesort'1#,mergesort'2# ,mergesort'3#,msplit#,msplit'1#,msplit'2#,msplit'3#} TcT has computed the following interpretation: p('0) = [0] p('EQ) = [0] p('GT) = [0] p('LT) = [0] p('cklt) = [0] p('compare) = [0] p('false) = [0] p('less) = [0] p('neg) = [0] p('pos) = [2] p('s) = [1] x1 + [0] p('true) = [0] p(dd) = [1] x1 + [1] x2 + [2] p(merge) = [1] x1 + [1] x2 + [0] p(merge'1) = [1] x1 + [1] x2 + [0] p(merge'2) = [1] x1 + [1] x2 + [1] x3 + [2] p(merge'3) = [1] x2 + [1] x3 + [1] x4 + [1] x5 + [4] p(mergesort) = [1] x1 + [0] p(mergesort'1) = [1] x1 + [0] p(mergesort'2) = [1] x1 + [1] x2 + [2] p(mergesort'3) = [1] x1 + [0] p(msplit) = [1] x1 + [0] p(msplit'1) = [1] x1 + [0] p(msplit'2) = [1] x1 + [1] x2 + [2] p(msplit'3) = [1] x1 + [1] x2 + [1] x3 + [4] p(nil) = [0] p(tuple'2) = [1] x1 + [1] x2 + [0] p('cklt#) = [2] x1 + [4] p('compare#) = [1] x1 + [1] p('less#) = [2] x2 + [0] p(merge#) = [1] x1 + [2] x2 + [0] p(merge'1#) = [1] x1 + [2] x2 + [0] p(merge'2#) = [2] x1 + [1] x2 + [1] x3 + [2] p(merge'3#) = [1] x2 + [1] x3 + [2] x4 + [2] x5 + [4] p(mergesort#) = [2] x1 + [0] p(mergesort'1#) = [2] x1 + [0] p(mergesort'2#) = [2] x1 + [2] x2 + [4] p(mergesort'3#) = [2] x1 + [0] p(msplit#) = [1] p(msplit'1#) = [0] p(msplit'2#) = [0] p(msplit'3#) = [0] p(c_1) = [1] p(c_2) = [0] p(c_3) = [0] p(c_4) = [0] p(c_5) = [1] p(c_6) = [0] p(c_7) = [4] p(c_8) = [4] p(c_9) = [1] p(c_10) = [1] p(c_11) = [0] p(c_12) = [0] p(c_13) = [1] x1 + [1] p(c_14) = [1] p(c_15) = [1] x1 + [0] p(c_16) = [4] p(c_17) = [1] x1 + [0] p(c_18) = [1] x1 + [0] p(c_19) = [1] p(c_20) = [1] x1 + [1] p(c_21) = [1] p(c_22) = [1] x1 + [2] p(c_23) = [1] x1 + [0] p(c_24) = [0] p(c_25) = [4] p(c_26) = [0] p(c_27) = [0] p(c_28) = [0] p(c_29) = [4] p(c_30) = [2] x1 + [1] p(c_31) = [1] x1 + [0] p(c_32) = [0] p(c_33) = [1] p(c_34) = [1] p(c_35) = [1] Following rules are strictly oriented: merge'2#(dd(y,ys),x,xs) = [1] x + [1] xs + [2] y + [2] ys + [6] > [1] x + [1] xs + [2] y + [2] ys + [5] = c_20(merge'3#('less(x,y),x,xs,y,ys)) Following rules are (at-least) weakly oriented: merge#(l1,l2) = [1] l1 + [2] l2 + [0] >= [1] l1 + [2] l2 + [0] = c_17(merge'1#(l1,l2)) merge'1#(dd(x,xs),l2) = [2] l2 + [1] x + [1] xs + [2] >= [2] l2 + [1] x + [1] xs + [2] = c_18(merge'2#(l2,x,xs)) merge'3#('false(),x,xs,y,ys) = [1] x + [1] xs + [2] y + [2] ys + [4] >= [1] x + [1] xs + [2] ys + [4] = c_22(merge#(dd(x,xs),ys)) merge'3#('true(),x,xs,y,ys) = [1] x + [1] xs + [2] y + [2] ys + [4] >= [1] xs + [2] y + [2] ys + [4] = c_23(merge#(xs,dd(y,ys))) mergesort#(l) = [2] l + [0] >= [2] l + [0] = mergesort'1#(l) mergesort'1#(dd(x1,xs)) = [2] x1 + [2] xs + [4] >= [2] x1 + [2] xs + [4] = mergesort'2#(xs,x1) mergesort'2#(dd(x2,xs'),x1) = [2] x1 + [2] x2 + [2] xs' + [8] >= [2] x1 + [2] x2 + [2] xs' + [8] = mergesort'3#(msplit(dd(x1,dd(x2,xs')))) mergesort'3#(tuple'2(l1,l2)) = [2] l1 + [2] l2 + [0] >= [1] l1 + [2] l2 + [0] = merge#(mergesort(l1),mergesort(l2)) mergesort'3#(tuple'2(l1,l2)) = [2] l1 + [2] l2 + [0] >= [2] l1 + [0] = mergesort#(l1) mergesort'3#(tuple'2(l1,l2)) = [2] l1 + [2] l2 + [0] >= [2] l2 + [0] = mergesort#(l2) merge(l1,l2) = [1] l1 + [1] l2 + [0] >= [1] l1 + [1] l2 + [0] = merge'1(l1,l2) merge'1(dd(x,xs),l2) = [1] l2 + [1] x + [1] xs + [2] >= [1] l2 + [1] x + [1] xs + [2] = merge'2(l2,x,xs) merge'1(nil(),l2) = [1] l2 + [0] >= [1] l2 + [0] = l2 merge'2(dd(y,ys),x,xs) = [1] x + [1] xs + [1] y + [1] ys + [4] >= [1] x + [1] xs + [1] y + [1] ys + [4] = merge'3('less(x,y),x,xs,y,ys) merge'2(nil(),x,xs) = [1] x + [1] xs + [2] >= [1] x + [1] xs + [2] = dd(x,xs) merge'3('false(),x,xs,y,ys) = [1] x + [1] xs + [1] y + [1] ys + [4] >= [1] x + [1] xs + [1] y + [1] ys + [4] = dd(y,merge(dd(x,xs),ys)) merge'3('true(),x,xs,y,ys) = [1] x + [1] xs + [1] y + [1] ys + [4] >= [1] x + [1] xs + [1] y + [1] ys + [4] = dd(x,merge(xs,dd(y,ys))) mergesort(l) = [1] l + [0] >= [1] l + [0] = mergesort'1(l) mergesort'1(dd(x1,xs)) = [1] x1 + [1] xs + [2] >= [1] x1 + [1] xs + [2] = mergesort'2(xs,x1) mergesort'1(nil()) = [0] >= [0] = nil() mergesort'2(dd(x2,xs'),x1) = [1] x1 + [1] x2 + [1] xs' + [4] >= [1] x1 + [1] x2 + [1] xs' + [4] = mergesort'3(msplit(dd(x1,dd(x2,xs')))) mergesort'2(nil(),x1) = [1] x1 + [2] >= [1] x1 + [2] = dd(x1,nil()) mergesort'3(tuple'2(l1,l2)) = [1] l1 + [1] l2 + [0] >= [1] l1 + [1] l2 + [0] = merge(mergesort(l1),mergesort(l2)) msplit(l) = [1] l + [0] >= [1] l + [0] = msplit'1(l) msplit'1(dd(x1,xs)) = [1] x1 + [1] xs + [2] >= [1] x1 + [1] xs + [2] = msplit'2(xs,x1) msplit'1(nil()) = [0] >= [0] = tuple'2(nil(),nil()) msplit'2(dd(x2,xs'),x1) = [1] x1 + [1] x2 + [1] xs' + [4] >= [1] x1 + [1] x2 + [1] xs' + [4] = msplit'3(msplit(xs'),x1,x2) msplit'2(nil(),x1) = [1] x1 + [2] >= [1] x1 + [2] = tuple'2(dd(x1,nil()),nil()) msplit'3(tuple'2(l1,l2),x1,x2) = [1] l1 + [1] l2 + [1] x1 + [1] x2 + [4] >= [1] l1 + [1] l2 + [1] x1 + [1] x2 + [4] = tuple'2(dd(x1,l1),dd(x2,l2)) ***** Step 5.b:4.a:3.b:1.a:2: Assumption WORST_CASE(?,O(1)) + Considered Problem: - Strict DPs: merge#(l1,l2) -> c_17(merge'1#(l1,l2)) merge'1#(dd(x,xs),l2) -> c_18(merge'2#(l2,x,xs)) merge'3#('false(),x,xs,y,ys) -> c_22(merge#(dd(x,xs),ys)) merge'3#('true(),x,xs,y,ys) -> c_23(merge#(xs,dd(y,ys))) - Weak DPs: merge'2#(dd(y,ys),x,xs) -> c_20(merge'3#('less(x,y),x,xs,y,ys)) mergesort#(l) -> mergesort'1#(l) mergesort'1#(dd(x1,xs)) -> mergesort'2#(xs,x1) mergesort'2#(dd(x2,xs'),x1) -> mergesort'3#(msplit(dd(x1,dd(x2,xs')))) mergesort'3#(tuple'2(l1,l2)) -> merge#(mergesort(l1),mergesort(l2)) mergesort'3#(tuple'2(l1,l2)) -> mergesort#(l1) mergesort'3#(tuple'2(l1,l2)) -> mergesort#(l2) - Weak TRS: 'cklt('EQ()) -> 'false() 'cklt('GT()) -> 'false() 'cklt('LT()) -> 'true() 'compare('0(),'0()) -> 'EQ() 'compare('0(),'neg(y)) -> 'GT() 'compare('0(),'pos(y)) -> 'LT() 'compare('0(),'s(y)) -> 'LT() 'compare('neg(x),'0()) -> 'LT() 'compare('neg(x),'neg(y)) -> 'compare(y,x) 'compare('neg(x),'pos(y)) -> 'LT() 'compare('pos(x),'0()) -> 'GT() 'compare('pos(x),'neg(y)) -> 'GT() 'compare('pos(x),'pos(y)) -> 'compare(x,y) 'compare('s(x),'0()) -> 'GT() 'compare('s(x),'s(y)) -> 'compare(x,y) 'less(x,y) -> 'cklt('compare(x,y)) merge(l1,l2) -> merge'1(l1,l2) merge'1(dd(x,xs),l2) -> merge'2(l2,x,xs) merge'1(nil(),l2) -> l2 merge'2(dd(y,ys),x,xs) -> merge'3('less(x,y),x,xs,y,ys) merge'2(nil(),x,xs) -> dd(x,xs) merge'3('false(),x,xs,y,ys) -> dd(y,merge(dd(x,xs),ys)) merge'3('true(),x,xs,y,ys) -> dd(x,merge(xs,dd(y,ys))) mergesort(l) -> mergesort'1(l) mergesort'1(dd(x1,xs)) -> mergesort'2(xs,x1) mergesort'1(nil()) -> nil() mergesort'2(dd(x2,xs'),x1) -> mergesort'3(msplit(dd(x1,dd(x2,xs')))) mergesort'2(nil(),x1) -> dd(x1,nil()) mergesort'3(tuple'2(l1,l2)) -> merge(mergesort(l1),mergesort(l2)) msplit(l) -> msplit'1(l) msplit'1(dd(x1,xs)) -> msplit'2(xs,x1) msplit'1(nil()) -> tuple'2(nil(),nil()) msplit'2(dd(x2,xs'),x1) -> msplit'3(msplit(xs'),x1,x2) msplit'2(nil(),x1) -> tuple'2(dd(x1,nil()),nil()) msplit'3(tuple'2(l1,l2),x1,x2) -> tuple'2(dd(x1,l1),dd(x2,l2)) - Signature: {'cklt/1,'compare/2,'less/2,merge/2,merge'1/2,merge'2/3,merge'3/5,mergesort/1,mergesort'1/1,mergesort'2/2 ,mergesort'3/1,msplit/1,msplit'1/1,msplit'2/2,msplit'3/3,'cklt#/1,'compare#/2,'less#/2,merge#/2,merge'1#/2 ,merge'2#/3,merge'3#/5,mergesort#/1,mergesort'1#/1,mergesort'2#/2,mergesort'3#/1,msplit#/1,msplit'1#/1 ,msplit'2#/2,msplit'3#/3} / {'0/0,'EQ/0,'GT/0,'LT/0,'false/0,'neg/1,'pos/1,'s/1,'true/0,dd/2,nil/0,tuple'2/2 ,c_1/0,c_2/0,c_3/0,c_4/0,c_5/0,c_6/0,c_7/0,c_8/0,c_9/1,c_10/0,c_11/0,c_12/0,c_13/1,c_14/0,c_15/1,c_16/1 ,c_17/1,c_18/1,c_19/0,c_20/1,c_21/0,c_22/1,c_23/1,c_24/1,c_25/1,c_26/0,c_27/1,c_28/0,c_29/3,c_30/1,c_31/1 ,c_32/0,c_33/1,c_34/0,c_35/0} - Obligation: innermost runtime complexity wrt. defined symbols {'cklt#,'compare#,'less#,merge#,merge'1#,merge'2#,merge'3# ,mergesort#,mergesort'1#,mergesort'2#,mergesort'3#,msplit#,msplit'1#,msplit'2# ,msplit'3#} and constructors {'0,'EQ,'GT,'LT,'false,'neg,'pos,'s,'true,dd,nil,tuple'2} + Applied Processor: Assumption {assumed = Certificate {spaceUB = Unknown, spaceLB = Unknown, timeUB = Poly (Just 0), timeLB = Unknown}} + Details: () ***** Step 5.b:4.a:3.b:1.b:1: PredecessorEstimationCP WORST_CASE(?,O(n^1)) + Considered Problem: - Strict DPs: merge#(l1,l2) -> c_17(merge'1#(l1,l2)) merge'1#(dd(x,xs),l2) -> c_18(merge'2#(l2,x,xs)) - Weak DPs: merge'2#(dd(y,ys),x,xs) -> c_20(merge'3#('less(x,y),x,xs,y,ys)) merge'3#('false(),x,xs,y,ys) -> c_22(merge#(dd(x,xs),ys)) merge'3#('true(),x,xs,y,ys) -> c_23(merge#(xs,dd(y,ys))) mergesort#(l) -> mergesort'1#(l) mergesort'1#(dd(x1,xs)) -> mergesort'2#(xs,x1) mergesort'2#(dd(x2,xs'),x1) -> mergesort'3#(msplit(dd(x1,dd(x2,xs')))) mergesort'3#(tuple'2(l1,l2)) -> merge#(mergesort(l1),mergesort(l2)) mergesort'3#(tuple'2(l1,l2)) -> mergesort#(l1) mergesort'3#(tuple'2(l1,l2)) -> mergesort#(l2) - Weak TRS: 'cklt('EQ()) -> 'false() 'cklt('GT()) -> 'false() 'cklt('LT()) -> 'true() 'compare('0(),'0()) -> 'EQ() 'compare('0(),'neg(y)) -> 'GT() 'compare('0(),'pos(y)) -> 'LT() 'compare('0(),'s(y)) -> 'LT() 'compare('neg(x),'0()) -> 'LT() 'compare('neg(x),'neg(y)) -> 'compare(y,x) 'compare('neg(x),'pos(y)) -> 'LT() 'compare('pos(x),'0()) -> 'GT() 'compare('pos(x),'neg(y)) -> 'GT() 'compare('pos(x),'pos(y)) -> 'compare(x,y) 'compare('s(x),'0()) -> 'GT() 'compare('s(x),'s(y)) -> 'compare(x,y) 'less(x,y) -> 'cklt('compare(x,y)) merge(l1,l2) -> merge'1(l1,l2) merge'1(dd(x,xs),l2) -> merge'2(l2,x,xs) merge'1(nil(),l2) -> l2 merge'2(dd(y,ys),x,xs) -> merge'3('less(x,y),x,xs,y,ys) merge'2(nil(),x,xs) -> dd(x,xs) merge'3('false(),x,xs,y,ys) -> dd(y,merge(dd(x,xs),ys)) merge'3('true(),x,xs,y,ys) -> dd(x,merge(xs,dd(y,ys))) mergesort(l) -> mergesort'1(l) mergesort'1(dd(x1,xs)) -> mergesort'2(xs,x1) mergesort'1(nil()) -> nil() mergesort'2(dd(x2,xs'),x1) -> mergesort'3(msplit(dd(x1,dd(x2,xs')))) mergesort'2(nil(),x1) -> dd(x1,nil()) mergesort'3(tuple'2(l1,l2)) -> merge(mergesort(l1),mergesort(l2)) msplit(l) -> msplit'1(l) msplit'1(dd(x1,xs)) -> msplit'2(xs,x1) msplit'1(nil()) -> tuple'2(nil(),nil()) msplit'2(dd(x2,xs'),x1) -> msplit'3(msplit(xs'),x1,x2) msplit'2(nil(),x1) -> tuple'2(dd(x1,nil()),nil()) msplit'3(tuple'2(l1,l2),x1,x2) -> tuple'2(dd(x1,l1),dd(x2,l2)) - Signature: {'cklt/1,'compare/2,'less/2,merge/2,merge'1/2,merge'2/3,merge'3/5,mergesort/1,mergesort'1/1,mergesort'2/2 ,mergesort'3/1,msplit/1,msplit'1/1,msplit'2/2,msplit'3/3,'cklt#/1,'compare#/2,'less#/2,merge#/2,merge'1#/2 ,merge'2#/3,merge'3#/5,mergesort#/1,mergesort'1#/1,mergesort'2#/2,mergesort'3#/1,msplit#/1,msplit'1#/1 ,msplit'2#/2,msplit'3#/3} / {'0/0,'EQ/0,'GT/0,'LT/0,'false/0,'neg/1,'pos/1,'s/1,'true/0,dd/2,nil/0,tuple'2/2 ,c_1/0,c_2/0,c_3/0,c_4/0,c_5/0,c_6/0,c_7/0,c_8/0,c_9/1,c_10/0,c_11/0,c_12/0,c_13/1,c_14/0,c_15/1,c_16/1 ,c_17/1,c_18/1,c_19/0,c_20/1,c_21/0,c_22/1,c_23/1,c_24/1,c_25/1,c_26/0,c_27/1,c_28/0,c_29/3,c_30/1,c_31/1 ,c_32/0,c_33/1,c_34/0,c_35/0} - Obligation: innermost runtime complexity wrt. defined symbols {'cklt#,'compare#,'less#,merge#,merge'1#,merge'2#,merge'3# ,mergesort#,mergesort'1#,mergesort'2#,mergesort'3#,msplit#,msplit'1#,msplit'2# ,msplit'3#} and constructors {'0,'EQ,'GT,'LT,'false,'neg,'pos,'s,'true,dd,nil,tuple'2} + Applied Processor: PredecessorEstimationCP {onSelectionCP = any intersect of rules of CDG leaf and strict-rules, withComplexityPair = NaturalMI {miDimension = 1, miDegree = 1, miKind = Algebraic, uargs = UArgs, urules = URules, selector = Nothing}} + Details: We first use the processor NaturalMI {miDimension = 1, miDegree = 1, miKind = Algebraic, uargs = UArgs, urules = URules, selector = Nothing} to orient following rules strictly: 2: merge'1#(dd(x,xs),l2) -> c_18(merge'2#(l2,x,xs)) Consider the set of all dependency pairs 1: merge#(l1,l2) -> c_17(merge'1#(l1,l2)) 2: merge'1#(dd(x,xs),l2) -> c_18(merge'2#(l2,x,xs)) 3: merge'2#(dd(y,ys),x,xs) -> c_20(merge'3#('less(x,y),x,xs,y,ys)) 4: merge'3#('false(),x,xs,y,ys) -> c_22(merge#(dd(x,xs),ys)) 5: merge'3#('true(),x,xs,y,ys) -> c_23(merge#(xs,dd(y,ys))) 6: mergesort#(l) -> mergesort'1#(l) 7: mergesort'1#(dd(x1,xs)) -> mergesort'2#(xs,x1) 8: mergesort'2#(dd(x2,xs'),x1) -> mergesort'3#(msplit(dd(x1,dd(x2,xs')))) 9: mergesort'3#(tuple'2(l1,l2)) -> merge#(mergesort(l1),mergesort(l2)) 10: mergesort'3#(tuple'2(l1,l2)) -> mergesort#(l1) 11: mergesort'3#(tuple'2(l1,l2)) -> mergesort#(l2) Processor NaturalMI {miDimension = 1, miDegree = 1, miKind = Algebraic, uargs = UArgs, urules = URules, selector = Nothing}induces the complexity certificateTIME (?,O(n^1)) SPACE(?,?)on application of the dependency pairs {2} These cover all (indirect) predecessors of dependency pairs {2,3,4,5} their number of applications is equally bounded. The dependency pairs are shifted into the weak component. ****** Step 5.b:4.a:3.b:1.b:1.a:1: NaturalMI WORST_CASE(?,O(n^1)) + Considered Problem: - Strict DPs: merge#(l1,l2) -> c_17(merge'1#(l1,l2)) merge'1#(dd(x,xs),l2) -> c_18(merge'2#(l2,x,xs)) - Weak DPs: merge'2#(dd(y,ys),x,xs) -> c_20(merge'3#('less(x,y),x,xs,y,ys)) merge'3#('false(),x,xs,y,ys) -> c_22(merge#(dd(x,xs),ys)) merge'3#('true(),x,xs,y,ys) -> c_23(merge#(xs,dd(y,ys))) mergesort#(l) -> mergesort'1#(l) mergesort'1#(dd(x1,xs)) -> mergesort'2#(xs,x1) mergesort'2#(dd(x2,xs'),x1) -> mergesort'3#(msplit(dd(x1,dd(x2,xs')))) mergesort'3#(tuple'2(l1,l2)) -> merge#(mergesort(l1),mergesort(l2)) mergesort'3#(tuple'2(l1,l2)) -> mergesort#(l1) mergesort'3#(tuple'2(l1,l2)) -> mergesort#(l2) - Weak TRS: 'cklt('EQ()) -> 'false() 'cklt('GT()) -> 'false() 'cklt('LT()) -> 'true() 'compare('0(),'0()) -> 'EQ() 'compare('0(),'neg(y)) -> 'GT() 'compare('0(),'pos(y)) -> 'LT() 'compare('0(),'s(y)) -> 'LT() 'compare('neg(x),'0()) -> 'LT() 'compare('neg(x),'neg(y)) -> 'compare(y,x) 'compare('neg(x),'pos(y)) -> 'LT() 'compare('pos(x),'0()) -> 'GT() 'compare('pos(x),'neg(y)) -> 'GT() 'compare('pos(x),'pos(y)) -> 'compare(x,y) 'compare('s(x),'0()) -> 'GT() 'compare('s(x),'s(y)) -> 'compare(x,y) 'less(x,y) -> 'cklt('compare(x,y)) merge(l1,l2) -> merge'1(l1,l2) merge'1(dd(x,xs),l2) -> merge'2(l2,x,xs) merge'1(nil(),l2) -> l2 merge'2(dd(y,ys),x,xs) -> merge'3('less(x,y),x,xs,y,ys) merge'2(nil(),x,xs) -> dd(x,xs) merge'3('false(),x,xs,y,ys) -> dd(y,merge(dd(x,xs),ys)) merge'3('true(),x,xs,y,ys) -> dd(x,merge(xs,dd(y,ys))) mergesort(l) -> mergesort'1(l) mergesort'1(dd(x1,xs)) -> mergesort'2(xs,x1) mergesort'1(nil()) -> nil() mergesort'2(dd(x2,xs'),x1) -> mergesort'3(msplit(dd(x1,dd(x2,xs')))) mergesort'2(nil(),x1) -> dd(x1,nil()) mergesort'3(tuple'2(l1,l2)) -> merge(mergesort(l1),mergesort(l2)) msplit(l) -> msplit'1(l) msplit'1(dd(x1,xs)) -> msplit'2(xs,x1) msplit'1(nil()) -> tuple'2(nil(),nil()) msplit'2(dd(x2,xs'),x1) -> msplit'3(msplit(xs'),x1,x2) msplit'2(nil(),x1) -> tuple'2(dd(x1,nil()),nil()) msplit'3(tuple'2(l1,l2),x1,x2) -> tuple'2(dd(x1,l1),dd(x2,l2)) - Signature: {'cklt/1,'compare/2,'less/2,merge/2,merge'1/2,merge'2/3,merge'3/5,mergesort/1,mergesort'1/1,mergesort'2/2 ,mergesort'3/1,msplit/1,msplit'1/1,msplit'2/2,msplit'3/3,'cklt#/1,'compare#/2,'less#/2,merge#/2,merge'1#/2 ,merge'2#/3,merge'3#/5,mergesort#/1,mergesort'1#/1,mergesort'2#/2,mergesort'3#/1,msplit#/1,msplit'1#/1 ,msplit'2#/2,msplit'3#/3} / {'0/0,'EQ/0,'GT/0,'LT/0,'false/0,'neg/1,'pos/1,'s/1,'true/0,dd/2,nil/0,tuple'2/2 ,c_1/0,c_2/0,c_3/0,c_4/0,c_5/0,c_6/0,c_7/0,c_8/0,c_9/1,c_10/0,c_11/0,c_12/0,c_13/1,c_14/0,c_15/1,c_16/1 ,c_17/1,c_18/1,c_19/0,c_20/1,c_21/0,c_22/1,c_23/1,c_24/1,c_25/1,c_26/0,c_27/1,c_28/0,c_29/3,c_30/1,c_31/1 ,c_32/0,c_33/1,c_34/0,c_35/0} - Obligation: innermost runtime complexity wrt. defined symbols {'cklt#,'compare#,'less#,merge#,merge'1#,merge'2#,merge'3# ,mergesort#,mergesort'1#,mergesort'2#,mergesort'3#,msplit#,msplit'1#,msplit'2# ,msplit'3#} and constructors {'0,'EQ,'GT,'LT,'false,'neg,'pos,'s,'true,dd,nil,tuple'2} + Applied Processor: NaturalMI {miDimension = 1, miDegree = 1, miKind = Algebraic, uargs = UArgs, urules = URules, selector = Just first alternative for predecessorEstimation on any intersect of rules of CDG leaf and strict-rules} + Details: We apply a matrix interpretation of kind constructor based matrix interpretation: The following argument positions are considered usable: uargs(c_17) = {1}, uargs(c_18) = {1}, uargs(c_20) = {1}, uargs(c_22) = {1}, uargs(c_23) = {1} Following symbols are considered usable: {'cklt,'less,merge,merge'1,merge'2,merge'3,mergesort,mergesort'1,mergesort'2,mergesort'3,msplit,msplit'1 ,msplit'2,msplit'3,'cklt#,'compare#,'less#,merge#,merge'1#,merge'2#,merge'3#,mergesort#,mergesort'1# ,mergesort'2#,mergesort'3#,msplit#,msplit'1#,msplit'2#,msplit'3#} TcT has computed the following interpretation: p('0) = [0] p('EQ) = [0] p('GT) = [0] p('LT) = [0] p('cklt) = [1] p('compare) = [1] x1 + [3] p('false) = [1] p('less) = [1] p('neg) = [1] p('pos) = [2] p('s) = [4] p('true) = [1] p(dd) = [1] x2 + [2] p(merge) = [1] x1 + [1] x2 + [0] p(merge'1) = [1] x1 + [1] x2 + [0] p(merge'2) = [1] x1 + [1] x3 + [2] p(merge'3) = [1] x3 + [1] x5 + [4] p(mergesort) = [1] x1 + [0] p(mergesort'1) = [1] x1 + [0] p(mergesort'2) = [1] x1 + [2] p(mergesort'3) = [1] x1 + [0] p(msplit) = [1] x1 + [0] p(msplit'1) = [1] x1 + [0] p(msplit'2) = [1] x1 + [2] p(msplit'3) = [1] x1 + [4] p(nil) = [0] p(tuple'2) = [1] x1 + [1] x2 + [0] p('cklt#) = [1] p('compare#) = [1] x2 + [1] p('less#) = [1] x2 + [0] p(merge#) = [2] x1 + [2] x2 + [1] p(merge'1#) = [2] x1 + [2] x2 + [1] p(merge'2#) = [2] x1 + [2] x3 + [4] p(merge'3#) = [4] x1 + [2] x3 + [2] x5 + [1] p(mergesort#) = [2] x1 + [1] p(mergesort'1#) = [2] x1 + [1] p(mergesort'2#) = [2] x1 + [5] p(mergesort'3#) = [2] x1 + [1] p(msplit#) = [4] x1 + [1] p(msplit'1#) = [1] x1 + [4] p(msplit'2#) = [1] x1 + [0] p(msplit'3#) = [4] p(c_1) = [1] p(c_2) = [4] p(c_3) = [1] p(c_4) = [1] p(c_5) = [2] p(c_6) = [2] p(c_7) = [4] p(c_8) = [0] p(c_9) = [1] x1 + [0] p(c_10) = [0] p(c_11) = [4] p(c_12) = [4] p(c_13) = [1] p(c_14) = [1] p(c_15) = [1] x1 + [0] p(c_16) = [1] p(c_17) = [1] x1 + [0] p(c_18) = [1] x1 + [0] p(c_19) = [0] p(c_20) = [1] x1 + [3] p(c_21) = [0] p(c_22) = [1] x1 + [0] p(c_23) = [1] x1 + [0] p(c_24) = [2] x1 + [0] p(c_25) = [4] x1 + [0] p(c_26) = [4] p(c_27) = [1] x1 + [1] p(c_28) = [2] p(c_29) = [4] x1 + [1] x3 + [1] p(c_30) = [2] x1 + [1] p(c_31) = [0] p(c_32) = [0] p(c_33) = [0] p(c_34) = [4] p(c_35) = [0] Following rules are strictly oriented: merge'1#(dd(x,xs),l2) = [2] l2 + [2] xs + [5] > [2] l2 + [2] xs + [4] = c_18(merge'2#(l2,x,xs)) Following rules are (at-least) weakly oriented: merge#(l1,l2) = [2] l1 + [2] l2 + [1] >= [2] l1 + [2] l2 + [1] = c_17(merge'1#(l1,l2)) merge'2#(dd(y,ys),x,xs) = [2] xs + [2] ys + [8] >= [2] xs + [2] ys + [8] = c_20(merge'3#('less(x,y),x,xs,y,ys)) merge'3#('false(),x,xs,y,ys) = [2] xs + [2] ys + [5] >= [2] xs + [2] ys + [5] = c_22(merge#(dd(x,xs),ys)) merge'3#('true(),x,xs,y,ys) = [2] xs + [2] ys + [5] >= [2] xs + [2] ys + [5] = c_23(merge#(xs,dd(y,ys))) mergesort#(l) = [2] l + [1] >= [2] l + [1] = mergesort'1#(l) mergesort'1#(dd(x1,xs)) = [2] xs + [5] >= [2] xs + [5] = mergesort'2#(xs,x1) mergesort'2#(dd(x2,xs'),x1) = [2] xs' + [9] >= [2] xs' + [9] = mergesort'3#(msplit(dd(x1,dd(x2,xs')))) mergesort'3#(tuple'2(l1,l2)) = [2] l1 + [2] l2 + [1] >= [2] l1 + [2] l2 + [1] = merge#(mergesort(l1),mergesort(l2)) mergesort'3#(tuple'2(l1,l2)) = [2] l1 + [2] l2 + [1] >= [2] l1 + [1] = mergesort#(l1) mergesort'3#(tuple'2(l1,l2)) = [2] l1 + [2] l2 + [1] >= [2] l2 + [1] = mergesort#(l2) 'cklt('EQ()) = [1] >= [1] = 'false() 'cklt('GT()) = [1] >= [1] = 'false() 'cklt('LT()) = [1] >= [1] = 'true() 'less(x,y) = [1] >= [1] = 'cklt('compare(x,y)) merge(l1,l2) = [1] l1 + [1] l2 + [0] >= [1] l1 + [1] l2 + [0] = merge'1(l1,l2) merge'1(dd(x,xs),l2) = [1] l2 + [1] xs + [2] >= [1] l2 + [1] xs + [2] = merge'2(l2,x,xs) merge'1(nil(),l2) = [1] l2 + [0] >= [1] l2 + [0] = l2 merge'2(dd(y,ys),x,xs) = [1] xs + [1] ys + [4] >= [1] xs + [1] ys + [4] = merge'3('less(x,y),x,xs,y,ys) merge'2(nil(),x,xs) = [1] xs + [2] >= [1] xs + [2] = dd(x,xs) merge'3('false(),x,xs,y,ys) = [1] xs + [1] ys + [4] >= [1] xs + [1] ys + [4] = dd(y,merge(dd(x,xs),ys)) merge'3('true(),x,xs,y,ys) = [1] xs + [1] ys + [4] >= [1] xs + [1] ys + [4] = dd(x,merge(xs,dd(y,ys))) mergesort(l) = [1] l + [0] >= [1] l + [0] = mergesort'1(l) mergesort'1(dd(x1,xs)) = [1] xs + [2] >= [1] xs + [2] = mergesort'2(xs,x1) mergesort'1(nil()) = [0] >= [0] = nil() mergesort'2(dd(x2,xs'),x1) = [1] xs' + [4] >= [1] xs' + [4] = mergesort'3(msplit(dd(x1,dd(x2,xs')))) mergesort'2(nil(),x1) = [2] >= [2] = dd(x1,nil()) mergesort'3(tuple'2(l1,l2)) = [1] l1 + [1] l2 + [0] >= [1] l1 + [1] l2 + [0] = merge(mergesort(l1),mergesort(l2)) msplit(l) = [1] l + [0] >= [1] l + [0] = msplit'1(l) msplit'1(dd(x1,xs)) = [1] xs + [2] >= [1] xs + [2] = msplit'2(xs,x1) msplit'1(nil()) = [0] >= [0] = tuple'2(nil(),nil()) msplit'2(dd(x2,xs'),x1) = [1] xs' + [4] >= [1] xs' + [4] = msplit'3(msplit(xs'),x1,x2) msplit'2(nil(),x1) = [2] >= [2] = tuple'2(dd(x1,nil()),nil()) msplit'3(tuple'2(l1,l2),x1,x2) = [1] l1 + [1] l2 + [4] >= [1] l1 + [1] l2 + [4] = tuple'2(dd(x1,l1),dd(x2,l2)) ****** Step 5.b:4.a:3.b:1.b:1.a:2: Assumption WORST_CASE(?,O(1)) + Considered Problem: - Strict DPs: merge#(l1,l2) -> c_17(merge'1#(l1,l2)) - Weak DPs: merge'1#(dd(x,xs),l2) -> c_18(merge'2#(l2,x,xs)) merge'2#(dd(y,ys),x,xs) -> c_20(merge'3#('less(x,y),x,xs,y,ys)) merge'3#('false(),x,xs,y,ys) -> c_22(merge#(dd(x,xs),ys)) merge'3#('true(),x,xs,y,ys) -> c_23(merge#(xs,dd(y,ys))) mergesort#(l) -> mergesort'1#(l) mergesort'1#(dd(x1,xs)) -> mergesort'2#(xs,x1) mergesort'2#(dd(x2,xs'),x1) -> mergesort'3#(msplit(dd(x1,dd(x2,xs')))) mergesort'3#(tuple'2(l1,l2)) -> merge#(mergesort(l1),mergesort(l2)) mergesort'3#(tuple'2(l1,l2)) -> mergesort#(l1) mergesort'3#(tuple'2(l1,l2)) -> mergesort#(l2) - Weak TRS: 'cklt('EQ()) -> 'false() 'cklt('GT()) -> 'false() 'cklt('LT()) -> 'true() 'compare('0(),'0()) -> 'EQ() 'compare('0(),'neg(y)) -> 'GT() 'compare('0(),'pos(y)) -> 'LT() 'compare('0(),'s(y)) -> 'LT() 'compare('neg(x),'0()) -> 'LT() 'compare('neg(x),'neg(y)) -> 'compare(y,x) 'compare('neg(x),'pos(y)) -> 'LT() 'compare('pos(x),'0()) -> 'GT() 'compare('pos(x),'neg(y)) -> 'GT() 'compare('pos(x),'pos(y)) -> 'compare(x,y) 'compare('s(x),'0()) -> 'GT() 'compare('s(x),'s(y)) -> 'compare(x,y) 'less(x,y) -> 'cklt('compare(x,y)) merge(l1,l2) -> merge'1(l1,l2) merge'1(dd(x,xs),l2) -> merge'2(l2,x,xs) merge'1(nil(),l2) -> l2 merge'2(dd(y,ys),x,xs) -> merge'3('less(x,y),x,xs,y,ys) merge'2(nil(),x,xs) -> dd(x,xs) merge'3('false(),x,xs,y,ys) -> dd(y,merge(dd(x,xs),ys)) merge'3('true(),x,xs,y,ys) -> dd(x,merge(xs,dd(y,ys))) mergesort(l) -> mergesort'1(l) mergesort'1(dd(x1,xs)) -> mergesort'2(xs,x1) mergesort'1(nil()) -> nil() mergesort'2(dd(x2,xs'),x1) -> mergesort'3(msplit(dd(x1,dd(x2,xs')))) mergesort'2(nil(),x1) -> dd(x1,nil()) mergesort'3(tuple'2(l1,l2)) -> merge(mergesort(l1),mergesort(l2)) msplit(l) -> msplit'1(l) msplit'1(dd(x1,xs)) -> msplit'2(xs,x1) msplit'1(nil()) -> tuple'2(nil(),nil()) msplit'2(dd(x2,xs'),x1) -> msplit'3(msplit(xs'),x1,x2) msplit'2(nil(),x1) -> tuple'2(dd(x1,nil()),nil()) msplit'3(tuple'2(l1,l2),x1,x2) -> tuple'2(dd(x1,l1),dd(x2,l2)) - Signature: {'cklt/1,'compare/2,'less/2,merge/2,merge'1/2,merge'2/3,merge'3/5,mergesort/1,mergesort'1/1,mergesort'2/2 ,mergesort'3/1,msplit/1,msplit'1/1,msplit'2/2,msplit'3/3,'cklt#/1,'compare#/2,'less#/2,merge#/2,merge'1#/2 ,merge'2#/3,merge'3#/5,mergesort#/1,mergesort'1#/1,mergesort'2#/2,mergesort'3#/1,msplit#/1,msplit'1#/1 ,msplit'2#/2,msplit'3#/3} / {'0/0,'EQ/0,'GT/0,'LT/0,'false/0,'neg/1,'pos/1,'s/1,'true/0,dd/2,nil/0,tuple'2/2 ,c_1/0,c_2/0,c_3/0,c_4/0,c_5/0,c_6/0,c_7/0,c_8/0,c_9/1,c_10/0,c_11/0,c_12/0,c_13/1,c_14/0,c_15/1,c_16/1 ,c_17/1,c_18/1,c_19/0,c_20/1,c_21/0,c_22/1,c_23/1,c_24/1,c_25/1,c_26/0,c_27/1,c_28/0,c_29/3,c_30/1,c_31/1 ,c_32/0,c_33/1,c_34/0,c_35/0} - Obligation: innermost runtime complexity wrt. defined symbols {'cklt#,'compare#,'less#,merge#,merge'1#,merge'2#,merge'3# ,mergesort#,mergesort'1#,mergesort'2#,mergesort'3#,msplit#,msplit'1#,msplit'2# ,msplit'3#} and constructors {'0,'EQ,'GT,'LT,'false,'neg,'pos,'s,'true,dd,nil,tuple'2} + Applied Processor: Assumption {assumed = Certificate {spaceUB = Unknown, spaceLB = Unknown, timeUB = Poly (Just 0), timeLB = Unknown}} + Details: () ****** Step 5.b:4.a:3.b:1.b:1.b:1: PredecessorEstimationCP WORST_CASE(?,O(n^1)) + Considered Problem: - Strict DPs: merge#(l1,l2) -> c_17(merge'1#(l1,l2)) - Weak DPs: merge'1#(dd(x,xs),l2) -> c_18(merge'2#(l2,x,xs)) merge'2#(dd(y,ys),x,xs) -> c_20(merge'3#('less(x,y),x,xs,y,ys)) merge'3#('false(),x,xs,y,ys) -> c_22(merge#(dd(x,xs),ys)) merge'3#('true(),x,xs,y,ys) -> c_23(merge#(xs,dd(y,ys))) mergesort#(l) -> mergesort'1#(l) mergesort'1#(dd(x1,xs)) -> mergesort'2#(xs,x1) mergesort'2#(dd(x2,xs'),x1) -> mergesort'3#(msplit(dd(x1,dd(x2,xs')))) mergesort'3#(tuple'2(l1,l2)) -> merge#(mergesort(l1),mergesort(l2)) mergesort'3#(tuple'2(l1,l2)) -> mergesort#(l1) mergesort'3#(tuple'2(l1,l2)) -> mergesort#(l2) - Weak TRS: 'cklt('EQ()) -> 'false() 'cklt('GT()) -> 'false() 'cklt('LT()) -> 'true() 'compare('0(),'0()) -> 'EQ() 'compare('0(),'neg(y)) -> 'GT() 'compare('0(),'pos(y)) -> 'LT() 'compare('0(),'s(y)) -> 'LT() 'compare('neg(x),'0()) -> 'LT() 'compare('neg(x),'neg(y)) -> 'compare(y,x) 'compare('neg(x),'pos(y)) -> 'LT() 'compare('pos(x),'0()) -> 'GT() 'compare('pos(x),'neg(y)) -> 'GT() 'compare('pos(x),'pos(y)) -> 'compare(x,y) 'compare('s(x),'0()) -> 'GT() 'compare('s(x),'s(y)) -> 'compare(x,y) 'less(x,y) -> 'cklt('compare(x,y)) merge(l1,l2) -> merge'1(l1,l2) merge'1(dd(x,xs),l2) -> merge'2(l2,x,xs) merge'1(nil(),l2) -> l2 merge'2(dd(y,ys),x,xs) -> merge'3('less(x,y),x,xs,y,ys) merge'2(nil(),x,xs) -> dd(x,xs) merge'3('false(),x,xs,y,ys) -> dd(y,merge(dd(x,xs),ys)) merge'3('true(),x,xs,y,ys) -> dd(x,merge(xs,dd(y,ys))) mergesort(l) -> mergesort'1(l) mergesort'1(dd(x1,xs)) -> mergesort'2(xs,x1) mergesort'1(nil()) -> nil() mergesort'2(dd(x2,xs'),x1) -> mergesort'3(msplit(dd(x1,dd(x2,xs')))) mergesort'2(nil(),x1) -> dd(x1,nil()) mergesort'3(tuple'2(l1,l2)) -> merge(mergesort(l1),mergesort(l2)) msplit(l) -> msplit'1(l) msplit'1(dd(x1,xs)) -> msplit'2(xs,x1) msplit'1(nil()) -> tuple'2(nil(),nil()) msplit'2(dd(x2,xs'),x1) -> msplit'3(msplit(xs'),x1,x2) msplit'2(nil(),x1) -> tuple'2(dd(x1,nil()),nil()) msplit'3(tuple'2(l1,l2),x1,x2) -> tuple'2(dd(x1,l1),dd(x2,l2)) - Signature: {'cklt/1,'compare/2,'less/2,merge/2,merge'1/2,merge'2/3,merge'3/5,mergesort/1,mergesort'1/1,mergesort'2/2 ,mergesort'3/1,msplit/1,msplit'1/1,msplit'2/2,msplit'3/3,'cklt#/1,'compare#/2,'less#/2,merge#/2,merge'1#/2 ,merge'2#/3,merge'3#/5,mergesort#/1,mergesort'1#/1,mergesort'2#/2,mergesort'3#/1,msplit#/1,msplit'1#/1 ,msplit'2#/2,msplit'3#/3} / {'0/0,'EQ/0,'GT/0,'LT/0,'false/0,'neg/1,'pos/1,'s/1,'true/0,dd/2,nil/0,tuple'2/2 ,c_1/0,c_2/0,c_3/0,c_4/0,c_5/0,c_6/0,c_7/0,c_8/0,c_9/1,c_10/0,c_11/0,c_12/0,c_13/1,c_14/0,c_15/1,c_16/1 ,c_17/1,c_18/1,c_19/0,c_20/1,c_21/0,c_22/1,c_23/1,c_24/1,c_25/1,c_26/0,c_27/1,c_28/0,c_29/3,c_30/1,c_31/1 ,c_32/0,c_33/1,c_34/0,c_35/0} - Obligation: innermost runtime complexity wrt. defined symbols {'cklt#,'compare#,'less#,merge#,merge'1#,merge'2#,merge'3# ,mergesort#,mergesort'1#,mergesort'2#,mergesort'3#,msplit#,msplit'1#,msplit'2# ,msplit'3#} and constructors {'0,'EQ,'GT,'LT,'false,'neg,'pos,'s,'true,dd,nil,tuple'2} + Applied Processor: PredecessorEstimationCP {onSelectionCP = any intersect of rules of CDG leaf and strict-rules, withComplexityPair = NaturalMI {miDimension = 1, miDegree = 1, miKind = Algebraic, uargs = UArgs, urules = URules, selector = Nothing}} + Details: We first use the processor NaturalMI {miDimension = 1, miDegree = 1, miKind = Algebraic, uargs = UArgs, urules = URules, selector = Nothing} to orient following rules strictly: 1: merge#(l1,l2) -> c_17(merge'1#(l1,l2)) Consider the set of all dependency pairs 1: merge#(l1,l2) -> c_17(merge'1#(l1,l2)) 2: merge'1#(dd(x,xs),l2) -> c_18(merge'2#(l2,x,xs)) 3: merge'2#(dd(y,ys),x,xs) -> c_20(merge'3#('less(x,y),x,xs,y,ys)) 4: merge'3#('false(),x,xs,y,ys) -> c_22(merge#(dd(x,xs),ys)) 5: merge'3#('true(),x,xs,y,ys) -> c_23(merge#(xs,dd(y,ys))) 6: mergesort#(l) -> mergesort'1#(l) 7: mergesort'1#(dd(x1,xs)) -> mergesort'2#(xs,x1) 8: mergesort'2#(dd(x2,xs'),x1) -> mergesort'3#(msplit(dd(x1,dd(x2,xs')))) 9: mergesort'3#(tuple'2(l1,l2)) -> merge#(mergesort(l1),mergesort(l2)) 10: mergesort'3#(tuple'2(l1,l2)) -> mergesort#(l1) 11: mergesort'3#(tuple'2(l1,l2)) -> mergesort#(l2) Processor NaturalMI {miDimension = 1, miDegree = 1, miKind = Algebraic, uargs = UArgs, urules = URules, selector = Nothing}induces the complexity certificateTIME (?,O(n^1)) SPACE(?,?)on application of the dependency pairs {1} These cover all (indirect) predecessors of dependency pairs {1,2,3,4,5} their number of applications is equally bounded. The dependency pairs are shifted into the weak component. ******* Step 5.b:4.a:3.b:1.b:1.b:1.a:1: NaturalMI WORST_CASE(?,O(n^1)) + Considered Problem: - Strict DPs: merge#(l1,l2) -> c_17(merge'1#(l1,l2)) - Weak DPs: merge'1#(dd(x,xs),l2) -> c_18(merge'2#(l2,x,xs)) merge'2#(dd(y,ys),x,xs) -> c_20(merge'3#('less(x,y),x,xs,y,ys)) merge'3#('false(),x,xs,y,ys) -> c_22(merge#(dd(x,xs),ys)) merge'3#('true(),x,xs,y,ys) -> c_23(merge#(xs,dd(y,ys))) mergesort#(l) -> mergesort'1#(l) mergesort'1#(dd(x1,xs)) -> mergesort'2#(xs,x1) mergesort'2#(dd(x2,xs'),x1) -> mergesort'3#(msplit(dd(x1,dd(x2,xs')))) mergesort'3#(tuple'2(l1,l2)) -> merge#(mergesort(l1),mergesort(l2)) mergesort'3#(tuple'2(l1,l2)) -> mergesort#(l1) mergesort'3#(tuple'2(l1,l2)) -> mergesort#(l2) - Weak TRS: 'cklt('EQ()) -> 'false() 'cklt('GT()) -> 'false() 'cklt('LT()) -> 'true() 'compare('0(),'0()) -> 'EQ() 'compare('0(),'neg(y)) -> 'GT() 'compare('0(),'pos(y)) -> 'LT() 'compare('0(),'s(y)) -> 'LT() 'compare('neg(x),'0()) -> 'LT() 'compare('neg(x),'neg(y)) -> 'compare(y,x) 'compare('neg(x),'pos(y)) -> 'LT() 'compare('pos(x),'0()) -> 'GT() 'compare('pos(x),'neg(y)) -> 'GT() 'compare('pos(x),'pos(y)) -> 'compare(x,y) 'compare('s(x),'0()) -> 'GT() 'compare('s(x),'s(y)) -> 'compare(x,y) 'less(x,y) -> 'cklt('compare(x,y)) merge(l1,l2) -> merge'1(l1,l2) merge'1(dd(x,xs),l2) -> merge'2(l2,x,xs) merge'1(nil(),l2) -> l2 merge'2(dd(y,ys),x,xs) -> merge'3('less(x,y),x,xs,y,ys) merge'2(nil(),x,xs) -> dd(x,xs) merge'3('false(),x,xs,y,ys) -> dd(y,merge(dd(x,xs),ys)) merge'3('true(),x,xs,y,ys) -> dd(x,merge(xs,dd(y,ys))) mergesort(l) -> mergesort'1(l) mergesort'1(dd(x1,xs)) -> mergesort'2(xs,x1) mergesort'1(nil()) -> nil() mergesort'2(dd(x2,xs'),x1) -> mergesort'3(msplit(dd(x1,dd(x2,xs')))) mergesort'2(nil(),x1) -> dd(x1,nil()) mergesort'3(tuple'2(l1,l2)) -> merge(mergesort(l1),mergesort(l2)) msplit(l) -> msplit'1(l) msplit'1(dd(x1,xs)) -> msplit'2(xs,x1) msplit'1(nil()) -> tuple'2(nil(),nil()) msplit'2(dd(x2,xs'),x1) -> msplit'3(msplit(xs'),x1,x2) msplit'2(nil(),x1) -> tuple'2(dd(x1,nil()),nil()) msplit'3(tuple'2(l1,l2),x1,x2) -> tuple'2(dd(x1,l1),dd(x2,l2)) - Signature: {'cklt/1,'compare/2,'less/2,merge/2,merge'1/2,merge'2/3,merge'3/5,mergesort/1,mergesort'1/1,mergesort'2/2 ,mergesort'3/1,msplit/1,msplit'1/1,msplit'2/2,msplit'3/3,'cklt#/1,'compare#/2,'less#/2,merge#/2,merge'1#/2 ,merge'2#/3,merge'3#/5,mergesort#/1,mergesort'1#/1,mergesort'2#/2,mergesort'3#/1,msplit#/1,msplit'1#/1 ,msplit'2#/2,msplit'3#/3} / {'0/0,'EQ/0,'GT/0,'LT/0,'false/0,'neg/1,'pos/1,'s/1,'true/0,dd/2,nil/0,tuple'2/2 ,c_1/0,c_2/0,c_3/0,c_4/0,c_5/0,c_6/0,c_7/0,c_8/0,c_9/1,c_10/0,c_11/0,c_12/0,c_13/1,c_14/0,c_15/1,c_16/1 ,c_17/1,c_18/1,c_19/0,c_20/1,c_21/0,c_22/1,c_23/1,c_24/1,c_25/1,c_26/0,c_27/1,c_28/0,c_29/3,c_30/1,c_31/1 ,c_32/0,c_33/1,c_34/0,c_35/0} - Obligation: innermost runtime complexity wrt. defined symbols {'cklt#,'compare#,'less#,merge#,merge'1#,merge'2#,merge'3# ,mergesort#,mergesort'1#,mergesort'2#,mergesort'3#,msplit#,msplit'1#,msplit'2# ,msplit'3#} and constructors {'0,'EQ,'GT,'LT,'false,'neg,'pos,'s,'true,dd,nil,tuple'2} + Applied Processor: NaturalMI {miDimension = 1, miDegree = 1, miKind = Algebraic, uargs = UArgs, urules = URules, selector = Just first alternative for predecessorEstimation on any intersect of rules of CDG leaf and strict-rules} + Details: We apply a matrix interpretation of kind constructor based matrix interpretation: The following argument positions are considered usable: uargs(c_17) = {1}, uargs(c_18) = {1}, uargs(c_20) = {1}, uargs(c_22) = {1}, uargs(c_23) = {1} Following symbols are considered usable: {merge,merge'1,merge'2,merge'3,mergesort,mergesort'1,mergesort'2,mergesort'3,msplit,msplit'1,msplit'2 ,msplit'3,'cklt#,'compare#,'less#,merge#,merge'1#,merge'2#,merge'3#,mergesort#,mergesort'1#,mergesort'2# ,mergesort'3#,msplit#,msplit'1#,msplit'2#,msplit'3#} TcT has computed the following interpretation: p('0) = [0] p('EQ) = [0] p('GT) = [0] p('LT) = [0] p('cklt) = [2] x1 + [1] p('compare) = [3] x1 + [7] x2 + [3] p('false) = [0] p('less) = [1] x1 + [0] p('neg) = [0] p('pos) = [1] x1 + [1] p('s) = [1] x1 + [0] p('true) = [0] p(dd) = [1] x2 + [1] p(merge) = [1] x1 + [1] x2 + [0] p(merge'1) = [1] x1 + [1] x2 + [0] p(merge'2) = [1] x1 + [1] x3 + [1] p(merge'3) = [1] x3 + [1] x5 + [2] p(mergesort) = [1] x1 + [0] p(mergesort'1) = [1] x1 + [0] p(mergesort'2) = [1] x1 + [1] p(mergesort'3) = [1] x1 + [0] p(msplit) = [1] x1 + [0] p(msplit'1) = [1] x1 + [0] p(msplit'2) = [1] x1 + [1] p(msplit'3) = [1] x1 + [2] p(nil) = [0] p(tuple'2) = [1] x1 + [1] x2 + [0] p('cklt#) = [1] x1 + [4] p('compare#) = [1] x1 + [0] p('less#) = [1] p(merge#) = [4] x1 + [4] x2 + [1] p(merge'1#) = [4] x1 + [4] x2 + [0] p(merge'2#) = [4] x1 + [4] x3 + [1] p(merge'3#) = [4] x3 + [4] x5 + [5] p(mergesort#) = [4] x1 + [1] p(mergesort'1#) = [4] x1 + [1] p(mergesort'2#) = [4] x1 + [5] p(mergesort'3#) = [4] x1 + [1] p(msplit#) = [0] p(msplit'1#) = [1] p(msplit'2#) = [2] x2 + [1] p(msplit'3#) = [1] x1 + [1] x3 + [2] p(c_1) = [0] p(c_2) = [1] p(c_3) = [0] p(c_4) = [1] p(c_5) = [0] p(c_6) = [0] p(c_7) = [1] p(c_8) = [0] p(c_9) = [2] p(c_10) = [2] p(c_11) = [2] p(c_12) = [0] p(c_13) = [1] x1 + [2] p(c_14) = [1] p(c_15) = [4] x1 + [1] p(c_16) = [1] x1 + [1] p(c_17) = [1] x1 + [0] p(c_18) = [1] x1 + [3] p(c_19) = [0] p(c_20) = [1] x1 + [0] p(c_21) = [2] p(c_22) = [1] x1 + [0] p(c_23) = [1] x1 + [0] p(c_24) = [1] p(c_25) = [1] x1 + [4] p(c_26) = [2] p(c_27) = [4] x1 + [1] p(c_28) = [2] p(c_29) = [1] x1 + [1] x2 + [2] x3 + [4] p(c_30) = [0] p(c_31) = [2] x1 + [1] p(c_32) = [4] p(c_33) = [2] p(c_34) = [4] p(c_35) = [0] Following rules are strictly oriented: merge#(l1,l2) = [4] l1 + [4] l2 + [1] > [4] l1 + [4] l2 + [0] = c_17(merge'1#(l1,l2)) Following rules are (at-least) weakly oriented: merge'1#(dd(x,xs),l2) = [4] l2 + [4] xs + [4] >= [4] l2 + [4] xs + [4] = c_18(merge'2#(l2,x,xs)) merge'2#(dd(y,ys),x,xs) = [4] xs + [4] ys + [5] >= [4] xs + [4] ys + [5] = c_20(merge'3#('less(x,y),x,xs,y,ys)) merge'3#('false(),x,xs,y,ys) = [4] xs + [4] ys + [5] >= [4] xs + [4] ys + [5] = c_22(merge#(dd(x,xs),ys)) merge'3#('true(),x,xs,y,ys) = [4] xs + [4] ys + [5] >= [4] xs + [4] ys + [5] = c_23(merge#(xs,dd(y,ys))) mergesort#(l) = [4] l + [1] >= [4] l + [1] = mergesort'1#(l) mergesort'1#(dd(x1,xs)) = [4] xs + [5] >= [4] xs + [5] = mergesort'2#(xs,x1) mergesort'2#(dd(x2,xs'),x1) = [4] xs' + [9] >= [4] xs' + [9] = mergesort'3#(msplit(dd(x1,dd(x2,xs')))) mergesort'3#(tuple'2(l1,l2)) = [4] l1 + [4] l2 + [1] >= [4] l1 + [4] l2 + [1] = merge#(mergesort(l1),mergesort(l2)) mergesort'3#(tuple'2(l1,l2)) = [4] l1 + [4] l2 + [1] >= [4] l1 + [1] = mergesort#(l1) mergesort'3#(tuple'2(l1,l2)) = [4] l1 + [4] l2 + [1] >= [4] l2 + [1] = mergesort#(l2) merge(l1,l2) = [1] l1 + [1] l2 + [0] >= [1] l1 + [1] l2 + [0] = merge'1(l1,l2) merge'1(dd(x,xs),l2) = [1] l2 + [1] xs + [1] >= [1] l2 + [1] xs + [1] = merge'2(l2,x,xs) merge'1(nil(),l2) = [1] l2 + [0] >= [1] l2 + [0] = l2 merge'2(dd(y,ys),x,xs) = [1] xs + [1] ys + [2] >= [1] xs + [1] ys + [2] = merge'3('less(x,y),x,xs,y,ys) merge'2(nil(),x,xs) = [1] xs + [1] >= [1] xs + [1] = dd(x,xs) merge'3('false(),x,xs,y,ys) = [1] xs + [1] ys + [2] >= [1] xs + [1] ys + [2] = dd(y,merge(dd(x,xs),ys)) merge'3('true(),x,xs,y,ys) = [1] xs + [1] ys + [2] >= [1] xs + [1] ys + [2] = dd(x,merge(xs,dd(y,ys))) mergesort(l) = [1] l + [0] >= [1] l + [0] = mergesort'1(l) mergesort'1(dd(x1,xs)) = [1] xs + [1] >= [1] xs + [1] = mergesort'2(xs,x1) mergesort'1(nil()) = [0] >= [0] = nil() mergesort'2(dd(x2,xs'),x1) = [1] xs' + [2] >= [1] xs' + [2] = mergesort'3(msplit(dd(x1,dd(x2,xs')))) mergesort'2(nil(),x1) = [1] >= [1] = dd(x1,nil()) mergesort'3(tuple'2(l1,l2)) = [1] l1 + [1] l2 + [0] >= [1] l1 + [1] l2 + [0] = merge(mergesort(l1),mergesort(l2)) msplit(l) = [1] l + [0] >= [1] l + [0] = msplit'1(l) msplit'1(dd(x1,xs)) = [1] xs + [1] >= [1] xs + [1] = msplit'2(xs,x1) msplit'1(nil()) = [0] >= [0] = tuple'2(nil(),nil()) msplit'2(dd(x2,xs'),x1) = [1] xs' + [2] >= [1] xs' + [2] = msplit'3(msplit(xs'),x1,x2) msplit'2(nil(),x1) = [1] >= [1] = tuple'2(dd(x1,nil()),nil()) msplit'3(tuple'2(l1,l2),x1,x2) = [1] l1 + [1] l2 + [2] >= [1] l1 + [1] l2 + [2] = tuple'2(dd(x1,l1),dd(x2,l2)) ******* Step 5.b:4.a:3.b:1.b:1.b:1.a:2: Assumption WORST_CASE(?,O(1)) + Considered Problem: - Weak DPs: merge#(l1,l2) -> c_17(merge'1#(l1,l2)) merge'1#(dd(x,xs),l2) -> c_18(merge'2#(l2,x,xs)) merge'2#(dd(y,ys),x,xs) -> c_20(merge'3#('less(x,y),x,xs,y,ys)) merge'3#('false(),x,xs,y,ys) -> c_22(merge#(dd(x,xs),ys)) merge'3#('true(),x,xs,y,ys) -> c_23(merge#(xs,dd(y,ys))) mergesort#(l) -> mergesort'1#(l) mergesort'1#(dd(x1,xs)) -> mergesort'2#(xs,x1) mergesort'2#(dd(x2,xs'),x1) -> mergesort'3#(msplit(dd(x1,dd(x2,xs')))) mergesort'3#(tuple'2(l1,l2)) -> merge#(mergesort(l1),mergesort(l2)) mergesort'3#(tuple'2(l1,l2)) -> mergesort#(l1) mergesort'3#(tuple'2(l1,l2)) -> mergesort#(l2) - Weak TRS: 'cklt('EQ()) -> 'false() 'cklt('GT()) -> 'false() 'cklt('LT()) -> 'true() 'compare('0(),'0()) -> 'EQ() 'compare('0(),'neg(y)) -> 'GT() 'compare('0(),'pos(y)) -> 'LT() 'compare('0(),'s(y)) -> 'LT() 'compare('neg(x),'0()) -> 'LT() 'compare('neg(x),'neg(y)) -> 'compare(y,x) 'compare('neg(x),'pos(y)) -> 'LT() 'compare('pos(x),'0()) -> 'GT() 'compare('pos(x),'neg(y)) -> 'GT() 'compare('pos(x),'pos(y)) -> 'compare(x,y) 'compare('s(x),'0()) -> 'GT() 'compare('s(x),'s(y)) -> 'compare(x,y) 'less(x,y) -> 'cklt('compare(x,y)) merge(l1,l2) -> merge'1(l1,l2) merge'1(dd(x,xs),l2) -> merge'2(l2,x,xs) merge'1(nil(),l2) -> l2 merge'2(dd(y,ys),x,xs) -> merge'3('less(x,y),x,xs,y,ys) merge'2(nil(),x,xs) -> dd(x,xs) merge'3('false(),x,xs,y,ys) -> dd(y,merge(dd(x,xs),ys)) merge'3('true(),x,xs,y,ys) -> dd(x,merge(xs,dd(y,ys))) mergesort(l) -> mergesort'1(l) mergesort'1(dd(x1,xs)) -> mergesort'2(xs,x1) mergesort'1(nil()) -> nil() mergesort'2(dd(x2,xs'),x1) -> mergesort'3(msplit(dd(x1,dd(x2,xs')))) mergesort'2(nil(),x1) -> dd(x1,nil()) mergesort'3(tuple'2(l1,l2)) -> merge(mergesort(l1),mergesort(l2)) msplit(l) -> msplit'1(l) msplit'1(dd(x1,xs)) -> msplit'2(xs,x1) msplit'1(nil()) -> tuple'2(nil(),nil()) msplit'2(dd(x2,xs'),x1) -> msplit'3(msplit(xs'),x1,x2) msplit'2(nil(),x1) -> tuple'2(dd(x1,nil()),nil()) msplit'3(tuple'2(l1,l2),x1,x2) -> tuple'2(dd(x1,l1),dd(x2,l2)) - Signature: {'cklt/1,'compare/2,'less/2,merge/2,merge'1/2,merge'2/3,merge'3/5,mergesort/1,mergesort'1/1,mergesort'2/2 ,mergesort'3/1,msplit/1,msplit'1/1,msplit'2/2,msplit'3/3,'cklt#/1,'compare#/2,'less#/2,merge#/2,merge'1#/2 ,merge'2#/3,merge'3#/5,mergesort#/1,mergesort'1#/1,mergesort'2#/2,mergesort'3#/1,msplit#/1,msplit'1#/1 ,msplit'2#/2,msplit'3#/3} / {'0/0,'EQ/0,'GT/0,'LT/0,'false/0,'neg/1,'pos/1,'s/1,'true/0,dd/2,nil/0,tuple'2/2 ,c_1/0,c_2/0,c_3/0,c_4/0,c_5/0,c_6/0,c_7/0,c_8/0,c_9/1,c_10/0,c_11/0,c_12/0,c_13/1,c_14/0,c_15/1,c_16/1 ,c_17/1,c_18/1,c_19/0,c_20/1,c_21/0,c_22/1,c_23/1,c_24/1,c_25/1,c_26/0,c_27/1,c_28/0,c_29/3,c_30/1,c_31/1 ,c_32/0,c_33/1,c_34/0,c_35/0} - Obligation: innermost runtime complexity wrt. defined symbols {'cklt#,'compare#,'less#,merge#,merge'1#,merge'2#,merge'3# ,mergesort#,mergesort'1#,mergesort'2#,mergesort'3#,msplit#,msplit'1#,msplit'2# ,msplit'3#} and constructors {'0,'EQ,'GT,'LT,'false,'neg,'pos,'s,'true,dd,nil,tuple'2} + Applied Processor: Assumption {assumed = Certificate {spaceUB = Unknown, spaceLB = Unknown, timeUB = Poly (Just 0), timeLB = Unknown}} + Details: () ******* Step 5.b:4.a:3.b:1.b:1.b:1.b:1: RemoveWeakSuffixes WORST_CASE(?,O(1)) + Considered Problem: - Weak DPs: merge#(l1,l2) -> c_17(merge'1#(l1,l2)) merge'1#(dd(x,xs),l2) -> c_18(merge'2#(l2,x,xs)) merge'2#(dd(y,ys),x,xs) -> c_20(merge'3#('less(x,y),x,xs,y,ys)) merge'3#('false(),x,xs,y,ys) -> c_22(merge#(dd(x,xs),ys)) merge'3#('true(),x,xs,y,ys) -> c_23(merge#(xs,dd(y,ys))) mergesort#(l) -> mergesort'1#(l) mergesort'1#(dd(x1,xs)) -> mergesort'2#(xs,x1) mergesort'2#(dd(x2,xs'),x1) -> mergesort'3#(msplit(dd(x1,dd(x2,xs')))) mergesort'3#(tuple'2(l1,l2)) -> merge#(mergesort(l1),mergesort(l2)) mergesort'3#(tuple'2(l1,l2)) -> mergesort#(l1) mergesort'3#(tuple'2(l1,l2)) -> mergesort#(l2) - Weak TRS: 'cklt('EQ()) -> 'false() 'cklt('GT()) -> 'false() 'cklt('LT()) -> 'true() 'compare('0(),'0()) -> 'EQ() 'compare('0(),'neg(y)) -> 'GT() 'compare('0(),'pos(y)) -> 'LT() 'compare('0(),'s(y)) -> 'LT() 'compare('neg(x),'0()) -> 'LT() 'compare('neg(x),'neg(y)) -> 'compare(y,x) 'compare('neg(x),'pos(y)) -> 'LT() 'compare('pos(x),'0()) -> 'GT() 'compare('pos(x),'neg(y)) -> 'GT() 'compare('pos(x),'pos(y)) -> 'compare(x,y) 'compare('s(x),'0()) -> 'GT() 'compare('s(x),'s(y)) -> 'compare(x,y) 'less(x,y) -> 'cklt('compare(x,y)) merge(l1,l2) -> merge'1(l1,l2) merge'1(dd(x,xs),l2) -> merge'2(l2,x,xs) merge'1(nil(),l2) -> l2 merge'2(dd(y,ys),x,xs) -> merge'3('less(x,y),x,xs,y,ys) merge'2(nil(),x,xs) -> dd(x,xs) merge'3('false(),x,xs,y,ys) -> dd(y,merge(dd(x,xs),ys)) merge'3('true(),x,xs,y,ys) -> dd(x,merge(xs,dd(y,ys))) mergesort(l) -> mergesort'1(l) mergesort'1(dd(x1,xs)) -> mergesort'2(xs,x1) mergesort'1(nil()) -> nil() mergesort'2(dd(x2,xs'),x1) -> mergesort'3(msplit(dd(x1,dd(x2,xs')))) mergesort'2(nil(),x1) -> dd(x1,nil()) mergesort'3(tuple'2(l1,l2)) -> merge(mergesort(l1),mergesort(l2)) msplit(l) -> msplit'1(l) msplit'1(dd(x1,xs)) -> msplit'2(xs,x1) msplit'1(nil()) -> tuple'2(nil(),nil()) msplit'2(dd(x2,xs'),x1) -> msplit'3(msplit(xs'),x1,x2) msplit'2(nil(),x1) -> tuple'2(dd(x1,nil()),nil()) msplit'3(tuple'2(l1,l2),x1,x2) -> tuple'2(dd(x1,l1),dd(x2,l2)) - Signature: {'cklt/1,'compare/2,'less/2,merge/2,merge'1/2,merge'2/3,merge'3/5,mergesort/1,mergesort'1/1,mergesort'2/2 ,mergesort'3/1,msplit/1,msplit'1/1,msplit'2/2,msplit'3/3,'cklt#/1,'compare#/2,'less#/2,merge#/2,merge'1#/2 ,merge'2#/3,merge'3#/5,mergesort#/1,mergesort'1#/1,mergesort'2#/2,mergesort'3#/1,msplit#/1,msplit'1#/1 ,msplit'2#/2,msplit'3#/3} / {'0/0,'EQ/0,'GT/0,'LT/0,'false/0,'neg/1,'pos/1,'s/1,'true/0,dd/2,nil/0,tuple'2/2 ,c_1/0,c_2/0,c_3/0,c_4/0,c_5/0,c_6/0,c_7/0,c_8/0,c_9/1,c_10/0,c_11/0,c_12/0,c_13/1,c_14/0,c_15/1,c_16/1 ,c_17/1,c_18/1,c_19/0,c_20/1,c_21/0,c_22/1,c_23/1,c_24/1,c_25/1,c_26/0,c_27/1,c_28/0,c_29/3,c_30/1,c_31/1 ,c_32/0,c_33/1,c_34/0,c_35/0} - Obligation: innermost runtime complexity wrt. defined symbols {'cklt#,'compare#,'less#,merge#,merge'1#,merge'2#,merge'3# ,mergesort#,mergesort'1#,mergesort'2#,mergesort'3#,msplit#,msplit'1#,msplit'2# ,msplit'3#} and constructors {'0,'EQ,'GT,'LT,'false,'neg,'pos,'s,'true,dd,nil,tuple'2} + Applied Processor: RemoveWeakSuffixes + Details: Consider the dependency graph 1:W:merge#(l1,l2) -> c_17(merge'1#(l1,l2)) -->_1 merge'1#(dd(x,xs),l2) -> c_18(merge'2#(l2,x,xs)):2 2:W:merge'1#(dd(x,xs),l2) -> c_18(merge'2#(l2,x,xs)) -->_1 merge'2#(dd(y,ys),x,xs) -> c_20(merge'3#('less(x,y),x,xs,y,ys)):3 3:W:merge'2#(dd(y,ys),x,xs) -> c_20(merge'3#('less(x,y),x,xs,y,ys)) -->_1 merge'3#('true(),x,xs,y,ys) -> c_23(merge#(xs,dd(y,ys))):5 -->_1 merge'3#('false(),x,xs,y,ys) -> c_22(merge#(dd(x,xs),ys)):4 4:W:merge'3#('false(),x,xs,y,ys) -> c_22(merge#(dd(x,xs),ys)) -->_1 merge#(l1,l2) -> c_17(merge'1#(l1,l2)):1 5:W:merge'3#('true(),x,xs,y,ys) -> c_23(merge#(xs,dd(y,ys))) -->_1 merge#(l1,l2) -> c_17(merge'1#(l1,l2)):1 6:W:mergesort#(l) -> mergesort'1#(l) -->_1 mergesort'1#(dd(x1,xs)) -> mergesort'2#(xs,x1):7 7:W:mergesort'1#(dd(x1,xs)) -> mergesort'2#(xs,x1) -->_1 mergesort'2#(dd(x2,xs'),x1) -> mergesort'3#(msplit(dd(x1,dd(x2,xs')))):8 8:W:mergesort'2#(dd(x2,xs'),x1) -> mergesort'3#(msplit(dd(x1,dd(x2,xs')))) -->_1 mergesort'3#(tuple'2(l1,l2)) -> mergesort#(l2):11 -->_1 mergesort'3#(tuple'2(l1,l2)) -> mergesort#(l1):10 -->_1 mergesort'3#(tuple'2(l1,l2)) -> merge#(mergesort(l1),mergesort(l2)):9 9:W:mergesort'3#(tuple'2(l1,l2)) -> merge#(mergesort(l1),mergesort(l2)) -->_1 merge#(l1,l2) -> c_17(merge'1#(l1,l2)):1 10:W:mergesort'3#(tuple'2(l1,l2)) -> mergesort#(l1) -->_1 mergesort#(l) -> mergesort'1#(l):6 11:W:mergesort'3#(tuple'2(l1,l2)) -> mergesort#(l2) -->_1 mergesort#(l) -> mergesort'1#(l):6 The following weak DPs constitute a sub-graph of the DG that is closed under successors. The DPs are removed. 6: mergesort#(l) -> mergesort'1#(l) 11: mergesort'3#(tuple'2(l1,l2)) -> mergesort#(l2) 8: mergesort'2#(dd(x2,xs'),x1) -> mergesort'3#(msplit(dd(x1,dd(x2,xs')))) 7: mergesort'1#(dd(x1,xs)) -> mergesort'2#(xs,x1) 10: mergesort'3#(tuple'2(l1,l2)) -> mergesort#(l1) 9: mergesort'3#(tuple'2(l1,l2)) -> merge#(mergesort(l1),mergesort(l2)) 1: merge#(l1,l2) -> c_17(merge'1#(l1,l2)) 5: merge'3#('true(),x,xs,y,ys) -> c_23(merge#(xs,dd(y,ys))) 3: merge'2#(dd(y,ys),x,xs) -> c_20(merge'3#('less(x,y),x,xs,y,ys)) 2: merge'1#(dd(x,xs),l2) -> c_18(merge'2#(l2,x,xs)) 4: merge'3#('false(),x,xs,y,ys) -> c_22(merge#(dd(x,xs),ys)) ******* Step 5.b:4.a:3.b:1.b:1.b:1.b:2: EmptyProcessor WORST_CASE(?,O(1)) + Considered Problem: - Weak TRS: 'cklt('EQ()) -> 'false() 'cklt('GT()) -> 'false() 'cklt('LT()) -> 'true() 'compare('0(),'0()) -> 'EQ() 'compare('0(),'neg(y)) -> 'GT() 'compare('0(),'pos(y)) -> 'LT() 'compare('0(),'s(y)) -> 'LT() 'compare('neg(x),'0()) -> 'LT() 'compare('neg(x),'neg(y)) -> 'compare(y,x) 'compare('neg(x),'pos(y)) -> 'LT() 'compare('pos(x),'0()) -> 'GT() 'compare('pos(x),'neg(y)) -> 'GT() 'compare('pos(x),'pos(y)) -> 'compare(x,y) 'compare('s(x),'0()) -> 'GT() 'compare('s(x),'s(y)) -> 'compare(x,y) 'less(x,y) -> 'cklt('compare(x,y)) merge(l1,l2) -> merge'1(l1,l2) merge'1(dd(x,xs),l2) -> merge'2(l2,x,xs) merge'1(nil(),l2) -> l2 merge'2(dd(y,ys),x,xs) -> merge'3('less(x,y),x,xs,y,ys) merge'2(nil(),x,xs) -> dd(x,xs) merge'3('false(),x,xs,y,ys) -> dd(y,merge(dd(x,xs),ys)) merge'3('true(),x,xs,y,ys) -> dd(x,merge(xs,dd(y,ys))) mergesort(l) -> mergesort'1(l) mergesort'1(dd(x1,xs)) -> mergesort'2(xs,x1) mergesort'1(nil()) -> nil() mergesort'2(dd(x2,xs'),x1) -> mergesort'3(msplit(dd(x1,dd(x2,xs')))) mergesort'2(nil(),x1) -> dd(x1,nil()) mergesort'3(tuple'2(l1,l2)) -> merge(mergesort(l1),mergesort(l2)) msplit(l) -> msplit'1(l) msplit'1(dd(x1,xs)) -> msplit'2(xs,x1) msplit'1(nil()) -> tuple'2(nil(),nil()) msplit'2(dd(x2,xs'),x1) -> msplit'3(msplit(xs'),x1,x2) msplit'2(nil(),x1) -> tuple'2(dd(x1,nil()),nil()) msplit'3(tuple'2(l1,l2),x1,x2) -> tuple'2(dd(x1,l1),dd(x2,l2)) - Signature: {'cklt/1,'compare/2,'less/2,merge/2,merge'1/2,merge'2/3,merge'3/5,mergesort/1,mergesort'1/1,mergesort'2/2 ,mergesort'3/1,msplit/1,msplit'1/1,msplit'2/2,msplit'3/3,'cklt#/1,'compare#/2,'less#/2,merge#/2,merge'1#/2 ,merge'2#/3,merge'3#/5,mergesort#/1,mergesort'1#/1,mergesort'2#/2,mergesort'3#/1,msplit#/1,msplit'1#/1 ,msplit'2#/2,msplit'3#/3} / {'0/0,'EQ/0,'GT/0,'LT/0,'false/0,'neg/1,'pos/1,'s/1,'true/0,dd/2,nil/0,tuple'2/2 ,c_1/0,c_2/0,c_3/0,c_4/0,c_5/0,c_6/0,c_7/0,c_8/0,c_9/1,c_10/0,c_11/0,c_12/0,c_13/1,c_14/0,c_15/1,c_16/1 ,c_17/1,c_18/1,c_19/0,c_20/1,c_21/0,c_22/1,c_23/1,c_24/1,c_25/1,c_26/0,c_27/1,c_28/0,c_29/3,c_30/1,c_31/1 ,c_32/0,c_33/1,c_34/0,c_35/0} - Obligation: innermost runtime complexity wrt. defined symbols {'cklt#,'compare#,'less#,merge#,merge'1#,merge'2#,merge'3# ,mergesort#,mergesort'1#,mergesort'2#,mergesort'3#,msplit#,msplit'1#,msplit'2# ,msplit'3#} and constructors {'0,'EQ,'GT,'LT,'false,'neg,'pos,'s,'true,dd,nil,tuple'2} + Applied Processor: EmptyProcessor + Details: The problem is already closed. The intended complexity is O(1). *** Step 5.b:4.b:1: RemoveWeakSuffixes WORST_CASE(?,O(n^2)) + Considered Problem: - Strict DPs: mergesort#(l) -> c_24(mergesort'1#(l)) mergesort'1#(dd(x1,xs)) -> c_25(mergesort'2#(xs,x1)) mergesort'2#(dd(x2,xs'),x1) -> c_27(mergesort'3#(msplit(dd(x1,dd(x2,xs')))),msplit#(dd(x1,dd(x2,xs')))) mergesort'3#(tuple'2(l1,l2)) -> c_29(merge#(mergesort(l1),mergesort(l2)),mergesort#(l1),mergesort#(l2)) msplit#(l) -> c_30(msplit'1#(l)) msplit'1#(dd(x1,xs)) -> c_31(msplit'2#(xs,x1)) msplit'2#(dd(x2,xs'),x1) -> c_33(msplit#(xs')) - Weak DPs: merge#(l1,l2) -> c_17(merge'1#(l1,l2)) merge'1#(dd(x,xs),l2) -> c_18(merge'2#(l2,x,xs)) merge'2#(dd(y,ys),x,xs) -> c_20(merge'3#('less(x,y),x,xs,y,ys)) merge'3#('false(),x,xs,y,ys) -> c_22(merge#(dd(x,xs),ys)) merge'3#('true(),x,xs,y,ys) -> c_23(merge#(xs,dd(y,ys))) - Weak TRS: 'cklt('EQ()) -> 'false() 'cklt('GT()) -> 'false() 'cklt('LT()) -> 'true() 'compare('0(),'0()) -> 'EQ() 'compare('0(),'neg(y)) -> 'GT() 'compare('0(),'pos(y)) -> 'LT() 'compare('0(),'s(y)) -> 'LT() 'compare('neg(x),'0()) -> 'LT() 'compare('neg(x),'neg(y)) -> 'compare(y,x) 'compare('neg(x),'pos(y)) -> 'LT() 'compare('pos(x),'0()) -> 'GT() 'compare('pos(x),'neg(y)) -> 'GT() 'compare('pos(x),'pos(y)) -> 'compare(x,y) 'compare('s(x),'0()) -> 'GT() 'compare('s(x),'s(y)) -> 'compare(x,y) 'less(x,y) -> 'cklt('compare(x,y)) merge(l1,l2) -> merge'1(l1,l2) merge'1(dd(x,xs),l2) -> merge'2(l2,x,xs) merge'1(nil(),l2) -> l2 merge'2(dd(y,ys),x,xs) -> merge'3('less(x,y),x,xs,y,ys) merge'2(nil(),x,xs) -> dd(x,xs) merge'3('false(),x,xs,y,ys) -> dd(y,merge(dd(x,xs),ys)) merge'3('true(),x,xs,y,ys) -> dd(x,merge(xs,dd(y,ys))) mergesort(l) -> mergesort'1(l) mergesort'1(dd(x1,xs)) -> mergesort'2(xs,x1) mergesort'1(nil()) -> nil() mergesort'2(dd(x2,xs'),x1) -> mergesort'3(msplit(dd(x1,dd(x2,xs')))) mergesort'2(nil(),x1) -> dd(x1,nil()) mergesort'3(tuple'2(l1,l2)) -> merge(mergesort(l1),mergesort(l2)) msplit(l) -> msplit'1(l) msplit'1(dd(x1,xs)) -> msplit'2(xs,x1) msplit'1(nil()) -> tuple'2(nil(),nil()) msplit'2(dd(x2,xs'),x1) -> msplit'3(msplit(xs'),x1,x2) msplit'2(nil(),x1) -> tuple'2(dd(x1,nil()),nil()) msplit'3(tuple'2(l1,l2),x1,x2) -> tuple'2(dd(x1,l1),dd(x2,l2)) - Signature: {'cklt/1,'compare/2,'less/2,merge/2,merge'1/2,merge'2/3,merge'3/5,mergesort/1,mergesort'1/1,mergesort'2/2 ,mergesort'3/1,msplit/1,msplit'1/1,msplit'2/2,msplit'3/3,'cklt#/1,'compare#/2,'less#/2,merge#/2,merge'1#/2 ,merge'2#/3,merge'3#/5,mergesort#/1,mergesort'1#/1,mergesort'2#/2,mergesort'3#/1,msplit#/1,msplit'1#/1 ,msplit'2#/2,msplit'3#/3} / {'0/0,'EQ/0,'GT/0,'LT/0,'false/0,'neg/1,'pos/1,'s/1,'true/0,dd/2,nil/0,tuple'2/2 ,c_1/0,c_2/0,c_3/0,c_4/0,c_5/0,c_6/0,c_7/0,c_8/0,c_9/1,c_10/0,c_11/0,c_12/0,c_13/1,c_14/0,c_15/1,c_16/1 ,c_17/1,c_18/1,c_19/0,c_20/1,c_21/0,c_22/1,c_23/1,c_24/1,c_25/1,c_26/0,c_27/2,c_28/0,c_29/3,c_30/1,c_31/1 ,c_32/0,c_33/1,c_34/0,c_35/0} - Obligation: innermost runtime complexity wrt. defined symbols {'cklt#,'compare#,'less#,merge#,merge'1#,merge'2#,merge'3# ,mergesort#,mergesort'1#,mergesort'2#,mergesort'3#,msplit#,msplit'1#,msplit'2# ,msplit'3#} and constructors {'0,'EQ,'GT,'LT,'false,'neg,'pos,'s,'true,dd,nil,tuple'2} + Applied Processor: RemoveWeakSuffixes + Details: Consider the dependency graph 1:S:mergesort#(l) -> c_24(mergesort'1#(l)) -->_1 mergesort'1#(dd(x1,xs)) -> c_25(mergesort'2#(xs,x1)):2 2:S:mergesort'1#(dd(x1,xs)) -> c_25(mergesort'2#(xs,x1)) -->_1 mergesort'2#(dd(x2,xs'),x1) -> c_27(mergesort'3#(msplit(dd(x1,dd(x2,xs')))) ,msplit#(dd(x1,dd(x2,xs')))):3 3:S:mergesort'2#(dd(x2,xs'),x1) -> c_27(mergesort'3#(msplit(dd(x1,dd(x2,xs')))),msplit#(dd(x1,dd(x2,xs')))) -->_2 msplit#(l) -> c_30(msplit'1#(l)):5 -->_1 mergesort'3#(tuple'2(l1,l2)) -> c_29(merge#(mergesort(l1),mergesort(l2)) ,mergesort#(l1) ,mergesort#(l2)):4 4:S:mergesort'3#(tuple'2(l1,l2)) -> c_29(merge#(mergesort(l1),mergesort(l2)),mergesort#(l1),mergesort#(l2)) -->_1 merge#(l1,l2) -> c_17(merge'1#(l1,l2)):8 -->_3 mergesort#(l) -> c_24(mergesort'1#(l)):1 -->_2 mergesort#(l) -> c_24(mergesort'1#(l)):1 5:S:msplit#(l) -> c_30(msplit'1#(l)) -->_1 msplit'1#(dd(x1,xs)) -> c_31(msplit'2#(xs,x1)):6 6:S:msplit'1#(dd(x1,xs)) -> c_31(msplit'2#(xs,x1)) -->_1 msplit'2#(dd(x2,xs'),x1) -> c_33(msplit#(xs')):7 7:S:msplit'2#(dd(x2,xs'),x1) -> c_33(msplit#(xs')) -->_1 msplit#(l) -> c_30(msplit'1#(l)):5 8:W:merge#(l1,l2) -> c_17(merge'1#(l1,l2)) -->_1 merge'1#(dd(x,xs),l2) -> c_18(merge'2#(l2,x,xs)):9 9:W:merge'1#(dd(x,xs),l2) -> c_18(merge'2#(l2,x,xs)) -->_1 merge'2#(dd(y,ys),x,xs) -> c_20(merge'3#('less(x,y),x,xs,y,ys)):10 10:W:merge'2#(dd(y,ys),x,xs) -> c_20(merge'3#('less(x,y),x,xs,y,ys)) -->_1 merge'3#('true(),x,xs,y,ys) -> c_23(merge#(xs,dd(y,ys))):12 -->_1 merge'3#('false(),x,xs,y,ys) -> c_22(merge#(dd(x,xs),ys)):11 11:W:merge'3#('false(),x,xs,y,ys) -> c_22(merge#(dd(x,xs),ys)) -->_1 merge#(l1,l2) -> c_17(merge'1#(l1,l2)):8 12:W:merge'3#('true(),x,xs,y,ys) -> c_23(merge#(xs,dd(y,ys))) -->_1 merge#(l1,l2) -> c_17(merge'1#(l1,l2)):8 The following weak DPs constitute a sub-graph of the DG that is closed under successors. The DPs are removed. 8: merge#(l1,l2) -> c_17(merge'1#(l1,l2)) 12: merge'3#('true(),x,xs,y,ys) -> c_23(merge#(xs,dd(y,ys))) 10: merge'2#(dd(y,ys),x,xs) -> c_20(merge'3#('less(x,y),x,xs,y,ys)) 9: merge'1#(dd(x,xs),l2) -> c_18(merge'2#(l2,x,xs)) 11: merge'3#('false(),x,xs,y,ys) -> c_22(merge#(dd(x,xs),ys)) *** Step 5.b:4.b:2: SimplifyRHS WORST_CASE(?,O(n^2)) + Considered Problem: - Strict DPs: mergesort#(l) -> c_24(mergesort'1#(l)) mergesort'1#(dd(x1,xs)) -> c_25(mergesort'2#(xs,x1)) mergesort'2#(dd(x2,xs'),x1) -> c_27(mergesort'3#(msplit(dd(x1,dd(x2,xs')))),msplit#(dd(x1,dd(x2,xs')))) mergesort'3#(tuple'2(l1,l2)) -> c_29(merge#(mergesort(l1),mergesort(l2)),mergesort#(l1),mergesort#(l2)) msplit#(l) -> c_30(msplit'1#(l)) msplit'1#(dd(x1,xs)) -> c_31(msplit'2#(xs,x1)) msplit'2#(dd(x2,xs'),x1) -> c_33(msplit#(xs')) - Weak TRS: 'cklt('EQ()) -> 'false() 'cklt('GT()) -> 'false() 'cklt('LT()) -> 'true() 'compare('0(),'0()) -> 'EQ() 'compare('0(),'neg(y)) -> 'GT() 'compare('0(),'pos(y)) -> 'LT() 'compare('0(),'s(y)) -> 'LT() 'compare('neg(x),'0()) -> 'LT() 'compare('neg(x),'neg(y)) -> 'compare(y,x) 'compare('neg(x),'pos(y)) -> 'LT() 'compare('pos(x),'0()) -> 'GT() 'compare('pos(x),'neg(y)) -> 'GT() 'compare('pos(x),'pos(y)) -> 'compare(x,y) 'compare('s(x),'0()) -> 'GT() 'compare('s(x),'s(y)) -> 'compare(x,y) 'less(x,y) -> 'cklt('compare(x,y)) merge(l1,l2) -> merge'1(l1,l2) merge'1(dd(x,xs),l2) -> merge'2(l2,x,xs) merge'1(nil(),l2) -> l2 merge'2(dd(y,ys),x,xs) -> merge'3('less(x,y),x,xs,y,ys) merge'2(nil(),x,xs) -> dd(x,xs) merge'3('false(),x,xs,y,ys) -> dd(y,merge(dd(x,xs),ys)) merge'3('true(),x,xs,y,ys) -> dd(x,merge(xs,dd(y,ys))) mergesort(l) -> mergesort'1(l) mergesort'1(dd(x1,xs)) -> mergesort'2(xs,x1) mergesort'1(nil()) -> nil() mergesort'2(dd(x2,xs'),x1) -> mergesort'3(msplit(dd(x1,dd(x2,xs')))) mergesort'2(nil(),x1) -> dd(x1,nil()) mergesort'3(tuple'2(l1,l2)) -> merge(mergesort(l1),mergesort(l2)) msplit(l) -> msplit'1(l) msplit'1(dd(x1,xs)) -> msplit'2(xs,x1) msplit'1(nil()) -> tuple'2(nil(),nil()) msplit'2(dd(x2,xs'),x1) -> msplit'3(msplit(xs'),x1,x2) msplit'2(nil(),x1) -> tuple'2(dd(x1,nil()),nil()) msplit'3(tuple'2(l1,l2),x1,x2) -> tuple'2(dd(x1,l1),dd(x2,l2)) - Signature: {'cklt/1,'compare/2,'less/2,merge/2,merge'1/2,merge'2/3,merge'3/5,mergesort/1,mergesort'1/1,mergesort'2/2 ,mergesort'3/1,msplit/1,msplit'1/1,msplit'2/2,msplit'3/3,'cklt#/1,'compare#/2,'less#/2,merge#/2,merge'1#/2 ,merge'2#/3,merge'3#/5,mergesort#/1,mergesort'1#/1,mergesort'2#/2,mergesort'3#/1,msplit#/1,msplit'1#/1 ,msplit'2#/2,msplit'3#/3} / {'0/0,'EQ/0,'GT/0,'LT/0,'false/0,'neg/1,'pos/1,'s/1,'true/0,dd/2,nil/0,tuple'2/2 ,c_1/0,c_2/0,c_3/0,c_4/0,c_5/0,c_6/0,c_7/0,c_8/0,c_9/1,c_10/0,c_11/0,c_12/0,c_13/1,c_14/0,c_15/1,c_16/1 ,c_17/1,c_18/1,c_19/0,c_20/1,c_21/0,c_22/1,c_23/1,c_24/1,c_25/1,c_26/0,c_27/2,c_28/0,c_29/3,c_30/1,c_31/1 ,c_32/0,c_33/1,c_34/0,c_35/0} - Obligation: innermost runtime complexity wrt. defined symbols {'cklt#,'compare#,'less#,merge#,merge'1#,merge'2#,merge'3# ,mergesort#,mergesort'1#,mergesort'2#,mergesort'3#,msplit#,msplit'1#,msplit'2# ,msplit'3#} and constructors {'0,'EQ,'GT,'LT,'false,'neg,'pos,'s,'true,dd,nil,tuple'2} + Applied Processor: SimplifyRHS + Details: Consider the dependency graph 1:S:mergesort#(l) -> c_24(mergesort'1#(l)) -->_1 mergesort'1#(dd(x1,xs)) -> c_25(mergesort'2#(xs,x1)):2 2:S:mergesort'1#(dd(x1,xs)) -> c_25(mergesort'2#(xs,x1)) -->_1 mergesort'2#(dd(x2,xs'),x1) -> c_27(mergesort'3#(msplit(dd(x1,dd(x2,xs')))) ,msplit#(dd(x1,dd(x2,xs')))):3 3:S:mergesort'2#(dd(x2,xs'),x1) -> c_27(mergesort'3#(msplit(dd(x1,dd(x2,xs')))),msplit#(dd(x1,dd(x2,xs')))) -->_2 msplit#(l) -> c_30(msplit'1#(l)):5 -->_1 mergesort'3#(tuple'2(l1,l2)) -> c_29(merge#(mergesort(l1),mergesort(l2)) ,mergesort#(l1) ,mergesort#(l2)):4 4:S:mergesort'3#(tuple'2(l1,l2)) -> c_29(merge#(mergesort(l1),mergesort(l2)),mergesort#(l1),mergesort#(l2)) -->_3 mergesort#(l) -> c_24(mergesort'1#(l)):1 -->_2 mergesort#(l) -> c_24(mergesort'1#(l)):1 5:S:msplit#(l) -> c_30(msplit'1#(l)) -->_1 msplit'1#(dd(x1,xs)) -> c_31(msplit'2#(xs,x1)):6 6:S:msplit'1#(dd(x1,xs)) -> c_31(msplit'2#(xs,x1)) -->_1 msplit'2#(dd(x2,xs'),x1) -> c_33(msplit#(xs')):7 7:S:msplit'2#(dd(x2,xs'),x1) -> c_33(msplit#(xs')) -->_1 msplit#(l) -> c_30(msplit'1#(l)):5 Due to missing edges in the depndency graph, the right-hand sides of following rules could be simplified: mergesort'3#(tuple'2(l1,l2)) -> c_29(mergesort#(l1),mergesort#(l2)) *** Step 5.b:4.b:3: UsableRules WORST_CASE(?,O(n^2)) + Considered Problem: - Strict DPs: mergesort#(l) -> c_24(mergesort'1#(l)) mergesort'1#(dd(x1,xs)) -> c_25(mergesort'2#(xs,x1)) mergesort'2#(dd(x2,xs'),x1) -> c_27(mergesort'3#(msplit(dd(x1,dd(x2,xs')))),msplit#(dd(x1,dd(x2,xs')))) mergesort'3#(tuple'2(l1,l2)) -> c_29(mergesort#(l1),mergesort#(l2)) msplit#(l) -> c_30(msplit'1#(l)) msplit'1#(dd(x1,xs)) -> c_31(msplit'2#(xs,x1)) msplit'2#(dd(x2,xs'),x1) -> c_33(msplit#(xs')) - Weak TRS: 'cklt('EQ()) -> 'false() 'cklt('GT()) -> 'false() 'cklt('LT()) -> 'true() 'compare('0(),'0()) -> 'EQ() 'compare('0(),'neg(y)) -> 'GT() 'compare('0(),'pos(y)) -> 'LT() 'compare('0(),'s(y)) -> 'LT() 'compare('neg(x),'0()) -> 'LT() 'compare('neg(x),'neg(y)) -> 'compare(y,x) 'compare('neg(x),'pos(y)) -> 'LT() 'compare('pos(x),'0()) -> 'GT() 'compare('pos(x),'neg(y)) -> 'GT() 'compare('pos(x),'pos(y)) -> 'compare(x,y) 'compare('s(x),'0()) -> 'GT() 'compare('s(x),'s(y)) -> 'compare(x,y) 'less(x,y) -> 'cklt('compare(x,y)) merge(l1,l2) -> merge'1(l1,l2) merge'1(dd(x,xs),l2) -> merge'2(l2,x,xs) merge'1(nil(),l2) -> l2 merge'2(dd(y,ys),x,xs) -> merge'3('less(x,y),x,xs,y,ys) merge'2(nil(),x,xs) -> dd(x,xs) merge'3('false(),x,xs,y,ys) -> dd(y,merge(dd(x,xs),ys)) merge'3('true(),x,xs,y,ys) -> dd(x,merge(xs,dd(y,ys))) mergesort(l) -> mergesort'1(l) mergesort'1(dd(x1,xs)) -> mergesort'2(xs,x1) mergesort'1(nil()) -> nil() mergesort'2(dd(x2,xs'),x1) -> mergesort'3(msplit(dd(x1,dd(x2,xs')))) mergesort'2(nil(),x1) -> dd(x1,nil()) mergesort'3(tuple'2(l1,l2)) -> merge(mergesort(l1),mergesort(l2)) msplit(l) -> msplit'1(l) msplit'1(dd(x1,xs)) -> msplit'2(xs,x1) msplit'1(nil()) -> tuple'2(nil(),nil()) msplit'2(dd(x2,xs'),x1) -> msplit'3(msplit(xs'),x1,x2) msplit'2(nil(),x1) -> tuple'2(dd(x1,nil()),nil()) msplit'3(tuple'2(l1,l2),x1,x2) -> tuple'2(dd(x1,l1),dd(x2,l2)) - Signature: {'cklt/1,'compare/2,'less/2,merge/2,merge'1/2,merge'2/3,merge'3/5,mergesort/1,mergesort'1/1,mergesort'2/2 ,mergesort'3/1,msplit/1,msplit'1/1,msplit'2/2,msplit'3/3,'cklt#/1,'compare#/2,'less#/2,merge#/2,merge'1#/2 ,merge'2#/3,merge'3#/5,mergesort#/1,mergesort'1#/1,mergesort'2#/2,mergesort'3#/1,msplit#/1,msplit'1#/1 ,msplit'2#/2,msplit'3#/3} / {'0/0,'EQ/0,'GT/0,'LT/0,'false/0,'neg/1,'pos/1,'s/1,'true/0,dd/2,nil/0,tuple'2/2 ,c_1/0,c_2/0,c_3/0,c_4/0,c_5/0,c_6/0,c_7/0,c_8/0,c_9/1,c_10/0,c_11/0,c_12/0,c_13/1,c_14/0,c_15/1,c_16/1 ,c_17/1,c_18/1,c_19/0,c_20/1,c_21/0,c_22/1,c_23/1,c_24/1,c_25/1,c_26/0,c_27/2,c_28/0,c_29/2,c_30/1,c_31/1 ,c_32/0,c_33/1,c_34/0,c_35/0} - Obligation: innermost runtime complexity wrt. defined symbols {'cklt#,'compare#,'less#,merge#,merge'1#,merge'2#,merge'3# ,mergesort#,mergesort'1#,mergesort'2#,mergesort'3#,msplit#,msplit'1#,msplit'2# ,msplit'3#} and constructors {'0,'EQ,'GT,'LT,'false,'neg,'pos,'s,'true,dd,nil,tuple'2} + Applied Processor: UsableRules + Details: We replace rewrite rules by usable rules: msplit(l) -> msplit'1(l) msplit'1(dd(x1,xs)) -> msplit'2(xs,x1) msplit'1(nil()) -> tuple'2(nil(),nil()) msplit'2(dd(x2,xs'),x1) -> msplit'3(msplit(xs'),x1,x2) msplit'2(nil(),x1) -> tuple'2(dd(x1,nil()),nil()) msplit'3(tuple'2(l1,l2),x1,x2) -> tuple'2(dd(x1,l1),dd(x2,l2)) mergesort#(l) -> c_24(mergesort'1#(l)) mergesort'1#(dd(x1,xs)) -> c_25(mergesort'2#(xs,x1)) mergesort'2#(dd(x2,xs'),x1) -> c_27(mergesort'3#(msplit(dd(x1,dd(x2,xs')))),msplit#(dd(x1,dd(x2,xs')))) mergesort'3#(tuple'2(l1,l2)) -> c_29(mergesort#(l1),mergesort#(l2)) msplit#(l) -> c_30(msplit'1#(l)) msplit'1#(dd(x1,xs)) -> c_31(msplit'2#(xs,x1)) msplit'2#(dd(x2,xs'),x1) -> c_33(msplit#(xs')) *** Step 5.b:4.b:4: DecomposeDG WORST_CASE(?,O(n^2)) + Considered Problem: - Strict DPs: mergesort#(l) -> c_24(mergesort'1#(l)) mergesort'1#(dd(x1,xs)) -> c_25(mergesort'2#(xs,x1)) mergesort'2#(dd(x2,xs'),x1) -> c_27(mergesort'3#(msplit(dd(x1,dd(x2,xs')))),msplit#(dd(x1,dd(x2,xs')))) mergesort'3#(tuple'2(l1,l2)) -> c_29(mergesort#(l1),mergesort#(l2)) msplit#(l) -> c_30(msplit'1#(l)) msplit'1#(dd(x1,xs)) -> c_31(msplit'2#(xs,x1)) msplit'2#(dd(x2,xs'),x1) -> c_33(msplit#(xs')) - Weak TRS: msplit(l) -> msplit'1(l) msplit'1(dd(x1,xs)) -> msplit'2(xs,x1) msplit'1(nil()) -> tuple'2(nil(),nil()) msplit'2(dd(x2,xs'),x1) -> msplit'3(msplit(xs'),x1,x2) msplit'2(nil(),x1) -> tuple'2(dd(x1,nil()),nil()) msplit'3(tuple'2(l1,l2),x1,x2) -> tuple'2(dd(x1,l1),dd(x2,l2)) - Signature: {'cklt/1,'compare/2,'less/2,merge/2,merge'1/2,merge'2/3,merge'3/5,mergesort/1,mergesort'1/1,mergesort'2/2 ,mergesort'3/1,msplit/1,msplit'1/1,msplit'2/2,msplit'3/3,'cklt#/1,'compare#/2,'less#/2,merge#/2,merge'1#/2 ,merge'2#/3,merge'3#/5,mergesort#/1,mergesort'1#/1,mergesort'2#/2,mergesort'3#/1,msplit#/1,msplit'1#/1 ,msplit'2#/2,msplit'3#/3} / {'0/0,'EQ/0,'GT/0,'LT/0,'false/0,'neg/1,'pos/1,'s/1,'true/0,dd/2,nil/0,tuple'2/2 ,c_1/0,c_2/0,c_3/0,c_4/0,c_5/0,c_6/0,c_7/0,c_8/0,c_9/1,c_10/0,c_11/0,c_12/0,c_13/1,c_14/0,c_15/1,c_16/1 ,c_17/1,c_18/1,c_19/0,c_20/1,c_21/0,c_22/1,c_23/1,c_24/1,c_25/1,c_26/0,c_27/2,c_28/0,c_29/2,c_30/1,c_31/1 ,c_32/0,c_33/1,c_34/0,c_35/0} - Obligation: innermost runtime complexity wrt. defined symbols {'cklt#,'compare#,'less#,merge#,merge'1#,merge'2#,merge'3# ,mergesort#,mergesort'1#,mergesort'2#,mergesort'3#,msplit#,msplit'1#,msplit'2# ,msplit'3#} and constructors {'0,'EQ,'GT,'LT,'false,'neg,'pos,'s,'true,dd,nil,tuple'2} + Applied Processor: DecomposeDG {onSelection = all below first cut in WDG, onUpper = Just someStrategy, onLower = Nothing} + Details: We decompose the input problem according to the dependency graph into the upper component mergesort#(l) -> c_24(mergesort'1#(l)) mergesort'1#(dd(x1,xs)) -> c_25(mergesort'2#(xs,x1)) mergesort'2#(dd(x2,xs'),x1) -> c_27(mergesort'3#(msplit(dd(x1,dd(x2,xs')))),msplit#(dd(x1,dd(x2,xs')))) mergesort'3#(tuple'2(l1,l2)) -> c_29(mergesort#(l1),mergesort#(l2)) and a lower component msplit#(l) -> c_30(msplit'1#(l)) msplit'1#(dd(x1,xs)) -> c_31(msplit'2#(xs,x1)) msplit'2#(dd(x2,xs'),x1) -> c_33(msplit#(xs')) Further, following extension rules are added to the lower component. mergesort#(l) -> mergesort'1#(l) mergesort'1#(dd(x1,xs)) -> mergesort'2#(xs,x1) mergesort'2#(dd(x2,xs'),x1) -> mergesort'3#(msplit(dd(x1,dd(x2,xs')))) mergesort'2#(dd(x2,xs'),x1) -> msplit#(dd(x1,dd(x2,xs'))) mergesort'3#(tuple'2(l1,l2)) -> mergesort#(l1) mergesort'3#(tuple'2(l1,l2)) -> mergesort#(l2) **** Step 5.b:4.b:4.a:1: PredecessorEstimationCP WORST_CASE(?,O(n^1)) + Considered Problem: - Strict DPs: mergesort#(l) -> c_24(mergesort'1#(l)) mergesort'1#(dd(x1,xs)) -> c_25(mergesort'2#(xs,x1)) mergesort'2#(dd(x2,xs'),x1) -> c_27(mergesort'3#(msplit(dd(x1,dd(x2,xs')))),msplit#(dd(x1,dd(x2,xs')))) mergesort'3#(tuple'2(l1,l2)) -> c_29(mergesort#(l1),mergesort#(l2)) - Weak TRS: msplit(l) -> msplit'1(l) msplit'1(dd(x1,xs)) -> msplit'2(xs,x1) msplit'1(nil()) -> tuple'2(nil(),nil()) msplit'2(dd(x2,xs'),x1) -> msplit'3(msplit(xs'),x1,x2) msplit'2(nil(),x1) -> tuple'2(dd(x1,nil()),nil()) msplit'3(tuple'2(l1,l2),x1,x2) -> tuple'2(dd(x1,l1),dd(x2,l2)) - Signature: {'cklt/1,'compare/2,'less/2,merge/2,merge'1/2,merge'2/3,merge'3/5,mergesort/1,mergesort'1/1,mergesort'2/2 ,mergesort'3/1,msplit/1,msplit'1/1,msplit'2/2,msplit'3/3,'cklt#/1,'compare#/2,'less#/2,merge#/2,merge'1#/2 ,merge'2#/3,merge'3#/5,mergesort#/1,mergesort'1#/1,mergesort'2#/2,mergesort'3#/1,msplit#/1,msplit'1#/1 ,msplit'2#/2,msplit'3#/3} / {'0/0,'EQ/0,'GT/0,'LT/0,'false/0,'neg/1,'pos/1,'s/1,'true/0,dd/2,nil/0,tuple'2/2 ,c_1/0,c_2/0,c_3/0,c_4/0,c_5/0,c_6/0,c_7/0,c_8/0,c_9/1,c_10/0,c_11/0,c_12/0,c_13/1,c_14/0,c_15/1,c_16/1 ,c_17/1,c_18/1,c_19/0,c_20/1,c_21/0,c_22/1,c_23/1,c_24/1,c_25/1,c_26/0,c_27/2,c_28/0,c_29/2,c_30/1,c_31/1 ,c_32/0,c_33/1,c_34/0,c_35/0} - Obligation: innermost runtime complexity wrt. defined symbols {'cklt#,'compare#,'less#,merge#,merge'1#,merge'2#,merge'3# ,mergesort#,mergesort'1#,mergesort'2#,mergesort'3#,msplit#,msplit'1#,msplit'2# ,msplit'3#} and constructors {'0,'EQ,'GT,'LT,'false,'neg,'pos,'s,'true,dd,nil,tuple'2} + Applied Processor: PredecessorEstimationCP {onSelectionCP = any intersect of rules of CDG leaf and strict-rules, withComplexityPair = NaturalMI {miDimension = 3, miDegree = 1, miKind = Algebraic, uargs = UArgs, urules = URules, selector = Nothing}} + Details: We first use the processor NaturalMI {miDimension = 3, miDegree = 1, miKind = Algebraic, uargs = UArgs, urules = URules, selector = Nothing} to orient following rules strictly: 3: mergesort'2#(dd(x2,xs'),x1) -> c_27(mergesort'3#(msplit(dd(x1,dd(x2,xs')))),msplit#(dd(x1,dd(x2,xs')))) Consider the set of all dependency pairs 1: mergesort#(l) -> c_24(mergesort'1#(l)) 2: mergesort'1#(dd(x1,xs)) -> c_25(mergesort'2#(xs,x1)) 3: mergesort'2#(dd(x2,xs'),x1) -> c_27(mergesort'3#(msplit(dd(x1,dd(x2,xs')))),msplit#(dd(x1,dd(x2,xs')))) 4: mergesort'3#(tuple'2(l1,l2)) -> c_29(mergesort#(l1),mergesort#(l2)) Processor NaturalMI {miDimension = 3, miDegree = 1, miKind = Algebraic, uargs = UArgs, urules = URules, selector = Nothing}induces the complexity certificateTIME (?,O(n^1)) SPACE(?,?)on application of the dependency pairs {3} These cover all (indirect) predecessors of dependency pairs {1,2,3,4} their number of applications is equally bounded. The dependency pairs are shifted into the weak component. ***** Step 5.b:4.b:4.a:1.a:1: NaturalMI WORST_CASE(?,O(n^1)) + Considered Problem: - Strict DPs: mergesort#(l) -> c_24(mergesort'1#(l)) mergesort'1#(dd(x1,xs)) -> c_25(mergesort'2#(xs,x1)) mergesort'2#(dd(x2,xs'),x1) -> c_27(mergesort'3#(msplit(dd(x1,dd(x2,xs')))),msplit#(dd(x1,dd(x2,xs')))) mergesort'3#(tuple'2(l1,l2)) -> c_29(mergesort#(l1),mergesort#(l2)) - Weak TRS: msplit(l) -> msplit'1(l) msplit'1(dd(x1,xs)) -> msplit'2(xs,x1) msplit'1(nil()) -> tuple'2(nil(),nil()) msplit'2(dd(x2,xs'),x1) -> msplit'3(msplit(xs'),x1,x2) msplit'2(nil(),x1) -> tuple'2(dd(x1,nil()),nil()) msplit'3(tuple'2(l1,l2),x1,x2) -> tuple'2(dd(x1,l1),dd(x2,l2)) - Signature: {'cklt/1,'compare/2,'less/2,merge/2,merge'1/2,merge'2/3,merge'3/5,mergesort/1,mergesort'1/1,mergesort'2/2 ,mergesort'3/1,msplit/1,msplit'1/1,msplit'2/2,msplit'3/3,'cklt#/1,'compare#/2,'less#/2,merge#/2,merge'1#/2 ,merge'2#/3,merge'3#/5,mergesort#/1,mergesort'1#/1,mergesort'2#/2,mergesort'3#/1,msplit#/1,msplit'1#/1 ,msplit'2#/2,msplit'3#/3} / {'0/0,'EQ/0,'GT/0,'LT/0,'false/0,'neg/1,'pos/1,'s/1,'true/0,dd/2,nil/0,tuple'2/2 ,c_1/0,c_2/0,c_3/0,c_4/0,c_5/0,c_6/0,c_7/0,c_8/0,c_9/1,c_10/0,c_11/0,c_12/0,c_13/1,c_14/0,c_15/1,c_16/1 ,c_17/1,c_18/1,c_19/0,c_20/1,c_21/0,c_22/1,c_23/1,c_24/1,c_25/1,c_26/0,c_27/2,c_28/0,c_29/2,c_30/1,c_31/1 ,c_32/0,c_33/1,c_34/0,c_35/0} - Obligation: innermost runtime complexity wrt. defined symbols {'cklt#,'compare#,'less#,merge#,merge'1#,merge'2#,merge'3# ,mergesort#,mergesort'1#,mergesort'2#,mergesort'3#,msplit#,msplit'1#,msplit'2# ,msplit'3#} and constructors {'0,'EQ,'GT,'LT,'false,'neg,'pos,'s,'true,dd,nil,tuple'2} + Applied Processor: NaturalMI {miDimension = 3, miDegree = 1, miKind = Algebraic, uargs = UArgs, urules = URules, selector = Just first alternative for predecessorEstimation on any intersect of rules of CDG leaf and strict-rules} + Details: We apply a matrix interpretation of kind constructor based matrix interpretation (containing no more than 1 non-zero interpretation-entries in the diagonal of the component-wise maxima): The following argument positions are considered usable: uargs(c_24) = {1}, uargs(c_25) = {1}, uargs(c_27) = {1}, uargs(c_29) = {1,2} Following symbols are considered usable: {msplit,msplit'1,msplit'2,msplit'3,'cklt#,'compare#,'less#,merge#,merge'1#,merge'2#,merge'3#,mergesort# ,mergesort'1#,mergesort'2#,mergesort'3#,msplit#,msplit'1#,msplit'2#,msplit'3#} TcT has computed the following interpretation: p('0) = [0] [0] [0] p('EQ) = [0] [0] [0] p('GT) = [0] [0] [0] p('LT) = [0] [0] [0] p('cklt) = [0] [0] [0] p('compare) = [0] [0] [0] p('false) = [0] [0] [0] p('less) = [0] [0] [0] p('neg) = [0] [0] [0] p('pos) = [0] [0] [0] p('s) = [0] [0] [0] p('true) = [0] [0] [0] p(dd) = [0 0 0] [0 1 0] [0] [0 0 0] x1 + [0 0 1] x2 + [0] [0 0 1] [0 0 1] [1] p(merge) = [0] [0] [0] p(merge'1) = [0] [0] [0] p(merge'2) = [0] [0] [0] p(merge'3) = [0] [0] [0] p(mergesort) = [0] [0] [0] p(mergesort'1) = [0] [0] [0] p(mergesort'2) = [0] [0] [0] p(mergesort'3) = [0] [0] [0] p(msplit) = [1 0 0] [0] [0 0 0] x1 + [1] [0 0 1] [0] p(msplit'1) = [1 0 0] [0] [0 0 0] x1 + [1] [0 0 1] [0] p(msplit'2) = [0 1 0] [0 0 0] [0] [0 0 0] x1 + [0 0 0] x2 + [1] [0 0 1] [0 0 1] [1] p(msplit'3) = [0 0 1] [0 0 0] [0 0 0] [0] [0 0 0] x1 + [0 0 0] x2 + [0 0 0] x3 + [1] [0 1 1] [0 0 1] [0 0 1] [1] p(nil) = [0] [0] [0] p(tuple'2) = [0 1 0] [0 1 0] [0] [0 0 0] x1 + [0 0 0] x2 + [1] [0 0 1] [0 0 1] [0] p('cklt#) = [0] [0] [0] p('compare#) = [0] [0] [0] p('less#) = [0] [0] [0] p(merge#) = [0] [0] [0] p(merge'1#) = [0] [0] [0] p(merge'2#) = [0] [0] [0] p(merge'3#) = [0] [0] [0] p(mergesort#) = [0 1 0] [0] [0 0 0] x1 + [1] [0 0 0] [0] p(mergesort'1#) = [0 1 0] [0] [0 1 0] x1 + [0] [0 1 1] [1] p(mergesort'2#) = [0 0 1] [0 0 0] [0] [1 0 0] x1 + [1 0 1] x2 + [0] [0 0 1] [0 0 0] [1] p(mergesort'3#) = [1 0 0] [0] [1 0 0] x1 + [0] [0 1 0] [1] p(msplit#) = [0 0 0] [1] [0 1 0] x1 + [1] [0 1 0] [0] p(msplit'1#) = [0] [0] [0] p(msplit'2#) = [0] [0] [0] p(msplit'3#) = [0] [0] [0] p(c_1) = [0] [0] [0] p(c_2) = [0] [0] [0] p(c_3) = [0] [0] [0] p(c_4) = [0] [0] [0] p(c_5) = [0] [0] [0] p(c_6) = [0] [0] [0] p(c_7) = [0] [0] [0] p(c_8) = [0] [0] [0] p(c_9) = [0] [0] [0] p(c_10) = [0] [0] [0] p(c_11) = [0] [0] [0] p(c_12) = [0] [0] [0] p(c_13) = [0] [0] [0] p(c_14) = [0] [0] [0] p(c_15) = [0] [0] [0] p(c_16) = [0] [0] [0] p(c_17) = [0] [0] [0] p(c_18) = [0] [0] [0] p(c_19) = [0] [0] [0] p(c_20) = [0] [0] [0] p(c_21) = [0] [0] [0] p(c_22) = [0] [0] [0] p(c_23) = [0] [0] [0] p(c_24) = [1 0 0] [0] [0 0 0] x1 + [1] [0 0 0] [0] p(c_25) = [1 0 0] [0] [0 0 0] x1 + [0] [0 0 1] [1] p(c_26) = [0] [0] [0] p(c_27) = [1 0 0] [0] [0 0 0] x1 + [0] [0 1 1] [0] p(c_28) = [0] [0] [0] p(c_29) = [1 0 0] [1 0 0] [0] [0 0 0] x1 + [0 0 0] x2 + [0] [0 1 0] [0 0 0] [1] p(c_30) = [0] [0] [0] p(c_31) = [0] [0] [0] p(c_32) = [0] [0] [0] p(c_33) = [0] [0] [0] p(c_34) = [0] [0] [0] p(c_35) = [0] [0] [0] Following rules are strictly oriented: mergesort'2#(dd(x2,xs'),x1) = [0 0 0] [0 0 1] [0 0 1] [1] [1 0 1] x1 + [0 0 0] x2 + [0 1 0] xs' + [0] [0 0 0] [0 0 1] [0 0 1] [2] > [0 0 1] [0] [0 0 0] xs' + [0] [0 0 1] [2] = c_27(mergesort'3#(msplit(dd(x1,dd(x2,xs')))),msplit#(dd(x1,dd(x2,xs')))) Following rules are (at-least) weakly oriented: mergesort#(l) = [0 1 0] [0] [0 0 0] l + [1] [0 0 0] [0] >= [0 1 0] [0] [0 0 0] l + [1] [0 0 0] [0] = c_24(mergesort'1#(l)) mergesort'1#(dd(x1,xs)) = [0 0 0] [0 0 1] [0] [0 0 0] x1 + [0 0 1] xs + [0] [0 0 1] [0 0 2] [2] >= [0 0 1] [0] [0 0 0] xs + [0] [0 0 1] [2] = c_25(mergesort'2#(xs,x1)) mergesort'3#(tuple'2(l1,l2)) = [0 1 0] [0 1 0] [0] [0 1 0] l1 + [0 1 0] l2 + [0] [0 0 0] [0 0 0] [2] >= [0 1 0] [0 1 0] [0] [0 0 0] l1 + [0 0 0] l2 + [0] [0 0 0] [0 0 0] [2] = c_29(mergesort#(l1),mergesort#(l2)) msplit(l) = [1 0 0] [0] [0 0 0] l + [1] [0 0 1] [0] >= [1 0 0] [0] [0 0 0] l + [1] [0 0 1] [0] = msplit'1(l) msplit'1(dd(x1,xs)) = [0 0 0] [0 1 0] [0] [0 0 0] x1 + [0 0 0] xs + [1] [0 0 1] [0 0 1] [1] >= [0 0 0] [0 1 0] [0] [0 0 0] x1 + [0 0 0] xs + [1] [0 0 1] [0 0 1] [1] = msplit'2(xs,x1) msplit'1(nil()) = [0] [1] [0] >= [0] [1] [0] = tuple'2(nil(),nil()) msplit'2(dd(x2,xs'),x1) = [0 0 0] [0 0 0] [0 0 1] [0] [0 0 0] x1 + [0 0 0] x2 + [0 0 0] xs' + [1] [0 0 1] [0 0 1] [0 0 1] [2] >= [0 0 0] [0 0 0] [0 0 1] [0] [0 0 0] x1 + [0 0 0] x2 + [0 0 0] xs' + [1] [0 0 1] [0 0 1] [0 0 1] [2] = msplit'3(msplit(xs'),x1,x2) msplit'2(nil(),x1) = [0 0 0] [0] [0 0 0] x1 + [1] [0 0 1] [1] >= [0 0 0] [0] [0 0 0] x1 + [1] [0 0 1] [1] = tuple'2(dd(x1,nil()),nil()) msplit'3(tuple'2(l1,l2),x1,x2) = [0 0 1] [0 0 1] [0 0 0] [0 0 0] [0] [0 0 0] l1 + [0 0 0] l2 + [0 0 0] x1 + [0 0 0] x2 + [1] [0 0 1] [0 0 1] [0 0 1] [0 0 1] [2] >= [0 0 1] [0 0 1] [0 0 0] [0 0 0] [0] [0 0 0] l1 + [0 0 0] l2 + [0 0 0] x1 + [0 0 0] x2 + [1] [0 0 1] [0 0 1] [0 0 1] [0 0 1] [2] = tuple'2(dd(x1,l1),dd(x2,l2)) ***** Step 5.b:4.b:4.a:1.a:2: Assumption WORST_CASE(?,O(1)) + Considered Problem: - Strict DPs: mergesort#(l) -> c_24(mergesort'1#(l)) mergesort'1#(dd(x1,xs)) -> c_25(mergesort'2#(xs,x1)) mergesort'3#(tuple'2(l1,l2)) -> c_29(mergesort#(l1),mergesort#(l2)) - Weak DPs: mergesort'2#(dd(x2,xs'),x1) -> c_27(mergesort'3#(msplit(dd(x1,dd(x2,xs')))),msplit#(dd(x1,dd(x2,xs')))) - Weak TRS: msplit(l) -> msplit'1(l) msplit'1(dd(x1,xs)) -> msplit'2(xs,x1) msplit'1(nil()) -> tuple'2(nil(),nil()) msplit'2(dd(x2,xs'),x1) -> msplit'3(msplit(xs'),x1,x2) msplit'2(nil(),x1) -> tuple'2(dd(x1,nil()),nil()) msplit'3(tuple'2(l1,l2),x1,x2) -> tuple'2(dd(x1,l1),dd(x2,l2)) - Signature: {'cklt/1,'compare/2,'less/2,merge/2,merge'1/2,merge'2/3,merge'3/5,mergesort/1,mergesort'1/1,mergesort'2/2 ,mergesort'3/1,msplit/1,msplit'1/1,msplit'2/2,msplit'3/3,'cklt#/1,'compare#/2,'less#/2,merge#/2,merge'1#/2 ,merge'2#/3,merge'3#/5,mergesort#/1,mergesort'1#/1,mergesort'2#/2,mergesort'3#/1,msplit#/1,msplit'1#/1 ,msplit'2#/2,msplit'3#/3} / {'0/0,'EQ/0,'GT/0,'LT/0,'false/0,'neg/1,'pos/1,'s/1,'true/0,dd/2,nil/0,tuple'2/2 ,c_1/0,c_2/0,c_3/0,c_4/0,c_5/0,c_6/0,c_7/0,c_8/0,c_9/1,c_10/0,c_11/0,c_12/0,c_13/1,c_14/0,c_15/1,c_16/1 ,c_17/1,c_18/1,c_19/0,c_20/1,c_21/0,c_22/1,c_23/1,c_24/1,c_25/1,c_26/0,c_27/2,c_28/0,c_29/2,c_30/1,c_31/1 ,c_32/0,c_33/1,c_34/0,c_35/0} - Obligation: innermost runtime complexity wrt. defined symbols {'cklt#,'compare#,'less#,merge#,merge'1#,merge'2#,merge'3# ,mergesort#,mergesort'1#,mergesort'2#,mergesort'3#,msplit#,msplit'1#,msplit'2# ,msplit'3#} and constructors {'0,'EQ,'GT,'LT,'false,'neg,'pos,'s,'true,dd,nil,tuple'2} + Applied Processor: Assumption {assumed = Certificate {spaceUB = Unknown, spaceLB = Unknown, timeUB = Poly (Just 0), timeLB = Unknown}} + Details: () ***** Step 5.b:4.b:4.a:1.b:1: RemoveWeakSuffixes WORST_CASE(?,O(1)) + Considered Problem: - Weak DPs: mergesort#(l) -> c_24(mergesort'1#(l)) mergesort'1#(dd(x1,xs)) -> c_25(mergesort'2#(xs,x1)) mergesort'2#(dd(x2,xs'),x1) -> c_27(mergesort'3#(msplit(dd(x1,dd(x2,xs')))),msplit#(dd(x1,dd(x2,xs')))) mergesort'3#(tuple'2(l1,l2)) -> c_29(mergesort#(l1),mergesort#(l2)) - Weak TRS: msplit(l) -> msplit'1(l) msplit'1(dd(x1,xs)) -> msplit'2(xs,x1) msplit'1(nil()) -> tuple'2(nil(),nil()) msplit'2(dd(x2,xs'),x1) -> msplit'3(msplit(xs'),x1,x2) msplit'2(nil(),x1) -> tuple'2(dd(x1,nil()),nil()) msplit'3(tuple'2(l1,l2),x1,x2) -> tuple'2(dd(x1,l1),dd(x2,l2)) - Signature: {'cklt/1,'compare/2,'less/2,merge/2,merge'1/2,merge'2/3,merge'3/5,mergesort/1,mergesort'1/1,mergesort'2/2 ,mergesort'3/1,msplit/1,msplit'1/1,msplit'2/2,msplit'3/3,'cklt#/1,'compare#/2,'less#/2,merge#/2,merge'1#/2 ,merge'2#/3,merge'3#/5,mergesort#/1,mergesort'1#/1,mergesort'2#/2,mergesort'3#/1,msplit#/1,msplit'1#/1 ,msplit'2#/2,msplit'3#/3} / {'0/0,'EQ/0,'GT/0,'LT/0,'false/0,'neg/1,'pos/1,'s/1,'true/0,dd/2,nil/0,tuple'2/2 ,c_1/0,c_2/0,c_3/0,c_4/0,c_5/0,c_6/0,c_7/0,c_8/0,c_9/1,c_10/0,c_11/0,c_12/0,c_13/1,c_14/0,c_15/1,c_16/1 ,c_17/1,c_18/1,c_19/0,c_20/1,c_21/0,c_22/1,c_23/1,c_24/1,c_25/1,c_26/0,c_27/2,c_28/0,c_29/2,c_30/1,c_31/1 ,c_32/0,c_33/1,c_34/0,c_35/0} - Obligation: innermost runtime complexity wrt. defined symbols {'cklt#,'compare#,'less#,merge#,merge'1#,merge'2#,merge'3# ,mergesort#,mergesort'1#,mergesort'2#,mergesort'3#,msplit#,msplit'1#,msplit'2# ,msplit'3#} and constructors {'0,'EQ,'GT,'LT,'false,'neg,'pos,'s,'true,dd,nil,tuple'2} + Applied Processor: RemoveWeakSuffixes + Details: Consider the dependency graph 1:W:mergesort#(l) -> c_24(mergesort'1#(l)) -->_1 mergesort'1#(dd(x1,xs)) -> c_25(mergesort'2#(xs,x1)):2 2:W:mergesort'1#(dd(x1,xs)) -> c_25(mergesort'2#(xs,x1)) -->_1 mergesort'2#(dd(x2,xs'),x1) -> c_27(mergesort'3#(msplit(dd(x1,dd(x2,xs')))) ,msplit#(dd(x1,dd(x2,xs')))):3 3:W:mergesort'2#(dd(x2,xs'),x1) -> c_27(mergesort'3#(msplit(dd(x1,dd(x2,xs')))),msplit#(dd(x1,dd(x2,xs')))) -->_1 mergesort'3#(tuple'2(l1,l2)) -> c_29(mergesort#(l1),mergesort#(l2)):4 4:W:mergesort'3#(tuple'2(l1,l2)) -> c_29(mergesort#(l1),mergesort#(l2)) -->_2 mergesort#(l) -> c_24(mergesort'1#(l)):1 -->_1 mergesort#(l) -> c_24(mergesort'1#(l)):1 The following weak DPs constitute a sub-graph of the DG that is closed under successors. The DPs are removed. 1: mergesort#(l) -> c_24(mergesort'1#(l)) 4: mergesort'3#(tuple'2(l1,l2)) -> c_29(mergesort#(l1),mergesort#(l2)) 3: mergesort'2#(dd(x2,xs'),x1) -> c_27(mergesort'3#(msplit(dd(x1,dd(x2,xs')))),msplit#(dd(x1,dd(x2,xs')))) 2: mergesort'1#(dd(x1,xs)) -> c_25(mergesort'2#(xs,x1)) ***** Step 5.b:4.b:4.a:1.b:2: EmptyProcessor WORST_CASE(?,O(1)) + Considered Problem: - Weak TRS: msplit(l) -> msplit'1(l) msplit'1(dd(x1,xs)) -> msplit'2(xs,x1) msplit'1(nil()) -> tuple'2(nil(),nil()) msplit'2(dd(x2,xs'),x1) -> msplit'3(msplit(xs'),x1,x2) msplit'2(nil(),x1) -> tuple'2(dd(x1,nil()),nil()) msplit'3(tuple'2(l1,l2),x1,x2) -> tuple'2(dd(x1,l1),dd(x2,l2)) - Signature: {'cklt/1,'compare/2,'less/2,merge/2,merge'1/2,merge'2/3,merge'3/5,mergesort/1,mergesort'1/1,mergesort'2/2 ,mergesort'3/1,msplit/1,msplit'1/1,msplit'2/2,msplit'3/3,'cklt#/1,'compare#/2,'less#/2,merge#/2,merge'1#/2 ,merge'2#/3,merge'3#/5,mergesort#/1,mergesort'1#/1,mergesort'2#/2,mergesort'3#/1,msplit#/1,msplit'1#/1 ,msplit'2#/2,msplit'3#/3} / {'0/0,'EQ/0,'GT/0,'LT/0,'false/0,'neg/1,'pos/1,'s/1,'true/0,dd/2,nil/0,tuple'2/2 ,c_1/0,c_2/0,c_3/0,c_4/0,c_5/0,c_6/0,c_7/0,c_8/0,c_9/1,c_10/0,c_11/0,c_12/0,c_13/1,c_14/0,c_15/1,c_16/1 ,c_17/1,c_18/1,c_19/0,c_20/1,c_21/0,c_22/1,c_23/1,c_24/1,c_25/1,c_26/0,c_27/2,c_28/0,c_29/2,c_30/1,c_31/1 ,c_32/0,c_33/1,c_34/0,c_35/0} - Obligation: innermost runtime complexity wrt. defined symbols {'cklt#,'compare#,'less#,merge#,merge'1#,merge'2#,merge'3# ,mergesort#,mergesort'1#,mergesort'2#,mergesort'3#,msplit#,msplit'1#,msplit'2# ,msplit'3#} and constructors {'0,'EQ,'GT,'LT,'false,'neg,'pos,'s,'true,dd,nil,tuple'2} + Applied Processor: EmptyProcessor + Details: The problem is already closed. The intended complexity is O(1). **** Step 5.b:4.b:4.b:1: PredecessorEstimationCP WORST_CASE(?,O(n^1)) + Considered Problem: - Strict DPs: msplit#(l) -> c_30(msplit'1#(l)) msplit'1#(dd(x1,xs)) -> c_31(msplit'2#(xs,x1)) msplit'2#(dd(x2,xs'),x1) -> c_33(msplit#(xs')) - Weak DPs: mergesort#(l) -> mergesort'1#(l) mergesort'1#(dd(x1,xs)) -> mergesort'2#(xs,x1) mergesort'2#(dd(x2,xs'),x1) -> mergesort'3#(msplit(dd(x1,dd(x2,xs')))) mergesort'2#(dd(x2,xs'),x1) -> msplit#(dd(x1,dd(x2,xs'))) mergesort'3#(tuple'2(l1,l2)) -> mergesort#(l1) mergesort'3#(tuple'2(l1,l2)) -> mergesort#(l2) - Weak TRS: msplit(l) -> msplit'1(l) msplit'1(dd(x1,xs)) -> msplit'2(xs,x1) msplit'1(nil()) -> tuple'2(nil(),nil()) msplit'2(dd(x2,xs'),x1) -> msplit'3(msplit(xs'),x1,x2) msplit'2(nil(),x1) -> tuple'2(dd(x1,nil()),nil()) msplit'3(tuple'2(l1,l2),x1,x2) -> tuple'2(dd(x1,l1),dd(x2,l2)) - Signature: {'cklt/1,'compare/2,'less/2,merge/2,merge'1/2,merge'2/3,merge'3/5,mergesort/1,mergesort'1/1,mergesort'2/2 ,mergesort'3/1,msplit/1,msplit'1/1,msplit'2/2,msplit'3/3,'cklt#/1,'compare#/2,'less#/2,merge#/2,merge'1#/2 ,merge'2#/3,merge'3#/5,mergesort#/1,mergesort'1#/1,mergesort'2#/2,mergesort'3#/1,msplit#/1,msplit'1#/1 ,msplit'2#/2,msplit'3#/3} / {'0/0,'EQ/0,'GT/0,'LT/0,'false/0,'neg/1,'pos/1,'s/1,'true/0,dd/2,nil/0,tuple'2/2 ,c_1/0,c_2/0,c_3/0,c_4/0,c_5/0,c_6/0,c_7/0,c_8/0,c_9/1,c_10/0,c_11/0,c_12/0,c_13/1,c_14/0,c_15/1,c_16/1 ,c_17/1,c_18/1,c_19/0,c_20/1,c_21/0,c_22/1,c_23/1,c_24/1,c_25/1,c_26/0,c_27/2,c_28/0,c_29/2,c_30/1,c_31/1 ,c_32/0,c_33/1,c_34/0,c_35/0} - Obligation: innermost runtime complexity wrt. defined symbols {'cklt#,'compare#,'less#,merge#,merge'1#,merge'2#,merge'3# ,mergesort#,mergesort'1#,mergesort'2#,mergesort'3#,msplit#,msplit'1#,msplit'2# ,msplit'3#} and constructors {'0,'EQ,'GT,'LT,'false,'neg,'pos,'s,'true,dd,nil,tuple'2} + Applied Processor: PredecessorEstimationCP {onSelectionCP = any intersect of rules of CDG leaf and strict-rules, withComplexityPair = NaturalMI {miDimension = 1, miDegree = 1, miKind = Algebraic, uargs = UArgs, urules = URules, selector = Nothing}} + Details: We first use the processor NaturalMI {miDimension = 1, miDegree = 1, miKind = Algebraic, uargs = UArgs, urules = URules, selector = Nothing} to orient following rules strictly: 2: msplit'1#(dd(x1,xs)) -> c_31(msplit'2#(xs,x1)) Consider the set of all dependency pairs 1: msplit#(l) -> c_30(msplit'1#(l)) 2: msplit'1#(dd(x1,xs)) -> c_31(msplit'2#(xs,x1)) 3: msplit'2#(dd(x2,xs'),x1) -> c_33(msplit#(xs')) 4: mergesort#(l) -> mergesort'1#(l) 5: mergesort'1#(dd(x1,xs)) -> mergesort'2#(xs,x1) 6: mergesort'2#(dd(x2,xs'),x1) -> mergesort'3#(msplit(dd(x1,dd(x2,xs')))) 7: mergesort'2#(dd(x2,xs'),x1) -> msplit#(dd(x1,dd(x2,xs'))) 8: mergesort'3#(tuple'2(l1,l2)) -> mergesort#(l1) 9: mergesort'3#(tuple'2(l1,l2)) -> mergesort#(l2) Processor NaturalMI {miDimension = 1, miDegree = 1, miKind = Algebraic, uargs = UArgs, urules = URules, selector = Nothing}induces the complexity certificateTIME (?,O(n^1)) SPACE(?,?)on application of the dependency pairs {2} These cover all (indirect) predecessors of dependency pairs {2,3} their number of applications is equally bounded. The dependency pairs are shifted into the weak component. ***** Step 5.b:4.b:4.b:1.a:1: NaturalMI WORST_CASE(?,O(n^1)) + Considered Problem: - Strict DPs: msplit#(l) -> c_30(msplit'1#(l)) msplit'1#(dd(x1,xs)) -> c_31(msplit'2#(xs,x1)) msplit'2#(dd(x2,xs'),x1) -> c_33(msplit#(xs')) - Weak DPs: mergesort#(l) -> mergesort'1#(l) mergesort'1#(dd(x1,xs)) -> mergesort'2#(xs,x1) mergesort'2#(dd(x2,xs'),x1) -> mergesort'3#(msplit(dd(x1,dd(x2,xs')))) mergesort'2#(dd(x2,xs'),x1) -> msplit#(dd(x1,dd(x2,xs'))) mergesort'3#(tuple'2(l1,l2)) -> mergesort#(l1) mergesort'3#(tuple'2(l1,l2)) -> mergesort#(l2) - Weak TRS: msplit(l) -> msplit'1(l) msplit'1(dd(x1,xs)) -> msplit'2(xs,x1) msplit'1(nil()) -> tuple'2(nil(),nil()) msplit'2(dd(x2,xs'),x1) -> msplit'3(msplit(xs'),x1,x2) msplit'2(nil(),x1) -> tuple'2(dd(x1,nil()),nil()) msplit'3(tuple'2(l1,l2),x1,x2) -> tuple'2(dd(x1,l1),dd(x2,l2)) - Signature: {'cklt/1,'compare/2,'less/2,merge/2,merge'1/2,merge'2/3,merge'3/5,mergesort/1,mergesort'1/1,mergesort'2/2 ,mergesort'3/1,msplit/1,msplit'1/1,msplit'2/2,msplit'3/3,'cklt#/1,'compare#/2,'less#/2,merge#/2,merge'1#/2 ,merge'2#/3,merge'3#/5,mergesort#/1,mergesort'1#/1,mergesort'2#/2,mergesort'3#/1,msplit#/1,msplit'1#/1 ,msplit'2#/2,msplit'3#/3} / {'0/0,'EQ/0,'GT/0,'LT/0,'false/0,'neg/1,'pos/1,'s/1,'true/0,dd/2,nil/0,tuple'2/2 ,c_1/0,c_2/0,c_3/0,c_4/0,c_5/0,c_6/0,c_7/0,c_8/0,c_9/1,c_10/0,c_11/0,c_12/0,c_13/1,c_14/0,c_15/1,c_16/1 ,c_17/1,c_18/1,c_19/0,c_20/1,c_21/0,c_22/1,c_23/1,c_24/1,c_25/1,c_26/0,c_27/2,c_28/0,c_29/2,c_30/1,c_31/1 ,c_32/0,c_33/1,c_34/0,c_35/0} - Obligation: innermost runtime complexity wrt. defined symbols {'cklt#,'compare#,'less#,merge#,merge'1#,merge'2#,merge'3# ,mergesort#,mergesort'1#,mergesort'2#,mergesort'3#,msplit#,msplit'1#,msplit'2# ,msplit'3#} and constructors {'0,'EQ,'GT,'LT,'false,'neg,'pos,'s,'true,dd,nil,tuple'2} + Applied Processor: NaturalMI {miDimension = 1, miDegree = 1, miKind = Algebraic, uargs = UArgs, urules = URules, selector = Just first alternative for predecessorEstimation on any intersect of rules of CDG leaf and strict-rules} + Details: We apply a matrix interpretation of kind constructor based matrix interpretation: The following argument positions are considered usable: uargs(c_30) = {1}, uargs(c_31) = {1}, uargs(c_33) = {1} Following symbols are considered usable: {msplit,msplit'1,msplit'2,msplit'3,'cklt#,'compare#,'less#,merge#,merge'1#,merge'2#,merge'3#,mergesort# ,mergesort'1#,mergesort'2#,mergesort'3#,msplit#,msplit'1#,msplit'2#,msplit'3#} TcT has computed the following interpretation: p('0) = [1] p('EQ) = [2] p('GT) = [1] p('LT) = [0] p('cklt) = [8] x1 + [1] p('compare) = [2] x1 + [1] x2 + [0] p('false) = [0] p('less) = [2] x1 + [1] x2 + [1] p('neg) = [1] p('pos) = [0] p('s) = [1] p('true) = [4] p(dd) = [1] x2 + [1] p(merge) = [1] x1 + [1] p(merge'1) = [1] p(merge'2) = [1] x2 + [1] x3 + [0] p(merge'3) = [2] x1 + [2] x2 + [1] x3 + [1] x4 + [1] x5 + [1] p(mergesort) = [1] x1 + [0] p(mergesort'1) = [1] p(mergesort'2) = [1] x1 + [4] x2 + [0] p(mergesort'3) = [1] p(msplit) = [1] x1 + [0] p(msplit'1) = [1] x1 + [0] p(msplit'2) = [1] x1 + [1] p(msplit'3) = [1] x1 + [2] p(nil) = [0] p(tuple'2) = [1] x1 + [1] x2 + [0] p('cklt#) = [2] p('compare#) = [2] x1 + [1] x2 + [0] p('less#) = [1] x1 + [1] p(merge#) = [1] x1 + [4] x2 + [0] p(merge'1#) = [1] p(merge'2#) = [2] x1 + [1] x2 + [2] p(merge'3#) = [1] x2 + [1] x5 + [1] p(mergesort#) = [4] x1 + [0] p(mergesort'1#) = [4] x1 + [0] p(mergesort'2#) = [4] x1 + [4] p(mergesort'3#) = [4] x1 + [0] p(msplit#) = [4] x1 + [0] p(msplit'1#) = [4] x1 + [0] p(msplit'2#) = [4] x1 + [0] p(msplit'3#) = [1] x1 + [1] x2 + [2] p(c_1) = [2] p(c_2) = [1] p(c_3) = [2] p(c_4) = [1] p(c_5) = [1] p(c_6) = [2] p(c_7) = [0] p(c_8) = [0] p(c_9) = [0] p(c_10) = [1] p(c_11) = [0] p(c_12) = [0] p(c_13) = [1] p(c_14) = [1] p(c_15) = [1] x1 + [2] p(c_16) = [8] x1 + [2] p(c_17) = [1] p(c_18) = [1] x1 + [0] p(c_19) = [0] p(c_20) = [1] x1 + [2] p(c_21) = [0] p(c_22) = [1] p(c_23) = [4] p(c_24) = [2] p(c_25) = [1] p(c_26) = [0] p(c_27) = [1] x2 + [2] p(c_28) = [1] p(c_29) = [1] x2 + [0] p(c_30) = [1] x1 + [0] p(c_31) = [1] x1 + [3] p(c_32) = [1] p(c_33) = [1] x1 + [4] p(c_34) = [4] p(c_35) = [2] Following rules are strictly oriented: msplit'1#(dd(x1,xs)) = [4] xs + [4] > [4] xs + [3] = c_31(msplit'2#(xs,x1)) Following rules are (at-least) weakly oriented: mergesort#(l) = [4] l + [0] >= [4] l + [0] = mergesort'1#(l) mergesort'1#(dd(x1,xs)) = [4] xs + [4] >= [4] xs + [4] = mergesort'2#(xs,x1) mergesort'2#(dd(x2,xs'),x1) = [4] xs' + [8] >= [4] xs' + [8] = mergesort'3#(msplit(dd(x1,dd(x2,xs')))) mergesort'2#(dd(x2,xs'),x1) = [4] xs' + [8] >= [4] xs' + [8] = msplit#(dd(x1,dd(x2,xs'))) mergesort'3#(tuple'2(l1,l2)) = [4] l1 + [4] l2 + [0] >= [4] l1 + [0] = mergesort#(l1) mergesort'3#(tuple'2(l1,l2)) = [4] l1 + [4] l2 + [0] >= [4] l2 + [0] = mergesort#(l2) msplit#(l) = [4] l + [0] >= [4] l + [0] = c_30(msplit'1#(l)) msplit'2#(dd(x2,xs'),x1) = [4] xs' + [4] >= [4] xs' + [4] = c_33(msplit#(xs')) msplit(l) = [1] l + [0] >= [1] l + [0] = msplit'1(l) msplit'1(dd(x1,xs)) = [1] xs + [1] >= [1] xs + [1] = msplit'2(xs,x1) msplit'1(nil()) = [0] >= [0] = tuple'2(nil(),nil()) msplit'2(dd(x2,xs'),x1) = [1] xs' + [2] >= [1] xs' + [2] = msplit'3(msplit(xs'),x1,x2) msplit'2(nil(),x1) = [1] >= [1] = tuple'2(dd(x1,nil()),nil()) msplit'3(tuple'2(l1,l2),x1,x2) = [1] l1 + [1] l2 + [2] >= [1] l1 + [1] l2 + [2] = tuple'2(dd(x1,l1),dd(x2,l2)) ***** Step 5.b:4.b:4.b:1.a:2: Assumption WORST_CASE(?,O(1)) + Considered Problem: - Strict DPs: msplit#(l) -> c_30(msplit'1#(l)) msplit'2#(dd(x2,xs'),x1) -> c_33(msplit#(xs')) - Weak DPs: mergesort#(l) -> mergesort'1#(l) mergesort'1#(dd(x1,xs)) -> mergesort'2#(xs,x1) mergesort'2#(dd(x2,xs'),x1) -> mergesort'3#(msplit(dd(x1,dd(x2,xs')))) mergesort'2#(dd(x2,xs'),x1) -> msplit#(dd(x1,dd(x2,xs'))) mergesort'3#(tuple'2(l1,l2)) -> mergesort#(l1) mergesort'3#(tuple'2(l1,l2)) -> mergesort#(l2) msplit'1#(dd(x1,xs)) -> c_31(msplit'2#(xs,x1)) - Weak TRS: msplit(l) -> msplit'1(l) msplit'1(dd(x1,xs)) -> msplit'2(xs,x1) msplit'1(nil()) -> tuple'2(nil(),nil()) msplit'2(dd(x2,xs'),x1) -> msplit'3(msplit(xs'),x1,x2) msplit'2(nil(),x1) -> tuple'2(dd(x1,nil()),nil()) msplit'3(tuple'2(l1,l2),x1,x2) -> tuple'2(dd(x1,l1),dd(x2,l2)) - Signature: {'cklt/1,'compare/2,'less/2,merge/2,merge'1/2,merge'2/3,merge'3/5,mergesort/1,mergesort'1/1,mergesort'2/2 ,mergesort'3/1,msplit/1,msplit'1/1,msplit'2/2,msplit'3/3,'cklt#/1,'compare#/2,'less#/2,merge#/2,merge'1#/2 ,merge'2#/3,merge'3#/5,mergesort#/1,mergesort'1#/1,mergesort'2#/2,mergesort'3#/1,msplit#/1,msplit'1#/1 ,msplit'2#/2,msplit'3#/3} / {'0/0,'EQ/0,'GT/0,'LT/0,'false/0,'neg/1,'pos/1,'s/1,'true/0,dd/2,nil/0,tuple'2/2 ,c_1/0,c_2/0,c_3/0,c_4/0,c_5/0,c_6/0,c_7/0,c_8/0,c_9/1,c_10/0,c_11/0,c_12/0,c_13/1,c_14/0,c_15/1,c_16/1 ,c_17/1,c_18/1,c_19/0,c_20/1,c_21/0,c_22/1,c_23/1,c_24/1,c_25/1,c_26/0,c_27/2,c_28/0,c_29/2,c_30/1,c_31/1 ,c_32/0,c_33/1,c_34/0,c_35/0} - Obligation: innermost runtime complexity wrt. defined symbols {'cklt#,'compare#,'less#,merge#,merge'1#,merge'2#,merge'3# ,mergesort#,mergesort'1#,mergesort'2#,mergesort'3#,msplit#,msplit'1#,msplit'2# ,msplit'3#} and constructors {'0,'EQ,'GT,'LT,'false,'neg,'pos,'s,'true,dd,nil,tuple'2} + Applied Processor: Assumption {assumed = Certificate {spaceUB = Unknown, spaceLB = Unknown, timeUB = Poly (Just 0), timeLB = Unknown}} + Details: () ***** Step 5.b:4.b:4.b:1.b:1: PredecessorEstimationCP WORST_CASE(?,O(n^1)) + Considered Problem: - Strict DPs: msplit#(l) -> c_30(msplit'1#(l)) - Weak DPs: mergesort#(l) -> mergesort'1#(l) mergesort'1#(dd(x1,xs)) -> mergesort'2#(xs,x1) mergesort'2#(dd(x2,xs'),x1) -> mergesort'3#(msplit(dd(x1,dd(x2,xs')))) mergesort'2#(dd(x2,xs'),x1) -> msplit#(dd(x1,dd(x2,xs'))) mergesort'3#(tuple'2(l1,l2)) -> mergesort#(l1) mergesort'3#(tuple'2(l1,l2)) -> mergesort#(l2) msplit'1#(dd(x1,xs)) -> c_31(msplit'2#(xs,x1)) msplit'2#(dd(x2,xs'),x1) -> c_33(msplit#(xs')) - Weak TRS: msplit(l) -> msplit'1(l) msplit'1(dd(x1,xs)) -> msplit'2(xs,x1) msplit'1(nil()) -> tuple'2(nil(),nil()) msplit'2(dd(x2,xs'),x1) -> msplit'3(msplit(xs'),x1,x2) msplit'2(nil(),x1) -> tuple'2(dd(x1,nil()),nil()) msplit'3(tuple'2(l1,l2),x1,x2) -> tuple'2(dd(x1,l1),dd(x2,l2)) - Signature: {'cklt/1,'compare/2,'less/2,merge/2,merge'1/2,merge'2/3,merge'3/5,mergesort/1,mergesort'1/1,mergesort'2/2 ,mergesort'3/1,msplit/1,msplit'1/1,msplit'2/2,msplit'3/3,'cklt#/1,'compare#/2,'less#/2,merge#/2,merge'1#/2 ,merge'2#/3,merge'3#/5,mergesort#/1,mergesort'1#/1,mergesort'2#/2,mergesort'3#/1,msplit#/1,msplit'1#/1 ,msplit'2#/2,msplit'3#/3} / {'0/0,'EQ/0,'GT/0,'LT/0,'false/0,'neg/1,'pos/1,'s/1,'true/0,dd/2,nil/0,tuple'2/2 ,c_1/0,c_2/0,c_3/0,c_4/0,c_5/0,c_6/0,c_7/0,c_8/0,c_9/1,c_10/0,c_11/0,c_12/0,c_13/1,c_14/0,c_15/1,c_16/1 ,c_17/1,c_18/1,c_19/0,c_20/1,c_21/0,c_22/1,c_23/1,c_24/1,c_25/1,c_26/0,c_27/2,c_28/0,c_29/2,c_30/1,c_31/1 ,c_32/0,c_33/1,c_34/0,c_35/0} - Obligation: innermost runtime complexity wrt. defined symbols {'cklt#,'compare#,'less#,merge#,merge'1#,merge'2#,merge'3# ,mergesort#,mergesort'1#,mergesort'2#,mergesort'3#,msplit#,msplit'1#,msplit'2# ,msplit'3#} and constructors {'0,'EQ,'GT,'LT,'false,'neg,'pos,'s,'true,dd,nil,tuple'2} + Applied Processor: PredecessorEstimationCP {onSelectionCP = any intersect of rules of CDG leaf and strict-rules, withComplexityPair = NaturalMI {miDimension = 1, miDegree = 1, miKind = Algebraic, uargs = UArgs, urules = URules, selector = Nothing}} + Details: We first use the processor NaturalMI {miDimension = 1, miDegree = 1, miKind = Algebraic, uargs = UArgs, urules = URules, selector = Nothing} to orient following rules strictly: 1: msplit#(l) -> c_30(msplit'1#(l)) Consider the set of all dependency pairs 1: msplit#(l) -> c_30(msplit'1#(l)) 2: mergesort#(l) -> mergesort'1#(l) 3: mergesort'1#(dd(x1,xs)) -> mergesort'2#(xs,x1) 4: mergesort'2#(dd(x2,xs'),x1) -> mergesort'3#(msplit(dd(x1,dd(x2,xs')))) 5: mergesort'2#(dd(x2,xs'),x1) -> msplit#(dd(x1,dd(x2,xs'))) 6: mergesort'3#(tuple'2(l1,l2)) -> mergesort#(l1) 7: mergesort'3#(tuple'2(l1,l2)) -> mergesort#(l2) 8: msplit'1#(dd(x1,xs)) -> c_31(msplit'2#(xs,x1)) 9: msplit'2#(dd(x2,xs'),x1) -> c_33(msplit#(xs')) Processor NaturalMI {miDimension = 1, miDegree = 1, miKind = Algebraic, uargs = UArgs, urules = URules, selector = Nothing}induces the complexity certificateTIME (?,O(n^1)) SPACE(?,?)on application of the dependency pairs {1} These cover all (indirect) predecessors of dependency pairs {1,8,9} their number of applications is equally bounded. The dependency pairs are shifted into the weak component. ****** Step 5.b:4.b:4.b:1.b:1.a:1: NaturalMI WORST_CASE(?,O(n^1)) + Considered Problem: - Strict DPs: msplit#(l) -> c_30(msplit'1#(l)) - Weak DPs: mergesort#(l) -> mergesort'1#(l) mergesort'1#(dd(x1,xs)) -> mergesort'2#(xs,x1) mergesort'2#(dd(x2,xs'),x1) -> mergesort'3#(msplit(dd(x1,dd(x2,xs')))) mergesort'2#(dd(x2,xs'),x1) -> msplit#(dd(x1,dd(x2,xs'))) mergesort'3#(tuple'2(l1,l2)) -> mergesort#(l1) mergesort'3#(tuple'2(l1,l2)) -> mergesort#(l2) msplit'1#(dd(x1,xs)) -> c_31(msplit'2#(xs,x1)) msplit'2#(dd(x2,xs'),x1) -> c_33(msplit#(xs')) - Weak TRS: msplit(l) -> msplit'1(l) msplit'1(dd(x1,xs)) -> msplit'2(xs,x1) msplit'1(nil()) -> tuple'2(nil(),nil()) msplit'2(dd(x2,xs'),x1) -> msplit'3(msplit(xs'),x1,x2) msplit'2(nil(),x1) -> tuple'2(dd(x1,nil()),nil()) msplit'3(tuple'2(l1,l2),x1,x2) -> tuple'2(dd(x1,l1),dd(x2,l2)) - Signature: {'cklt/1,'compare/2,'less/2,merge/2,merge'1/2,merge'2/3,merge'3/5,mergesort/1,mergesort'1/1,mergesort'2/2 ,mergesort'3/1,msplit/1,msplit'1/1,msplit'2/2,msplit'3/3,'cklt#/1,'compare#/2,'less#/2,merge#/2,merge'1#/2 ,merge'2#/3,merge'3#/5,mergesort#/1,mergesort'1#/1,mergesort'2#/2,mergesort'3#/1,msplit#/1,msplit'1#/1 ,msplit'2#/2,msplit'3#/3} / {'0/0,'EQ/0,'GT/0,'LT/0,'false/0,'neg/1,'pos/1,'s/1,'true/0,dd/2,nil/0,tuple'2/2 ,c_1/0,c_2/0,c_3/0,c_4/0,c_5/0,c_6/0,c_7/0,c_8/0,c_9/1,c_10/0,c_11/0,c_12/0,c_13/1,c_14/0,c_15/1,c_16/1 ,c_17/1,c_18/1,c_19/0,c_20/1,c_21/0,c_22/1,c_23/1,c_24/1,c_25/1,c_26/0,c_27/2,c_28/0,c_29/2,c_30/1,c_31/1 ,c_32/0,c_33/1,c_34/0,c_35/0} - Obligation: innermost runtime complexity wrt. defined symbols {'cklt#,'compare#,'less#,merge#,merge'1#,merge'2#,merge'3# ,mergesort#,mergesort'1#,mergesort'2#,mergesort'3#,msplit#,msplit'1#,msplit'2# ,msplit'3#} and constructors {'0,'EQ,'GT,'LT,'false,'neg,'pos,'s,'true,dd,nil,tuple'2} + Applied Processor: NaturalMI {miDimension = 1, miDegree = 1, miKind = Algebraic, uargs = UArgs, urules = URules, selector = Just first alternative for predecessorEstimation on any intersect of rules of CDG leaf and strict-rules} + Details: We apply a matrix interpretation of kind constructor based matrix interpretation: The following argument positions are considered usable: uargs(c_30) = {1}, uargs(c_31) = {1}, uargs(c_33) = {1} Following symbols are considered usable: {msplit,msplit'1,msplit'2,msplit'3,'cklt#,'compare#,'less#,merge#,merge'1#,merge'2#,merge'3#,mergesort# ,mergesort'1#,mergesort'2#,mergesort'3#,msplit#,msplit'1#,msplit'2#,msplit'3#} TcT has computed the following interpretation: p('0) = [2] p('EQ) = [1] p('GT) = [1] p('LT) = [0] p('cklt) = [4] p('compare) = [2] x1 + [1] x2 + [1] p('false) = [0] p('less) = [2] x2 + [2] p('neg) = [0] p('pos) = [1] x1 + [1] p('s) = [1] x1 + [2] p('true) = [1] p(dd) = [1] x2 + [1] p(merge) = [1] x2 + [0] p(merge'1) = [1] x1 + [2] x2 + [2] p(merge'2) = [1] x2 + [4] x3 + [1] p(merge'3) = [2] x2 + [8] x3 + [1] x4 + [1] x5 + [1] p(mergesort) = [1] x1 + [1] p(mergesort'1) = [1] x1 + [2] p(mergesort'2) = [8] x1 + [0] p(mergesort'3) = [8] x1 + [1] p(msplit) = [1] x1 + [0] p(msplit'1) = [1] x1 + [0] p(msplit'2) = [1] x1 + [1] p(msplit'3) = [1] x1 + [2] p(nil) = [0] p(tuple'2) = [1] x1 + [1] x2 + [0] p('cklt#) = [1] x1 + [2] p('compare#) = [1] x2 + [1] p('less#) = [4] x1 + [1] x2 + [0] p(merge#) = [2] x1 + [1] x2 + [1] p(merge'1#) = [1] x1 + [8] x2 + [1] p(merge'2#) = [1] x1 + [0] p(merge'3#) = [8] x1 + [1] x2 + [4] x5 + [1] p(mergesort#) = [9] x1 + [6] p(mergesort'1#) = [9] x1 + [6] p(mergesort'2#) = [9] x1 + [15] p(mergesort'3#) = [9] x1 + [6] p(msplit#) = [8] x1 + [8] p(msplit'1#) = [8] x1 + [0] p(msplit'2#) = [8] x1 + [8] p(msplit'3#) = [1] x1 + [1] x2 + [2] p(c_1) = [1] p(c_2) = [1] p(c_3) = [2] p(c_4) = [4] p(c_5) = [0] p(c_6) = [0] p(c_7) = [1] p(c_8) = [4] p(c_9) = [1] p(c_10) = [1] p(c_11) = [0] p(c_12) = [1] p(c_13) = [2] x1 + [2] p(c_14) = [1] p(c_15) = [0] p(c_16) = [1] p(c_17) = [2] x1 + [1] p(c_18) = [1] x1 + [1] p(c_19) = [1] p(c_20) = [2] p(c_21) = [0] p(c_22) = [1] p(c_23) = [1] x1 + [1] p(c_24) = [1] x1 + [1] p(c_25) = [8] x1 + [1] p(c_26) = [0] p(c_27) = [4] x1 + [1] p(c_28) = [8] p(c_29) = [1] x2 + [2] p(c_30) = [1] x1 + [4] p(c_31) = [1] x1 + [0] p(c_32) = [2] p(c_33) = [1] x1 + [8] p(c_34) = [1] p(c_35) = [1] Following rules are strictly oriented: msplit#(l) = [8] l + [8] > [8] l + [4] = c_30(msplit'1#(l)) Following rules are (at-least) weakly oriented: mergesort#(l) = [9] l + [6] >= [9] l + [6] = mergesort'1#(l) mergesort'1#(dd(x1,xs)) = [9] xs + [15] >= [9] xs + [15] = mergesort'2#(xs,x1) mergesort'2#(dd(x2,xs'),x1) = [9] xs' + [24] >= [9] xs' + [24] = mergesort'3#(msplit(dd(x1,dd(x2,xs')))) mergesort'2#(dd(x2,xs'),x1) = [9] xs' + [24] >= [8] xs' + [24] = msplit#(dd(x1,dd(x2,xs'))) mergesort'3#(tuple'2(l1,l2)) = [9] l1 + [9] l2 + [6] >= [9] l1 + [6] = mergesort#(l1) mergesort'3#(tuple'2(l1,l2)) = [9] l1 + [9] l2 + [6] >= [9] l2 + [6] = mergesort#(l2) msplit'1#(dd(x1,xs)) = [8] xs + [8] >= [8] xs + [8] = c_31(msplit'2#(xs,x1)) msplit'2#(dd(x2,xs'),x1) = [8] xs' + [16] >= [8] xs' + [16] = c_33(msplit#(xs')) msplit(l) = [1] l + [0] >= [1] l + [0] = msplit'1(l) msplit'1(dd(x1,xs)) = [1] xs + [1] >= [1] xs + [1] = msplit'2(xs,x1) msplit'1(nil()) = [0] >= [0] = tuple'2(nil(),nil()) msplit'2(dd(x2,xs'),x1) = [1] xs' + [2] >= [1] xs' + [2] = msplit'3(msplit(xs'),x1,x2) msplit'2(nil(),x1) = [1] >= [1] = tuple'2(dd(x1,nil()),nil()) msplit'3(tuple'2(l1,l2),x1,x2) = [1] l1 + [1] l2 + [2] >= [1] l1 + [1] l2 + [2] = tuple'2(dd(x1,l1),dd(x2,l2)) ****** Step 5.b:4.b:4.b:1.b:1.a:2: Assumption WORST_CASE(?,O(1)) + Considered Problem: - Weak DPs: mergesort#(l) -> mergesort'1#(l) mergesort'1#(dd(x1,xs)) -> mergesort'2#(xs,x1) mergesort'2#(dd(x2,xs'),x1) -> mergesort'3#(msplit(dd(x1,dd(x2,xs')))) mergesort'2#(dd(x2,xs'),x1) -> msplit#(dd(x1,dd(x2,xs'))) mergesort'3#(tuple'2(l1,l2)) -> mergesort#(l1) mergesort'3#(tuple'2(l1,l2)) -> mergesort#(l2) msplit#(l) -> c_30(msplit'1#(l)) msplit'1#(dd(x1,xs)) -> c_31(msplit'2#(xs,x1)) msplit'2#(dd(x2,xs'),x1) -> c_33(msplit#(xs')) - Weak TRS: msplit(l) -> msplit'1(l) msplit'1(dd(x1,xs)) -> msplit'2(xs,x1) msplit'1(nil()) -> tuple'2(nil(),nil()) msplit'2(dd(x2,xs'),x1) -> msplit'3(msplit(xs'),x1,x2) msplit'2(nil(),x1) -> tuple'2(dd(x1,nil()),nil()) msplit'3(tuple'2(l1,l2),x1,x2) -> tuple'2(dd(x1,l1),dd(x2,l2)) - Signature: {'cklt/1,'compare/2,'less/2,merge/2,merge'1/2,merge'2/3,merge'3/5,mergesort/1,mergesort'1/1,mergesort'2/2 ,mergesort'3/1,msplit/1,msplit'1/1,msplit'2/2,msplit'3/3,'cklt#/1,'compare#/2,'less#/2,merge#/2,merge'1#/2 ,merge'2#/3,merge'3#/5,mergesort#/1,mergesort'1#/1,mergesort'2#/2,mergesort'3#/1,msplit#/1,msplit'1#/1 ,msplit'2#/2,msplit'3#/3} / {'0/0,'EQ/0,'GT/0,'LT/0,'false/0,'neg/1,'pos/1,'s/1,'true/0,dd/2,nil/0,tuple'2/2 ,c_1/0,c_2/0,c_3/0,c_4/0,c_5/0,c_6/0,c_7/0,c_8/0,c_9/1,c_10/0,c_11/0,c_12/0,c_13/1,c_14/0,c_15/1,c_16/1 ,c_17/1,c_18/1,c_19/0,c_20/1,c_21/0,c_22/1,c_23/1,c_24/1,c_25/1,c_26/0,c_27/2,c_28/0,c_29/2,c_30/1,c_31/1 ,c_32/0,c_33/1,c_34/0,c_35/0} - Obligation: innermost runtime complexity wrt. defined symbols {'cklt#,'compare#,'less#,merge#,merge'1#,merge'2#,merge'3# ,mergesort#,mergesort'1#,mergesort'2#,mergesort'3#,msplit#,msplit'1#,msplit'2# ,msplit'3#} and constructors {'0,'EQ,'GT,'LT,'false,'neg,'pos,'s,'true,dd,nil,tuple'2} + Applied Processor: Assumption {assumed = Certificate {spaceUB = Unknown, spaceLB = Unknown, timeUB = Poly (Just 0), timeLB = Unknown}} + Details: () ****** Step 5.b:4.b:4.b:1.b:1.b:1: RemoveWeakSuffixes WORST_CASE(?,O(1)) + Considered Problem: - Weak DPs: mergesort#(l) -> mergesort'1#(l) mergesort'1#(dd(x1,xs)) -> mergesort'2#(xs,x1) mergesort'2#(dd(x2,xs'),x1) -> mergesort'3#(msplit(dd(x1,dd(x2,xs')))) mergesort'2#(dd(x2,xs'),x1) -> msplit#(dd(x1,dd(x2,xs'))) mergesort'3#(tuple'2(l1,l2)) -> mergesort#(l1) mergesort'3#(tuple'2(l1,l2)) -> mergesort#(l2) msplit#(l) -> c_30(msplit'1#(l)) msplit'1#(dd(x1,xs)) -> c_31(msplit'2#(xs,x1)) msplit'2#(dd(x2,xs'),x1) -> c_33(msplit#(xs')) - Weak TRS: msplit(l) -> msplit'1(l) msplit'1(dd(x1,xs)) -> msplit'2(xs,x1) msplit'1(nil()) -> tuple'2(nil(),nil()) msplit'2(dd(x2,xs'),x1) -> msplit'3(msplit(xs'),x1,x2) msplit'2(nil(),x1) -> tuple'2(dd(x1,nil()),nil()) msplit'3(tuple'2(l1,l2),x1,x2) -> tuple'2(dd(x1,l1),dd(x2,l2)) - Signature: {'cklt/1,'compare/2,'less/2,merge/2,merge'1/2,merge'2/3,merge'3/5,mergesort/1,mergesort'1/1,mergesort'2/2 ,mergesort'3/1,msplit/1,msplit'1/1,msplit'2/2,msplit'3/3,'cklt#/1,'compare#/2,'less#/2,merge#/2,merge'1#/2 ,merge'2#/3,merge'3#/5,mergesort#/1,mergesort'1#/1,mergesort'2#/2,mergesort'3#/1,msplit#/1,msplit'1#/1 ,msplit'2#/2,msplit'3#/3} / {'0/0,'EQ/0,'GT/0,'LT/0,'false/0,'neg/1,'pos/1,'s/1,'true/0,dd/2,nil/0,tuple'2/2 ,c_1/0,c_2/0,c_3/0,c_4/0,c_5/0,c_6/0,c_7/0,c_8/0,c_9/1,c_10/0,c_11/0,c_12/0,c_13/1,c_14/0,c_15/1,c_16/1 ,c_17/1,c_18/1,c_19/0,c_20/1,c_21/0,c_22/1,c_23/1,c_24/1,c_25/1,c_26/0,c_27/2,c_28/0,c_29/2,c_30/1,c_31/1 ,c_32/0,c_33/1,c_34/0,c_35/0} - Obligation: innermost runtime complexity wrt. defined symbols {'cklt#,'compare#,'less#,merge#,merge'1#,merge'2#,merge'3# ,mergesort#,mergesort'1#,mergesort'2#,mergesort'3#,msplit#,msplit'1#,msplit'2# ,msplit'3#} and constructors {'0,'EQ,'GT,'LT,'false,'neg,'pos,'s,'true,dd,nil,tuple'2} + Applied Processor: RemoveWeakSuffixes + Details: Consider the dependency graph 1:W:mergesort#(l) -> mergesort'1#(l) -->_1 mergesort'1#(dd(x1,xs)) -> mergesort'2#(xs,x1):2 2:W:mergesort'1#(dd(x1,xs)) -> mergesort'2#(xs,x1) -->_1 mergesort'2#(dd(x2,xs'),x1) -> msplit#(dd(x1,dd(x2,xs'))):4 -->_1 mergesort'2#(dd(x2,xs'),x1) -> mergesort'3#(msplit(dd(x1,dd(x2,xs')))):3 3:W:mergesort'2#(dd(x2,xs'),x1) -> mergesort'3#(msplit(dd(x1,dd(x2,xs')))) -->_1 mergesort'3#(tuple'2(l1,l2)) -> mergesort#(l2):6 -->_1 mergesort'3#(tuple'2(l1,l2)) -> mergesort#(l1):5 4:W:mergesort'2#(dd(x2,xs'),x1) -> msplit#(dd(x1,dd(x2,xs'))) -->_1 msplit#(l) -> c_30(msplit'1#(l)):7 5:W:mergesort'3#(tuple'2(l1,l2)) -> mergesort#(l1) -->_1 mergesort#(l) -> mergesort'1#(l):1 6:W:mergesort'3#(tuple'2(l1,l2)) -> mergesort#(l2) -->_1 mergesort#(l) -> mergesort'1#(l):1 7:W:msplit#(l) -> c_30(msplit'1#(l)) -->_1 msplit'1#(dd(x1,xs)) -> c_31(msplit'2#(xs,x1)):8 8:W:msplit'1#(dd(x1,xs)) -> c_31(msplit'2#(xs,x1)) -->_1 msplit'2#(dd(x2,xs'),x1) -> c_33(msplit#(xs')):9 9:W:msplit'2#(dd(x2,xs'),x1) -> c_33(msplit#(xs')) -->_1 msplit#(l) -> c_30(msplit'1#(l)):7 The following weak DPs constitute a sub-graph of the DG that is closed under successors. The DPs are removed. 1: mergesort#(l) -> mergesort'1#(l) 6: mergesort'3#(tuple'2(l1,l2)) -> mergesort#(l2) 3: mergesort'2#(dd(x2,xs'),x1) -> mergesort'3#(msplit(dd(x1,dd(x2,xs')))) 2: mergesort'1#(dd(x1,xs)) -> mergesort'2#(xs,x1) 5: mergesort'3#(tuple'2(l1,l2)) -> mergesort#(l1) 4: mergesort'2#(dd(x2,xs'),x1) -> msplit#(dd(x1,dd(x2,xs'))) 7: msplit#(l) -> c_30(msplit'1#(l)) 9: msplit'2#(dd(x2,xs'),x1) -> c_33(msplit#(xs')) 8: msplit'1#(dd(x1,xs)) -> c_31(msplit'2#(xs,x1)) ****** Step 5.b:4.b:4.b:1.b:1.b:2: EmptyProcessor WORST_CASE(?,O(1)) + Considered Problem: - Weak TRS: msplit(l) -> msplit'1(l) msplit'1(dd(x1,xs)) -> msplit'2(xs,x1) msplit'1(nil()) -> tuple'2(nil(),nil()) msplit'2(dd(x2,xs'),x1) -> msplit'3(msplit(xs'),x1,x2) msplit'2(nil(),x1) -> tuple'2(dd(x1,nil()),nil()) msplit'3(tuple'2(l1,l2),x1,x2) -> tuple'2(dd(x1,l1),dd(x2,l2)) - Signature: {'cklt/1,'compare/2,'less/2,merge/2,merge'1/2,merge'2/3,merge'3/5,mergesort/1,mergesort'1/1,mergesort'2/2 ,mergesort'3/1,msplit/1,msplit'1/1,msplit'2/2,msplit'3/3,'cklt#/1,'compare#/2,'less#/2,merge#/2,merge'1#/2 ,merge'2#/3,merge'3#/5,mergesort#/1,mergesort'1#/1,mergesort'2#/2,mergesort'3#/1,msplit#/1,msplit'1#/1 ,msplit'2#/2,msplit'3#/3} / {'0/0,'EQ/0,'GT/0,'LT/0,'false/0,'neg/1,'pos/1,'s/1,'true/0,dd/2,nil/0,tuple'2/2 ,c_1/0,c_2/0,c_3/0,c_4/0,c_5/0,c_6/0,c_7/0,c_8/0,c_9/1,c_10/0,c_11/0,c_12/0,c_13/1,c_14/0,c_15/1,c_16/1 ,c_17/1,c_18/1,c_19/0,c_20/1,c_21/0,c_22/1,c_23/1,c_24/1,c_25/1,c_26/0,c_27/2,c_28/0,c_29/2,c_30/1,c_31/1 ,c_32/0,c_33/1,c_34/0,c_35/0} - Obligation: innermost runtime complexity wrt. defined symbols {'cklt#,'compare#,'less#,merge#,merge'1#,merge'2#,merge'3# ,mergesort#,mergesort'1#,mergesort'2#,mergesort'3#,msplit#,msplit'1#,msplit'2# ,msplit'3#} and constructors {'0,'EQ,'GT,'LT,'false,'neg,'pos,'s,'true,dd,nil,tuple'2} + Applied Processor: EmptyProcessor + Details: The problem is already closed. The intended complexity is O(1). WORST_CASE(?,O(n^3))