details

property	value
status	complete
benchmark	Ex5_DLMMU04_L.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	Transformed_CSR_04

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	1.51415 seconds
cpu usage	3.24669
user time	3.09168
system time	0.155004
max virtual memory	1.8275312E7
max residence set size	212648.0

stage attributes

key	value
starexec-result	WORST_CASE(NON_POLY, ?)

output

WORST_CASE(NON_POLY, ?) proof of /export/starexec/sandbox/benchmark/theBenchmark.xml # AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty The Runtime Complexity of the given Name of obligation not specified could be proven to be BOUNDS(INF, INF). (0) Name of obligation not specified (1) ExtraVarProof [FINISHED, 0 ms] (2) BOUNDS(INF, INF) ---------------------------------------- (0) Obligation: The Runtime Complexity of the given Name of obligation not specified could be proven to be BOUNDS(INF, INF). The TRS R consists of the following rules: tail(cons(X)) -> XS pairNs -> cons(0) oddNs -> incr(pairNs) incr(cons(X)) -> cons(s(X)) take(0, XS) -> nil take(s(N), cons(X)) -> cons(X) zip(nil, XS) -> nil zip(X, nil) -> nil zip(cons(X), cons(Y)) -> cons(pair(X, Y)) repItems(nil) -> nil repItems(cons(X)) -> cons(X) ---------------------------------------- (1) ExtraVarProof (FINISHED) unbounded runtime complexity due to extra variable on rhs ---------------------------------------- (2) BOUNDS(INF, INF) popout

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

job log

popout

actions

all output return to Runtime Complexity: TRS