Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Full Rewri 10127 pair #381903971
details
property
value
status
complete
benchmark
ExSec4_2_DLMMU04_C.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n034.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
10.5465519428 seconds
cpu usage
37.301240573
max memory
4.350582784E9
stage attributes
key
value
output-size
112207
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, 284 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), 464 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), 124 ms] (20) typed CpxTrs (21) RewriteLemmaProof [LOWER BOUND(ID), 92 ms] (22) typed CpxTrs (23) RewriteLemmaProof [LOWER BOUND(ID), 66 ms] (24) typed CpxTrs (25) RewriteLemmaProof [LOWER BOUND(ID), 158 ms] (26) typed CpxTrs (27) RewriteLemmaProof [LOWER BOUND(ID), 126 ms] (28) typed CpxTrs (29) RewriteLemmaProof [LOWER BOUND(ID), 53 ms] (30) typed CpxTrs (31) RewriteLemmaProof [LOWER BOUND(ID), 97 ms] (32) typed CpxTrs (33) RewriteLemmaProof [LOWER BOUND(ID), 91 ms] (34) typed CpxTrs (35) RewriteLemmaProof [LOWER BOUND(ID), 119 ms] (36) typed CpxTrs (37) RewriteLemmaProof [LOWER BOUND(ID), 128 ms] (38) typed CpxTrs (39) RewriteLemmaProof [LOWER BOUND(ID), 129 ms] (40) typed CpxTrs (41) RewriteLemmaProof [LOWER BOUND(ID), 124 ms] (42) 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(natsFrom(N)) -> mark(cons(N, natsFrom(s(N)))) active(fst(pair(XS, YS))) -> mark(XS) active(snd(pair(XS, YS))) -> mark(YS) active(splitAt(0, XS)) -> mark(pair(nil, XS)) active(splitAt(s(N), cons(X, XS))) -> mark(u(splitAt(N, XS), N, X, XS)) active(u(pair(YS, ZS), N, X, XS)) -> mark(pair(cons(X, YS), ZS)) active(head(cons(N, XS))) -> mark(N) active(tail(cons(N, XS))) -> mark(XS) active(sel(N, XS)) -> mark(head(afterNth(N, XS))) active(take(N, XS)) -> mark(fst(splitAt(N, XS))) active(afterNth(N, XS)) -> mark(snd(splitAt(N, XS))) active(natsFrom(X)) -> natsFrom(active(X)) active(cons(X1, X2)) -> cons(active(X1), X2) active(s(X)) -> s(active(X)) active(fst(X)) -> fst(active(X)) active(pair(X1, X2)) -> pair(active(X1), X2) active(pair(X1, X2)) -> pair(X1, active(X2)) active(snd(X)) -> snd(active(X)) active(splitAt(X1, X2)) -> splitAt(active(X1), X2) active(splitAt(X1, X2)) -> splitAt(X1, active(X2)) active(u(X1, X2, X3, X4)) -> u(active(X1), X2, X3, X4) active(head(X)) -> head(active(X)) active(tail(X)) -> tail(active(X)) active(sel(X1, X2)) -> sel(active(X1), X2) active(sel(X1, X2)) -> sel(X1, active(X2)) active(afterNth(X1, X2)) -> afterNth(active(X1), X2) active(afterNth(X1, X2)) -> afterNth(X1, active(X2)) active(take(X1, X2)) -> take(active(X1), X2) active(take(X1, X2)) -> take(X1, active(X2)) natsFrom(mark(X)) -> mark(natsFrom(X)) cons(mark(X1), X2) -> mark(cons(X1, X2)) s(mark(X)) -> mark(s(X)) fst(mark(X)) -> mark(fst(X))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runti Compl Full Rewri 10127