details

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

run statistics

property	value
solver	AProVE
configuration	rcdcRelativeAlsoLower
runtime (wallclock)	297.379 seconds
cpu usage	1059.74
user time	1049.92
system time	9.81659
max virtual memory	1.9195652E7
max residence set size	1.5337916E7

stage attributes

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

output

WORST_CASE(Omega(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(n^1, INF). (0) DCpxTrs (1) DerivationalComplexityToRuntimeComplexityProof [BOTH BOUNDS(ID, ID), 0 ms] (2) CpxRelTRS (3) SInnermostTerminationProof [BOTH CONCRETE BOUNDS(ID, ID), 1321 ms] (4) CpxRelTRS (5) RelTrsToDecreasingLoopProblemProof [LOWER BOUND(ID), 0 ms] (6) TRS for Loop Detection (7) DecreasingLoopProof [LOWER BOUND(ID), 950 ms] (8) BEST (9) proven lower bound (10) LowerBoundPropagationProof [FINISHED, 0 ms] (11) BOUNDS(n^1, INF) (12) TRS for Loop Detection ---------------------------------------- (0) Obligation: The Derivational Complexity (full) of the given DCpxTrs could be proven to be BOUNDS(n^1, INF). The TRS R consists of the following rules: start(i) -> busy(F, closed, stop, false, false, false, i) busy(BF, d, stop, b1, b2, b3, i) -> incorrect busy(FS, d, stop, b1, b2, b3, i) -> incorrect busy(fl, open, up, b1, b2, b3, i) -> incorrect busy(fl, open, down, b1, b2, b3, i) -> incorrect busy(B, closed, stop, false, false, false, empty) -> correct busy(F, closed, stop, false, false, false, empty) -> correct busy(S, closed, stop, false, false, false, empty) -> correct busy(B, closed, stop, false, false, false, newbuttons(i1, i2, i3, i)) -> idle(B, closed, stop, false, false, false, newbuttons(i1, i2, i3, i)) busy(F, closed, stop, false, false, false, newbuttons(i1, i2, i3, i)) -> idle(F, closed, stop, false, false, false, newbuttons(i1, i2, i3, i)) busy(S, closed, stop, false, false, false, newbuttons(i1, i2, i3, i)) -> idle(S, closed, stop, false, false, false, newbuttons(i1, i2, i3, i)) busy(B, open, stop, false, b2, b3, i) -> idle(B, closed, stop, false, b2, b3, i) busy(F, open, stop, b1, false, b3, i) -> idle(F, closed, stop, b1, false, b3, i) busy(S, open, stop, b1, b2, false, i) -> idle(S, closed, stop, b1, b2, false, i) busy(B, d, stop, true, b2, b3, i) -> idle(B, open, stop, false, b2, b3, i) busy(F, d, stop, b1, true, b3, i) -> idle(F, open, stop, b1, false, b3, i) busy(S, d, stop, b1, b2, true, i) -> idle(S, open, stop, b1, b2, false, i) busy(B, closed, down, b1, b2, b3, i) -> idle(B, closed, stop, b1, b2, b3, i) busy(S, closed, up, b1, b2, b3, i) -> idle(S, closed, stop, b1, b2, b3, i) busy(B, closed, up, true, b2, b3, i) -> idle(B, closed, stop, true, b2, b3, i) busy(F, closed, up, b1, true, b3, i) -> idle(F, closed, stop, b1, true, b3, i) busy(F, closed, down, b1, true, b3, i) -> idle(F, closed, stop, b1, true, b3, i) busy(S, closed, down, b1, b2, true, i) -> idle(S, closed, stop, b1, b2, true, i) busy(B, closed, up, false, b2, b3, i) -> idle(BF, closed, up, false, b2, b3, i) busy(F, closed, up, b1, false, b3, i) -> idle(FS, closed, up, b1, false, b3, i) busy(F, closed, down, b1, false, b3, i) -> idle(BF, closed, down, b1, false, b3, i) busy(S, closed, down, b1, b2, false, i) -> idle(FS, closed, down, b1, b2, false, i) busy(BF, closed, up, b1, b2, b3, i) -> idle(F, closed, up, b1, b2, b3, i) busy(BF, closed, down, b1, b2, b3, i) -> idle(B, closed, down, b1, b2, b3, i) busy(FS, closed, up, b1, b2, b3, i) -> idle(S, closed, up, b1, b2, b3, i) busy(FS, closed, down, b1, b2, b3, i) -> idle(F, closed, down, b1, b2, b3, i) busy(B, closed, stop, false, true, b3, i) -> idle(B, closed, up, false, true, b3, i) busy(B, closed, stop, false, false, true, i) -> idle(B, closed, up, false, false, true, i) busy(F, closed, stop, true, false, b3, i) -> idle(F, closed, down, true, false, b3, i) busy(F, closed, stop, false, false, true, i) -> idle(F, closed, up, false, false, true, i) busy(S, closed, stop, b1, true, false, i) -> idle(S, closed, down, b1, true, false, i) busy(S, closed, stop, true, false, false, i) -> idle(S, closed, down, true, false, false, i) idle(fl, d, m, b1, b2, b3, empty) -> busy(fl, d, m, b1, b2, b3, empty) idle(fl, d, m, b1, b2, b3, newbuttons(i1, i2, i3, i)) -> busy(fl, d, m, or(b1, i1), or(b2, i2), or(b3, i3), i) or(true, b) -> true or(false, b) -> b 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(F) -> F encArg(closed) -> closed encArg(stop) -> stop encArg(false) -> false encArg(BF) -> BF encArg(incorrect) -> incorrect encArg(FS) -> FS encArg(open) -> open encArg(up) -> up encArg(down) -> down encArg(B) -> B encArg(empty) -> empty encArg(correct) -> correct encArg(S) -> S encArg(newbuttons(x_1, x_2, x_3, x_4)) -> newbuttons(encArg(x_1), encArg(x_2), encArg(x_3), encArg(x_4)) encArg(true) -> true encArg(cons_start(x_1)) -> start(encArg(x_1)) encArg(cons_busy(x_1, x_2, x_3, x_4, x_5, x_6, x_7)) -> busy(encArg(x_1), encArg(x_2), encArg(x_3), encArg(x_4), encArg(x_5), encArg(x_6), encArg(x_7)) encArg(cons_idle(x_1, x_2, x_3, x_4, x_5, x_6, x_7)) -> idle(encArg(x_1), encArg(x_2), encArg(x_3), encArg(x_4), encArg(x_5), encArg(x_6), encArg(x_7)) encArg(cons_or(x_1, x_2)) -> or(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