details

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

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	293.457264185 seconds
cpu usage	1150.33081069
max memory	1.5319937024E10

stage attributes

key	value
output-size	23513
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 (innermost) 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), 13.0 s] (8) BEST (9) proven lower bound (10) LowerBoundPropagationProof [FINISHED, 0 ms] (11) BOUNDS(n^1, INF) (12) typed CpxTrs ---------------------------------------- (0) Obligation: The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(n^1, INF). The TRS R consists of the following rules: a__pairNs -> cons(0, incr(oddNs)) a__oddNs -> a__incr(a__pairNs) a__incr(cons(X, XS)) -> cons(s(mark(X)), incr(XS)) a__take(0, XS) -> nil a__take(s(N), cons(X, XS)) -> cons(mark(X), take(N, XS)) a__zip(nil, XS) -> nil a__zip(X, nil) -> nil a__zip(cons(X, XS), cons(Y, YS)) -> cons(pair(mark(X), mark(Y)), zip(XS, YS)) a__tail(cons(X, XS)) -> mark(XS) a__repItems(nil) -> nil a__repItems(cons(X, XS)) -> cons(mark(X), cons(X, repItems(XS))) mark(pairNs) -> a__pairNs mark(incr(X)) -> a__incr(mark(X)) mark(oddNs) -> a__oddNs mark(take(X1, X2)) -> a__take(mark(X1), mark(X2)) mark(zip(X1, X2)) -> a__zip(mark(X1), mark(X2)) mark(tail(X)) -> a__tail(mark(X)) mark(repItems(X)) -> a__repItems(mark(X)) mark(cons(X1, X2)) -> cons(mark(X1), X2) mark(0) -> 0 mark(s(X)) -> s(mark(X)) mark(nil) -> nil mark(pair(X1, X2)) -> pair(mark(X1), mark(X2)) a__pairNs -> pairNs a__incr(X) -> incr(X) a__oddNs -> oddNs a__take(X1, X2) -> take(X1, X2) a__zip(X1, X2) -> zip(X1, X2) a__tail(X) -> tail(X) a__repItems(X) -> repItems(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^1, INF). The TRS R consists of the following rules: a__pairNs -> cons(0', incr(oddNs)) a__oddNs -> a__incr(a__pairNs) a__incr(cons(X, XS)) -> cons(s(mark(X)), incr(XS)) a__take(0', XS) -> nil a__take(s(N), cons(X, XS)) -> cons(mark(X), take(N, XS)) a__zip(nil, XS) -> nil a__zip(X, nil) -> nil a__zip(cons(X, XS), cons(Y, YS)) -> cons(pair(mark(X), mark(Y)), zip(XS, YS)) a__tail(cons(X, XS)) -> mark(XS) a__repItems(nil) -> nil a__repItems(cons(X, XS)) -> cons(mark(X), cons(X, repItems(XS))) mark(pairNs) -> a__pairNs mark(incr(X)) -> a__incr(mark(X)) mark(oddNs) -> a__oddNs mark(take(X1, X2)) -> a__take(mark(X1), mark(X2)) mark(zip(X1, X2)) -> a__zip(mark(X1), mark(X2)) mark(tail(X)) -> a__tail(mark(X)) popout

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

job log

popout

actions

all output return to Runti Compl Inner Rewri 22807