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