details

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

run statistics

property	value
solver	AProVE
configuration	rcdcRelativeAlsoLower
runtime (wallclock)	296.849 seconds
cpu usage	1164.26
user time	1151.63
system time	12.6348
max virtual memory	3.8189332E7
max residence set size	1.5128904E7

stage attributes

key	value
starexec-result	WORST_CASE(Omega(n^1), ?)

output

WORST_CASE(Omega(n^1), ?) proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml # AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty The Derivational Complexity (innermost) of the given DCpxTrs could be proven to be BOUNDS(n^1, INF). (0) DCpxTrs (1) DerivationalComplexityToRuntimeComplexityProof [BOTH BOUNDS(ID, ID), 0 ms] (2) CpxRelTRS (3) SInnermostTerminationProof [BOTH CONCRETE BOUNDS(ID, ID), 481 ms] (4) CpxRelTRS (5) RenamingProof [BOTH BOUNDS(ID, ID), 0 ms] (6) CpxRelTRS (7) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms] (8) typed CpxTrs (9) OrderProof [LOWER BOUND(ID), 0 ms] (10) typed CpxTrs (11) RewriteLemmaProof [LOWER BOUND(ID), 581 ms] (12) BEST (13) proven lower bound (14) LowerBoundPropagationProof [FINISHED, 0 ms] (15) BOUNDS(n^1, INF) (16) typed CpxTrs ---------------------------------------- (0) Obligation: The Derivational Complexity (innermost) of the given DCpxTrs could be proven to be BOUNDS(n^1, INF). The TRS R consists of the following rules: pairNs -> cons(0, n__incr(n__oddNs)) oddNs -> incr(pairNs) incr(cons(X, XS)) -> cons(s(X), n__incr(activate(XS))) take(0, XS) -> nil take(s(N), cons(X, XS)) -> cons(X, n__take(N, activate(XS))) zip(nil, XS) -> nil zip(X, nil) -> nil zip(cons(X, XS), cons(Y, YS)) -> cons(pair(X, Y), n__zip(activate(XS), activate(YS))) tail(cons(X, XS)) -> activate(XS) repItems(nil) -> nil repItems(cons(X, XS)) -> cons(X, n__cons(X, n__repItems(activate(XS)))) incr(X) -> n__incr(X) oddNs -> n__oddNs take(X1, X2) -> n__take(X1, X2) zip(X1, X2) -> n__zip(X1, X2) cons(X1, X2) -> n__cons(X1, X2) repItems(X) -> n__repItems(X) activate(n__incr(X)) -> incr(activate(X)) activate(n__oddNs) -> oddNs activate(n__take(X1, X2)) -> take(activate(X1), activate(X2)) activate(n__zip(X1, X2)) -> zip(activate(X1), activate(X2)) activate(n__cons(X1, X2)) -> cons(activate(X1), X2) activate(n__repItems(X)) -> repItems(activate(X)) activate(X) -> X S is empty. Rewrite Strategy: INNERMOST ---------------------------------------- (1) DerivationalComplexityToRuntimeComplexityProof (BOTH BOUNDS(ID, ID)) The following rules have been added to S to convert the given derivational complexity problem to a runtime complexity problem: encArg(0) -> 0 encArg(n__incr(x_1)) -> n__incr(encArg(x_1)) encArg(n__oddNs) -> n__oddNs encArg(s(x_1)) -> s(encArg(x_1)) encArg(nil) -> nil encArg(n__take(x_1, x_2)) -> n__take(encArg(x_1), encArg(x_2)) encArg(pair(x_1, x_2)) -> pair(encArg(x_1), encArg(x_2)) encArg(n__zip(x_1, x_2)) -> n__zip(encArg(x_1), encArg(x_2)) encArg(n__cons(x_1, x_2)) -> n__cons(encArg(x_1), encArg(x_2)) encArg(n__repItems(x_1)) -> n__repItems(encArg(x_1)) encArg(cons_pairNs) -> pairNs encArg(cons_oddNs) -> oddNs encArg(cons_incr(x_1)) -> incr(encArg(x_1)) encArg(cons_take(x_1, x_2)) -> take(encArg(x_1), encArg(x_2)) encArg(cons_zip(x_1, x_2)) -> zip(encArg(x_1), encArg(x_2)) encArg(cons_tail(x_1)) -> tail(encArg(x_1)) encArg(cons_repItems(x_1)) -> repItems(encArg(x_1)) encArg(cons_cons(x_1, x_2)) -> cons(encArg(x_1), encArg(x_2)) encArg(cons_activate(x_1)) -> activate(encArg(x_1)) encode_pairNs -> pairNs encode_cons(x_1, x_2) -> cons(encArg(x_1), encArg(x_2)) encode_0 -> 0 encode_n__incr(x_1) -> n__incr(encArg(x_1)) encode_n__oddNs -> n__oddNs encode_oddNs -> oddNs encode_incr(x_1) -> incr(encArg(x_1)) encode_s(x_1) -> s(encArg(x_1)) encode_activate(x_1) -> activate(encArg(x_1)) encode_take(x_1, x_2) -> take(encArg(x_1), encArg(x_2)) encode_nil -> nil encode_n__take(x_1, x_2) -> n__take(encArg(x_1), encArg(x_2)) encode_zip(x_1, x_2) -> zip(encArg(x_1), encArg(x_2)) encode_pair(x_1, x_2) -> pair(encArg(x_1), encArg(x_2)) popout

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

job log

popout

actions

all output return to Derivational Complexity: TRS Innermost