details

property	value
status	complete
benchmark	Ex1_Luc04b_FR.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	Transformed_CSR_04

run statistics

property	value
solver	AProVE
configuration	rcdcRelativeAlsoLower
runtime (wallclock)	2.22898 seconds
cpu usage	5.7205
user time	5.47568
system time	0.244819
max virtual memory	1.8477524E7
max residence set size	478508.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), 301 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, 143 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: nats -> cons(0, n__incr(n__nats)) pairs -> cons(0, n__incr(n__odds)) odds -> incr(pairs) incr(cons(X, XS)) -> cons(s(X), n__incr(activate(XS))) head(cons(X, XS)) -> X tail(cons(X, XS)) -> activate(XS) incr(X) -> n__incr(X) nats -> n__nats odds -> n__odds activate(n__incr(X)) -> incr(activate(X)) activate(n__nats) -> nats activate(n__odds) -> odds 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(cons(x_1, x_2)) -> cons(encArg(x_1), encArg(x_2)) encArg(0) -> 0 encArg(n__incr(x_1)) -> n__incr(encArg(x_1)) encArg(n__nats) -> n__nats encArg(n__odds) -> n__odds encArg(s(x_1)) -> s(encArg(x_1)) encArg(cons_nats) -> nats encArg(cons_pairs) -> pairs encArg(cons_odds) -> odds encArg(cons_incr(x_1)) -> incr(encArg(x_1)) 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_nats -> nats encode_cons(x_1, x_2) -> cons(encArg(x_1), encArg(x_2)) encode_0 -> 0 encode_n__incr(x_1) -> n__incr(encArg(x_1)) encode_n__nats -> n__nats encode_pairs -> pairs encode_n__odds -> n__odds encode_odds -> odds encode_incr(x_1) -> incr(encArg(x_1)) encode_s(x_1) -> s(encArg(x_1)) encode_activate(x_1) -> activate(encArg(x_1)) 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: nats -> cons(0, n__incr(n__nats)) pairs -> cons(0, n__incr(n__odds)) odds -> incr(pairs) incr(cons(X, XS)) -> cons(s(X), n__incr(activate(XS))) head(cons(X, XS)) -> X tail(cons(X, XS)) -> activate(XS) incr(X) -> n__incr(X) nats -> n__nats odds -> n__odds popout

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

job log

popout

actions

all output return to Derivational Complexity: TRS