details

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

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	8.77626 seconds
cpu usage	30.8007
user time	29.255
system time	1.54572
max virtual memory	3.7715988E7
max residence set size	3697712.0

stage attributes

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

output

WORST_CASE(Omega(n^1), O(n^1)) proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml # AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, n^1). (0) CpxTRS (1) NestedDefinedSymbolProof [UPPER BOUND(ID), 0 ms] (2) CpxTRS (3) RcToIrcProof [BOTH BOUNDS(ID, ID), 47 ms] (4) CpxTRS (5) CpxTrsToCdtProof [UPPER BOUND(ID), 0 ms] (6) CdtProblem (7) CdtLeafRemovalProof [BOTH BOUNDS(ID, ID), 0 ms] (8) CdtProblem (9) CdtRhsSimplificationProcessorProof [BOTH BOUNDS(ID, ID), 0 ms] (10) CdtProblem (11) CdtUsableRulesProof [BOTH BOUNDS(ID, ID), 0 ms] (12) CdtProblem (13) CdtRuleRemovalProof [UPPER BOUND(ADD(n^1)), 199 ms] (14) CdtProblem (15) CdtRuleRemovalProof [UPPER BOUND(ADD(n^1)), 0 ms] (16) CdtProblem (17) SIsEmptyProof [BOTH BOUNDS(ID, ID), 0 ms] (18) BOUNDS(1, 1) (19) RenamingProof [BOTH BOUNDS(ID, ID), 0 ms] (20) CpxTRS (21) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms] (22) typed CpxTrs (23) OrderProof [LOWER BOUND(ID), 9 ms] (24) typed CpxTrs (25) RewriteLemmaProof [LOWER BOUND(ID), 448 ms] (26) BEST (27) proven lower bound (28) LowerBoundPropagationProof [FINISHED, 0 ms] (29) BOUNDS(n^1, INF) (30) typed CpxTrs (31) RewriteLemmaProof [LOWER BOUND(ID), 140 ms] (32) typed CpxTrs (33) RewriteLemmaProof [LOWER BOUND(ID), 102 ms] (34) typed CpxTrs (35) RewriteLemmaProof [LOWER BOUND(ID), 125 ms] (36) typed CpxTrs (37) RewriteLemmaProof [LOWER BOUND(ID), 111 ms] (38) typed CpxTrs (39) RewriteLemmaProof [LOWER BOUND(ID), 104 ms] (40) typed CpxTrs (41) RewriteLemmaProof [LOWER BOUND(ID), 90 ms] (42) typed CpxTrs (43) RewriteLemmaProof [LOWER BOUND(ID), 159 ms] (44) typed CpxTrs (45) RewriteLemmaProof [LOWER BOUND(ID), 121 ms] (46) typed CpxTrs (47) RewriteLemmaProof [LOWER BOUND(ID), 167 ms] (48) typed CpxTrs (49) RewriteLemmaProof [LOWER BOUND(ID), 208 ms] (50) typed CpxTrs (51) RewriteLemmaProof [LOWER BOUND(ID), 155 ms] (52) typed CpxTrs (53) RewriteLemmaProof [LOWER BOUND(ID), 131 ms] (54) typed CpxTrs (55) RewriteLemmaProof [LOWER BOUND(ID), 109 ms] (56) typed CpxTrs (57) RewriteLemmaProof [LOWER BOUND(ID), 137 ms] (58) typed CpxTrs (59) RewriteLemmaProof [LOWER BOUND(ID), 136 ms] (60) typed CpxTrs (61) RewriteLemmaProof [LOWER BOUND(ID), 112 ms] (62) typed CpxTrs (63) RewriteLemmaProof [LOWER BOUND(ID), 172 ms] (64) typed CpxTrs ---------------------------------------- (0) Obligation: The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, n^1). The TRS R consists of the following rules: active(U101(tt, N, XS)) -> mark(fst(splitAt(N, XS))) active(U11(tt, N, XS)) -> mark(snd(splitAt(N, XS))) active(U21(tt, X)) -> mark(X) active(U31(tt, N)) -> mark(N) active(U41(tt, N)) -> mark(cons(N, natsFrom(s(N)))) active(U51(tt, N, XS)) -> mark(head(afterNth(N, XS))) active(U61(tt, Y)) -> mark(Y) active(U71(tt, XS)) -> mark(pair(nil, XS)) active(U81(tt, N, X, XS)) -> mark(U82(splitAt(N, XS), X)) active(U82(pair(YS, ZS), X)) -> mark(pair(cons(X, YS), ZS)) active(U91(tt, XS)) -> mark(XS) active(afterNth(N, XS)) -> mark(U11(and(isNatural(N), isLNat(XS)), N, XS)) active(and(tt, X)) -> mark(X) active(fst(pair(X, Y))) -> mark(U21(and(isLNat(X), isLNat(Y)), X)) active(head(cons(N, XS))) -> mark(U31(and(isNatural(N), isLNat(XS)), N)) active(isLNat(nil)) -> mark(tt) active(isLNat(afterNth(V1, V2))) -> mark(and(isNatural(V1), isLNat(V2))) popout

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

job log

popout

actions

all output return to Runtime Complexity: TRS