details

property	value
status	complete
benchmark	jones1.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	Mixed_TRS

run statistics

property	value
solver	AProVE
configuration	rcdcRelativeAlsoLower
runtime (wallclock)	291.648 seconds
cpu usage	309.991
user time	307.565
system time	2.42683
max virtual memory	1.9208828E7
max residence set size	5151940.0

stage attributes

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

output

WORST_CASE(Omega(n^1), O(n^2)) 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, n^2). (0) DCpxTrs (1) DerivationalComplexityToRuntimeComplexityProof [BOTH BOUNDS(ID, ID), 0 ms] (2) CpxRelTRS (3) SInnermostTerminationProof [BOTH CONCRETE BOUNDS(ID, ID), 228 ms] (4) CpxRelTRS (5) RcToIrcProof [BOTH BOUNDS(ID, ID), 0 ms] (6) CpxRelTRS (7) RelTrsToWeightedTrsProof [BOTH BOUNDS(ID, ID), 0 ms] (8) CpxWeightedTrs (9) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms] (10) CpxTypedWeightedTrs (11) CompletionProof [UPPER BOUND(ID), 0 ms] (12) CpxTypedWeightedCompleteTrs (13) NarrowingProof [BOTH BOUNDS(ID, ID), 0 ms] (14) CpxTypedWeightedCompleteTrs (15) CpxTypedWeightedTrsToRntsProof [UPPER BOUND(ID), 0 ms] (16) CpxRNTS (17) SimplificationProof [BOTH BOUNDS(ID, ID), 0 ms] (18) CpxRNTS (19) CpxRntsAnalysisOrderProof [BOTH BOUNDS(ID, ID), 0 ms] (20) CpxRNTS (21) ResultPropagationProof [UPPER BOUND(ID), 0 ms] (22) CpxRNTS (23) IntTrsBoundProof [UPPER BOUND(ID), 321 ms] (24) CpxRNTS (25) IntTrsBoundProof [UPPER BOUND(ID), 108 ms] (26) CpxRNTS (27) ResultPropagationProof [UPPER BOUND(ID), 0 ms] (28) CpxRNTS (29) IntTrsBoundProof [UPPER BOUND(ID), 37 ms] (30) CpxRNTS (31) IntTrsBoundProof [UPPER BOUND(ID), 0 ms] (32) CpxRNTS (33) ResultPropagationProof [UPPER BOUND(ID), 0 ms] (34) CpxRNTS (35) IntTrsBoundProof [UPPER BOUND(ID), 89 ms] (36) CpxRNTS (37) IntTrsBoundProof [UPPER BOUND(ID), 54 ms] (38) CpxRNTS (39) ResultPropagationProof [UPPER BOUND(ID), 0 ms] (40) CpxRNTS (41) IntTrsBoundProof [UPPER BOUND(ID), 829 ms] (42) CpxRNTS (43) IntTrsBoundProof [UPPER BOUND(ID), 471 ms] (44) CpxRNTS (45) ResultPropagationProof [UPPER BOUND(ID), 0 ms] (46) CpxRNTS (47) IntTrsBoundProof [UPPER BOUND(ID), 158 ms] (48) CpxRNTS (49) IntTrsBoundProof [UPPER BOUND(ID), 3 ms] (50) CpxRNTS (51) ResultPropagationProof [UPPER BOUND(ID), 0 ms] (52) CpxRNTS (53) IntTrsBoundProof [UPPER BOUND(ID), 266 ms] (54) CpxRNTS (55) IntTrsBoundProof [UPPER BOUND(ID), 27 ms] (56) CpxRNTS (57) ResultPropagationProof [UPPER BOUND(ID), 0 ms] (58) CpxRNTS (59) IntTrsBoundProof [UPPER BOUND(ID), 147 ms] (60) CpxRNTS (61) IntTrsBoundProof [UPPER BOUND(ID), 1 ms] (62) CpxRNTS (63) FinalProof [FINISHED, 0 ms] (64) BOUNDS(1, n^2) (65) RenamingProof [BOTH BOUNDS(ID, ID), 0 ms] (66) CpxRelTRS (67) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms] (68) typed CpxTrs (69) OrderProof [LOWER BOUND(ID), 0 ms] (70) typed CpxTrs (71) RewriteLemmaProof [LOWER BOUND(ID), 295 ms] (72) BEST (73) proven lower bound (74) LowerBoundPropagationProof [FINISHED, 0 ms] (75) BOUNDS(n^1, INF) (76) typed CpxTrs (77) RewriteLemmaProof [LOWER BOUND(ID), 22 ms] (78) BOUNDS(1, INF) ---------------------------------------- (0) Obligation: The Derivational Complexity (full) of the given DCpxTrs could be proven to be BOUNDS(n^1, n^2). The TRS R consists of the following rules: rev(ls) -> r1(ls, empty) r1(empty, a) -> a r1(cons(x, k), a) -> r1(k, cons(x, a)) popout

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

job log

popout

actions

all output return to Derivational Complexity: TRS