details

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

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	294.09760499 seconds
cpu usage	1131.82714676
max memory	1.6001040384E10

stage attributes

key	value
output-size	14946
starexec-result	WORST_CASE(Omega(n^2), ?)

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^2), ?) proof of /export/starexec/sandbox/benchmark/theBenchmark.xml # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(n^2, 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), 304 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), 121 ms] (14) typed CpxTrs (15) RewriteLemmaProof [LOWER BOUND(ID), 58 ms] (16) typed CpxTrs (17) RewriteLemmaProof [LOWER BOUND(ID), 88 ms] (18) BEST (19) proven lower bound (20) LowerBoundPropagationProof [FINISHED, 0 ms] (21) BOUNDS(n^2, INF) (22) typed CpxTrs ---------------------------------------- (0) Obligation: The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(n^2, INF). The TRS R consists of the following rules: log(x, s(s(y))) -> cond(le(x, s(s(y))), x, y) cond(true, x, y) -> s(0) cond(false, x, y) -> double(log(x, square(s(s(y))))) le(0, v) -> true le(s(u), 0) -> false le(s(u), s(v)) -> le(u, v) double(0) -> 0 double(s(x)) -> s(s(double(x))) square(0) -> 0 square(s(x)) -> s(plus(square(x), double(x))) plus(n, 0) -> n plus(n, s(m)) -> s(plus(n, m)) S is empty. Rewrite Strategy: INNERMOST ---------------------------------------- (1) RenamingProof (BOTH BOUNDS(ID, ID)) Renamed function symbols to avoid clashes with predefined symbol. ---------------------------------------- (2) Obligation: The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(n^2, INF). The TRS R consists of the following rules: log(x, s(s(y))) -> cond(le(x, s(s(y))), x, y) cond(true, x, y) -> s(0') cond(false, x, y) -> double(log(x, square(s(s(y))))) le(0', v) -> true le(s(u), 0') -> false le(s(u), s(v)) -> le(u, v) double(0') -> 0' double(s(x)) -> s(s(double(x))) square(0') -> 0' square(s(x)) -> s(plus(square(x), double(x))) plus(n, 0') -> n plus(n, s(m)) -> s(plus(n, m)) S is empty. Rewrite Strategy: INNERMOST ---------------------------------------- (3) TypeInferenceProof (BOTH BOUNDS(ID, ID)) Infered types. ---------------------------------------- (4) Obligation: Innermost TRS: Rules: popout

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

job log

popout

actions

all output return to Runti Compl Inner Rewri 22807