details

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

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	1.5364151001 seconds
cpu usage	3.141974038
max memory	2.05406208E8

stage attributes

key	value
output-size	2250
starexec-result	WORST_CASE(NON_POLY, ?)

output

/export/starexec/sandbox2/solver/bin/starexec_run_complexity /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- WORST_CASE(NON_POLY, ?) proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(INF, INF). (0) CpxTRS (1) RelTrsToDecreasingLoopProblemProof [LOWER BOUND(ID), 0 ms] (2) TRS for Loop Detection (3) InfiniteLowerBoundProof [FINISHED, 0 ms] (4) BOUNDS(INF, INF) ---------------------------------------- (0) Obligation: The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(INF, INF). The TRS R consists of the following rules: from(X) -> cons(X, from(s(X))) head(cons(X, XS)) -> X 2nd(cons(X, XS)) -> head(XS) take(0, XS) -> nil take(s(N), cons(X, XS)) -> cons(X, take(N, XS)) sel(0, cons(X, XS)) -> X sel(s(N), cons(X, XS)) -> sel(N, XS) S is empty. Rewrite Strategy: FULL ---------------------------------------- (1) RelTrsToDecreasingLoopProblemProof (LOWER BOUND(ID)) Transformed a relative TRS into a decreasing-loop problem. ---------------------------------------- (2) Obligation: Analyzing the following TRS for decreasing loops: The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(INF, INF). The TRS R consists of the following rules: from(X) -> cons(X, from(s(X))) head(cons(X, XS)) -> X 2nd(cons(X, XS)) -> head(XS) take(0, XS) -> nil take(s(N), cons(X, XS)) -> cons(X, take(N, XS)) sel(0, cons(X, XS)) -> X sel(s(N), cons(X, XS)) -> sel(N, XS) S is empty. Rewrite Strategy: FULL ---------------------------------------- (3) InfiniteLowerBoundProof (FINISHED) The following loop proves infinite runtime complexity: The rewrite sequence from(X) ->^+ cons(X, from(s(X))) gives rise to a decreasing loop by considering the right hand sides subterm at position [1]. The pumping substitution is [ ]. The result substitution is [X / s(X)]. ---------------------------------------- (4) BOUNDS(INF, INF) popout

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

job log

popout

actions

all output return to Runti Compl Full Rewri 10127