Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Full Rewri 10127 pair #381903651
details
property
value
status
complete
benchmark
Ex3_3_25_Bor03_C.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n049.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
8.51207399368 seconds
cpu usage
24.497307949
max memory
3.796217856E9
stage attributes
key
value
output-size
38278
starexec-result
WORST_CASE(Omega(n^1), O(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), O(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, 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, 100 ms] (6) BOUNDS(1, n^1) (7) RenamingProof [BOTH BOUNDS(ID, ID), 0 ms] (8) CpxTRS (9) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms] (10) typed CpxTrs (11) OrderProof [LOWER BOUND(ID), 0 ms] (12) typed CpxTrs (13) RewriteLemmaProof [LOWER BOUND(ID), 462 ms] (14) BEST (15) proven lower bound (16) LowerBoundPropagationProof [FINISHED, 0 ms] (17) BOUNDS(n^1, INF) (18) typed CpxTrs (19) RewriteLemmaProof [LOWER BOUND(ID), 125 ms] (20) typed CpxTrs (21) RewriteLemmaProof [LOWER BOUND(ID), 84 ms] (22) typed CpxTrs (23) RewriteLemmaProof [LOWER BOUND(ID), 90 ms] (24) typed CpxTrs (25) RewriteLemmaProof [LOWER BOUND(ID), 110 ms] (26) typed CpxTrs (27) RewriteLemmaProof [LOWER BOUND(ID), 75 ms] (28) typed CpxTrs ---------------------------------------- (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(app(nil, YS)) -> mark(YS) active(app(cons(X, XS), YS)) -> mark(cons(X, app(XS, YS))) active(from(X)) -> mark(cons(X, from(s(X)))) active(zWadr(nil, YS)) -> mark(nil) active(zWadr(XS, nil)) -> mark(nil) active(zWadr(cons(X, XS), cons(Y, YS))) -> mark(cons(app(Y, cons(X, nil)), zWadr(XS, YS))) active(prefix(L)) -> mark(cons(nil, zWadr(L, prefix(L)))) active(app(X1, X2)) -> app(active(X1), X2) active(app(X1, X2)) -> app(X1, active(X2)) active(cons(X1, X2)) -> cons(active(X1), X2) active(from(X)) -> from(active(X)) active(s(X)) -> s(active(X)) active(zWadr(X1, X2)) -> zWadr(active(X1), X2) active(zWadr(X1, X2)) -> zWadr(X1, active(X2)) active(prefix(X)) -> prefix(active(X)) app(mark(X1), X2) -> mark(app(X1, X2)) app(X1, mark(X2)) -> mark(app(X1, X2)) cons(mark(X1), X2) -> mark(cons(X1, X2)) from(mark(X)) -> mark(from(X)) s(mark(X)) -> mark(s(X)) zWadr(mark(X1), X2) -> mark(zWadr(X1, X2)) zWadr(X1, mark(X2)) -> mark(zWadr(X1, X2)) prefix(mark(X)) -> mark(prefix(X)) proper(app(X1, X2)) -> app(proper(X1), proper(X2)) proper(nil) -> ok(nil) proper(cons(X1, X2)) -> cons(proper(X1), proper(X2)) proper(from(X)) -> from(proper(X)) proper(s(X)) -> s(proper(X)) proper(zWadr(X1, X2)) -> zWadr(proper(X1), proper(X2)) proper(prefix(X)) -> prefix(proper(X)) app(ok(X1), ok(X2)) -> ok(app(X1, X2)) cons(ok(X1), ok(X2)) -> ok(cons(X1, X2)) from(ok(X)) -> ok(from(X)) s(ok(X)) -> ok(s(X)) zWadr(ok(X1), ok(X2)) -> ok(zWadr(X1, X2)) prefix(ok(X)) -> ok(prefix(X)) 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 top: proper, active The following defined symbols can occur below the 0th argument of proper: proper, active The following defined symbols can occur below the 0th argument of active: proper, active
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runti Compl Full Rewri 10127