/export/starexec/sandbox/solver/bin/starexec_run_complexity /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- WORST_CASE(Omega(n^1), O(n^1)) proof of /export/starexec/sandbox/benchmark/theBenchmark.xml # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, n^1). (0) CpxTRS (1) RcToIrcProof [BOTH BOUNDS(ID, ID), 0 ms] (2) CpxTRS (3) RelTrsToWeightedTrsProof [BOTH BOUNDS(ID, ID), 0 ms] (4) CpxWeightedTrs (5) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms] (6) CpxTypedWeightedTrs (7) CompletionProof [UPPER BOUND(ID), 0 ms] (8) CpxTypedWeightedCompleteTrs (9) NarrowingProof [BOTH BOUNDS(ID, ID), 0 ms] (10) CpxTypedWeightedCompleteTrs (11) CpxTypedWeightedTrsToRntsProof [UPPER BOUND(ID), 0 ms] (12) CpxRNTS (13) InliningProof [UPPER BOUND(ID), 55 ms] (14) CpxRNTS (15) SimplificationProof [BOTH BOUNDS(ID, ID), 0 ms] (16) CpxRNTS (17) CpxRntsAnalysisOrderProof [BOTH BOUNDS(ID, ID), 0 ms] (18) CpxRNTS (19) ResultPropagationProof [UPPER BOUND(ID), 0 ms] (20) CpxRNTS (21) IntTrsBoundProof [UPPER BOUND(ID), 514 ms] (22) CpxRNTS (23) IntTrsBoundProof [UPPER BOUND(ID), 80 ms] (24) CpxRNTS (25) ResultPropagationProof [UPPER BOUND(ID), 0 ms] (26) CpxRNTS (27) IntTrsBoundProof [UPPER BOUND(ID), 207 ms] (28) CpxRNTS (29) IntTrsBoundProof [UPPER BOUND(ID), 2 ms] (30) CpxRNTS (31) FinalProof [FINISHED, 0 ms] (32) BOUNDS(1, n^1) (33) RelTrsToDecreasingLoopProblemProof [LOWER BOUND(ID), 0 ms] (34) TRS for Loop Detection (35) DecreasingLoopProof [LOWER BOUND(ID), 0 ms] (36) BEST (37) proven lower bound (38) LowerBoundPropagationProof [FINISHED, 0 ms] (39) BOUNDS(n^1, INF) (40) TRS for Loop Detection ---------------------------------------- (0) Obligation: The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, n^1). The TRS R consists of the following rules: sum(0) -> 0 sum(s(x)) -> +(sqr(s(x)), sum(x)) sqr(x) -> *(x, x) sum(s(x)) -> +(*(s(x), s(x)), sum(x)) S is empty. Rewrite Strategy: FULL ---------------------------------------- (1) RcToIrcProof (BOTH BOUNDS(ID, ID)) Converted rc-obligation to irc-obligation. As the TRS does not nest defined symbols, we have rc = irc. ---------------------------------------- (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: sum(0) -> 0 sum(s(x)) -> +(sqr(s(x)), sum(x)) sqr(x) -> *(x, x) sum(s(x)) -> +(*(s(x), s(x)), sum(x)) S is empty. Rewrite Strategy: INNERMOST ---------------------------------------- (3) RelTrsToWeightedTrsProof (BOTH BOUNDS(ID, ID)) Transformed relative TRS to weighted TRS ---------------------------------------- (4) Obligation: The Runtime Complexity (innermost) of the given CpxWeightedTrs could be proven to be BOUNDS(1, n^1). The TRS R consists of the following rules: sum(0) -> 0 [1] sum(s(x)) -> +(sqr(s(x)), sum(x)) [1] sqr(x) -> *(x, x) [1] sum(s(x)) -> +(*(s(x), s(x)), sum(x)) [1] Rewrite Strategy: INNERMOST ---------------------------------------- (5) TypeInferenceProof (BOTH BOUNDS(ID, ID)) Infered types. ---------------------------------------- (6) Obligation: Runtime Complexity Weighted TRS with Types. The TRS R consists of the following rules: sum(0) -> 0 [1] sum(s(x)) -> +(sqr(s(x)), sum(x)) [1] sqr(x) -> *(x, x) [1] sum(s(x)) -> +(*(s(x), s(x)), sum(x)) [1] The TRS has the following type information: sum :: 0:s:+ -> 0:s:+ 0 :: 0:s:+ s :: 0:s:+ -> 0:s:+ + :: * -> 0:s:+ -> 0:s:+ sqr :: 0:s:+ -> * * :: 0:s:+ -> 0:s:+ -> * Rewrite Strategy: INNERMOST ---------------------------------------- (7) CompletionProof (UPPER BOUND(ID)) The transformation into a RNTS is sound, since: (a) The obligation is a constructor system where every type has a constant constructor, (b) The following defined symbols do not have to be completely defined, as they can never occur inside other defined symbols: sum_1 sqr_1 (c) The following functions are completely defined: none Due to the following rules being added: none And the following fresh constants: const ---------------------------------------- (8) Obligation: Runtime Complexity Weighted TRS where critical functions are completely defined. The underlying TRS is: Runtime Complexity Weighted TRS with Types. The TRS R consists of the following rules: sum(0) -> 0 [1] sum(s(x)) -> +(sqr(s(x)), sum(x)) [1] sqr(x) -> *(x, x) [1] sum(s(x)) -> +(*(s(x), s(x)), sum(x)) [1] The TRS has the following type information: sum :: 0:s:+ -> 0:s:+ 0 :: 0:s:+ s :: 0:s:+ -> 0:s:+ + :: * -> 0:s:+ -> 0:s:+ sqr :: 0:s:+ -> * * :: 0:s:+ -> 0:s:+ -> * const :: * Rewrite Strategy: INNERMOST ---------------------------------------- (9) NarrowingProof (BOTH BOUNDS(ID, ID)) Narrowed the inner basic terms of all right-hand sides by a single narrowing step. ---------------------------------------- (10) Obligation: Runtime Complexity Weighted TRS where critical functions are completely defined. The underlying TRS is: Runtime Complexity Weighted TRS with Types. The TRS R consists of the following rules: sum(0) -> 0 [1] sum(s(x)) -> +(sqr(s(x)), sum(x)) [1] sqr(x) -> *(x, x) [1] sum(s(x)) -> +(*(s(x), s(x)), sum(x)) [1] The TRS has the following type information: sum :: 0:s:+ -> 0:s:+ 0 :: 0:s:+ s :: 0:s:+ -> 0:s:+ + :: * -> 0:s:+ -> 0:s:+ sqr :: 0:s:+ -> * * :: 0:s:+ -> 0:s:+ -> * const :: * Rewrite Strategy: INNERMOST ---------------------------------------- (11) CpxTypedWeightedTrsToRntsProof (UPPER BOUND(ID)) Transformed the TRS into an over-approximating RNTS by (improved) Size Abstraction. The constant constructors are abstracted as follows: 0 => 0 const => 0 ---------------------------------------- (12) Obligation: Complexity RNTS consisting of the following rules: sqr(z) -{ 1 }-> 1 + x + x :|: x >= 0, z = x sum(z) -{ 1 }-> 0 :|: z = 0 sum(z) -{ 1 }-> 1 + sqr(1 + x) + sum(x) :|: x >= 0, z = 1 + x sum(z) -{ 1 }-> 1 + (1 + (1 + x) + (1 + x)) + sum(x) :|: x >= 0, z = 1 + x ---------------------------------------- (13) InliningProof (UPPER BOUND(ID)) Inlined the following terminating rules on right-hand sides where appropriate: sqr(z) -{ 1 }-> 1 + x + x :|: x >= 0, z = x ---------------------------------------- (14) Obligation: Complexity RNTS consisting of the following rules: sqr(z) -{ 1 }-> 1 + x + x :|: x >= 0, z = x sum(z) -{ 1 }-> 0 :|: z = 0 sum(z) -{ 2 }-> 1 + (1 + x' + x') + sum(x) :|: x >= 0, z = 1 + x, x' >= 0, 1 + x = x' sum(z) -{ 1 }-> 1 + (1 + (1 + x) + (1 + x)) + sum(x) :|: x >= 0, z = 1 + x ---------------------------------------- (15) SimplificationProof (BOTH BOUNDS(ID, ID)) Simplified the RNTS by moving equalities from the constraints into the right-hand sides. ---------------------------------------- (16) Obligation: Complexity RNTS consisting of the following rules: sqr(z) -{ 1 }-> 1 + z + z :|: z >= 0 sum(z) -{ 1 }-> 0 :|: z = 0 sum(z) -{ 2 }-> 1 + (1 + x' + x') + sum(z - 1) :|: z - 1 >= 0, x' >= 0, 1 + (z - 1) = x' sum(z) -{ 1 }-> 1 + (1 + (1 + (z - 1)) + (1 + (z - 1))) + sum(z - 1) :|: z - 1 >= 0 ---------------------------------------- (17) CpxRntsAnalysisOrderProof (BOTH BOUNDS(ID, ID)) Found the following analysis order by SCC decomposition: { sum } { sqr } ---------------------------------------- (18) Obligation: Complexity RNTS consisting of the following rules: sqr(z) -{ 1 }-> 1 + z + z :|: z >= 0 sum(z) -{ 1 }-> 0 :|: z = 0 sum(z) -{ 2 }-> 1 + (1 + x' + x') + sum(z - 1) :|: z - 1 >= 0, x' >= 0, 1 + (z - 1) = x' sum(z) -{ 1 }-> 1 + (1 + (1 + (z - 1)) + (1 + (z - 1))) + sum(z - 1) :|: z - 1 >= 0 Function symbols to be analyzed: {sum}, {sqr} ---------------------------------------- (19) ResultPropagationProof (UPPER BOUND(ID)) Applied inner abstraction using the recently inferred runtime/size bounds where possible. ---------------------------------------- (20) Obligation: Complexity RNTS consisting of the following rules: sqr(z) -{ 1 }-> 1 + z + z :|: z >= 0 sum(z) -{ 1 }-> 0 :|: z = 0 sum(z) -{ 2 }-> 1 + (1 + x' + x') + sum(z - 1) :|: z - 1 >= 0, x' >= 0, 1 + (z - 1) = x' sum(z) -{ 1 }-> 1 + (1 + (1 + (z - 1)) + (1 + (z - 1))) + sum(z - 1) :|: z - 1 >= 0 Function symbols to be analyzed: {sum}, {sqr} ---------------------------------------- (21) IntTrsBoundProof (UPPER BOUND(ID)) Computed SIZE bound using CoFloCo for: sum after applying outer abstraction to obtain an ITS, resulting in: O(n^2) with polynomial bound: 2*z + 2*z^2 ---------------------------------------- (22) Obligation: Complexity RNTS consisting of the following rules: sqr(z) -{ 1 }-> 1 + z + z :|: z >= 0 sum(z) -{ 1 }-> 0 :|: z = 0 sum(z) -{ 2 }-> 1 + (1 + x' + x') + sum(z - 1) :|: z - 1 >= 0, x' >= 0, 1 + (z - 1) = x' sum(z) -{ 1 }-> 1 + (1 + (1 + (z - 1)) + (1 + (z - 1))) + sum(z - 1) :|: z - 1 >= 0 Function symbols to be analyzed: {sum}, {sqr} Previous analysis results are: sum: runtime: ?, size: O(n^2) [2*z + 2*z^2] ---------------------------------------- (23) IntTrsBoundProof (UPPER BOUND(ID)) Computed RUNTIME bound using CoFloCo for: sum after applying outer abstraction to obtain an ITS, resulting in: O(n^1) with polynomial bound: 1 + 2*z ---------------------------------------- (24) Obligation: Complexity RNTS consisting of the following rules: sqr(z) -{ 1 }-> 1 + z + z :|: z >= 0 sum(z) -{ 1 }-> 0 :|: z = 0 sum(z) -{ 2 }-> 1 + (1 + x' + x') + sum(z - 1) :|: z - 1 >= 0, x' >= 0, 1 + (z - 1) = x' sum(z) -{ 1 }-> 1 + (1 + (1 + (z - 1)) + (1 + (z - 1))) + sum(z - 1) :|: z - 1 >= 0 Function symbols to be analyzed: {sqr} Previous analysis results are: sum: runtime: O(n^1) [1 + 2*z], size: O(n^2) [2*z + 2*z^2] ---------------------------------------- (25) ResultPropagationProof (UPPER BOUND(ID)) Applied inner abstraction using the recently inferred runtime/size bounds where possible. ---------------------------------------- (26) Obligation: Complexity RNTS consisting of the following rules: sqr(z) -{ 1 }-> 1 + z + z :|: z >= 0 sum(z) -{ 1 }-> 0 :|: z = 0 sum(z) -{ 1 + 2*z }-> 1 + (1 + x' + x') + s' :|: s' >= 0, s' <= 2 * ((z - 1) * (z - 1)) + 2 * (z - 1), z - 1 >= 0, x' >= 0, 1 + (z - 1) = x' sum(z) -{ 2*z }-> 1 + (1 + (1 + (z - 1)) + (1 + (z - 1))) + s :|: s >= 0, s <= 2 * ((z - 1) * (z - 1)) + 2 * (z - 1), z - 1 >= 0 Function symbols to be analyzed: {sqr} Previous analysis results are: sum: runtime: O(n^1) [1 + 2*z], size: O(n^2) [2*z + 2*z^2] ---------------------------------------- (27) IntTrsBoundProof (UPPER BOUND(ID)) Computed SIZE bound using CoFloCo for: sqr after applying outer abstraction to obtain an ITS, resulting in: O(n^1) with polynomial bound: 1 + 2*z ---------------------------------------- (28) Obligation: Complexity RNTS consisting of the following rules: sqr(z) -{ 1 }-> 1 + z + z :|: z >= 0 sum(z) -{ 1 }-> 0 :|: z = 0 sum(z) -{ 1 + 2*z }-> 1 + (1 + x' + x') + s' :|: s' >= 0, s' <= 2 * ((z - 1) * (z - 1)) + 2 * (z - 1), z - 1 >= 0, x' >= 0, 1 + (z - 1) = x' sum(z) -{ 2*z }-> 1 + (1 + (1 + (z - 1)) + (1 + (z - 1))) + s :|: s >= 0, s <= 2 * ((z - 1) * (z - 1)) + 2 * (z - 1), z - 1 >= 0 Function symbols to be analyzed: {sqr} Previous analysis results are: sum: runtime: O(n^1) [1 + 2*z], size: O(n^2) [2*z + 2*z^2] sqr: runtime: ?, size: O(n^1) [1 + 2*z] ---------------------------------------- (29) IntTrsBoundProof (UPPER BOUND(ID)) Computed RUNTIME bound using CoFloCo for: sqr after applying outer abstraction to obtain an ITS, resulting in: O(1) with polynomial bound: 1 ---------------------------------------- (30) Obligation: Complexity RNTS consisting of the following rules: sqr(z) -{ 1 }-> 1 + z + z :|: z >= 0 sum(z) -{ 1 }-> 0 :|: z = 0 sum(z) -{ 1 + 2*z }-> 1 + (1 + x' + x') + s' :|: s' >= 0, s' <= 2 * ((z - 1) * (z - 1)) + 2 * (z - 1), z - 1 >= 0, x' >= 0, 1 + (z - 1) = x' sum(z) -{ 2*z }-> 1 + (1 + (1 + (z - 1)) + (1 + (z - 1))) + s :|: s >= 0, s <= 2 * ((z - 1) * (z - 1)) + 2 * (z - 1), z - 1 >= 0 Function symbols to be analyzed: Previous analysis results are: sum: runtime: O(n^1) [1 + 2*z], size: O(n^2) [2*z + 2*z^2] sqr: runtime: O(1) [1], size: O(n^1) [1 + 2*z] ---------------------------------------- (31) FinalProof (FINISHED) Computed overall runtime complexity ---------------------------------------- (32) BOUNDS(1, n^1) ---------------------------------------- (33) RelTrsToDecreasingLoopProblemProof (LOWER BOUND(ID)) Transformed a relative TRS into a decreasing-loop problem. ---------------------------------------- (34) Obligation: Analyzing the following TRS for decreasing loops: The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, n^1). The TRS R consists of the following rules: sum(0) -> 0 sum(s(x)) -> +(sqr(s(x)), sum(x)) sqr(x) -> *(x, x) sum(s(x)) -> +(*(s(x), s(x)), sum(x)) S is empty. Rewrite Strategy: FULL ---------------------------------------- (35) DecreasingLoopProof (LOWER BOUND(ID)) The following loop(s) give(s) rise to the lower bound Omega(n^1): The rewrite sequence sum(s(x)) ->^+ +(*(s(x), s(x)), sum(x)) gives rise to a decreasing loop by considering the right hand sides subterm at position [1]. The pumping substitution is [x / s(x)]. The result substitution is [ ]. ---------------------------------------- (36) Complex Obligation (BEST) ---------------------------------------- (37) Obligation: Proved the lower bound n^1 for the following obligation: The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, n^1). The TRS R consists of the following rules: sum(0) -> 0 sum(s(x)) -> +(sqr(s(x)), sum(x)) sqr(x) -> *(x, x) sum(s(x)) -> +(*(s(x), s(x)), sum(x)) S is empty. Rewrite Strategy: FULL ---------------------------------------- (38) LowerBoundPropagationProof (FINISHED) Propagated lower bound. ---------------------------------------- (39) BOUNDS(n^1, INF) ---------------------------------------- (40) Obligation: Analyzing the following TRS for decreasing loops: The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, n^1). The TRS R consists of the following rules: sum(0) -> 0 sum(s(x)) -> +(sqr(s(x)), sum(x)) sqr(x) -> *(x, x) sum(s(x)) -> +(*(s(x), s(x)), sum(x)) S is empty. Rewrite Strategy: FULL