details

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

run statistics

property	value
solver	AProVE
configuration	rcdcRelativeAlsoLower
runtime (wallclock)	111.397 seconds
cpu usage	434.671
user time	423.181
system time	11.4904
max virtual memory	3.8040908E7
max residence set size	1.4494064E7

stage attributes

key	value
starexec-result	WORST_CASE(NON_POLY, ?)

output

WORST_CASE(NON_POLY, ?) proof of /export/starexec/sandbox/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(INF, INF). (0) DCpxTrs (1) DerivationalComplexityToRuntimeComplexityProof [BOTH BOUNDS(ID, ID), 0 ms] (2) CpxRelTRS (3) SInnermostTerminationProof [BOTH CONCRETE BOUNDS(ID, ID), 660 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) InfiniteLowerBoundProof [FINISHED, 39.0 s] (14) BOUNDS(INF, INF) ---------------------------------------- (0) Obligation: The Derivational Complexity (innermost) of the given DCpxTrs could be proven to be BOUNDS(INF, INF). The TRS R consists of the following rules: sel(s(X), cons(Y, Z)) -> sel(X, activate(Z)) sel(0, cons(X, Z)) -> X first(0, Z) -> nil first(s(X), cons(Y, Z)) -> cons(Y, n__first(X, activate(Z))) from(X) -> cons(X, n__from(n__s(X))) sel1(s(X), cons(Y, Z)) -> sel1(X, activate(Z)) sel1(0, cons(X, Z)) -> quote(X) first1(0, Z) -> nil1 first1(s(X), cons(Y, Z)) -> cons1(quote(Y), first1(X, activate(Z))) quote(n__0) -> 01 quote1(n__cons(X, Z)) -> cons1(quote(activate(X)), quote1(activate(Z))) quote1(n__nil) -> nil1 quote(n__s(X)) -> s1(quote(activate(X))) quote(n__sel(X, Z)) -> sel1(activate(X), activate(Z)) quote1(n__first(X, Z)) -> first1(activate(X), activate(Z)) unquote(01) -> 0 unquote(s1(X)) -> s(unquote(X)) unquote1(nil1) -> nil unquote1(cons1(X, Z)) -> fcons(unquote(X), unquote1(Z)) fcons(X, Z) -> cons(X, Z) first(X1, X2) -> n__first(X1, X2) from(X) -> n__from(X) s(X) -> n__s(X) 0 -> n__0 cons(X1, X2) -> n__cons(X1, X2) nil -> n__nil sel(X1, X2) -> n__sel(X1, X2) activate(n__first(X1, X2)) -> first(activate(X1), activate(X2)) activate(n__from(X)) -> from(activate(X)) activate(n__s(X)) -> s(activate(X)) activate(n__0) -> 0 activate(n__cons(X1, X2)) -> cons(activate(X1), X2) activate(n__nil) -> nil activate(n__sel(X1, X2)) -> sel(activate(X1), activate(X2)) 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(n__first(x_1, x_2)) -> n__first(encArg(x_1), encArg(x_2)) encArg(n__from(x_1)) -> n__from(encArg(x_1)) encArg(n__s(x_1)) -> n__s(encArg(x_1)) encArg(nil1) -> nil1 encArg(cons1(x_1, x_2)) -> cons1(encArg(x_1), encArg(x_2)) encArg(n__0) -> n__0 encArg(01) -> 01 encArg(n__cons(x_1, x_2)) -> n__cons(encArg(x_1), encArg(x_2)) encArg(n__nil) -> n__nil encArg(s1(x_1)) -> s1(encArg(x_1)) encArg(n__sel(x_1, x_2)) -> n__sel(encArg(x_1), encArg(x_2)) encArg(cons_sel(x_1, x_2)) -> sel(encArg(x_1), encArg(x_2)) encArg(cons_first(x_1, x_2)) -> first(encArg(x_1), encArg(x_2)) encArg(cons_from(x_1)) -> from(encArg(x_1)) encArg(cons_sel1(x_1, x_2)) -> sel1(encArg(x_1), encArg(x_2)) encArg(cons_first1(x_1, x_2)) -> first1(encArg(x_1), encArg(x_2)) encArg(cons_quote(x_1)) -> quote(encArg(x_1)) encArg(cons_quote1(x_1)) -> quote1(encArg(x_1)) encArg(cons_unquote(x_1)) -> unquote(encArg(x_1)) encArg(cons_unquote1(x_1)) -> unquote1(encArg(x_1)) encArg(cons_fcons(x_1, x_2)) -> fcons(encArg(x_1), encArg(x_2)) encArg(cons_s(x_1)) -> s(encArg(x_1)) encArg(cons_0) -> 0 encArg(cons_cons(x_1, x_2)) -> cons(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