details

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

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	291.452651978 seconds
cpu usage	1109.3380278
max memory	6.677495808E9

stage attributes

key	value
output-size	9518
starexec-result	WORST_CASE(Omega(n^1), ?)

output

/export/starexec/sandbox2/solver/bin/starexec_run_complexity /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- WORST_CASE(Omega(n^1), ?) proof of /export/starexec/sandbox2/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) RenamingProof [BOTH BOUNDS(ID, ID), 0 ms] (2) CpxTRS (3) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms] (4) typed CpxTrs (5) OrderProof [LOWER BOUND(ID), 0 ms] (6) typed CpxTrs (7) RewriteLemmaProof [LOWER BOUND(ID), 339 ms] (8) BEST (9) proven lower bound (10) LowerBoundPropagationProof [FINISHED, 0 ms] (11) BOUNDS(n^1, INF) (12) typed CpxTrs (13) RewriteLemmaProof [LOWER BOUND(ID), 79 ms] (14) typed CpxTrs (15) RewriteLemmaProof [LOWER BOUND(ID), 524 ms] (16) typed CpxTrs ---------------------------------------- (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: tower(x) -> f(a, x, s(0)) f(a, 0, y) -> y f(a, s(x), y) -> f(b, y, s(x)) f(b, y, x) -> f(a, half(x), exp(y)) exp(0) -> s(0) exp(s(x)) -> double(exp(x)) double(0) -> 0 double(s(x)) -> s(s(double(x))) half(0) -> double(0) half(s(0)) -> half(0) half(s(s(x))) -> s(half(x)) S is empty. Rewrite Strategy: FULL ---------------------------------------- (1) RenamingProof (BOTH BOUNDS(ID, ID)) Renamed function symbols to avoid clashes with predefined symbol. ---------------------------------------- (2) 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: tower(x) -> f(a, x, s(0')) f(a, 0', y) -> y f(a, s(x), y) -> f(b, y, s(x)) f(b, y, x) -> f(a, half(x), exp(y)) exp(0') -> s(0') exp(s(x)) -> double(exp(x)) double(0') -> 0' double(s(x)) -> s(s(double(x))) half(0') -> double(0') half(s(0')) -> half(0') half(s(s(x))) -> s(half(x)) S is empty. Rewrite Strategy: FULL ---------------------------------------- (3) TypeInferenceProof (BOTH BOUNDS(ID, ID)) Infered types. ---------------------------------------- (4) Obligation: TRS: Rules: tower(x) -> f(a, x, s(0')) f(a, 0', y) -> y f(a, s(x), y) -> f(b, y, s(x)) f(b, y, x) -> f(a, half(x), exp(y)) exp(0') -> s(0') exp(s(x)) -> double(exp(x)) double(0') -> 0' double(s(x)) -> s(s(double(x))) popout

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

job log

popout

actions

all output return to Runti Compl Full Rewri 10127