WORST_CASE(Omega(n^1),O(n^1)) proof of /export/starexec/sandbox/benchmark/theBenchmark.trs # AProVE Commit ID: c69e44bd14796315568835c1ffa2502984884775 mhark 20210624 unpublished The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(n^1, n^1). (0) CpxTRS (1) RelTrsToTrsProof [UPPER BOUND(ID), 0 ms] (2) CpxTRS (3) CpxTrsMatchBoundsProof [FINISHED, 0 ms] (4) BOUNDS(1, n^1) (5) RelTrsToDecreasingLoopProblemProof [LOWER BOUND(ID), 0 ms] (6) TRS for Loop Detection (7) DecreasingLoopProof [LOWER BOUND(ID), 0 ms] (8) BEST (9) proven lower bound (10) LowerBoundPropagationProof [FINISHED, 0 ms] (11) BOUNDS(n^1, INF) (12) TRS for Loop Detection ---------------------------------------- (0) Obligation: The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(n^1, n^1). The TRS R consists of the following rules: a__f(X) -> g(h(f(X))) mark(f(X)) -> a__f(mark(X)) mark(g(X)) -> g(X) mark(h(X)) -> h(mark(X)) a__f(X) -> f(X) S is empty. Rewrite Strategy: INNERMOST ---------------------------------------- (1) RelTrsToTrsProof (UPPER BOUND(ID)) transformed relative TRS to TRS ---------------------------------------- (2) Obligation: The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(1, n^1). The TRS R consists of the following rules: a__f(X) -> g(h(f(X))) mark(f(X)) -> a__f(mark(X)) mark(g(X)) -> g(X) mark(h(X)) -> h(mark(X)) a__f(X) -> f(X) S is empty. Rewrite Strategy: INNERMOST ---------------------------------------- (3) CpxTrsMatchBoundsProof (FINISHED) A linear upper bound on the runtime complexity of the TRS R could be shown with a Match Bound [MATCHBOUNDS1,MATCHBOUNDS2] of 2. The certificate found is represented by the following graph. "[3, 4, 5, 6, 7, 8, 9, 10] {(3,4,[a__f_1|0, mark_1|0, f_1|1, g_1|1]), (3,5,[g_1|1]), (3,7,[a__f_1|1, f_1|2]), (3,8,[h_1|1]), (3,9,[g_1|2]), (4,4,[g_1|0, h_1|0, f_1|0]), (5,6,[h_1|1]), (6,4,[f_1|1]), (7,4,[mark_1|1, g_1|1]), (7,7,[a__f_1|1, f_1|2]), (7,8,[h_1|1]), (7,9,[g_1|2]), (8,4,[mark_1|1, g_1|1]), (8,7,[a__f_1|1, f_1|2]), (8,8,[h_1|1]), (8,9,[g_1|2]), (9,10,[h_1|2]), (10,7,[f_1|2])}" ---------------------------------------- (4) BOUNDS(1, n^1) ---------------------------------------- (5) RelTrsToDecreasingLoopProblemProof (LOWER BOUND(ID)) Transformed a relative TRS into a decreasing-loop problem. ---------------------------------------- (6) Obligation: Analyzing the following TRS for decreasing loops: The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(n^1, n^1). The TRS R consists of the following rules: a__f(X) -> g(h(f(X))) mark(f(X)) -> a__f(mark(X)) mark(g(X)) -> g(X) mark(h(X)) -> h(mark(X)) a__f(X) -> f(X) S is empty. Rewrite Strategy: INNERMOST ---------------------------------------- (7) DecreasingLoopProof (LOWER BOUND(ID)) The following loop(s) give(s) rise to the lower bound Omega(n^1): The rewrite sequence mark(f(X)) ->^+ a__f(mark(X)) gives rise to a decreasing loop by considering the right hand sides subterm at position [0]. The pumping substitution is [X / f(X)]. The result substitution is [ ]. ---------------------------------------- (8) Complex Obligation (BEST) ---------------------------------------- (9) Obligation: Proved the lower bound n^1 for the following obligation: The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(n^1, n^1). The TRS R consists of the following rules: a__f(X) -> g(h(f(X))) mark(f(X)) -> a__f(mark(X)) mark(g(X)) -> g(X) mark(h(X)) -> h(mark(X)) a__f(X) -> f(X) S is empty. Rewrite Strategy: INNERMOST ---------------------------------------- (10) LowerBoundPropagationProof (FINISHED) Propagated lower bound. ---------------------------------------- (11) BOUNDS(n^1, INF) ---------------------------------------- (12) Obligation: Analyzing the following TRS for decreasing loops: The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(n^1, n^1). The TRS R consists of the following rules: a__f(X) -> g(h(f(X))) mark(f(X)) -> a__f(mark(X)) mark(g(X)) -> g(X) mark(h(X)) -> h(mark(X)) a__f(X) -> f(X) S is empty. Rewrite Strategy: INNERMOST