details

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

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	5.20936 seconds
cpu usage	17.4168
user time	16.4044
system time	1.01239
max virtual memory	3.7838724E7
max residence set size	2335852.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/sandbox/benchmark/theBenchmark.xml # AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(n^1, n^1). (0) CpxTRS (1) RelTrsToWeightedTrsProof [BOTH BOUNDS(ID, ID), 0 ms] (2) CpxWeightedTrs (3) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms] (4) CpxTypedWeightedTrs (5) CompletionProof [UPPER BOUND(ID), 0 ms] (6) CpxTypedWeightedCompleteTrs (7) CpxTypedWeightedTrsToRntsProof [UPPER BOUND(ID), 0 ms] (8) CpxRNTS (9) CompleteCoflocoProof [FINISHED, 360 ms] (10) BOUNDS(1, n^1) (11) RenamingProof [BOTH BOUNDS(ID, ID), 0 ms] (12) CpxTRS (13) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms] (14) typed CpxTrs (15) OrderProof [LOWER BOUND(ID), 0 ms] (16) typed CpxTrs (17) RewriteLemmaProof [LOWER BOUND(ID), 208 ms] (18) BEST (19) proven lower bound (20) LowerBoundPropagationProof [FINISHED, 0 ms] (21) BOUNDS(n^1, INF) (22) typed CpxTrs (23) RewriteLemmaProof [LOWER BOUND(ID), 50 ms] (24) typed CpxTrs (25) RewriteLemmaProof [LOWER BOUND(ID), 29 ms] (26) typed CpxTrs (27) RewriteLemmaProof [LOWER BOUND(ID), 16 ms] (28) typed CpxTrs ---------------------------------------- (0) Obligation: The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(n^1, n^1). The TRS R consists of the following rules: append(@l1, @l2) -> append#1(@l1, @l2) append#1(::(@x, @xs), @l2) -> ::(@x, append(@xs, @l2)) append#1(nil, @l2) -> @l2 appendAll(@l) -> appendAll#1(@l) appendAll#1(::(@l1, @ls)) -> append(@l1, appendAll(@ls)) appendAll#1(nil) -> nil appendAll2(@l) -> appendAll2#1(@l) appendAll2#1(::(@l1, @ls)) -> append(appendAll(@l1), appendAll2(@ls)) appendAll2#1(nil) -> nil appendAll3(@l) -> appendAll3#1(@l) appendAll3#1(::(@l1, @ls)) -> append(appendAll2(@l1), appendAll3(@ls)) appendAll3#1(nil) -> nil S is empty. Rewrite Strategy: INNERMOST ---------------------------------------- (1) RelTrsToWeightedTrsProof (BOTH BOUNDS(ID, ID)) Transformed relative TRS to weighted TRS ---------------------------------------- (2) Obligation: The Runtime Complexity (innermost) of the given CpxWeightedTrs could be proven to be BOUNDS(1, n^1). The TRS R consists of the following rules: append(@l1, @l2) -> append#1(@l1, @l2) [1] append#1(::(@x, @xs), @l2) -> ::(@x, append(@xs, @l2)) [1] append#1(nil, @l2) -> @l2 [1] appendAll(@l) -> appendAll#1(@l) [1] appendAll#1(::(@l1, @ls)) -> append(@l1, appendAll(@ls)) [1] appendAll#1(nil) -> nil [1] appendAll2(@l) -> appendAll2#1(@l) [1] appendAll2#1(::(@l1, @ls)) -> append(appendAll(@l1), appendAll2(@ls)) [1] appendAll2#1(nil) -> nil [1] appendAll3(@l) -> appendAll3#1(@l) [1] appendAll3#1(::(@l1, @ls)) -> append(appendAll2(@l1), appendAll3(@ls)) [1] appendAll3#1(nil) -> nil [1] Rewrite Strategy: INNERMOST ---------------------------------------- (3) TypeInferenceProof (BOTH BOUNDS(ID, ID)) Infered types. ---------------------------------------- (4) Obligation: Runtime Complexity Weighted TRS with Types. The TRS R consists of the following rules: popout

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

job log

popout

actions

all output return to Runtime Complexity: TRS Innermost