MAYBE * Step 1: DependencyPairs MAYBE + Considered Problem: - Strict TRS: a__add(X1,X2) -> add(X1,X2) a__add(0(),X) -> mark(X) a__add(s(X),Y) -> s(a__add(mark(X),mark(Y))) a__dbl(X) -> dbl(X) a__dbl(0()) -> 0() a__dbl(s(X)) -> s(s(a__dbl(mark(X)))) a__first(X1,X2) -> first(X1,X2) a__first(0(),X) -> nil() a__first(s(X),cons(Y,Z)) -> cons(mark(Y),first(X,Z)) a__sqr(X) -> sqr(X) a__sqr(0()) -> 0() a__sqr(s(X)) -> s(a__add(a__sqr(mark(X)),a__dbl(mark(X)))) a__terms(N) -> cons(recip(a__sqr(mark(N))),terms(s(N))) a__terms(X) -> terms(X) mark(0()) -> 0() mark(add(X1,X2)) -> a__add(mark(X1),mark(X2)) mark(cons(X1,X2)) -> cons(mark(X1),X2) mark(dbl(X)) -> a__dbl(mark(X)) mark(first(X1,X2)) -> a__first(mark(X1),mark(X2)) mark(nil()) -> nil() mark(recip(X)) -> recip(mark(X)) mark(s(X)) -> s(mark(X)) mark(sqr(X)) -> a__sqr(mark(X)) mark(terms(X)) -> a__terms(mark(X)) - Signature: {a__add/2,a__dbl/1,a__first/2,a__sqr/1,a__terms/1,mark/1} / {0/0,add/2,cons/2,dbl/1,first/2,nil/0,recip/1 ,s/1,sqr/1,terms/1} - Obligation: innermost runtime complexity wrt. defined symbols {a__add,a__dbl,a__first,a__sqr,a__terms ,mark} and constructors {0,add,cons,dbl,first,nil,recip,s,sqr,terms} + Applied Processor: DependencyPairs {dpKind_ = DT} + Details: We add the following dependency tuples: Strict DPs a__add#(X1,X2) -> c_1() a__add#(0(),X) -> c_2(mark#(X)) a__add#(s(X),Y) -> c_3(a__add#(mark(X),mark(Y)),mark#(X),mark#(Y)) a__dbl#(X) -> c_4() a__dbl#(0()) -> c_5() a__dbl#(s(X)) -> c_6(a__dbl#(mark(X)),mark#(X)) a__first#(X1,X2) -> c_7() a__first#(0(),X) -> c_8() a__first#(s(X),cons(Y,Z)) -> c_9(mark#(Y)) a__sqr#(X) -> c_10() a__sqr#(0()) -> c_11() a__sqr#(s(X)) -> c_12(a__add#(a__sqr(mark(X)),a__dbl(mark(X))) ,a__sqr#(mark(X)) ,mark#(X) ,a__dbl#(mark(X)) ,mark#(X)) a__terms#(N) -> c_13(a__sqr#(mark(N)),mark#(N)) a__terms#(X) -> c_14() mark#(0()) -> c_15() mark#(add(X1,X2)) -> c_16(a__add#(mark(X1),mark(X2)),mark#(X1),mark#(X2)) mark#(cons(X1,X2)) -> c_17(mark#(X1)) mark#(dbl(X)) -> c_18(a__dbl#(mark(X)),mark#(X)) mark#(first(X1,X2)) -> c_19(a__first#(mark(X1),mark(X2)),mark#(X1),mark#(X2)) mark#(nil()) -> c_20() mark#(recip(X)) -> c_21(mark#(X)) mark#(s(X)) -> c_22(mark#(X)) mark#(sqr(X)) -> c_23(a__sqr#(mark(X)),mark#(X)) mark#(terms(X)) -> c_24(a__terms#(mark(X)),mark#(X)) Weak DPs and mark the set of starting terms. * Step 2: PredecessorEstimation MAYBE + Considered Problem: - Strict DPs: a__add#(X1,X2) -> c_1() a__add#(0(),X) -> c_2(mark#(X)) a__add#(s(X),Y) -> c_3(a__add#(mark(X),mark(Y)),mark#(X),mark#(Y)) a__dbl#(X) -> c_4() a__dbl#(0()) -> c_5() a__dbl#(s(X)) -> c_6(a__dbl#(mark(X)),mark#(X)) a__first#(X1,X2) -> c_7() a__first#(0(),X) -> c_8() a__first#(s(X),cons(Y,Z)) -> c_9(mark#(Y)) a__sqr#(X) -> c_10() a__sqr#(0()) -> c_11() a__sqr#(s(X)) -> c_12(a__add#(a__sqr(mark(X)),a__dbl(mark(X))) ,a__sqr#(mark(X)) ,mark#(X) ,a__dbl#(mark(X)) ,mark#(X)) a__terms#(N) -> c_13(a__sqr#(mark(N)),mark#(N)) a__terms#(X) -> c_14() mark#(0()) -> c_15() mark#(add(X1,X2)) -> c_16(a__add#(mark(X1),mark(X2)),mark#(X1),mark#(X2)) mark#(cons(X1,X2)) -> c_17(mark#(X1)) mark#(dbl(X)) -> c_18(a__dbl#(mark(X)),mark#(X)) mark#(first(X1,X2)) -> c_19(a__first#(mark(X1),mark(X2)),mark#(X1),mark#(X2)) mark#(nil()) -> c_20() mark#(recip(X)) -> c_21(mark#(X)) mark#(s(X)) -> c_22(mark#(X)) mark#(sqr(X)) -> c_23(a__sqr#(mark(X)),mark#(X)) mark#(terms(X)) -> c_24(a__terms#(mark(X)),mark#(X)) - Weak TRS: a__add(X1,X2) -> add(X1,X2) a__add(0(),X) -> mark(X) a__add(s(X),Y) -> s(a__add(mark(X),mark(Y))) a__dbl(X) -> dbl(X) a__dbl(0()) -> 0() a__dbl(s(X)) -> s(s(a__dbl(mark(X)))) a__first(X1,X2) -> first(X1,X2) a__first(0(),X) -> nil() a__first(s(X),cons(Y,Z)) -> cons(mark(Y),first(X,Z)) a__sqr(X) -> sqr(X) a__sqr(0()) -> 0() a__sqr(s(X)) -> s(a__add(a__sqr(mark(X)),a__dbl(mark(X)))) a__terms(N) -> cons(recip(a__sqr(mark(N))),terms(s(N))) a__terms(X) -> terms(X) mark(0()) -> 0() mark(add(X1,X2)) -> a__add(mark(X1),mark(X2)) mark(cons(X1,X2)) -> cons(mark(X1),X2) mark(dbl(X)) -> a__dbl(mark(X)) mark(first(X1,X2)) -> a__first(mark(X1),mark(X2)) mark(nil()) -> nil() mark(recip(X)) -> recip(mark(X)) mark(s(X)) -> s(mark(X)) mark(sqr(X)) -> a__sqr(mark(X)) mark(terms(X)) -> a__terms(mark(X)) - Signature: {a__add/2,a__dbl/1,a__first/2,a__sqr/1,a__terms/1,mark/1,a__add#/2,a__dbl#/1,a__first#/2,a__sqr#/1 ,a__terms#/1,mark#/1} / {0/0,add/2,cons/2,dbl/1,first/2,nil/0,recip/1,s/1,sqr/1,terms/1,c_1/0,c_2/1,c_3/3 ,c_4/0,c_5/0,c_6/2,c_7/0,c_8/0,c_9/1,c_10/0,c_11/0,c_12/5,c_13/2,c_14/0,c_15/0,c_16/3,c_17/1,c_18/2,c_19/3 ,c_20/0,c_21/1,c_22/1,c_23/2,c_24/2} - Obligation: innermost runtime complexity wrt. defined symbols {a__add#,a__dbl#,a__first#,a__sqr#,a__terms# ,mark#} and constructors {0,add,cons,dbl,first,nil,recip,s,sqr,terms} + Applied Processor: PredecessorEstimation {onSelection = all simple predecessor estimation selector} + Details: We estimate the number of application of {1,4,5,7,8,10,11,14,15,20} by application of Pre({1,4,5,7,8,10,11,14,15,20}) = {2,3,6,9,12,13,16,17,18,19,21,22,23,24}. Here rules are labelled as follows: 1: a__add#(X1,X2) -> c_1() 2: a__add#(0(),X) -> c_2(mark#(X)) 3: a__add#(s(X),Y) -> c_3(a__add#(mark(X),mark(Y)),mark#(X),mark#(Y)) 4: a__dbl#(X) -> c_4() 5: a__dbl#(0()) -> c_5() 6: a__dbl#(s(X)) -> c_6(a__dbl#(mark(X)),mark#(X)) 7: a__first#(X1,X2) -> c_7() 8: a__first#(0(),X) -> c_8() 9: a__first#(s(X),cons(Y,Z)) -> c_9(mark#(Y)) 10: a__sqr#(X) -> c_10() 11: a__sqr#(0()) -> c_11() 12: a__sqr#(s(X)) -> c_12(a__add#(a__sqr(mark(X)),a__dbl(mark(X))) ,a__sqr#(mark(X)) ,mark#(X) ,a__dbl#(mark(X)) ,mark#(X)) 13: a__terms#(N) -> c_13(a__sqr#(mark(N)),mark#(N)) 14: a__terms#(X) -> c_14() 15: mark#(0()) -> c_15() 16: mark#(add(X1,X2)) -> c_16(a__add#(mark(X1),mark(X2)),mark#(X1),mark#(X2)) 17: mark#(cons(X1,X2)) -> c_17(mark#(X1)) 18: mark#(dbl(X)) -> c_18(a__dbl#(mark(X)),mark#(X)) 19: mark#(first(X1,X2)) -> c_19(a__first#(mark(X1),mark(X2)),mark#(X1),mark#(X2)) 20: mark#(nil()) -> c_20() 21: mark#(recip(X)) -> c_21(mark#(X)) 22: mark#(s(X)) -> c_22(mark#(X)) 23: mark#(sqr(X)) -> c_23(a__sqr#(mark(X)),mark#(X)) 24: mark#(terms(X)) -> c_24(a__terms#(mark(X)),mark#(X)) * Step 3: RemoveWeakSuffixes MAYBE + Considered Problem: - Strict DPs: a__add#(0(),X) -> c_2(mark#(X)) a__add#(s(X),Y) -> c_3(a__add#(mark(X),mark(Y)),mark#(X),mark#(Y)) a__dbl#(s(X)) -> c_6(a__dbl#(mark(X)),mark#(X)) a__first#(s(X),cons(Y,Z)) -> c_9(mark#(Y)) a__sqr#(s(X)) -> c_12(a__add#(a__sqr(mark(X)),a__dbl(mark(X))) ,a__sqr#(mark(X)) ,mark#(X) ,a__dbl#(mark(X)) ,mark#(X)) a__terms#(N) -> c_13(a__sqr#(mark(N)),mark#(N)) mark#(add(X1,X2)) -> c_16(a__add#(mark(X1),mark(X2)),mark#(X1),mark#(X2)) mark#(cons(X1,X2)) -> c_17(mark#(X1)) mark#(dbl(X)) -> c_18(a__dbl#(mark(X)),mark#(X)) mark#(first(X1,X2)) -> c_19(a__first#(mark(X1),mark(X2)),mark#(X1),mark#(X2)) mark#(recip(X)) -> c_21(mark#(X)) mark#(s(X)) -> c_22(mark#(X)) mark#(sqr(X)) -> c_23(a__sqr#(mark(X)),mark#(X)) mark#(terms(X)) -> c_24(a__terms#(mark(X)),mark#(X)) - Weak DPs: a__add#(X1,X2) -> c_1() a__dbl#(X) -> c_4() a__dbl#(0()) -> c_5() a__first#(X1,X2) -> c_7() a__first#(0(),X) -> c_8() a__sqr#(X) -> c_10() a__sqr#(0()) -> c_11() a__terms#(X) -> c_14() mark#(0()) -> c_15() mark#(nil()) -> c_20() - Weak TRS: a__add(X1,X2) -> add(X1,X2) a__add(0(),X) -> mark(X) a__add(s(X),Y) -> s(a__add(mark(X),mark(Y))) a__dbl(X) -> dbl(X) a__dbl(0()) -> 0() a__dbl(s(X)) -> s(s(a__dbl(mark(X)))) a__first(X1,X2) -> first(X1,X2) a__first(0(),X) -> nil() a__first(s(X),cons(Y,Z)) -> cons(mark(Y),first(X,Z)) a__sqr(X) -> sqr(X) a__sqr(0()) -> 0() a__sqr(s(X)) -> s(a__add(a__sqr(mark(X)),a__dbl(mark(X)))) a__terms(N) -> cons(recip(a__sqr(mark(N))),terms(s(N))) a__terms(X) -> terms(X) mark(0()) -> 0() mark(add(X1,X2)) -> a__add(mark(X1),mark(X2)) mark(cons(X1,X2)) -> cons(mark(X1),X2) mark(dbl(X)) -> a__dbl(mark(X)) mark(first(X1,X2)) -> a__first(mark(X1),mark(X2)) mark(nil()) -> nil() mark(recip(X)) -> recip(mark(X)) mark(s(X)) -> s(mark(X)) mark(sqr(X)) -> a__sqr(mark(X)) mark(terms(X)) -> a__terms(mark(X)) - Signature: {a__add/2,a__dbl/1,a__first/2,a__sqr/1,a__terms/1,mark/1,a__add#/2,a__dbl#/1,a__first#/2,a__sqr#/1 ,a__terms#/1,mark#/1} / {0/0,add/2,cons/2,dbl/1,first/2,nil/0,recip/1,s/1,sqr/1,terms/1,c_1/0,c_2/1,c_3/3 ,c_4/0,c_5/0,c_6/2,c_7/0,c_8/0,c_9/1,c_10/0,c_11/0,c_12/5,c_13/2,c_14/0,c_15/0,c_16/3,c_17/1,c_18/2,c_19/3 ,c_20/0,c_21/1,c_22/1,c_23/2,c_24/2} - Obligation: innermost runtime complexity wrt. defined symbols {a__add#,a__dbl#,a__first#,a__sqr#,a__terms# ,mark#} and constructors {0,add,cons,dbl,first,nil,recip,s,sqr,terms} + Applied Processor: RemoveWeakSuffixes + Details: Consider the dependency graph 1:S:a__add#(0(),X) -> c_2(mark#(X)) -->_1 mark#(terms(X)) -> c_24(a__terms#(mark(X)),mark#(X)):14 -->_1 mark#(sqr(X)) -> c_23(a__sqr#(mark(X)),mark#(X)):13 -->_1 mark#(s(X)) -> c_22(mark#(X)):12 -->_1 mark#(recip(X)) -> c_21(mark#(X)):11 -->_1 mark#(first(X1,X2)) -> c_19(a__first#(mark(X1),mark(X2)),mark#(X1),mark#(X2)):10 -->_1 mark#(dbl(X)) -> c_18(a__dbl#(mark(X)),mark#(X)):9 -->_1 mark#(cons(X1,X2)) -> c_17(mark#(X1)):8 -->_1 mark#(add(X1,X2)) -> c_16(a__add#(mark(X1),mark(X2)),mark#(X1),mark#(X2)):7 -->_1 mark#(nil()) -> c_20():24 -->_1 mark#(0()) -> c_15():23 2:S:a__add#(s(X),Y) -> c_3(a__add#(mark(X),mark(Y)),mark#(X),mark#(Y)) -->_3 mark#(terms(X)) -> c_24(a__terms#(mark(X)),mark#(X)):14 -->_2 mark#(terms(X)) -> c_24(a__terms#(mark(X)),mark#(X)):14 -->_3 mark#(sqr(X)) -> c_23(a__sqr#(mark(X)),mark#(X)):13 -->_2 mark#(sqr(X)) -> c_23(a__sqr#(mark(X)),mark#(X)):13 -->_3 mark#(s(X)) -> c_22(mark#(X)):12 -->_2 mark#(s(X)) -> c_22(mark#(X)):12 -->_3 mark#(recip(X)) -> c_21(mark#(X)):11 -->_2 mark#(recip(X)) -> c_21(mark#(X)):11 -->_3 mark#(first(X1,X2)) -> c_19(a__first#(mark(X1),mark(X2)),mark#(X1),mark#(X2)):10 -->_2 mark#(first(X1,X2)) -> c_19(a__first#(mark(X1),mark(X2)),mark#(X1),mark#(X2)):10 -->_3 mark#(dbl(X)) -> c_18(a__dbl#(mark(X)),mark#(X)):9 -->_2 mark#(dbl(X)) -> c_18(a__dbl#(mark(X)),mark#(X)):9 -->_3 mark#(cons(X1,X2)) -> c_17(mark#(X1)):8 -->_2 mark#(cons(X1,X2)) -> c_17(mark#(X1)):8 -->_3 mark#(add(X1,X2)) -> c_16(a__add#(mark(X1),mark(X2)),mark#(X1),mark#(X2)):7 -->_2 mark#(add(X1,X2)) -> c_16(a__add#(mark(X1),mark(X2)),mark#(X1),mark#(X2)):7 -->_3 mark#(nil()) -> c_20():24 -->_2 mark#(nil()) -> c_20():24 -->_3 mark#(0()) -> c_15():23 -->_2 mark#(0()) -> c_15():23 -->_1 a__add#(X1,X2) -> c_1():15 -->_1 a__add#(s(X),Y) -> c_3(a__add#(mark(X),mark(Y)),mark#(X),mark#(Y)):2 -->_1 a__add#(0(),X) -> c_2(mark#(X)):1 3:S:a__dbl#(s(X)) -> c_6(a__dbl#(mark(X)),mark#(X)) -->_2 mark#(terms(X)) -> c_24(a__terms#(mark(X)),mark#(X)):14 -->_2 mark#(sqr(X)) -> c_23(a__sqr#(mark(X)),mark#(X)):13 -->_2 mark#(s(X)) -> c_22(mark#(X)):12 -->_2 mark#(recip(X)) -> c_21(mark#(X)):11 -->_2 mark#(first(X1,X2)) -> c_19(a__first#(mark(X1),mark(X2)),mark#(X1),mark#(X2)):10 -->_2 mark#(dbl(X)) -> c_18(a__dbl#(mark(X)),mark#(X)):9 -->_2 mark#(cons(X1,X2)) -> c_17(mark#(X1)):8 -->_2 mark#(add(X1,X2)) -> c_16(a__add#(mark(X1),mark(X2)),mark#(X1),mark#(X2)):7 -->_2 mark#(nil()) -> c_20():24 -->_2 mark#(0()) -> c_15():23 -->_1 a__dbl#(0()) -> c_5():17 -->_1 a__dbl#(X) -> c_4():16 -->_1 a__dbl#(s(X)) -> c_6(a__dbl#(mark(X)),mark#(X)):3 4:S:a__first#(s(X),cons(Y,Z)) -> c_9(mark#(Y)) -->_1 mark#(terms(X)) -> c_24(a__terms#(mark(X)),mark#(X)):14 -->_1 mark#(sqr(X)) -> c_23(a__sqr#(mark(X)),mark#(X)):13 -->_1 mark#(s(X)) -> c_22(mark#(X)):12 -->_1 mark#(recip(X)) -> c_21(mark#(X)):11 -->_1 mark#(first(X1,X2)) -> c_19(a__first#(mark(X1),mark(X2)),mark#(X1),mark#(X2)):10 -->_1 mark#(dbl(X)) -> c_18(a__dbl#(mark(X)),mark#(X)):9 -->_1 mark#(cons(X1,X2)) -> c_17(mark#(X1)):8 -->_1 mark#(add(X1,X2)) -> c_16(a__add#(mark(X1),mark(X2)),mark#(X1),mark#(X2)):7 -->_1 mark#(nil()) -> c_20():24 -->_1 mark#(0()) -> c_15():23 5:S:a__sqr#(s(X)) -> c_12(a__add#(a__sqr(mark(X)),a__dbl(mark(X))) ,a__sqr#(mark(X)) ,mark#(X) ,a__dbl#(mark(X)) ,mark#(X)) -->_5 mark#(terms(X)) -> c_24(a__terms#(mark(X)),mark#(X)):14 -->_3 mark#(terms(X)) -> c_24(a__terms#(mark(X)),mark#(X)):14 -->_5 mark#(sqr(X)) -> c_23(a__sqr#(mark(X)),mark#(X)):13 -->_3 mark#(sqr(X)) -> c_23(a__sqr#(mark(X)),mark#(X)):13 -->_5 mark#(s(X)) -> c_22(mark#(X)):12 -->_3 mark#(s(X)) -> c_22(mark#(X)):12 -->_5 mark#(recip(X)) -> c_21(mark#(X)):11 -->_3 mark#(recip(X)) -> c_21(mark#(X)):11 -->_5 mark#(first(X1,X2)) -> c_19(a__first#(mark(X1),mark(X2)),mark#(X1),mark#(X2)):10 -->_3 mark#(first(X1,X2)) -> c_19(a__first#(mark(X1),mark(X2)),mark#(X1),mark#(X2)):10 -->_5 mark#(dbl(X)) -> c_18(a__dbl#(mark(X)),mark#(X)):9 -->_3 mark#(dbl(X)) -> c_18(a__dbl#(mark(X)),mark#(X)):9 -->_5 mark#(cons(X1,X2)) -> c_17(mark#(X1)):8 -->_3 mark#(cons(X1,X2)) -> c_17(mark#(X1)):8 -->_5 mark#(add(X1,X2)) -> c_16(a__add#(mark(X1),mark(X2)),mark#(X1),mark#(X2)):7 -->_3 mark#(add(X1,X2)) -> c_16(a__add#(mark(X1),mark(X2)),mark#(X1),mark#(X2)):7 -->_5 mark#(nil()) -> c_20():24 -->_3 mark#(nil()) -> c_20():24 -->_5 mark#(0()) -> c_15():23 -->_3 mark#(0()) -> c_15():23 -->_2 a__sqr#(0()) -> c_11():21 -->_2 a__sqr#(X) -> c_10():20 -->_4 a__dbl#(0()) -> c_5():17 -->_4 a__dbl#(X) -> c_4():16 -->_1 a__add#(X1,X2) -> c_1():15 -->_2 a__sqr#(s(X)) -> c_12(a__add#(a__sqr(mark(X)),a__dbl(mark(X))) ,a__sqr#(mark(X)) ,mark#(X) ,a__dbl#(mark(X)) ,mark#(X)):5 -->_4 a__dbl#(s(X)) -> c_6(a__dbl#(mark(X)),mark#(X)):3 -->_1 a__add#(s(X),Y) -> c_3(a__add#(mark(X),mark(Y)),mark#(X),mark#(Y)):2 -->_1 a__add#(0(),X) -> c_2(mark#(X)):1 6:S:a__terms#(N) -> c_13(a__sqr#(mark(N)),mark#(N)) -->_2 mark#(terms(X)) -> c_24(a__terms#(mark(X)),mark#(X)):14 -->_2 mark#(sqr(X)) -> c_23(a__sqr#(mark(X)),mark#(X)):13 -->_2 mark#(s(X)) -> c_22(mark#(X)):12 -->_2 mark#(recip(X)) -> c_21(mark#(X)):11 -->_2 mark#(first(X1,X2)) -> c_19(a__first#(mark(X1),mark(X2)),mark#(X1),mark#(X2)):10 -->_2 mark#(dbl(X)) -> c_18(a__dbl#(mark(X)),mark#(X)):9 -->_2 mark#(cons(X1,X2)) -> c_17(mark#(X1)):8 -->_2 mark#(add(X1,X2)) -> c_16(a__add#(mark(X1),mark(X2)),mark#(X1),mark#(X2)):7 -->_2 mark#(nil()) -> c_20():24 -->_2 mark#(0()) -> c_15():23 -->_1 a__sqr#(0()) -> c_11():21 -->_1 a__sqr#(X) -> c_10():20 -->_1 a__sqr#(s(X)) -> c_12(a__add#(a__sqr(mark(X)),a__dbl(mark(X))) ,a__sqr#(mark(X)) ,mark#(X) ,a__dbl#(mark(X)) ,mark#(X)):5 7:S:mark#(add(X1,X2)) -> c_16(a__add#(mark(X1),mark(X2)),mark#(X1),mark#(X2)) -->_3 mark#(terms(X)) -> c_24(a__terms#(mark(X)),mark#(X)):14 -->_2 mark#(terms(X)) -> c_24(a__terms#(mark(X)),mark#(X)):14 -->_3 mark#(sqr(X)) -> c_23(a__sqr#(mark(X)),mark#(X)):13 -->_2 mark#(sqr(X)) -> c_23(a__sqr#(mark(X)),mark#(X)):13 -->_3 mark#(s(X)) -> c_22(mark#(X)):12 -->_2 mark#(s(X)) -> c_22(mark#(X)):12 -->_3 mark#(recip(X)) -> c_21(mark#(X)):11 -->_2 mark#(recip(X)) -> c_21(mark#(X)):11 -->_3 mark#(first(X1,X2)) -> c_19(a__first#(mark(X1),mark(X2)),mark#(X1),mark#(X2)):10 -->_2 mark#(first(X1,X2)) -> c_19(a__first#(mark(X1),mark(X2)),mark#(X1),mark#(X2)):10 -->_3 mark#(dbl(X)) -> c_18(a__dbl#(mark(X)),mark#(X)):9 -->_2 mark#(dbl(X)) -> c_18(a__dbl#(mark(X)),mark#(X)):9 -->_3 mark#(cons(X1,X2)) -> c_17(mark#(X1)):8 -->_2 mark#(cons(X1,X2)) -> c_17(mark#(X1)):8 -->_3 mark#(nil()) -> c_20():24 -->_2 mark#(nil()) -> c_20():24 -->_3 mark#(0()) -> c_15():23 -->_2 mark#(0()) -> c_15():23 -->_1 a__add#(X1,X2) -> c_1():15 -->_3 mark#(add(X1,X2)) -> c_16(a__add#(mark(X1),mark(X2)),mark#(X1),mark#(X2)):7 -->_2 mark#(add(X1,X2)) -> c_16(a__add#(mark(X1),mark(X2)),mark#(X1),mark#(X2)):7 -->_1 a__add#(s(X),Y) -> c_3(a__add#(mark(X),mark(Y)),mark#(X),mark#(Y)):2 -->_1 a__add#(0(),X) -> c_2(mark#(X)):1 8:S:mark#(cons(X1,X2)) -> c_17(mark#(X1)) -->_1 mark#(terms(X)) -> c_24(a__terms#(mark(X)),mark#(X)):14 -->_1 mark#(sqr(X)) -> c_23(a__sqr#(mark(X)),mark#(X)):13 -->_1 mark#(s(X)) -> c_22(mark#(X)):12 -->_1 mark#(recip(X)) -> c_21(mark#(X)):11 -->_1 mark#(first(X1,X2)) -> c_19(a__first#(mark(X1),mark(X2)),mark#(X1),mark#(X2)):10 -->_1 mark#(dbl(X)) -> c_18(a__dbl#(mark(X)),mark#(X)):9 -->_1 mark#(nil()) -> c_20():24 -->_1 mark#(0()) -> c_15():23 -->_1 mark#(cons(X1,X2)) -> c_17(mark#(X1)):8 -->_1 mark#(add(X1,X2)) -> c_16(a__add#(mark(X1),mark(X2)),mark#(X1),mark#(X2)):7 9:S:mark#(dbl(X)) -> c_18(a__dbl#(mark(X)),mark#(X)) -->_2 mark#(terms(X)) -> c_24(a__terms#(mark(X)),mark#(X)):14 -->_2 mark#(sqr(X)) -> c_23(a__sqr#(mark(X)),mark#(X)):13 -->_2 mark#(s(X)) -> c_22(mark#(X)):12 -->_2 mark#(recip(X)) -> c_21(mark#(X)):11 -->_2 mark#(first(X1,X2)) -> c_19(a__first#(mark(X1),mark(X2)),mark#(X1),mark#(X2)):10 -->_2 mark#(nil()) -> c_20():24 -->_2 mark#(0()) -> c_15():23 -->_1 a__dbl#(0()) -> c_5():17 -->_1 a__dbl#(X) -> c_4():16 -->_2 mark#(dbl(X)) -> c_18(a__dbl#(mark(X)),mark#(X)):9 -->_2 mark#(cons(X1,X2)) -> c_17(mark#(X1)):8 -->_2 mark#(add(X1,X2)) -> c_16(a__add#(mark(X1),mark(X2)),mark#(X1),mark#(X2)):7 -->_1 a__dbl#(s(X)) -> c_6(a__dbl#(mark(X)),mark#(X)):3 10:S:mark#(first(X1,X2)) -> c_19(a__first#(mark(X1),mark(X2)),mark#(X1),mark#(X2)) -->_3 mark#(terms(X)) -> c_24(a__terms#(mark(X)),mark#(X)):14 -->_2 mark#(terms(X)) -> c_24(a__terms#(mark(X)),mark#(X)):14 -->_3 mark#(sqr(X)) -> c_23(a__sqr#(mark(X)),mark#(X)):13 -->_2 mark#(sqr(X)) -> c_23(a__sqr#(mark(X)),mark#(X)):13 -->_3 mark#(s(X)) -> c_22(mark#(X)):12 -->_2 mark#(s(X)) -> c_22(mark#(X)):12 -->_3 mark#(recip(X)) -> c_21(mark#(X)):11 -->_2 mark#(recip(X)) -> c_21(mark#(X)):11 -->_3 mark#(nil()) -> c_20():24 -->_2 mark#(nil()) -> c_20():24 -->_3 mark#(0()) -> c_15():23 -->_2 mark#(0()) -> c_15():23 -->_1 a__first#(0(),X) -> c_8():19 -->_1 a__first#(X1,X2) -> c_7():18 -->_3 mark#(first(X1,X2)) -> c_19(a__first#(mark(X1),mark(X2)),mark#(X1),mark#(X2)):10 -->_2 mark#(first(X1,X2)) -> c_19(a__first#(mark(X1),mark(X2)),mark#(X1),mark#(X2)):10 -->_3 mark#(dbl(X)) -> c_18(a__dbl#(mark(X)),mark#(X)):9 -->_2 mark#(dbl(X)) -> c_18(a__dbl#(mark(X)),mark#(X)):9 -->_3 mark#(cons(X1,X2)) -> c_17(mark#(X1)):8 -->_2 mark#(cons(X1,X2)) -> c_17(mark#(X1)):8 -->_3 mark#(add(X1,X2)) -> c_16(a__add#(mark(X1),mark(X2)),mark#(X1),mark#(X2)):7 -->_2 mark#(add(X1,X2)) -> c_16(a__add#(mark(X1),mark(X2)),mark#(X1),mark#(X2)):7 -->_1 a__first#(s(X),cons(Y,Z)) -> c_9(mark#(Y)):4 11:S:mark#(recip(X)) -> c_21(mark#(X)) -->_1 mark#(terms(X)) -> c_24(a__terms#(mark(X)),mark#(X)):14 -->_1 mark#(sqr(X)) -> c_23(a__sqr#(mark(X)),mark#(X)):13 -->_1 mark#(s(X)) -> c_22(mark#(X)):12 -->_1 mark#(nil()) -> c_20():24 -->_1 mark#(0()) -> c_15():23 -->_1 mark#(recip(X)) -> c_21(mark#(X)):11 -->_1 mark#(first(X1,X2)) -> c_19(a__first#(mark(X1),mark(X2)),mark#(X1),mark#(X2)):10 -->_1 mark#(dbl(X)) -> c_18(a__dbl#(mark(X)),mark#(X)):9 -->_1 mark#(cons(X1,X2)) -> c_17(mark#(X1)):8 -->_1 mark#(add(X1,X2)) -> c_16(a__add#(mark(X1),mark(X2)),mark#(X1),mark#(X2)):7 12:S:mark#(s(X)) -> c_22(mark#(X)) -->_1 mark#(terms(X)) -> c_24(a__terms#(mark(X)),mark#(X)):14 -->_1 mark#(sqr(X)) -> c_23(a__sqr#(mark(X)),mark#(X)):13 -->_1 mark#(nil()) -> c_20():24 -->_1 mark#(0()) -> c_15():23 -->_1 mark#(s(X)) -> c_22(mark#(X)):12 -->_1 mark#(recip(X)) -> c_21(mark#(X)):11 -->_1 mark#(first(X1,X2)) -> c_19(a__first#(mark(X1),mark(X2)),mark#(X1),mark#(X2)):10 -->_1 mark#(dbl(X)) -> c_18(a__dbl#(mark(X)),mark#(X)):9 -->_1 mark#(cons(X1,X2)) -> c_17(mark#(X1)):8 -->_1 mark#(add(X1,X2)) -> c_16(a__add#(mark(X1),mark(X2)),mark#(X1),mark#(X2)):7 13:S:mark#(sqr(X)) -> c_23(a__sqr#(mark(X)),mark#(X)) -->_2 mark#(terms(X)) -> c_24(a__terms#(mark(X)),mark#(X)):14 -->_2 mark#(nil()) -> c_20():24 -->_2 mark#(0()) -> c_15():23 -->_1 a__sqr#(0()) -> c_11():21 -->_1 a__sqr#(X) -> c_10():20 -->_2 mark#(sqr(X)) -> c_23(a__sqr#(mark(X)),mark#(X)):13 -->_2 mark#(s(X)) -> c_22(mark#(X)):12 -->_2 mark#(recip(X)) -> c_21(mark#(X)):11 -->_2 mark#(first(X1,X2)) -> c_19(a__first#(mark(X1),mark(X2)),mark#(X1),mark#(X2)):10 -->_2 mark#(dbl(X)) -> c_18(a__dbl#(mark(X)),mark#(X)):9 -->_2 mark#(cons(X1,X2)) -> c_17(mark#(X1)):8 -->_2 mark#(add(X1,X2)) -> c_16(a__add#(mark(X1),mark(X2)),mark#(X1),mark#(X2)):7 -->_1 a__sqr#(s(X)) -> c_12(a__add#(a__sqr(mark(X)),a__dbl(mark(X))) ,a__sqr#(mark(X)) ,mark#(X) ,a__dbl#(mark(X)) ,mark#(X)):5 14:S:mark#(terms(X)) -> c_24(a__terms#(mark(X)),mark#(X)) -->_2 mark#(nil()) -> c_20():24 -->_2 mark#(0()) -> c_15():23 -->_1 a__terms#(X) -> c_14():22 -->_2 mark#(terms(X)) -> c_24(a__terms#(mark(X)),mark#(X)):14 -->_2 mark#(sqr(X)) -> c_23(a__sqr#(mark(X)),mark#(X)):13 -->_2 mark#(s(X)) -> c_22(mark#(X)):12 -->_2 mark#(recip(X)) -> c_21(mark#(X)):11 -->_2 mark#(first(X1,X2)) -> c_19(a__first#(mark(X1),mark(X2)),mark#(X1),mark#(X2)):10 -->_2 mark#(dbl(X)) -> c_18(a__dbl#(mark(X)),mark#(X)):9 -->_2 mark#(cons(X1,X2)) -> c_17(mark#(X1)):8 -->_2 mark#(add(X1,X2)) -> c_16(a__add#(mark(X1),mark(X2)),mark#(X1),mark#(X2)):7 -->_1 a__terms#(N) -> c_13(a__sqr#(mark(N)),mark#(N)):6 15:W:a__add#(X1,X2) -> c_1() 16:W:a__dbl#(X) -> c_4() 17:W:a__dbl#(0()) -> c_5() 18:W:a__first#(X1,X2) -> c_7() 19:W:a__first#(0(),X) -> c_8() 20:W:a__sqr#(X) -> c_10() 21:W:a__sqr#(0()) -> c_11() 22:W:a__terms#(X) -> c_14() 23:W:mark#(0()) -> c_15() 24:W:mark#(nil()) -> c_20() The following weak DPs constitute a sub-graph of the DG that is closed under successors. The DPs are removed. 15: a__add#(X1,X2) -> c_1() 16: a__dbl#(X) -> c_4() 17: a__dbl#(0()) -> c_5() 18: a__first#(X1,X2) -> c_7() 19: a__first#(0(),X) -> c_8() 20: a__sqr#(X) -> c_10() 21: a__sqr#(0()) -> c_11() 22: a__terms#(X) -> c_14() 23: mark#(0()) -> c_15() 24: mark#(nil()) -> c_20() * Step 4: Failure MAYBE + Considered Problem: - Strict DPs: a__add#(0(),X) -> c_2(mark#(X)) a__add#(s(X),Y) -> c_3(a__add#(mark(X),mark(Y)),mark#(X),mark#(Y)) a__dbl#(s(X)) -> c_6(a__dbl#(mark(X)),mark#(X)) a__first#(s(X),cons(Y,Z)) -> c_9(mark#(Y)) a__sqr#(s(X)) -> c_12(a__add#(a__sqr(mark(X)),a__dbl(mark(X))) ,a__sqr#(mark(X)) ,mark#(X) ,a__dbl#(mark(X)) ,mark#(X)) a__terms#(N) -> c_13(a__sqr#(mark(N)),mark#(N)) mark#(add(X1,X2)) -> c_16(a__add#(mark(X1),mark(X2)),mark#(X1),mark#(X2)) mark#(cons(X1,X2)) -> c_17(mark#(X1)) mark#(dbl(X)) -> c_18(a__dbl#(mark(X)),mark#(X)) mark#(first(X1,X2)) -> c_19(a__first#(mark(X1),mark(X2)),mark#(X1),mark#(X2)) mark#(recip(X)) -> c_21(mark#(X)) mark#(s(X)) -> c_22(mark#(X)) mark#(sqr(X)) -> c_23(a__sqr#(mark(X)),mark#(X)) mark#(terms(X)) -> c_24(a__terms#(mark(X)),mark#(X)) - Weak TRS: a__add(X1,X2) -> add(X1,X2) a__add(0(),X) -> mark(X) a__add(s(X),Y) -> s(a__add(mark(X),mark(Y))) a__dbl(X) -> dbl(X) a__dbl(0()) -> 0() a__dbl(s(X)) -> s(s(a__dbl(mark(X)))) a__first(X1,X2) -> first(X1,X2) a__first(0(),X) -> nil() a__first(s(X),cons(Y,Z)) -> cons(mark(Y),first(X,Z)) a__sqr(X) -> sqr(X) a__sqr(0()) -> 0() a__sqr(s(X)) -> s(a__add(a__sqr(mark(X)),a__dbl(mark(X)))) a__terms(N) -> cons(recip(a__sqr(mark(N))),terms(s(N))) a__terms(X) -> terms(X) mark(0()) -> 0() mark(add(X1,X2)) -> a__add(mark(X1),mark(X2)) mark(cons(X1,X2)) -> cons(mark(X1),X2) mark(dbl(X)) -> a__dbl(mark(X)) mark(first(X1,X2)) -> a__first(mark(X1),mark(X2)) mark(nil()) -> nil() mark(recip(X)) -> recip(mark(X)) mark(s(X)) -> s(mark(X)) mark(sqr(X)) -> a__sqr(mark(X)) mark(terms(X)) -> a__terms(mark(X)) - Signature: {a__add/2,a__dbl/1,a__first/2,a__sqr/1,a__terms/1,mark/1,a__add#/2,a__dbl#/1,a__first#/2,a__sqr#/1 ,a__terms#/1,mark#/1} / {0/0,add/2,cons/2,dbl/1,first/2,nil/0,recip/1,s/1,sqr/1,terms/1,c_1/0,c_2/1,c_3/3 ,c_4/0,c_5/0,c_6/2,c_7/0,c_8/0,c_9/1,c_10/0,c_11/0,c_12/5,c_13/2,c_14/0,c_15/0,c_16/3,c_17/1,c_18/2,c_19/3 ,c_20/0,c_21/1,c_22/1,c_23/2,c_24/2} - Obligation: innermost runtime complexity wrt. defined symbols {a__add#,a__dbl#,a__first#,a__sqr#,a__terms# ,mark#} and constructors {0,add,cons,dbl,first,nil,recip,s,sqr,terms} + Applied Processor: EmptyProcessor + Details: The problem is still open. MAYBE