details

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

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	292.091144085 seconds
cpu usage	307.706880097
max memory	5.383491584E9

stage attributes

key	value
output-size	13385
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 (full) 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), 223 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), 83 ms] (14) typed CpxTrs (15) RewriteLemmaProof [LOWER BOUND(ID), 35 ms] (16) proven lower bound (17) LowerBoundPropagationProof [FINISHED, 0 ms] (18) BOUNDS(n^2, INF) ---------------------------------------- (0) Obligation: The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^2, INF). The TRS R consists of the following rules: last(nil) -> 0 last(cons(x, nil)) -> x last(cons(x, cons(y, xs))) -> last(cons(y, xs)) del(x, nil) -> nil del(x, cons(y, xs)) -> if(eq(x, y), x, y, xs) if(true, x, y, xs) -> xs if(false, x, y, xs) -> cons(y, del(x, xs)) eq(0, 0) -> true eq(0, s(y)) -> false eq(s(x), 0) -> false eq(s(x), s(y)) -> eq(x, y) reverse(nil) -> nil reverse(cons(x, xs)) -> cons(last(cons(x, xs)), reverse(del(last(cons(x, xs)), cons(x, xs)))) 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^2, INF). The TRS R consists of the following rules: last(nil) -> 0' last(cons(x, nil)) -> x last(cons(x, cons(y, xs))) -> last(cons(y, xs)) del(x, nil) -> nil del(x, cons(y, xs)) -> if(eq(x, y), x, y, xs) if(true, x, y, xs) -> xs if(false, x, y, xs) -> cons(y, del(x, xs)) eq(0', 0') -> true eq(0', s(y)) -> false eq(s(x), 0') -> false eq(s(x), s(y)) -> eq(x, y) reverse(nil) -> nil reverse(cons(x, xs)) -> cons(last(cons(x, xs)), reverse(del(last(cons(x, xs)), cons(x, xs)))) S is empty. Rewrite Strategy: FULL ---------------------------------------- (3) TypeInferenceProof (BOTH BOUNDS(ID, ID)) Infered types. ---------------------------------------- (4) Obligation: TRS: Rules: last(nil) -> 0' last(cons(x, nil)) -> x popout

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

job log

popout

actions

all output return to Runti Compl Full Rewri 10127