details

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

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	291.468455076 seconds
cpu usage	485.115932745
max memory	9.452187648E9

stage attributes

key	value
output-size	8110
starexec-result	WORST_CASE(Omega(n^1), ?)

output

/export/starexec/sandbox2/solver/bin/starexec_run_complexity /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- WORST_CASE(Omega(n^1), ?) 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(n^1, INF). (0) CpxTRS (1) RelTrsToDecreasingLoopProblemProof [LOWER BOUND(ID), 0 ms] (2) TRS for Loop Detection (3) DecreasingLoopProof [LOWER BOUND(ID), 0 ms] (4) BEST (5) proven lower bound (6) LowerBoundPropagationProof [FINISHED, 0 ms] (7) BOUNDS(n^1, INF) (8) TRS for Loop Detection ---------------------------------------- (0) Obligation: The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, INF). The TRS R consists of the following rules: a__dbl(0) -> 0 a__dbl(s(X)) -> s(s(dbl(X))) a__dbls(nil) -> nil a__dbls(cons(X, Y)) -> cons(dbl(X), dbls(Y)) a__sel(0, cons(X, Y)) -> mark(X) a__sel(s(X), cons(Y, Z)) -> a__sel(mark(X), mark(Z)) a__indx(nil, X) -> nil a__indx(cons(X, Y), Z) -> cons(sel(X, Z), indx(Y, Z)) a__from(X) -> cons(X, from(s(X))) a__dbl1(0) -> 01 a__dbl1(s(X)) -> s1(s1(a__dbl1(mark(X)))) a__sel1(0, cons(X, Y)) -> mark(X) a__sel1(s(X), cons(Y, Z)) -> a__sel1(mark(X), mark(Z)) a__quote(0) -> 01 a__quote(s(X)) -> s1(a__quote(mark(X))) a__quote(dbl(X)) -> a__dbl1(mark(X)) a__quote(sel(X, Y)) -> a__sel1(mark(X), mark(Y)) mark(dbl(X)) -> a__dbl(mark(X)) mark(dbls(X)) -> a__dbls(mark(X)) mark(sel(X1, X2)) -> a__sel(mark(X1), mark(X2)) mark(indx(X1, X2)) -> a__indx(mark(X1), X2) mark(from(X)) -> a__from(X) mark(dbl1(X)) -> a__dbl1(mark(X)) mark(sel1(X1, X2)) -> a__sel1(mark(X1), mark(X2)) mark(quote(X)) -> a__quote(mark(X)) mark(0) -> 0 mark(s(X)) -> s(X) mark(nil) -> nil mark(cons(X1, X2)) -> cons(X1, X2) mark(01) -> 01 mark(s1(X)) -> s1(mark(X)) a__dbl(X) -> dbl(X) a__dbls(X) -> dbls(X) a__sel(X1, X2) -> sel(X1, X2) a__indx(X1, X2) -> indx(X1, X2) a__from(X) -> from(X) a__dbl1(X) -> dbl1(X) a__sel1(X1, X2) -> sel1(X1, X2) a__quote(X) -> quote(X) 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(n^1, INF). The TRS R consists of the following rules: a__dbl(0) -> 0 a__dbl(s(X)) -> s(s(dbl(X))) a__dbls(nil) -> nil a__dbls(cons(X, Y)) -> cons(dbl(X), dbls(Y)) a__sel(0, cons(X, Y)) -> mark(X) a__sel(s(X), cons(Y, Z)) -> a__sel(mark(X), mark(Z)) a__indx(nil, X) -> nil a__indx(cons(X, Y), Z) -> cons(sel(X, Z), indx(Y, Z)) a__from(X) -> cons(X, from(s(X))) a__dbl1(0) -> 01 popout

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

job log

popout

actions

all output return to Runti Compl Full Rewri 10127