details

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

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	292.009451866 seconds
cpu usage	317.925377606
max memory	5.873618944E9

stage attributes

key	value
output-size	9590
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 (full) 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), 156 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 (full) of the given CpxTRS could be proven to be BOUNDS(n^1, INF). The TRS R consists of the following rules: zeros -> cons(0, n__zeros) U11(tt) -> tt U21(tt) -> tt U31(tt) -> tt U41(tt, V2) -> U42(isNatIList(activate(V2))) U42(tt) -> tt U51(tt, V2) -> U52(isNatList(activate(V2))) U52(tt) -> tt U61(tt, V2) -> U62(isNatIList(activate(V2))) U62(tt) -> tt U71(tt, L, N) -> U72(isNat(activate(N)), activate(L)) U72(tt, L) -> s(length(activate(L))) U81(tt) -> nil U91(tt, IL, M, N) -> U92(isNat(activate(M)), activate(IL), activate(M), activate(N)) U92(tt, IL, M, N) -> U93(isNat(activate(N)), activate(IL), activate(M), activate(N)) U93(tt, IL, M, N) -> cons(activate(N), n__take(activate(M), activate(IL))) isNat(n__0) -> tt isNat(n__length(V1)) -> U11(isNatList(activate(V1))) isNat(n__s(V1)) -> U21(isNat(activate(V1))) isNatIList(V) -> U31(isNatList(activate(V))) isNatIList(n__zeros) -> tt isNatIList(n__cons(V1, V2)) -> U41(isNat(activate(V1)), activate(V2)) isNatList(n__nil) -> tt isNatList(n__cons(V1, V2)) -> U51(isNat(activate(V1)), activate(V2)) isNatList(n__take(V1, V2)) -> U61(isNat(activate(V1)), activate(V2)) length(nil) -> 0 length(cons(N, L)) -> U71(isNatList(activate(L)), activate(L), N) take(0, IL) -> U81(isNatIList(IL)) take(s(M), cons(N, IL)) -> U91(isNatIList(activate(IL)), activate(IL), M, N) zeros -> n__zeros take(X1, X2) -> n__take(X1, X2) 0 -> n__0 length(X) -> n__length(X) s(X) -> n__s(X) cons(X1, X2) -> n__cons(X1, X2) nil -> n__nil activate(n__zeros) -> zeros activate(n__take(X1, X2)) -> take(X1, X2) activate(n__0) -> 0 activate(n__length(X)) -> length(X) activate(n__s(X)) -> s(X) activate(n__cons(X1, X2)) -> cons(X1, X2) activate(n__nil) -> nil activate(X) -> X S is empty. Rewrite Strategy: FULL ---------------------------------------- (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 (full) of the given CpxTRS could be proven to be BOUNDS(n^1, INF). The TRS R consists of the following rules: zeros -> cons(0, n__zeros) U11(tt) -> tt U21(tt) -> tt U31(tt) -> tt U41(tt, V2) -> U42(isNatIList(activate(V2))) popout

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

job log

popout

actions

all output return to Runti Compl Full Rewri 10127