details

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

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	1.50659 seconds
cpu usage	3.13591
user time	2.99743
system time	0.138478
max virtual memory	1.8275312E7
max residence set size	212064.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: 2nd(cons(X)) -> head(XS) sel(s(N), cons(X)) -> sel(N, XS) from(X) -> cons(X) head(cons(X)) -> X take(0, XS) -> nil take(s(N), cons(X)) -> cons(X) sel(0, cons(X)) -> 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