WORST_CASE(Omega(n^1),?) proof of /export/starexec/sandbox/benchmark/theBenchmark.trs # AProVE Commit ID: c69e44bd14796315568835c1ffa2502984884775 mhark 20210624 unpublished The Runtime Complexity (innermost) of the given CpxRelTRS could be proven to be BOUNDS(n^1, INF). (0) CpxRelTRS (1) SInnermostTerminationProof [BOTH CONCRETE BOUNDS(ID, ID), 94.6 s] (2) CpxRelTRS (3) RelTrsToDecreasingLoopProblemProof [LOWER BOUND(ID), 0 ms] (4) TRS for Loop Detection (5) DecreasingLoopProof [LOWER BOUND(ID), 0 ms] (6) BEST (7) proven lower bound (8) LowerBoundPropagationProof [FINISHED, 0 ms] (9) BOUNDS(n^1, INF) (10) TRS for Loop Detection ---------------------------------------- (0) Obligation: The Runtime Complexity (innermost) of the given CpxRelTRS could be proven to be BOUNDS(n^1, INF). The TRS R consists of the following rules: QUICKSORT(Cons(z0, Cons(z1, z2))) -> c8(PART(z0, Cons(z0, Cons(z1, z2)), Cons(z0, Nil), Nil)) QUICKSORT(Cons(z0, Nil)) -> c9 QUICKSORT(Nil) -> c10 PART(z0, Cons(z1, z2), z3, z4) -> c11(PART[ITE][TRUE][ITE](>(z0, z1), z0, Cons(z1, z2), z3, z4), >'(z0, z1)) PART(z0, Nil, z1, z2) -> c12(APP(quicksort(z1), quicksort(z2)), QUICKSORT(z1)) PART(z0, Nil, z1, z2) -> c13(APP(quicksort(z1), quicksort(z2)), QUICKSORT(z2)) APP(Cons(z0, z1), z2) -> c14(APP(z1, z2)) APP(Nil, z0) -> c15 NOTEMPTY(Cons(z0, z1)) -> c16 NOTEMPTY(Nil) -> c17 GOAL(z0) -> c18(QUICKSORT(z0)) The (relative) TRS S consists of the following rules: <'(S(z0), S(z1)) -> c(<'(z0, z1)) <'(0, S(z0)) -> c1 <'(z0, 0) -> c2 >'(S(z0), S(z1)) -> c3(>'(z0, z1)) >'(0, z0) -> c4 >'(S(z0), 0) -> c5 PART[ITE][TRUE][ITE](True, z0, Cons(z1, z2), z3, z4) -> c6(PART(z0, z2, Cons(z1, z3), z4)) PART[ITE][TRUE][ITE](False, z0, Cons(z1, z2), z3, z4) -> c7(<'(z0, z1)) <(S(z0), S(z1)) -> <(z0, z1) <(0, S(z0)) -> True <(z0, 0) -> False >(S(z0), S(z1)) -> >(z0, z1) >(0, z0) -> False >(S(z0), 0) -> True part[Ite][True][Ite](True, z0, Cons(z1, z2), z3, z4) -> part(z0, z2, Cons(z1, z3), z4) part[Ite][True][Ite](False, z0, Cons(z1, z2), z3, z4) -> part[Ite][True][Ite][False][Ite](<(z0, z1), z0, Cons(z1, z2), z3, z4) quicksort(Cons(z0, Cons(z1, z2))) -> part(z0, Cons(z0, Cons(z1, z2)), Cons(z0, Nil), Nil) quicksort(Cons(z0, Nil)) -> Cons(z0, Nil) quicksort(Nil) -> Nil part(z0, Cons(z1, z2), z3, z4) -> part[Ite][True][Ite](>(z0, z1), z0, Cons(z1, z2), z3, z4) part(z0, Nil, z1, z2) -> app(quicksort(z1), quicksort(z2)) app(Cons(z0, z1), z2) -> Cons(z0, app(z1, z2)) app(Nil, z0) -> z0 notEmpty(Cons(z0, z1)) -> True notEmpty(Nil) -> False goal(z0) -> quicksort(z0) Rewrite Strategy: INNERMOST ---------------------------------------- (1) SInnermostTerminationProof (BOTH CONCRETE BOUNDS(ID, ID)) proved innermost termination of relative rules ---------------------------------------- (2) Obligation: The Runtime Complexity (innermost) of the given CpxRelTRS could be proven to be BOUNDS(n^1, INF). The TRS R consists of the following rules: QUICKSORT(Cons(z0, Cons(z1, z2))) -> c8(PART(z0, Cons(z0, Cons(z1, z2)), Cons(z0, Nil), Nil)) QUICKSORT(Cons(z0, Nil)) -> c9 QUICKSORT(Nil) -> c10 PART(z0, Cons(z1, z2), z3, z4) -> c11(PART[ITE][TRUE][ITE](>(z0, z1), z0, Cons(z1, z2), z3, z4), >'(z0, z1)) PART(z0, Nil, z1, z2) -> c12(APP(quicksort(z1), quicksort(z2)), QUICKSORT(z1)) PART(z0, Nil, z1, z2) -> c13(APP(quicksort(z1), quicksort(z2)), QUICKSORT(z2)) APP(Cons(z0, z1), z2) -> c14(APP(z1, z2)) APP(Nil, z0) -> c15 NOTEMPTY(Cons(z0, z1)) -> c16 NOTEMPTY(Nil) -> c17 GOAL(z0) -> c18(QUICKSORT(z0)) The (relative) TRS S consists of the following rules: <'(S(z0), S(z1)) -> c(<'(z0, z1)) <'(0, S(z0)) -> c1 <'(z0, 0) -> c2 >'(S(z0), S(z1)) -> c3(>'(z0, z1)) >'(0, z0) -> c4 >'(S(z0), 0) -> c5 PART[ITE][TRUE][ITE](True, z0, Cons(z1, z2), z3, z4) -> c6(PART(z0, z2, Cons(z1, z3), z4)) PART[ITE][TRUE][ITE](False, z0, Cons(z1, z2), z3, z4) -> c7(<'(z0, z1)) <(S(z0), S(z1)) -> <(z0, z1) <(0, S(z0)) -> True <(z0, 0) -> False >(S(z0), S(z1)) -> >(z0, z1) >(0, z0) -> False >(S(z0), 0) -> True part[Ite][True][Ite](True, z0, Cons(z1, z2), z3, z4) -> part(z0, z2, Cons(z1, z3), z4) part[Ite][True][Ite](False, z0, Cons(z1, z2), z3, z4) -> part[Ite][True][Ite][False][Ite](<(z0, z1), z0, Cons(z1, z2), z3, z4) quicksort(Cons(z0, Cons(z1, z2))) -> part(z0, Cons(z0, Cons(z1, z2)), Cons(z0, Nil), Nil) quicksort(Cons(z0, Nil)) -> Cons(z0, Nil) quicksort(Nil) -> Nil part(z0, Cons(z1, z2), z3, z4) -> part[Ite][True][Ite](>(z0, z1), z0, Cons(z1, z2), z3, z4) part(z0, Nil, z1, z2) -> app(quicksort(z1), quicksort(z2)) app(Cons(z0, z1), z2) -> Cons(z0, app(z1, z2)) app(Nil, z0) -> z0 notEmpty(Cons(z0, z1)) -> True notEmpty(Nil) -> False goal(z0) -> quicksort(z0) Rewrite Strategy: INNERMOST ---------------------------------------- (3) RelTrsToDecreasingLoopProblemProof (LOWER BOUND(ID)) Transformed a relative TRS into a decreasing-loop problem. ---------------------------------------- (4) Obligation: Analyzing the following TRS for decreasing loops: The Runtime Complexity (innermost) of the given CpxRelTRS could be proven to be BOUNDS(n^1, INF). The TRS R consists of the following rules: QUICKSORT(Cons(z0, Cons(z1, z2))) -> c8(PART(z0, Cons(z0, Cons(z1, z2)), Cons(z0, Nil), Nil)) QUICKSORT(Cons(z0, Nil)) -> c9 QUICKSORT(Nil) -> c10 PART(z0, Cons(z1, z2), z3, z4) -> c11(PART[ITE][TRUE][ITE](>(z0, z1), z0, Cons(z1, z2), z3, z4), >'(z0, z1)) PART(z0, Nil, z1, z2) -> c12(APP(quicksort(z1), quicksort(z2)), QUICKSORT(z1)) PART(z0, Nil, z1, z2) -> c13(APP(quicksort(z1), quicksort(z2)), QUICKSORT(z2)) APP(Cons(z0, z1), z2) -> c14(APP(z1, z2)) APP(Nil, z0) -> c15 NOTEMPTY(Cons(z0, z1)) -> c16 NOTEMPTY(Nil) -> c17 GOAL(z0) -> c18(QUICKSORT(z0)) The (relative) TRS S consists of the following rules: <'(S(z0), S(z1)) -> c(<'(z0, z1)) <'(0, S(z0)) -> c1 <'(z0, 0) -> c2 >'(S(z0), S(z1)) -> c3(>'(z0, z1)) >'(0, z0) -> c4 >'(S(z0), 0) -> c5 PART[ITE][TRUE][ITE](True, z0, Cons(z1, z2), z3, z4) -> c6(PART(z0, z2, Cons(z1, z3), z4)) PART[ITE][TRUE][ITE](False, z0, Cons(z1, z2), z3, z4) -> c7(<'(z0, z1)) <(S(z0), S(z1)) -> <(z0, z1) <(0, S(z0)) -> True <(z0, 0) -> False >(S(z0), S(z1)) -> >(z0, z1) >(0, z0) -> False >(S(z0), 0) -> True part[Ite][True][Ite](True, z0, Cons(z1, z2), z3, z4) -> part(z0, z2, Cons(z1, z3), z4) part[Ite][True][Ite](False, z0, Cons(z1, z2), z3, z4) -> part[Ite][True][Ite][False][Ite](<(z0, z1), z0, Cons(z1, z2), z3, z4) quicksort(Cons(z0, Cons(z1, z2))) -> part(z0, Cons(z0, Cons(z1, z2)), Cons(z0, Nil), Nil) quicksort(Cons(z0, Nil)) -> Cons(z0, Nil) quicksort(Nil) -> Nil part(z0, Cons(z1, z2), z3, z4) -> part[Ite][True][Ite](>(z0, z1), z0, Cons(z1, z2), z3, z4) part(z0, Nil, z1, z2) -> app(quicksort(z1), quicksort(z2)) app(Cons(z0, z1), z2) -> Cons(z0, app(z1, z2)) app(Nil, z0) -> z0 notEmpty(Cons(z0, z1)) -> True notEmpty(Nil) -> False goal(z0) -> quicksort(z0) Rewrite Strategy: INNERMOST ---------------------------------------- (5) DecreasingLoopProof (LOWER BOUND(ID)) The following loop(s) give(s) rise to the lower bound Omega(n^1): The rewrite sequence APP(Cons(z0, z1), z2) ->^+ c14(APP(z1, z2)) gives rise to a decreasing loop by considering the right hand sides subterm at position [0]. The pumping substitution is [z1 / Cons(z0, z1)]. The result substitution is [ ]. ---------------------------------------- (6) Complex Obligation (BEST) ---------------------------------------- (7) Obligation: Proved the lower bound n^1 for the following obligation: The Runtime Complexity (innermost) of the given CpxRelTRS could be proven to be BOUNDS(n^1, INF). The TRS R consists of the following rules: QUICKSORT(Cons(z0, Cons(z1, z2))) -> c8(PART(z0, Cons(z0, Cons(z1, z2)), Cons(z0, Nil), Nil)) QUICKSORT(Cons(z0, Nil)) -> c9 QUICKSORT(Nil) -> c10 PART(z0, Cons(z1, z2), z3, z4) -> c11(PART[ITE][TRUE][ITE](>(z0, z1), z0, Cons(z1, z2), z3, z4), >'(z0, z1)) PART(z0, Nil, z1, z2) -> c12(APP(quicksort(z1), quicksort(z2)), QUICKSORT(z1)) PART(z0, Nil, z1, z2) -> c13(APP(quicksort(z1), quicksort(z2)), QUICKSORT(z2)) APP(Cons(z0, z1), z2) -> c14(APP(z1, z2)) APP(Nil, z0) -> c15 NOTEMPTY(Cons(z0, z1)) -> c16 NOTEMPTY(Nil) -> c17 GOAL(z0) -> c18(QUICKSORT(z0)) The (relative) TRS S consists of the following rules: <'(S(z0), S(z1)) -> c(<'(z0, z1)) <'(0, S(z0)) -> c1 <'(z0, 0) -> c2 >'(S(z0), S(z1)) -> c3(>'(z0, z1)) >'(0, z0) -> c4 >'(S(z0), 0) -> c5 PART[ITE][TRUE][ITE](True, z0, Cons(z1, z2), z3, z4) -> c6(PART(z0, z2, Cons(z1, z3), z4)) PART[ITE][TRUE][ITE](False, z0, Cons(z1, z2), z3, z4) -> c7(<'(z0, z1)) <(S(z0), S(z1)) -> <(z0, z1) <(0, S(z0)) -> True <(z0, 0) -> False >(S(z0), S(z1)) -> >(z0, z1) >(0, z0) -> False >(S(z0), 0) -> True part[Ite][True][Ite](True, z0, Cons(z1, z2), z3, z4) -> part(z0, z2, Cons(z1, z3), z4) part[Ite][True][Ite](False, z0, Cons(z1, z2), z3, z4) -> part[Ite][True][Ite][False][Ite](<(z0, z1), z0, Cons(z1, z2), z3, z4) quicksort(Cons(z0, Cons(z1, z2))) -> part(z0, Cons(z0, Cons(z1, z2)), Cons(z0, Nil), Nil) quicksort(Cons(z0, Nil)) -> Cons(z0, Nil) quicksort(Nil) -> Nil part(z0, Cons(z1, z2), z3, z4) -> part[Ite][True][Ite](>(z0, z1), z0, Cons(z1, z2), z3, z4) part(z0, Nil, z1, z2) -> app(quicksort(z1), quicksort(z2)) app(Cons(z0, z1), z2) -> Cons(z0, app(z1, z2)) app(Nil, z0) -> z0 notEmpty(Cons(z0, z1)) -> True notEmpty(Nil) -> False goal(z0) -> quicksort(z0) Rewrite Strategy: INNERMOST ---------------------------------------- (8) LowerBoundPropagationProof (FINISHED) Propagated lower bound. ---------------------------------------- (9) BOUNDS(n^1, INF) ---------------------------------------- (10) Obligation: Analyzing the following TRS for decreasing loops: The Runtime Complexity (innermost) of the given CpxRelTRS could be proven to be BOUNDS(n^1, INF). The TRS R consists of the following rules: QUICKSORT(Cons(z0, Cons(z1, z2))) -> c8(PART(z0, Cons(z0, Cons(z1, z2)), Cons(z0, Nil), Nil)) QUICKSORT(Cons(z0, Nil)) -> c9 QUICKSORT(Nil) -> c10 PART(z0, Cons(z1, z2), z3, z4) -> c11(PART[ITE][TRUE][ITE](>(z0, z1), z0, Cons(z1, z2), z3, z4), >'(z0, z1)) PART(z0, Nil, z1, z2) -> c12(APP(quicksort(z1), quicksort(z2)), QUICKSORT(z1)) PART(z0, Nil, z1, z2) -> c13(APP(quicksort(z1), quicksort(z2)), QUICKSORT(z2)) APP(Cons(z0, z1), z2) -> c14(APP(z1, z2)) APP(Nil, z0) -> c15 NOTEMPTY(Cons(z0, z1)) -> c16 NOTEMPTY(Nil) -> c17 GOAL(z0) -> c18(QUICKSORT(z0)) The (relative) TRS S consists of the following rules: <'(S(z0), S(z1)) -> c(<'(z0, z1)) <'(0, S(z0)) -> c1 <'(z0, 0) -> c2 >'(S(z0), S(z1)) -> c3(>'(z0, z1)) >'(0, z0) -> c4 >'(S(z0), 0) -> c5 PART[ITE][TRUE][ITE](True, z0, Cons(z1, z2), z3, z4) -> c6(PART(z0, z2, Cons(z1, z3), z4)) PART[ITE][TRUE][ITE](False, z0, Cons(z1, z2), z3, z4) -> c7(<'(z0, z1)) <(S(z0), S(z1)) -> <(z0, z1) <(0, S(z0)) -> True <(z0, 0) -> False >(S(z0), S(z1)) -> >(z0, z1) >(0, z0) -> False >(S(z0), 0) -> True part[Ite][True][Ite](True, z0, Cons(z1, z2), z3, z4) -> part(z0, z2, Cons(z1, z3), z4) part[Ite][True][Ite](False, z0, Cons(z1, z2), z3, z4) -> part[Ite][True][Ite][False][Ite](<(z0, z1), z0, Cons(z1, z2), z3, z4) quicksort(Cons(z0, Cons(z1, z2))) -> part(z0, Cons(z0, Cons(z1, z2)), Cons(z0, Nil), Nil) quicksort(Cons(z0, Nil)) -> Cons(z0, Nil) quicksort(Nil) -> Nil part(z0, Cons(z1, z2), z3, z4) -> part[Ite][True][Ite](>(z0, z1), z0, Cons(z1, z2), z3, z4) part(z0, Nil, z1, z2) -> app(quicksort(z1), quicksort(z2)) app(Cons(z0, z1), z2) -> Cons(z0, app(z1, z2)) app(Nil, z0) -> z0 notEmpty(Cons(z0, z1)) -> True notEmpty(Nil) -> False goal(z0) -> quicksort(z0) Rewrite Strategy: INNERMOST