details

property	value
status	complete
benchmark	ExIntrod_GM01_FR.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)	7.1686 seconds
cpu usage	24.46
user time	23.1119
system time	1.34805
max virtual memory	1.9200092E7
max residence set size	3577404.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 (full) 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), 315 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, 2270 ms] (14) BOUNDS(INF, INF) ---------------------------------------- (0) Obligation: The Derivational Complexity (full) of the given DCpxTrs could be proven to be BOUNDS(INF, INF). The TRS R consists of the following rules: incr(nil) -> nil incr(cons(X, L)) -> cons(s(X), n__incr(activate(L))) adx(nil) -> nil adx(cons(X, L)) -> incr(cons(X, n__adx(activate(L)))) nats -> adx(zeros) zeros -> cons(0, n__zeros) head(cons(X, L)) -> X tail(cons(X, L)) -> activate(L) incr(X) -> n__incr(X) adx(X) -> n__adx(X) zeros -> n__zeros activate(n__incr(X)) -> incr(activate(X)) activate(n__adx(X)) -> adx(activate(X)) activate(n__zeros) -> zeros activate(X) -> 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(nil) -> nil encArg(cons(x_1, x_2)) -> cons(encArg(x_1), encArg(x_2)) encArg(s(x_1)) -> s(encArg(x_1)) encArg(n__incr(x_1)) -> n__incr(encArg(x_1)) encArg(n__adx(x_1)) -> n__adx(encArg(x_1)) encArg(0) -> 0 encArg(n__zeros) -> n__zeros encArg(cons_incr(x_1)) -> incr(encArg(x_1)) encArg(cons_adx(x_1)) -> adx(encArg(x_1)) encArg(cons_nats) -> nats encArg(cons_zeros) -> zeros encArg(cons_head(x_1)) -> head(encArg(x_1)) encArg(cons_tail(x_1)) -> tail(encArg(x_1)) encArg(cons_activate(x_1)) -> activate(encArg(x_1)) encode_incr(x_1) -> incr(encArg(x_1)) encode_nil -> nil encode_cons(x_1, x_2) -> cons(encArg(x_1), encArg(x_2)) encode_s(x_1) -> s(encArg(x_1)) encode_n__incr(x_1) -> n__incr(encArg(x_1)) encode_activate(x_1) -> activate(encArg(x_1)) encode_adx(x_1) -> adx(encArg(x_1)) encode_n__adx(x_1) -> n__adx(encArg(x_1)) encode_nats -> nats encode_zeros -> zeros encode_0 -> 0 encode_n__zeros -> n__zeros encode_head(x_1) -> head(encArg(x_1)) encode_tail(x_1) -> tail(encArg(x_1)) ---------------------------------------- (2) Obligation: The Runtime Complexity (full) of the given CpxRelTRS could be proven to be BOUNDS(INF, INF). The TRS R consists of the following rules: incr(nil) -> nil incr(cons(X, L)) -> cons(s(X), n__incr(activate(L))) adx(nil) -> nil adx(cons(X, L)) -> incr(cons(X, n__adx(activate(L)))) nats -> adx(zeros) popout

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

job log

popout

actions

all output return to Derivational Complexity: TRS