details

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

run statistics

property	value
solver	AProVE
configuration	rcdcRelativeAlsoLower
runtime (wallclock)	291.491 seconds
cpu usage	310.004
user time	307.371
system time	2.63232
max virtual memory	1.884688E7
max residence set size	5210360.0

stage attributes

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

output

WORST_CASE(?, O(n^1)) proof of /export/starexec/sandbox/benchmark/theBenchmark.xml # AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty The Derivational Complexity (full) of the given DCpxTrs could be proven to be BOUNDS(1, n^1). (0) DCpxTrs (1) DerivationalComplexityToRuntimeComplexityProof [BOTH BOUNDS(ID, ID), 0 ms] (2) CpxRelTRS (3) SInnermostTerminationProof [BOTH CONCRETE BOUNDS(ID, ID), 182 ms] (4) CpxRelTRS (5) RelTrsToTrsProof [UPPER BOUND(ID), 0 ms] (6) CpxTRS (7) CpxTrsMatchBoundsTAProof [FINISHED, 40 ms] (8) BOUNDS(1, n^1) ---------------------------------------- (0) Obligation: The Derivational Complexity (full) of the given DCpxTrs could be proven to be BOUNDS(1, n^1). The TRS R consists of the following rules: first(0, X) -> nil first(s(X), cons(Y)) -> cons(Y) from(X) -> cons(X) S is empty. Rewrite Strategy: FULL ---------------------------------------- (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(nil) -> nil encArg(s(x_1)) -> s(encArg(x_1)) encArg(cons(x_1)) -> cons(encArg(x_1)) encArg(cons_first(x_1, x_2)) -> first(encArg(x_1), encArg(x_2)) encArg(cons_from(x_1)) -> from(encArg(x_1)) encode_first(x_1, x_2) -> first(encArg(x_1), encArg(x_2)) encode_0 -> 0 encode_nil -> nil encode_s(x_1) -> s(encArg(x_1)) encode_cons(x_1) -> cons(encArg(x_1)) encode_from(x_1) -> from(encArg(x_1)) ---------------------------------------- (2) Obligation: The Runtime Complexity (full) of the given CpxRelTRS could be proven to be BOUNDS(1, n^1). The TRS R consists of the following rules: first(0, X) -> nil first(s(X), cons(Y)) -> cons(Y) from(X) -> cons(X) The (relative) TRS S consists of the following rules: encArg(0) -> 0 encArg(nil) -> nil encArg(s(x_1)) -> s(encArg(x_1)) encArg(cons(x_1)) -> cons(encArg(x_1)) encArg(cons_first(x_1, x_2)) -> first(encArg(x_1), encArg(x_2)) encArg(cons_from(x_1)) -> from(encArg(x_1)) encode_first(x_1, x_2) -> first(encArg(x_1), encArg(x_2)) encode_0 -> 0 encode_nil -> nil encode_s(x_1) -> s(encArg(x_1)) encode_cons(x_1) -> cons(encArg(x_1)) encode_from(x_1) -> from(encArg(x_1)) Rewrite Strategy: FULL ---------------------------------------- (3) SInnermostTerminationProof (BOTH CONCRETE BOUNDS(ID, ID)) proved innermost termination of relative rules ---------------------------------------- (4) Obligation: The Runtime Complexity (full) of the given CpxRelTRS could be proven to be BOUNDS(1, n^1). The TRS R consists of the following rules: first(0, X) -> nil first(s(X), cons(Y)) -> cons(Y) from(X) -> cons(X) The (relative) TRS S consists of the following rules: popout

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

job log

popout

actions

all output return to Derivational Complexity: TRS