details

property	value
status	timeout (wallclock)
benchmark	Liveness6.2.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
space	AProVE_04

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	301.009832144 seconds
cpu usage	1209.72249451
max memory	1.5620050944E10

stage attributes

unavailable

output

/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), ?) 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, INF). (0) CpxTRS (1) RelTrsToDecreasingLoopProblemProof [LOWER BOUND(ID), 0 ms] (2) TRS for Loop Detection (3) DecreasingLoopProof [LOWER BOUND(ID), 0 ms] (4) BEST (5) proven lower bound (6) LowerBoundPropagationProof [FINISHED, 0 ms] (7) BOUNDS(n^1, INF) (8) TRS for Loop Detection ---------------------------------------- (0) Obligation: The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, INF). The TRS R consists of the following rules: top(sent(x)) -> top(check(rest(x))) rest(nil) -> sent(nil) rest(cons(x, y)) -> sent(y) check(sent(x)) -> sent(check(x)) check(rest(x)) -> rest(check(x)) check(cons(x, y)) -> cons(check(x), y) check(cons(x, y)) -> cons(x, check(y)) check(cons(x, y)) -> cons(x, y) S is empty. Rewrite Strategy: FULL ---------------------------------------- (1) RelTrsToDecreasingLoopProblemProof (LOWER BOUND(ID)) Transformed a relative TRS into a decreasing-loop problem. ---------------------------------------- (2) Obligation: Analyzing the following TRS for decreasing loops: The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, INF). The TRS R consists of the following rules: top(sent(x)) -> top(check(rest(x))) rest(nil) -> sent(nil) rest(cons(x, y)) -> sent(y) check(sent(x)) -> sent(check(x)) check(rest(x)) -> rest(check(x)) check(cons(x, y)) -> cons(check(x), y) check(cons(x, y)) -> cons(x, check(y)) check(cons(x, y)) -> cons(x, y) S is empty. Rewrite Strategy: FULL ---------------------------------------- (3) DecreasingLoopProof (LOWER BOUND(ID)) The following loop(s) give(s) rise to the lower bound Omega(n^1): The rewrite sequence check(cons(x, y)) ->^+ cons(check(x), y) gives rise to a decreasing loop by considering the right hand sides subterm at position [0]. The pumping substitution is [x / cons(x, y)]. The result substitution is [ ]. ---------------------------------------- (4) Complex Obligation (BEST) ---------------------------------------- (5) 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, INF). popout

output may be truncated. 'popout' for the full output.

job log

popout

actions

all output return to Runti Compl Full Rewri 10127