details

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

run statistics

property	value
solver	AProVE
configuration	rcdcRelativeAlsoLower
runtime (wallclock)	1.76592 seconds
cpu usage	3.82083
user time	3.65927
system time	0.161565
max virtual memory	1.8409712E7
max residence set size	238476.0

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), 200 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, 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: eq(0, 0) -> true eq(s(X), s(Y)) -> eq(X, Y) eq(X, Y) -> false inf(X) -> cons(X, inf(s(X))) take(0, X) -> nil take(s(X), cons(Y, L)) -> cons(Y, take(X, L)) length(nil) -> 0 length(cons(X, L)) -> s(length(L)) 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(true) -> true encArg(s(x_1)) -> s(encArg(x_1)) encArg(false) -> false encArg(cons(x_1, x_2)) -> cons(encArg(x_1), encArg(x_2)) encArg(nil) -> nil encArg(cons_eq(x_1, x_2)) -> eq(encArg(x_1), encArg(x_2)) encArg(cons_inf(x_1)) -> inf(encArg(x_1)) encArg(cons_take(x_1, x_2)) -> take(encArg(x_1), encArg(x_2)) encArg(cons_length(x_1)) -> length(encArg(x_1)) encode_eq(x_1, x_2) -> eq(encArg(x_1), encArg(x_2)) encode_0 -> 0 encode_true -> true encode_s(x_1) -> s(encArg(x_1)) encode_false -> false encode_inf(x_1) -> inf(encArg(x_1)) encode_cons(x_1, x_2) -> cons(encArg(x_1), encArg(x_2)) encode_take(x_1, x_2) -> take(encArg(x_1), encArg(x_2)) encode_nil -> nil encode_length(x_1) -> length(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: eq(0, 0) -> true eq(s(X), s(Y)) -> eq(X, Y) eq(X, Y) -> false inf(X) -> cons(X, inf(s(X))) take(0, X) -> nil take(s(X), cons(Y, L)) -> cons(Y, take(X, L)) length(nil) -> 0 length(cons(X, L)) -> s(length(L)) The (relative) TRS S consists of the following rules: encArg(0) -> 0 encArg(true) -> true encArg(s(x_1)) -> s(encArg(x_1)) encArg(false) -> false encArg(cons(x_1, x_2)) -> cons(encArg(x_1), encArg(x_2)) encArg(nil) -> nil encArg(cons_eq(x_1, x_2)) -> eq(encArg(x_1), encArg(x_2)) encArg(cons_inf(x_1)) -> inf(encArg(x_1)) encArg(cons_take(x_1, x_2)) -> take(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