details

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

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	291.509234905 seconds
cpu usage	1122.22142506
max memory	1.534560256E10

stage attributes

key	value
output-size	14029
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), 231 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), 194 ms] (14) proven lower bound (15) LowerBoundPropagationProof [FINISHED, 0 ms] (16) 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: sum(cons(s(n), x), cons(m, y)) -> sum(cons(n, x), cons(s(m), y)) sum(cons(0, x), y) -> sum(x, y) sum(nil, y) -> y empty(nil) -> true empty(cons(n, x)) -> false tail(nil) -> nil tail(cons(n, x)) -> x head(cons(n, x)) -> n weight(x) -> if(empty(x), empty(tail(x)), x) if(true, b, x) -> weight_undefined_error if(false, b, x) -> if2(b, x) if2(true, x) -> head(x) if2(false, x) -> weight(sum(x, cons(0, tail(tail(x))))) 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: sum(cons(s(n), x), cons(m, y)) -> sum(cons(n, x), cons(s(m), y)) sum(cons(0', x), y) -> sum(x, y) sum(nil, y) -> y empty(nil) -> true empty(cons(n, x)) -> false tail(nil) -> nil tail(cons(n, x)) -> x head(cons(n, x)) -> n weight(x) -> if(empty(x), empty(tail(x)), x) if(true, b, x) -> weight_undefined_error if(false, b, x) -> if2(b, x) if2(true, x) -> head(x) if2(false, x) -> weight(sum(x, cons(0', tail(tail(x))))) S is empty. Rewrite Strategy: INNERMOST ---------------------------------------- (3) TypeInferenceProof (BOTH BOUNDS(ID, ID)) Infered types. ---------------------------------------- (4) Obligation: Innermost TRS: Rules: sum(cons(s(n), x), cons(m, y)) -> sum(cons(n, x), cons(s(m), y)) sum(cons(0', x), y) -> sum(x, y) sum(nil, y) -> y empty(nil) -> true popout

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

job log

popout

actions

all output return to Runti Compl Inner Rewri 22807