details

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

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	292.138468981 seconds
cpu usage	319.031561514
max memory	5.623713792E9

stage attributes

key	value
output-size	11327
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), 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), 119 ms] (14) typed CpxTrs (15) RewriteLemmaProof [LOWER BOUND(ID), 55 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: le(0, y) -> true le(s(x), 0) -> false le(s(x), s(y)) -> le(x, y) minus(x, 0) -> x minus(0, s(y)) -> 0 minus(s(x), s(y)) -> minus(x, y) plus(x, 0) -> x plus(x, s(y)) -> s(plus(x, y)) mod(s(x), 0) -> 0 mod(x, s(y)) -> help(x, s(y), 0) help(x, s(y), c) -> if(le(c, x), x, s(y), c) if(true, x, s(y), c) -> help(x, s(y), plus(c, s(y))) if(false, x, s(y), c) -> minus(x, minus(c, s(y))) 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: le(0', y) -> true le(s(x), 0') -> false le(s(x), s(y)) -> le(x, y) minus(x, 0') -> x minus(0', s(y)) -> 0' minus(s(x), s(y)) -> minus(x, y) plus(x, 0') -> x plus(x, s(y)) -> s(plus(x, y)) mod(s(x), 0') -> 0' mod(x, s(y)) -> help(x, s(y), 0') help(x, s(y), c) -> if(le(c, x), x, s(y), c) if(true, x, s(y), c) -> help(x, s(y), plus(c, s(y))) if(false, x, s(y), c) -> minus(x, minus(c, s(y))) S is empty. Rewrite Strategy: FULL ---------------------------------------- (3) TypeInferenceProof (BOTH BOUNDS(ID, ID)) Infered types. ---------------------------------------- (4) Obligation: TRS: Rules: le(0', y) -> true le(s(x), 0') -> false le(s(x), s(y)) -> le(x, y) minus(x, 0') -> x popout

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

job log

popout

actions

all output return to Runti Compl Full Rewri 10127