details

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

run statistics

property	value
solver	AProVE
configuration	rcdcRelativeAlsoLower
runtime (wallclock)	2.17372 seconds
cpu usage	5.65909
user time	5.41119
system time	0.247902
max virtual memory	1.841808E7
max residence set size	395868.0

stage attributes

key	value
starexec-result	WORST_CASE(NON_POLY, ?)

output

WORST_CASE(NON_POLY, ?) 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(EXP, INF). (0) DCpxTrs (1) DerivationalComplexityToRuntimeComplexityProof [BOTH BOUNDS(ID, ID), 0 ms] (2) CpxRelTRS (3) SInnermostTerminationProof [BOTH CONCRETE BOUNDS(ID, ID), 495 ms] (4) CpxRelTRS (5) RelTrsToDecreasingLoopProblemProof [LOWER BOUND(ID), 0 ms] (6) TRS for Loop Detection (7) DecreasingLoopProof [LOWER BOUND(ID), 0 ms] (8) BEST (9) proven lower bound (10) LowerBoundPropagationProof [FINISHED, 0 ms] (11) BOUNDS(n^1, INF) (12) TRS for Loop Detection (13) DecreasingLoopProof [FINISHED, 23 ms] (14) BOUNDS(EXP, INF) ---------------------------------------- (0) Obligation: The Derivational Complexity (innermost) of the given DCpxTrs could be proven to be BOUNDS(EXP, INF). The TRS R consists of the following rules: dbl(0) -> 0 dbl(s(X)) -> s(n__s(n__dbl(activate(X)))) dbls(nil) -> nil dbls(cons(X, Y)) -> cons(n__dbl(activate(X)), n__dbls(activate(Y))) sel(0, cons(X, Y)) -> activate(X) sel(s(X), cons(Y, Z)) -> sel(activate(X), activate(Z)) indx(nil, X) -> nil indx(cons(X, Y), Z) -> cons(n__sel(activate(X), activate(Z)), n__indx(activate(Y), activate(Z))) from(X) -> cons(activate(X), n__from(n__s(activate(X)))) dbl1(0) -> 01 dbl1(s(X)) -> s1(s1(dbl1(activate(X)))) sel1(0, cons(X, Y)) -> activate(X) sel1(s(X), cons(Y, Z)) -> sel1(activate(X), activate(Z)) quote(0) -> 01 quote(s(X)) -> s1(quote(activate(X))) quote(dbl(X)) -> dbl1(X) quote(sel(X, Y)) -> sel1(X, Y) s(X) -> n__s(X) dbl(X) -> n__dbl(X) dbls(X) -> n__dbls(X) sel(X1, X2) -> n__sel(X1, X2) indx(X1, X2) -> n__indx(X1, X2) from(X) -> n__from(X) activate(n__s(X)) -> s(X) activate(n__dbl(X)) -> dbl(activate(X)) activate(n__dbls(X)) -> dbls(activate(X)) activate(n__sel(X1, X2)) -> sel(activate(X1), activate(X2)) activate(n__indx(X1, X2)) -> indx(activate(X1), X2) activate(n__from(X)) -> from(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__s(x_1)) -> n__s(encArg(x_1)) encArg(n__dbl(x_1)) -> n__dbl(encArg(x_1)) encArg(nil) -> nil encArg(cons(x_1, x_2)) -> cons(encArg(x_1), encArg(x_2)) encArg(n__dbls(x_1)) -> n__dbls(encArg(x_1)) encArg(n__sel(x_1, x_2)) -> n__sel(encArg(x_1), encArg(x_2)) encArg(n__indx(x_1, x_2)) -> n__indx(encArg(x_1), encArg(x_2)) encArg(n__from(x_1)) -> n__from(encArg(x_1)) encArg(01) -> 01 encArg(s1(x_1)) -> s1(encArg(x_1)) encArg(cons_dbl(x_1)) -> dbl(encArg(x_1)) encArg(cons_dbls(x_1)) -> dbls(encArg(x_1)) encArg(cons_sel(x_1, x_2)) -> sel(encArg(x_1), encArg(x_2)) encArg(cons_indx(x_1, x_2)) -> indx(encArg(x_1), encArg(x_2)) encArg(cons_from(x_1)) -> from(encArg(x_1)) encArg(cons_dbl1(x_1)) -> dbl1(encArg(x_1)) encArg(cons_sel1(x_1, x_2)) -> sel1(encArg(x_1), encArg(x_2)) encArg(cons_quote(x_1)) -> quote(encArg(x_1)) encArg(cons_s(x_1)) -> s(encArg(x_1)) encArg(cons_activate(x_1)) -> activate(encArg(x_1)) encode_dbl(x_1) -> dbl(encArg(x_1)) encode_0 -> 0 encode_s(x_1) -> s(encArg(x_1)) encode_n__s(x_1) -> n__s(encArg(x_1)) encode_n__dbl(x_1) -> n__dbl(encArg(x_1)) encode_activate(x_1) -> activate(encArg(x_1)) encode_dbls(x_1) -> dbls(encArg(x_1)) encode_nil -> nil popout

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

job log

popout

actions

all output return to Derivational Complexity: TRS Innermost