details

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

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	292.07911706 seconds
cpu usage	310.750473978
max memory	5.350006784E9

stage attributes

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

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) 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), 242 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), 58 ms] (14) 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: div(x, s(y)) -> d(x, s(y), 0) d(x, s(y), z) -> cond(ge(x, z), x, y, z) cond(true, x, y, z) -> s(d(x, s(y), plus(s(y), z))) cond(false, x, y, z) -> 0 ge(u, 0) -> true ge(0, s(v)) -> false ge(s(u), s(v)) -> ge(u, v) plus(n, 0) -> n plus(n, s(m)) -> s(plus(n, m)) 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: div(x, s(y)) -> d(x, s(y), 0') d(x, s(y), z) -> cond(ge(x, z), x, y, z) cond(true, x, y, z) -> s(d(x, s(y), plus(s(y), z))) cond(false, x, y, z) -> 0' ge(u, 0') -> true ge(0', s(v)) -> false ge(s(u), s(v)) -> ge(u, v) plus(n, 0') -> n plus(n, s(m)) -> s(plus(n, m)) S is empty. Rewrite Strategy: FULL ---------------------------------------- (3) TypeInferenceProof (BOTH BOUNDS(ID, ID)) Infered types. ---------------------------------------- (4) Obligation: TRS: Rules: div(x, s(y)) -> d(x, s(y), 0') d(x, s(y), z) -> cond(ge(x, z), x, y, z) cond(true, x, y, z) -> s(d(x, s(y), plus(s(y), z))) cond(false, x, y, z) -> 0' ge(u, 0') -> true ge(0', s(v)) -> false ge(s(u), s(v)) -> ge(u, v) plus(n, 0') -> n plus(n, s(m)) -> s(plus(n, m)) Types: div :: s:0' -> s:0' -> s:0' s :: s:0' -> s:0' d :: s:0' -> s:0' -> s:0' -> s:0' popout

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

job log

popout

actions

all output return to Runti Compl Full Rewri 10127