details

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

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	291.551304102 seconds
cpu usage	1111.40300702
max memory	1.5187300352E10

stage attributes

key	value
output-size	8869
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 (innermost) 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 (innermost) of the given CpxTRS could be proven to be BOUNDS(n^1, INF). The TRS R consists of the following rules: a__natsFrom(N) -> cons(mark(N), natsFrom(s(N))) a__fst(pair(XS, YS)) -> mark(XS) a__snd(pair(XS, YS)) -> mark(YS) a__splitAt(0, XS) -> pair(nil, mark(XS)) a__splitAt(s(N), cons(X, XS)) -> a__u(a__splitAt(mark(N), mark(XS)), N, X, XS) a__u(pair(YS, ZS), N, X, XS) -> pair(cons(mark(X), YS), mark(ZS)) a__head(cons(N, XS)) -> mark(N) a__tail(cons(N, XS)) -> mark(XS) a__sel(N, XS) -> a__head(a__afterNth(mark(N), mark(XS))) a__take(N, XS) -> a__fst(a__splitAt(mark(N), mark(XS))) a__afterNth(N, XS) -> a__snd(a__splitAt(mark(N), mark(XS))) mark(natsFrom(X)) -> a__natsFrom(mark(X)) mark(fst(X)) -> a__fst(mark(X)) mark(snd(X)) -> a__snd(mark(X)) mark(splitAt(X1, X2)) -> a__splitAt(mark(X1), mark(X2)) mark(u(X1, X2, X3, X4)) -> a__u(mark(X1), X2, X3, X4) mark(head(X)) -> a__head(mark(X)) mark(tail(X)) -> a__tail(mark(X)) mark(sel(X1, X2)) -> a__sel(mark(X1), mark(X2)) mark(afterNth(X1, X2)) -> a__afterNth(mark(X1), mark(X2)) mark(take(X1, X2)) -> a__take(mark(X1), mark(X2)) mark(cons(X1, X2)) -> cons(mark(X1), X2) mark(s(X)) -> s(mark(X)) mark(pair(X1, X2)) -> pair(mark(X1), mark(X2)) mark(0) -> 0 mark(nil) -> nil a__natsFrom(X) -> natsFrom(X) a__fst(X) -> fst(X) a__snd(X) -> snd(X) a__splitAt(X1, X2) -> splitAt(X1, X2) a__u(X1, X2, X3, X4) -> u(X1, X2, X3, X4) a__head(X) -> head(X) a__tail(X) -> tail(X) a__sel(X1, X2) -> sel(X1, X2) a__afterNth(X1, X2) -> afterNth(X1, X2) a__take(X1, X2) -> take(X1, X2) 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(n^1, INF). The TRS R consists of the following rules: a__natsFrom(N) -> cons(mark(N), natsFrom(s(N))) a__fst(pair(XS, YS)) -> mark(XS) a__snd(pair(XS, YS)) -> mark(YS) a__splitAt(0, XS) -> pair(nil, mark(XS)) a__splitAt(s(N), cons(X, XS)) -> a__u(a__splitAt(mark(N), mark(XS)), N, X, XS) a__u(pair(YS, ZS), N, X, XS) -> pair(cons(mark(X), YS), mark(ZS)) a__head(cons(N, XS)) -> mark(N) a__tail(cons(N, XS)) -> mark(XS) a__sel(N, XS) -> a__head(a__afterNth(mark(N), mark(XS))) a__take(N, XS) -> a__fst(a__splitAt(mark(N), mark(XS))) a__afterNth(N, XS) -> a__snd(a__splitAt(mark(N), mark(XS))) mark(natsFrom(X)) -> a__natsFrom(mark(X)) mark(fst(X)) -> a__fst(mark(X)) popout

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

job log

popout

actions

all output return to Runti Compl Inner Rewri 22807