1114.42/291.50 WORST_CASE(Omega(n^1), ?) 1114.70/291.53 proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml 1114.70/291.53 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 1114.70/291.53 1114.70/291.53 1114.70/291.53 The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(n^1, INF). 1114.70/291.53 1114.70/291.53 (0) CpxTRS 1114.70/291.53 (1) RelTrsToDecreasingLoopProblemProof [LOWER BOUND(ID), 0 ms] 1114.70/291.53 (2) TRS for Loop Detection 1114.70/291.53 (3) DecreasingLoopProof [LOWER BOUND(ID), 0 ms] 1114.70/291.53 (4) BEST 1114.70/291.53 (5) proven lower bound 1114.70/291.53 (6) LowerBoundPropagationProof [FINISHED, 0 ms] 1114.70/291.53 (7) BOUNDS(n^1, INF) 1114.70/291.53 (8) TRS for Loop Detection 1114.70/291.53 1114.70/291.53 1114.70/291.53 ---------------------------------------- 1114.70/291.53 1114.70/291.53 (0) 1114.70/291.53 Obligation: 1114.70/291.53 The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(n^1, INF). 1114.70/291.53 1114.70/291.53 1114.70/291.53 The TRS R consists of the following rules: 1114.70/291.53 1114.70/291.53 times(x, y) -> help(x, y, 0) 1114.70/291.53 help(x, y, c) -> if(lt(c, y), x, y, c) 1114.70/291.53 if(true, x, y, c) -> plus(x, help(x, y, s(c))) 1114.70/291.53 if(false, x, y, c) -> 0 1114.70/291.53 lt(0, s(x)) -> true 1114.70/291.53 lt(s(x), 0) -> false 1114.70/291.53 lt(s(x), s(y)) -> lt(x, y) 1114.70/291.53 plus(x, 0) -> x 1114.70/291.53 plus(0, x) -> x 1114.70/291.53 plus(x, s(y)) -> s(plus(x, y)) 1114.70/291.53 plus(s(x), y) -> s(plus(x, y)) 1114.70/291.53 1114.70/291.53 S is empty. 1114.70/291.53 Rewrite Strategy: INNERMOST 1114.70/291.53 ---------------------------------------- 1114.70/291.53 1114.70/291.53 (1) RelTrsToDecreasingLoopProblemProof (LOWER BOUND(ID)) 1114.70/291.53 Transformed a relative TRS into a decreasing-loop problem. 1114.70/291.53 ---------------------------------------- 1114.70/291.53 1114.70/291.53 (2) 1114.70/291.53 Obligation: 1114.70/291.53 Analyzing the following TRS for decreasing loops: 1114.70/291.53 1114.70/291.53 The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(n^1, INF). 1114.70/291.53 1114.70/291.53 1114.70/291.53 The TRS R consists of the following rules: 1114.70/291.53 1114.70/291.53 times(x, y) -> help(x, y, 0) 1114.70/291.53 help(x, y, c) -> if(lt(c, y), x, y, c) 1114.70/291.53 if(true, x, y, c) -> plus(x, help(x, y, s(c))) 1114.70/291.53 if(false, x, y, c) -> 0 1114.70/291.53 lt(0, s(x)) -> true 1114.70/291.53 lt(s(x), 0) -> false 1114.70/291.53 lt(s(x), s(y)) -> lt(x, y) 1114.70/291.53 plus(x, 0) -> x 1114.70/291.53 plus(0, x) -> x 1114.70/291.53 plus(x, s(y)) -> s(plus(x, y)) 1114.70/291.53 plus(s(x), y) -> s(plus(x, y)) 1114.70/291.53 1114.70/291.53 S is empty. 1114.70/291.53 Rewrite Strategy: INNERMOST 1114.70/291.53 ---------------------------------------- 1114.70/291.53 1114.70/291.53 (3) DecreasingLoopProof (LOWER BOUND(ID)) 1114.70/291.53 The following loop(s) give(s) rise to the lower bound Omega(n^1): 1114.70/291.53 1114.70/291.53 The rewrite sequence 1114.70/291.53 1114.70/291.53 lt(s(x), s(y)) ->^+ lt(x, y) 1114.70/291.53 1114.70/291.53 gives rise to a decreasing loop by considering the right hand sides subterm at position []. 1114.70/291.53 1114.70/291.53 The pumping substitution is [x / s(x), y / s(y)]. 1114.70/291.53 1114.70/291.53 The result substitution is [ ]. 1114.70/291.53 1114.70/291.53 1114.70/291.53 1114.70/291.53 1114.70/291.53 ---------------------------------------- 1114.70/291.53 1114.70/291.53 (4) 1114.70/291.53 Complex Obligation (BEST) 1114.70/291.53 1114.70/291.53 ---------------------------------------- 1114.70/291.53 1114.70/291.53 (5) 1114.70/291.53 Obligation: 1114.70/291.53 Proved the lower bound n^1 for the following obligation: 1114.70/291.53 1114.70/291.53 The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(n^1, INF). 1114.70/291.53 1114.70/291.53 1114.70/291.53 The TRS R consists of the following rules: 1114.70/291.53 1114.70/291.53 times(x, y) -> help(x, y, 0) 1114.70/291.53 help(x, y, c) -> if(lt(c, y), x, y, c) 1114.70/291.53 if(true, x, y, c) -> plus(x, help(x, y, s(c))) 1114.70/291.53 if(false, x, y, c) -> 0 1114.70/291.53 lt(0, s(x)) -> true 1114.70/291.53 lt(s(x), 0) -> false 1114.70/291.53 lt(s(x), s(y)) -> lt(x, y) 1114.70/291.53 plus(x, 0) -> x 1114.70/291.53 plus(0, x) -> x 1114.70/291.53 plus(x, s(y)) -> s(plus(x, y)) 1114.70/291.53 plus(s(x), y) -> s(plus(x, y)) 1114.70/291.53 1114.70/291.53 S is empty. 1114.70/291.53 Rewrite Strategy: INNERMOST 1114.70/291.53 ---------------------------------------- 1114.70/291.53 1114.70/291.53 (6) LowerBoundPropagationProof (FINISHED) 1114.70/291.53 Propagated lower bound. 1114.70/291.53 ---------------------------------------- 1114.70/291.53 1114.70/291.53 (7) 1114.70/291.53 BOUNDS(n^1, INF) 1114.70/291.53 1114.70/291.53 ---------------------------------------- 1114.70/291.53 1114.70/291.53 (8) 1114.70/291.53 Obligation: 1114.70/291.53 Analyzing the following TRS for decreasing loops: 1114.70/291.53 1114.70/291.53 The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(n^1, INF). 1114.70/291.53 1114.70/291.53 1114.70/291.53 The TRS R consists of the following rules: 1114.70/291.53 1114.70/291.53 times(x, y) -> help(x, y, 0) 1114.70/291.53 help(x, y, c) -> if(lt(c, y), x, y, c) 1114.70/291.53 if(true, x, y, c) -> plus(x, help(x, y, s(c))) 1114.70/291.53 if(false, x, y, c) -> 0 1114.70/291.53 lt(0, s(x)) -> true 1114.70/291.53 lt(s(x), 0) -> false 1114.70/291.53 lt(s(x), s(y)) -> lt(x, y) 1114.70/291.53 plus(x, 0) -> x 1114.70/291.53 plus(0, x) -> x 1114.70/291.53 plus(x, s(y)) -> s(plus(x, y)) 1114.70/291.53 plus(s(x), y) -> s(plus(x, y)) 1114.70/291.53 1114.70/291.53 S is empty. 1114.70/291.53 Rewrite Strategy: INNERMOST 1114.87/291.61 EOF