details

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

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	297.903774977 seconds
cpu usage	1129.72926107
max memory	1.5200755712E10

stage attributes

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

output

/export/starexec/sandbox/solver/bin/starexec_run_complexity /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- WORST_CASE(Omega(n^1), ?) proof of /export/starexec/sandbox/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__U101(tt, V1, V2) -> a__U102(a__isNatural(V1), V2) a__U102(tt, V2) -> a__U103(a__isLNat(V2)) a__U103(tt) -> tt a__U11(tt, N, XS) -> a__snd(a__splitAt(mark(N), mark(XS))) a__U111(tt, V1) -> a__U112(a__isLNat(V1)) a__U112(tt) -> tt a__U121(tt, V1) -> a__U122(a__isNatural(V1)) a__U122(tt) -> tt a__U131(tt, V1, V2) -> a__U132(a__isNatural(V1), V2) a__U132(tt, V2) -> a__U133(a__isLNat(V2)) a__U133(tt) -> tt a__U141(tt, V1, V2) -> a__U142(a__isLNat(V1), V2) a__U142(tt, V2) -> a__U143(a__isLNat(V2)) a__U143(tt) -> tt a__U151(tt, V1, V2) -> a__U152(a__isNatural(V1), V2) a__U152(tt, V2) -> a__U153(a__isLNat(V2)) a__U153(tt) -> tt a__U161(tt, N) -> cons(mark(N), natsFrom(s(N))) a__U171(tt, N, XS) -> a__head(a__afterNth(mark(N), mark(XS))) a__U181(tt, Y) -> mark(Y) a__U191(tt, XS) -> pair(nil, mark(XS)) a__U201(tt, N, X, XS) -> a__U202(a__splitAt(mark(N), mark(XS)), X) a__U202(pair(YS, ZS), X) -> pair(cons(mark(X), YS), mark(ZS)) a__U21(tt, X) -> mark(X) a__U211(tt, XS) -> mark(XS) a__U221(tt, N, XS) -> a__fst(a__splitAt(mark(N), mark(XS))) a__U31(tt, N) -> mark(N) a__U41(tt, V1, V2) -> a__U42(a__isNatural(V1), V2) a__U42(tt, V2) -> a__U43(a__isLNat(V2)) a__U43(tt) -> tt a__U51(tt, V1, V2) -> a__U52(a__isNatural(V1), V2) a__U52(tt, V2) -> a__U53(a__isLNat(V2)) a__U53(tt) -> tt a__U61(tt, V1) -> a__U62(a__isPLNat(V1)) a__U62(tt) -> tt a__U71(tt, V1) -> a__U72(a__isNatural(V1)) a__U72(tt) -> tt a__U81(tt, V1) -> a__U82(a__isPLNat(V1)) a__U82(tt) -> tt a__U91(tt, V1) -> a__U92(a__isLNat(V1)) a__U92(tt) -> tt a__afterNth(N, XS) -> a__U11(a__and(a__and(a__isNatural(N), isNaturalKind(N)), and(isLNat(XS), isLNatKind(XS))), N, XS) a__and(tt, X) -> mark(X) a__fst(pair(X, Y)) -> a__U21(a__and(a__and(a__isLNat(X), isLNatKind(X)), and(isLNat(Y), isLNatKind(Y))), X) a__head(cons(N, XS)) -> a__U31(a__and(a__and(a__isNatural(N), isNaturalKind(N)), and(isLNat(XS), isLNatKind(XS))), N) a__isLNat(nil) -> tt a__isLNat(afterNth(V1, V2)) -> a__U41(a__and(a__isNaturalKind(V1), isLNatKind(V2)), V1, V2) a__isLNat(cons(V1, V2)) -> a__U51(a__and(a__isNaturalKind(V1), isLNatKind(V2)), V1, V2) a__isLNat(fst(V1)) -> a__U61(a__isPLNatKind(V1), V1) a__isLNat(natsFrom(V1)) -> a__U71(a__isNaturalKind(V1), V1) a__isLNat(snd(V1)) -> a__U81(a__isPLNatKind(V1), V1) a__isLNat(tail(V1)) -> a__U91(a__isLNatKind(V1), V1) a__isLNat(take(V1, V2)) -> a__U101(a__and(a__isNaturalKind(V1), isLNatKind(V2)), V1, V2) a__isLNatKind(nil) -> tt a__isLNatKind(afterNth(V1, V2)) -> a__and(a__isNaturalKind(V1), isLNatKind(V2)) a__isLNatKind(cons(V1, V2)) -> a__and(a__isNaturalKind(V1), isLNatKind(V2)) a__isLNatKind(fst(V1)) -> a__isPLNatKind(V1) a__isLNatKind(natsFrom(V1)) -> a__isNaturalKind(V1) a__isLNatKind(snd(V1)) -> a__isPLNatKind(V1) a__isLNatKind(tail(V1)) -> a__isLNatKind(V1) a__isLNatKind(take(V1, V2)) -> a__and(a__isNaturalKind(V1), isLNatKind(V2)) a__isNatural(0) -> tt a__isNatural(head(V1)) -> a__U111(a__isLNatKind(V1), V1) a__isNatural(s(V1)) -> a__U121(a__isNaturalKind(V1), V1) a__isNatural(sel(V1, V2)) -> a__U131(a__and(a__isNaturalKind(V1), isLNatKind(V2)), V1, V2) a__isNaturalKind(0) -> tt a__isNaturalKind(head(V1)) -> a__isLNatKind(V1) popout

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

job log

popout

actions

all output return to Runti Compl Inner Rewri 22807