details

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

run statistics

property	value
solver	AProVE
configuration	rcdcRelativeAlsoLower
runtime (wallclock)	1.82148 seconds
cpu usage	4.03721
user time	3.88032
system time	0.156894
max virtual memory	1.8475476E7
max residence set size	254136.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(INF, INF). (0) DCpxTrs (1) DerivationalComplexityToRuntimeComplexityProof [BOTH BOUNDS(ID, ID), 0 ms] (2) CpxRelTRS (3) SInnermostTerminationProof [BOTH CONCRETE BOUNDS(ID, ID), 252 ms] (4) CpxRelTRS (5) RelTrsToDecreasingLoopProblemProof [LOWER BOUND(ID), 3 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, 0 ms] (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: dbl(0) -> 0 dbl(s(X)) -> s(s(dbl(X))) dbls(nil) -> nil dbls(cons(X, Y)) -> cons(dbl(X), dbls(Y)) sel(0, cons(X, Y)) -> X sel(s(X), cons(Y, Z)) -> sel(X, Z) indx(nil, X) -> nil indx(cons(X, Y), Z) -> cons(sel(X, Z), indx(Y, Z)) from(X) -> cons(X, from(s(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(s(x_1)) -> s(encArg(x_1)) encArg(nil) -> nil encArg(cons(x_1, x_2)) -> cons(encArg(x_1), encArg(x_2)) 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)) encode_dbl(x_1) -> dbl(encArg(x_1)) encode_0 -> 0 encode_s(x_1) -> s(encArg(x_1)) encode_dbls(x_1) -> dbls(encArg(x_1)) encode_nil -> nil encode_cons(x_1, x_2) -> cons(encArg(x_1), encArg(x_2)) encode_sel(x_1, x_2) -> sel(encArg(x_1), encArg(x_2)) encode_indx(x_1, x_2) -> indx(encArg(x_1), encArg(x_2)) encode_from(x_1) -> from(encArg(x_1)) ---------------------------------------- (2) Obligation: The Runtime Complexity (innermost) of the given CpxRelTRS could be proven to be BOUNDS(INF, INF). The TRS R consists of the following rules: dbl(0) -> 0 dbl(s(X)) -> s(s(dbl(X))) dbls(nil) -> nil dbls(cons(X, Y)) -> cons(dbl(X), dbls(Y)) sel(0, cons(X, Y)) -> X sel(s(X), cons(Y, Z)) -> sel(X, Z) indx(nil, X) -> nil indx(cons(X, Y), Z) -> cons(sel(X, Z), indx(Y, Z)) from(X) -> cons(X, from(s(X))) The (relative) TRS S consists of the following rules: encArg(0) -> 0 encArg(s(x_1)) -> s(encArg(x_1)) encArg(nil) -> nil encArg(cons(x_1, x_2)) -> cons(encArg(x_1), encArg(x_2)) 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)) popout

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

job log

popout

actions

all output return to Derivational Complexity: TRS Innermost