details

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

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	2.47699594498 seconds
cpu usage	3.258972573
max memory	2.10481152E8

stage attributes

key	value
output-size	2015
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 (innermost) 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 (innermost) of the given CpxTRS could be proven to be BOUNDS(INF, INF). The TRS R consists of the following rules: letexp(x, y) -> letexp(Cons(Cons(Nil, Nil), x), y) goal(x, y) -> letexp(x, y) S is empty. Rewrite Strategy: INNERMOST ---------------------------------------- (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 (innermost) of the given CpxTRS could be proven to be BOUNDS(INF, INF). The TRS R consists of the following rules: letexp(x, y) -> letexp(Cons(Cons(Nil, Nil), x), y) goal(x, y) -> letexp(x, y) S is empty. Rewrite Strategy: INNERMOST ---------------------------------------- (3) InfiniteLowerBoundProof (FINISHED) The following loop proves infinite runtime complexity: The rewrite sequence letexp(x, y) ->^+ letexp(Cons(Cons(Nil, Nil), x), y) gives rise to a decreasing loop by considering the right hand sides subterm at position []. The pumping substitution is [ ]. The result substitution is [x / Cons(Cons(Nil, Nil), 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 Inner Rewri 22807