details

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

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	18.0773060322 seconds
cpu usage	61.260963526
max memory	5.32514816E9

stage attributes

key	value
output-size	33997
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, 14.4 s] (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__zeros -> cons(0, zeros) a__U101(tt, V1, V2) -> a__U102(a__isNatKind(V1), V1, V2) a__U102(tt, V1, V2) -> a__U103(a__isNatIListKind(V2), V1, V2) a__U103(tt, V1, V2) -> a__U104(a__isNatIListKind(V2), V1, V2) a__U104(tt, V1, V2) -> a__U105(a__isNat(V1), V2) a__U105(tt, V2) -> a__U106(a__isNatIList(V2)) a__U106(tt) -> tt a__U11(tt, V1) -> a__U12(a__isNatIListKind(V1), V1) a__U111(tt, L, N) -> a__U112(a__isNatIListKind(L), L, N) a__U112(tt, L, N) -> a__U113(a__isNat(N), L, N) a__U113(tt, L, N) -> a__U114(a__isNatKind(N), L) a__U114(tt, L) -> s(a__length(mark(L))) a__U12(tt, V1) -> a__U13(a__isNatList(V1)) a__U121(tt, IL) -> a__U122(a__isNatIListKind(IL)) a__U122(tt) -> nil a__U13(tt) -> tt a__U131(tt, IL, M, N) -> a__U132(a__isNatIListKind(IL), IL, M, N) a__U132(tt, IL, M, N) -> a__U133(a__isNat(M), IL, M, N) a__U133(tt, IL, M, N) -> a__U134(a__isNatKind(M), IL, M, N) a__U134(tt, IL, M, N) -> a__U135(a__isNat(N), IL, M, N) a__U135(tt, IL, M, N) -> a__U136(a__isNatKind(N), IL, M, N) a__U136(tt, IL, M, N) -> cons(mark(N), take(M, IL)) a__U21(tt, V1) -> a__U22(a__isNatKind(V1), V1) a__U22(tt, V1) -> a__U23(a__isNat(V1)) a__U23(tt) -> tt a__U31(tt, V) -> a__U32(a__isNatIListKind(V), V) a__U32(tt, V) -> a__U33(a__isNatList(V)) a__U33(tt) -> tt a__U41(tt, V1, V2) -> a__U42(a__isNatKind(V1), V1, V2) a__U42(tt, V1, V2) -> a__U43(a__isNatIListKind(V2), V1, V2) a__U43(tt, V1, V2) -> a__U44(a__isNatIListKind(V2), V1, V2) a__U44(tt, V1, V2) -> a__U45(a__isNat(V1), V2) a__U45(tt, V2) -> a__U46(a__isNatIList(V2)) a__U46(tt) -> tt a__U51(tt, V2) -> a__U52(a__isNatIListKind(V2)) a__U52(tt) -> tt a__U61(tt, V2) -> a__U62(a__isNatIListKind(V2)) a__U62(tt) -> tt a__U71(tt) -> tt a__U81(tt) -> tt a__U91(tt, V1, V2) -> a__U92(a__isNatKind(V1), V1, V2) a__U92(tt, V1, V2) -> a__U93(a__isNatIListKind(V2), V1, V2) a__U93(tt, V1, V2) -> a__U94(a__isNatIListKind(V2), V1, V2) a__U94(tt, V1, V2) -> a__U95(a__isNat(V1), V2) a__U95(tt, V2) -> a__U96(a__isNatList(V2)) a__U96(tt) -> tt a__isNat(0) -> tt a__isNat(length(V1)) -> a__U11(a__isNatIListKind(V1), V1) a__isNat(s(V1)) -> a__U21(a__isNatKind(V1), V1) a__isNatIList(V) -> a__U31(a__isNatIListKind(V), V) a__isNatIList(zeros) -> tt a__isNatIList(cons(V1, V2)) -> a__U41(a__isNatKind(V1), V1, V2) a__isNatIListKind(nil) -> tt a__isNatIListKind(zeros) -> tt a__isNatIListKind(cons(V1, V2)) -> a__U51(a__isNatKind(V1), V2) a__isNatIListKind(take(V1, V2)) -> a__U61(a__isNatKind(V1), V2) a__isNatKind(0) -> tt a__isNatKind(length(V1)) -> a__U71(a__isNatIListKind(V1)) a__isNatKind(s(V1)) -> a__U81(a__isNatKind(V1)) a__isNatList(nil) -> tt a__isNatList(cons(V1, V2)) -> a__U91(a__isNatKind(V1), V1, V2) a__isNatList(take(V1, V2)) -> a__U101(a__isNatKind(V1), V1, V2) a__length(nil) -> 0 a__length(cons(N, L)) -> a__U111(a__isNatList(L), L, N) a__take(0, IL) -> a__U121(a__isNatIList(IL), IL) popout

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

job log

popout

actions

all output return to Runti Compl Full Rewri 10127