details

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

run statistics

property	value
solver	AProVE
configuration	rcdcRelativeAlsoLower
runtime (wallclock)	296.797 seconds
cpu usage	1168.49
user time	1158.22
system time	10.2771
max virtual memory	1.9339536E7
max residence set size	1.3645556E7

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 (innermost) 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), 1200 ms] (4) CpxRelTRS (5) RenamingProof [BOTH BOUNDS(ID, ID), 0 ms] (6) CpxRelTRS (7) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms] (8) typed CpxTrs (9) OrderProof [LOWER BOUND(ID), 0 ms] (10) typed CpxTrs (11) RewriteLemmaProof [LOWER BOUND(ID), 533 ms] (12) BEST (13) proven lower bound (14) LowerBoundPropagationProof [FINISHED, 0 ms] (15) BOUNDS(n^1, INF) (16) typed CpxTrs (17) RewriteLemmaProof [LOWER BOUND(ID), 271 ms] (18) typed CpxTrs (19) RewriteLemmaProof [LOWER BOUND(ID), 186 ms] (20) typed CpxTrs (21) RewriteLemmaProof [LOWER BOUND(ID), 233 ms] (22) typed CpxTrs (23) RewriteLemmaProof [LOWER BOUND(ID), 136 ms] (24) typed CpxTrs (25) RewriteLemmaProof [LOWER BOUND(ID), 201 ms] (26) typed CpxTrs (27) RewriteLemmaProof [LOWER BOUND(ID), 60 ms] (28) typed CpxTrs (29) RewriteLemmaProof [LOWER BOUND(ID), 264 ms] (30) typed CpxTrs (31) RewriteLemmaProof [LOWER BOUND(ID), 239 ms] (32) typed CpxTrs (33) RewriteLemmaProof [LOWER BOUND(ID), 286 ms] (34) typed CpxTrs (35) RewriteLemmaProof [LOWER BOUND(ID), 198 ms] (36) typed CpxTrs (37) RewriteLemmaProof [LOWER BOUND(ID), 107 ms] (38) typed CpxTrs (39) RewriteLemmaProof [LOWER BOUND(ID), 117 ms] (40) typed CpxTrs (41) RewriteLemmaProof [LOWER BOUND(ID), 269 ms] (42) typed CpxTrs (43) RewriteLemmaProof [LOWER BOUND(ID), 258 ms] (44) typed CpxTrs (45) RewriteLemmaProof [LOWER BOUND(ID), 298 ms] (46) typed CpxTrs (47) RewriteLemmaProof [LOWER BOUND(ID), 241 ms] (48) typed CpxTrs (49) RewriteLemmaProof [LOWER BOUND(ID), 156 ms] (50) typed CpxTrs (51) RewriteLemmaProof [LOWER BOUND(ID), 317 ms] (52) typed CpxTrs (53) RewriteLemmaProof [LOWER BOUND(ID), 307 ms] (54) typed CpxTrs (55) RewriteLemmaProof [LOWER BOUND(ID), 214 ms] (56) typed CpxTrs (57) RewriteLemmaProof [LOWER BOUND(ID), 144 ms] (58) typed CpxTrs (59) RewriteLemmaProof [LOWER BOUND(ID), 119 ms] (60) typed CpxTrs (61) RewriteLemmaProof [LOWER BOUND(ID), 214 ms] (62) typed CpxTrs (63) RewriteLemmaProof [LOWER BOUND(ID), 210 ms] (64) typed CpxTrs (65) RewriteLemmaProof [LOWER BOUND(ID), 231 ms] (66) typed CpxTrs (67) RewriteLemmaProof [LOWER BOUND(ID), 327 ms] (68) typed CpxTrs (69) RewriteLemmaProof [LOWER BOUND(ID), 222 ms] (70) typed CpxTrs (71) RewriteLemmaProof [LOWER BOUND(ID), 126 ms] (72) typed CpxTrs (73) RewriteLemmaProof [LOWER BOUND(ID), 120 ms] (74) typed CpxTrs (75) RewriteLemmaProof [LOWER BOUND(ID), 321 ms] (76) typed CpxTrs (77) RewriteLemmaProof [LOWER BOUND(ID), 324 ms] (78) typed CpxTrs ---------------------------------------- (0) Obligation: The Derivational Complexity (innermost) of the given DCpxTrs could be proven to be BOUNDS(n^1, INF). The TRS R consists of the following rules: active(zeros) -> mark(cons(0, zeros)) active(U11(tt, V1)) -> mark(U12(isNatIListKind(V1), V1)) active(U12(tt, V1)) -> mark(U13(isNatList(V1))) popout

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

job log

popout

actions

all output return to Derivational Complexity: TRS Innermost