details

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

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	291.500135183 seconds
cpu usage	1125.38277105
max memory	1.5320674304E10

stage attributes

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

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^2), ?) proof of /export/starexec/sandbox2/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), 241 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), 24 ms] (14) typed CpxTrs (15) RewriteLemmaProof [LOWER BOUND(ID), 26 ms] (16) typed CpxTrs (17) RewriteLemmaProof [LOWER BOUND(ID), 319 ms] (18) proven lower bound (19) LowerBoundPropagationProof [FINISHED, 0 ms] (20) BOUNDS(n^2, INF) ---------------------------------------- (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: isEmpty(nil) -> true isEmpty(cons(x, xs)) -> false last(cons(x, nil)) -> x last(cons(x, cons(y, ys))) -> last(cons(y, ys)) dropLast(nil) -> nil dropLast(cons(x, nil)) -> nil dropLast(cons(x, cons(y, ys))) -> cons(x, dropLast(cons(y, ys))) append(nil, ys) -> ys append(cons(x, xs), ys) -> cons(x, append(xs, ys)) reverse(xs) -> rev(xs, nil) rev(xs, ys) -> if(isEmpty(xs), dropLast(xs), append(ys, last(xs)), ys) if(true, xs, ys, zs) -> zs if(false, xs, ys, zs) -> rev(xs, ys) 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: isEmpty(nil) -> true isEmpty(cons(x, xs)) -> false last(cons(x, nil)) -> x last(cons(x, cons(y, ys))) -> last(cons(y, ys)) dropLast(nil) -> nil dropLast(cons(x, nil)) -> nil dropLast(cons(x, cons(y, ys))) -> cons(x, dropLast(cons(y, ys))) append(nil, ys) -> ys append(cons(x, xs), ys) -> cons(x, append(xs, ys)) reverse(xs) -> rev(xs, nil) rev(xs, ys) -> if(isEmpty(xs), dropLast(xs), append(ys, last(xs)), ys) if(true, xs, ys, zs) -> zs if(false, xs, ys, zs) -> rev(xs, ys) 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