details

property	value
status	complete
benchmark	2.26.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n039.star.cs.uiowa.edu
space	SK90

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	1.58601999283 seconds
cpu usage	3.156838653
max memory	1.85204736E8

stage attributes

key	value
output-size	4728
starexec-result	WORST_CASE(NON_POLY, ?)

output

/export/starexec/sandbox/solver/bin/starexec_run_complexity /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- WORST_CASE(NON_POLY, ?) 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(EXP, 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 (9) DecreasingLoopProof [FINISHED, 0 ms] (10) BOUNDS(EXP, INF) ---------------------------------------- (0) Obligation: The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(EXP, INF). The TRS R consists of the following rules: f(0) -> 0 f(s(0)) -> s(0) f(s(s(x))) -> p(h(g(x))) g(0) -> pair(s(0), s(0)) g(s(x)) -> h(g(x)) h(x) -> pair(+(p(x), q(x)), p(x)) p(pair(x, y)) -> x q(pair(x, y)) -> y +(x, 0) -> x +(x, s(y)) -> s(+(x, y)) f(s(s(x))) -> +(p(g(x)), q(g(x))) g(s(x)) -> pair(+(p(g(x)), q(g(x))), p(g(x))) 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(EXP, INF). The TRS R consists of the following rules: f(0) -> 0 f(s(0)) -> s(0) f(s(s(x))) -> p(h(g(x))) g(0) -> pair(s(0), s(0)) g(s(x)) -> h(g(x)) h(x) -> pair(+(p(x), q(x)), p(x)) p(pair(x, y)) -> x q(pair(x, y)) -> y +(x, 0) -> x +(x, s(y)) -> s(+(x, y)) f(s(s(x))) -> +(p(g(x)), q(g(x))) g(s(x)) -> pair(+(p(g(x)), q(g(x))), p(g(x))) 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 +(x, s(y)) ->^+ s(+(x, y)) gives rise to a decreasing loop by considering the right hand sides subterm at position [0]. The pumping substitution is [y / s(y)]. The result substitution is [ ]. ---------------------------------------- popout

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

job log

popout

actions

all output return to Runti Compl Full Rewri 10127