details

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

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	2.62321305275 seconds
cpu usage	7.613412536
max memory	1.15017728E9

stage attributes

key	value
output-size	31226
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(EXP, 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 (9) DecreasingLoopProof [FINISHED, 740 ms] (10) BOUNDS(EXP, INF) ---------------------------------------- (0) Obligation: The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(EXP, INF). The TRS R consists of the following rules: a__U101(tt, V2) -> a__U102(a__isLNat(V2)) a__U102(tt) -> tt a__U11(tt, N, XS) -> a__U12(a__isLNat(XS), N, XS) a__U111(tt) -> tt a__U12(tt, N, XS) -> a__snd(a__splitAt(mark(N), mark(XS))) a__U121(tt) -> tt a__U131(tt, V2) -> a__U132(a__isLNat(V2)) a__U132(tt) -> tt a__U141(tt, V2) -> a__U142(a__isLNat(V2)) a__U142(tt) -> tt a__U151(tt, V2) -> a__U152(a__isLNat(V2)) a__U152(tt) -> tt a__U161(tt, N) -> cons(mark(N), natsFrom(s(N))) a__U171(tt, N, XS) -> a__U172(a__isLNat(XS), N, XS) a__U172(tt, N, XS) -> a__head(a__afterNth(mark(N), mark(XS))) a__U181(tt, Y) -> a__U182(a__isLNat(Y), Y) a__U182(tt, Y) -> mark(Y) a__U191(tt, XS) -> pair(nil, mark(XS)) a__U201(tt, N, X, XS) -> a__U202(a__isNatural(X), N, X, XS) a__U202(tt, N, X, XS) -> a__U203(a__isLNat(XS), N, X, XS) a__U203(tt, N, X, XS) -> a__U204(a__splitAt(mark(N), mark(XS)), X) a__U204(pair(YS, ZS), X) -> pair(cons(mark(X), YS), mark(ZS)) a__U21(tt, X, Y) -> a__U22(a__isLNat(Y), X) a__U211(tt, XS) -> a__U212(a__isLNat(XS), XS) a__U212(tt, XS) -> mark(XS) a__U22(tt, X) -> mark(X) a__U221(tt, N, XS) -> a__U222(a__isLNat(XS), N, XS) a__U222(tt, N, XS) -> a__fst(a__splitAt(mark(N), mark(XS))) a__U31(tt, N, XS) -> a__U32(a__isLNat(XS), N) a__U32(tt, N) -> mark(N) a__U41(tt, V2) -> a__U42(a__isLNat(V2)) a__U42(tt) -> tt a__U51(tt, V2) -> a__U52(a__isLNat(V2)) a__U52(tt) -> tt a__U61(tt) -> tt a__U71(tt) -> tt a__U81(tt) -> tt a__U91(tt) -> tt a__afterNth(N, XS) -> a__U11(a__isNatural(N), N, XS) a__fst(pair(X, Y)) -> a__U21(a__isLNat(X), X, Y) a__head(cons(N, XS)) -> a__U31(a__isNatural(N), N, XS) a__isLNat(nil) -> tt a__isLNat(afterNth(V1, V2)) -> a__U41(a__isNatural(V1), V2) a__isLNat(cons(V1, V2)) -> a__U51(a__isNatural(V1), V2) a__isLNat(fst(V1)) -> a__U61(a__isPLNat(V1)) a__isLNat(natsFrom(V1)) -> a__U71(a__isNatural(V1)) a__isLNat(snd(V1)) -> a__U81(a__isPLNat(V1)) a__isLNat(tail(V1)) -> a__U91(a__isLNat(V1)) a__isLNat(take(V1, V2)) -> a__U101(a__isNatural(V1), V2) a__isNatural(0) -> tt a__isNatural(head(V1)) -> a__U111(a__isLNat(V1)) a__isNatural(s(V1)) -> a__U121(a__isNatural(V1)) a__isNatural(sel(V1, V2)) -> a__U131(a__isNatural(V1), V2) a__isPLNat(pair(V1, V2)) -> a__U141(a__isLNat(V1), V2) a__isPLNat(splitAt(V1, V2)) -> a__U151(a__isNatural(V1), V2) a__natsFrom(N) -> a__U161(a__isNatural(N), N) a__sel(N, XS) -> a__U171(a__isNatural(N), N, XS) a__snd(pair(X, Y)) -> a__U181(a__isLNat(X), Y) a__splitAt(0, XS) -> a__U191(a__isLNat(XS), XS) a__splitAt(s(N), cons(X, XS)) -> a__U201(a__isNatural(N), N, X, XS) a__tail(cons(N, XS)) -> a__U211(a__isNatural(N), XS) a__take(N, XS) -> a__U221(a__isNatural(N), N, XS) mark(U101(X1, X2)) -> a__U101(mark(X1), X2) mark(U102(X)) -> a__U102(mark(X)) mark(isLNat(X)) -> a__isLNat(X) popout

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

job log

popout

actions

all output return to Runti Compl Full Rewri 10127