details

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

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	291.474932194 seconds
cpu usage	312.623653795
max memory	5.354123264E9

stage attributes

key	value
output-size	23133
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), 301 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), 96 ms] (14) typed CpxTrs (15) RewriteLemmaProof [LOWER BOUND(ID), 494 ms] (16) typed CpxTrs (17) RewriteLemmaProof [LOWER BOUND(ID), 36 ms] (18) 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(s(x), 0) -> false le(0, y) -> true le(s(x), s(y)) -> le(x, y) double(0) -> 0 double(s(x)) -> s(s(double(x))) log(0) -> logError log(s(x)) -> loop(s(x), s(0), 0) loop(x, s(y), z) -> if(le(x, s(y)), x, s(y), z) if(true, x, y, z) -> z if(false, x, y, z) -> loop(x, double(y), s(z)) maplog(xs) -> mapIter(xs, nil) mapIter(xs, ys) -> ifmap(isempty(xs), xs, ys) ifmap(true, xs, ys) -> ys ifmap(false, xs, ys) -> mapIter(droplast(xs), cons(log(last(xs)), ys)) isempty(nil) -> true isempty(cons(x, xs)) -> false last(nil) -> error last(cons(x, nil)) -> x last(cons(x, cons(y, xs))) -> last(cons(y, xs)) droplast(nil) -> nil droplast(cons(x, nil)) -> nil droplast(cons(x, cons(y, xs))) -> cons(x, droplast(cons(y, xs))) a -> b a -> c 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(s(x), 0') -> false le(0', y) -> true le(s(x), s(y)) -> le(x, y) double(0') -> 0' double(s(x)) -> s(s(double(x))) log(0') -> logError log(s(x)) -> loop(s(x), s(0'), 0') loop(x, s(y), z) -> if(le(x, s(y)), x, s(y), z) if(true, x, y, z) -> z if(false, x, y, z) -> loop(x, double(y), s(z)) maplog(xs) -> mapIter(xs, nil) mapIter(xs, ys) -> ifmap(isempty(xs), xs, ys) ifmap(true, xs, ys) -> ys ifmap(false, xs, ys) -> mapIter(droplast(xs), cons(log(last(xs)), ys)) isempty(nil) -> true isempty(cons(x, xs)) -> false last(nil) -> error popout

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

job log

popout

actions

all output return to Runti Compl Full Rewri 10127