details

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

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	291.893763065 seconds
cpu usage	309.212007309
max memory	5.272543232E9

stage attributes

key	value
output-size	17336
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), 288 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), 54 ms] (14) typed CpxTrs (15) RewriteLemmaProof [LOWER BOUND(ID), 0 ms] (16) typed CpxTrs (17) RewriteLemmaProof [LOWER BOUND(ID), 75 ms] (18) proven lower bound (19) LowerBoundPropagationProof [FINISHED, 0 ms] (20) 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: le(0, y) -> true le(s(x), 0) -> false le(s(x), s(y)) -> le(x, y) eq(0, 0) -> true eq(0, s(y)) -> false eq(s(x), 0) -> false eq(s(x), s(y)) -> eq(x, y) if1(true, x, y, xs) -> min(x, xs) if1(false, x, y, xs) -> min(y, xs) if2(true, x, y, xs) -> xs if2(false, x, y, xs) -> cons(y, del(x, xs)) minsort(nil) -> nil minsort(cons(x, y)) -> cons(min(x, y), minsort(del(min(x, y), cons(x, y)))) min(x, nil) -> x min(x, cons(y, z)) -> if1(le(x, y), x, y, z) del(x, nil) -> nil del(x, cons(y, z)) -> if2(eq(x, y), x, y, z) 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: le(0', y) -> true le(s(x), 0') -> false le(s(x), s(y)) -> le(x, y) eq(0', 0') -> true eq(0', s(y)) -> false eq(s(x), 0') -> false eq(s(x), s(y)) -> eq(x, y) if1(true, x, y, xs) -> min(x, xs) if1(false, x, y, xs) -> min(y, xs) if2(true, x, y, xs) -> xs if2(false, x, y, xs) -> cons(y, del(x, xs)) minsort(nil) -> nil minsort(cons(x, y)) -> cons(min(x, y), minsort(del(min(x, y), cons(x, y)))) min(x, nil) -> x min(x, cons(y, z)) -> if1(le(x, y), x, y, z) del(x, nil) -> nil del(x, cons(y, z)) -> if2(eq(x, y), x, y, z) S is empty. Rewrite Strategy: FULL ---------------------------------------- popout

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

job log

popout

actions

all output return to Runti Compl Full Rewri 10127