Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Full Rewri 10127 pair #381903381
details
property
value
status
complete
benchmark
Ex5_DLMMU04_C.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n048.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
292.224667072 seconds
cpu usage
1140.406325
max memory
1.5471407104E10
stage attributes
key
value
output-size
12022
starexec-result
WORST_CASE(Omega(n^1), ?)
output
/export/starexec/sandbox2/solver/bin/starexec_run_complexity /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- WORST_CASE(Omega(n^1), ?) 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(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 (full) of the given CpxTRS could be proven to be BOUNDS(n^1, INF). The TRS R consists of the following rules: active(pairNs) -> mark(cons(0, incr(oddNs))) active(oddNs) -> mark(incr(pairNs)) active(incr(cons(X, XS))) -> mark(cons(s(X), incr(XS))) active(take(0, XS)) -> mark(nil) active(take(s(N), cons(X, XS))) -> mark(cons(X, take(N, XS))) active(zip(nil, XS)) -> mark(nil) active(zip(X, nil)) -> mark(nil) active(zip(cons(X, XS), cons(Y, YS))) -> mark(cons(pair(X, Y), zip(XS, YS))) active(tail(cons(X, XS))) -> mark(XS) active(repItems(nil)) -> mark(nil) active(repItems(cons(X, XS))) -> mark(cons(X, cons(X, repItems(XS)))) active(cons(X1, X2)) -> cons(active(X1), X2) active(incr(X)) -> incr(active(X)) active(s(X)) -> s(active(X)) active(take(X1, X2)) -> take(active(X1), X2) active(take(X1, X2)) -> take(X1, active(X2)) active(zip(X1, X2)) -> zip(active(X1), X2) active(zip(X1, X2)) -> zip(X1, active(X2)) active(pair(X1, X2)) -> pair(active(X1), X2) active(pair(X1, X2)) -> pair(X1, active(X2)) active(tail(X)) -> tail(active(X)) active(repItems(X)) -> repItems(active(X)) cons(mark(X1), X2) -> mark(cons(X1, X2)) incr(mark(X)) -> mark(incr(X)) s(mark(X)) -> mark(s(X)) take(mark(X1), X2) -> mark(take(X1, X2)) take(X1, mark(X2)) -> mark(take(X1, X2)) zip(mark(X1), X2) -> mark(zip(X1, X2)) zip(X1, mark(X2)) -> mark(zip(X1, X2)) pair(mark(X1), X2) -> mark(pair(X1, X2)) pair(X1, mark(X2)) -> mark(pair(X1, X2)) tail(mark(X)) -> mark(tail(X)) repItems(mark(X)) -> mark(repItems(X)) proper(pairNs) -> ok(pairNs) proper(cons(X1, X2)) -> cons(proper(X1), proper(X2)) proper(0) -> ok(0) proper(incr(X)) -> incr(proper(X)) proper(oddNs) -> ok(oddNs) proper(s(X)) -> s(proper(X)) proper(take(X1, X2)) -> take(proper(X1), proper(X2)) proper(nil) -> ok(nil) proper(zip(X1, X2)) -> zip(proper(X1), proper(X2)) proper(pair(X1, X2)) -> pair(proper(X1), proper(X2)) proper(tail(X)) -> tail(proper(X)) proper(repItems(X)) -> repItems(proper(X)) cons(ok(X1), ok(X2)) -> ok(cons(X1, X2)) incr(ok(X)) -> ok(incr(X)) s(ok(X)) -> ok(s(X)) take(ok(X1), ok(X2)) -> ok(take(X1, X2)) zip(ok(X1), ok(X2)) -> ok(zip(X1, X2)) pair(ok(X1), ok(X2)) -> ok(pair(X1, X2)) tail(ok(X)) -> ok(tail(X)) repItems(ok(X)) -> ok(repItems(X)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(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:
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runti Compl Full Rewri 10127