details

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

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	296.788446903 seconds
cpu usage	1179.38845365
max memory	1.5346987008E10

stage attributes

key	value
output-size	75108
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__isNaturalKind(V1), V1, V2) a__U102(tt, V1, V2) -> a__U103(a__isLNatKind(V2), V1, V2) a__U103(tt, V1, V2) -> a__U104(a__isLNatKind(V2), V1, V2) a__U104(tt, V1, V2) -> a__U105(a__isNatural(V1), V2) a__U105(tt, V2) -> a__U106(a__isLNat(V2)) a__U106(tt) -> tt a__U11(tt, N, XS) -> a__U12(a__isNaturalKind(N), N, XS) a__U111(tt, V2) -> a__U112(a__isLNatKind(V2)) a__U112(tt) -> tt a__U12(tt, N, XS) -> a__U13(a__isLNat(XS), N, XS) a__U121(tt, V2) -> a__U122(a__isLNatKind(V2)) a__U122(tt) -> tt a__U13(tt, N, XS) -> a__U14(a__isLNatKind(XS), N, XS) a__U131(tt) -> tt a__U14(tt, N, XS) -> a__snd(a__splitAt(mark(N), mark(XS))) a__U141(tt) -> tt a__U151(tt) -> tt a__U161(tt) -> tt a__U171(tt, V2) -> a__U172(a__isLNatKind(V2)) a__U172(tt) -> tt a__U181(tt, V1) -> a__U182(a__isLNatKind(V1), V1) a__U182(tt, V1) -> a__U183(a__isLNat(V1)) a__U183(tt) -> tt a__U191(tt, V1) -> a__U192(a__isNaturalKind(V1), V1) a__U192(tt, V1) -> a__U193(a__isNatural(V1)) a__U193(tt) -> tt a__U201(tt, V1, V2) -> a__U202(a__isNaturalKind(V1), V1, V2) a__U202(tt, V1, V2) -> a__U203(a__isLNatKind(V2), V1, V2) a__U203(tt, V1, V2) -> a__U204(a__isLNatKind(V2), V1, V2) a__U204(tt, V1, V2) -> a__U205(a__isNatural(V1), V2) a__U205(tt, V2) -> a__U206(a__isLNat(V2)) a__U206(tt) -> tt a__U21(tt, X, Y) -> a__U22(a__isLNatKind(X), X, Y) a__U211(tt) -> tt a__U22(tt, X, Y) -> a__U23(a__isLNat(Y), X, Y) a__U221(tt) -> tt a__U23(tt, X, Y) -> a__U24(a__isLNatKind(Y), X) a__U231(tt, V2) -> a__U232(a__isLNatKind(V2)) a__U232(tt) -> tt a__U24(tt, X) -> mark(X) a__U241(tt, V1, V2) -> a__U242(a__isLNatKind(V1), V1, V2) a__U242(tt, V1, V2) -> a__U243(a__isLNatKind(V2), V1, V2) a__U243(tt, V1, V2) -> a__U244(a__isLNatKind(V2), V1, V2) a__U244(tt, V1, V2) -> a__U245(a__isLNat(V1), V2) a__U245(tt, V2) -> a__U246(a__isLNat(V2)) a__U246(tt) -> tt a__U251(tt, V1, V2) -> a__U252(a__isNaturalKind(V1), V1, V2) a__U252(tt, V1, V2) -> a__U253(a__isLNatKind(V2), V1, V2) a__U253(tt, V1, V2) -> a__U254(a__isLNatKind(V2), V1, V2) a__U254(tt, V1, V2) -> a__U255(a__isNatural(V1), V2) a__U255(tt, V2) -> a__U256(a__isLNat(V2)) a__U256(tt) -> tt a__U261(tt, V2) -> a__U262(a__isLNatKind(V2)) a__U262(tt) -> tt a__U271(tt, V2) -> a__U272(a__isLNatKind(V2)) a__U272(tt) -> tt a__U281(tt, N) -> a__U282(a__isNaturalKind(N), N) a__U282(tt, N) -> cons(mark(N), natsFrom(s(N))) a__U291(tt, N, XS) -> a__U292(a__isNaturalKind(N), N, XS) a__U292(tt, N, XS) -> a__U293(a__isLNat(XS), N, XS) a__U293(tt, N, XS) -> a__U294(a__isLNatKind(XS), N, XS) a__U294(tt, N, XS) -> a__head(a__afterNth(mark(N), mark(XS))) a__U301(tt, X, Y) -> a__U302(a__isLNatKind(X), Y) a__U302(tt, Y) -> a__U303(a__isLNat(Y), Y) a__U303(tt, Y) -> a__U304(a__isLNatKind(Y), Y) a__U304(tt, Y) -> mark(Y) a__U31(tt, N, XS) -> a__U32(a__isNaturalKind(N), N, XS) popout

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

job log

popout

actions

all output return to Runti Compl Inner Rewri 22807