Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Full Rewri 10127 pair #381903591
details
property
value
status
complete
benchmark
OvConsOS_nosorts_C.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n077.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
293.855357885 seconds
cpu usage
1129.9801164
max memory
1.544136704E10
stage attributes
key
value
output-size
13902
starexec-result
WORST_CASE(Omega(n^1), O(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), O(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, n^1). (0) CpxTRS (1) NestedDefinedSymbolProof [UPPER BOUND(ID), 0 ms] (2) CpxTRS (3) RelTrsToTrsProof [UPPER BOUND(ID), 0 ms] (4) CpxTRS (5) CpxTrsMatchBoundsTAProof [FINISHED, 751 ms] (6) BOUNDS(1, n^1) (7) RelTrsToDecreasingLoopProblemProof [LOWER BOUND(ID), 0 ms] (8) TRS for Loop Detection (9) DecreasingLoopProof [LOWER BOUND(ID), 0 ms] (10) BEST (11) proven lower bound (12) LowerBoundPropagationProof [FINISHED, 0 ms] (13) BOUNDS(n^1, INF) (14) TRS for Loop Detection ---------------------------------------- (0) Obligation: The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, n^1). The TRS R consists of the following rules: active(zeros) -> mark(cons(0, zeros)) active(and(tt, X)) -> mark(X) active(length(nil)) -> mark(0) active(length(cons(N, L))) -> mark(s(length(L))) active(take(0, IL)) -> mark(nil) active(take(s(M), cons(N, IL))) -> mark(cons(N, take(M, IL))) active(cons(X1, X2)) -> cons(active(X1), X2) active(and(X1, X2)) -> and(active(X1), X2) active(length(X)) -> length(active(X)) active(s(X)) -> s(active(X)) active(take(X1, X2)) -> take(active(X1), X2) active(take(X1, X2)) -> take(X1, active(X2)) cons(mark(X1), X2) -> mark(cons(X1, X2)) and(mark(X1), X2) -> mark(and(X1, X2)) length(mark(X)) -> mark(length(X)) s(mark(X)) -> mark(s(X)) take(mark(X1), X2) -> mark(take(X1, X2)) take(X1, mark(X2)) -> mark(take(X1, X2)) proper(zeros) -> ok(zeros) proper(cons(X1, X2)) -> cons(proper(X1), proper(X2)) proper(0) -> ok(0) proper(and(X1, X2)) -> and(proper(X1), proper(X2)) proper(tt) -> ok(tt) proper(length(X)) -> length(proper(X)) proper(nil) -> ok(nil) proper(s(X)) -> s(proper(X)) proper(take(X1, X2)) -> take(proper(X1), proper(X2)) cons(ok(X1), ok(X2)) -> ok(cons(X1, X2)) and(ok(X1), ok(X2)) -> ok(and(X1, X2)) length(ok(X)) -> ok(length(X)) s(ok(X)) -> ok(s(X)) take(ok(X1), ok(X2)) -> ok(take(X1, X2)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) S is empty. Rewrite Strategy: FULL ---------------------------------------- (1) NestedDefinedSymbolProof (UPPER BOUND(ID)) The following defined symbols can occur below the 0th argument of cons: active, proper, cons The following defined symbols can occur below the 1th argument of cons: active, proper, cons The following defined symbols can occur below the 0th argument of top: active, proper, cons The following defined symbols can occur below the 0th argument of proper: active, proper, cons The following defined symbols can occur below the 0th argument of active: active, proper, cons Hence, the left-hand sides of the following rules are not basic-reachable and can be removed: active(and(tt, X)) -> mark(X) active(length(nil)) -> mark(0) active(length(cons(N, L))) -> mark(s(length(L))) active(take(0, IL)) -> mark(nil) active(take(s(M), cons(N, IL))) -> mark(cons(N, take(M, IL))) active(and(X1, X2)) -> and(active(X1), X2) active(length(X)) -> length(active(X)) active(s(X)) -> s(active(X)) active(take(X1, X2)) -> take(active(X1), X2) active(take(X1, X2)) -> take(X1, active(X2)) proper(and(X1, X2)) -> and(proper(X1), proper(X2)) proper(length(X)) -> length(proper(X)) proper(s(X)) -> s(proper(X)) proper(take(X1, X2)) -> take(proper(X1), proper(X2))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runti Compl Full Rewri 10127