Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Full Rewri 10127 pair #381903933
details
property
value
status
complete
benchmark
LISTUTILITIES_nosorts_C.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n046.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
13.894974947 seconds
cpu usage
40.175480975
max memory
4.279902208E9
stage attributes
key
value
output-size
28099
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, 401 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(U11(tt, N, X, XS)) -> mark(U12(splitAt(N, XS), X)) active(U12(pair(YS, ZS), X)) -> mark(pair(cons(X, YS), ZS)) active(afterNth(N, XS)) -> mark(snd(splitAt(N, XS))) active(and(tt, X)) -> mark(X) active(fst(pair(X, Y))) -> mark(X) active(head(cons(N, XS))) -> mark(N) active(natsFrom(N)) -> mark(cons(N, natsFrom(s(N)))) active(sel(N, XS)) -> mark(head(afterNth(N, XS))) active(snd(pair(X, Y))) -> mark(Y) active(splitAt(0, XS)) -> mark(pair(nil, XS)) active(splitAt(s(N), cons(X, XS))) -> mark(U11(tt, N, X, XS)) active(tail(cons(N, XS))) -> mark(XS) active(take(N, XS)) -> mark(fst(splitAt(N, XS))) active(U11(X1, X2, X3, X4)) -> U11(active(X1), X2, X3, X4) active(U12(X1, X2)) -> U12(active(X1), X2) active(splitAt(X1, X2)) -> splitAt(active(X1), X2) active(splitAt(X1, X2)) -> splitAt(X1, active(X2)) active(pair(X1, X2)) -> pair(active(X1), X2) active(pair(X1, X2)) -> pair(X1, active(X2)) active(cons(X1, X2)) -> cons(active(X1), X2) active(afterNth(X1, X2)) -> afterNth(active(X1), X2) active(afterNth(X1, X2)) -> afterNth(X1, active(X2)) active(snd(X)) -> snd(active(X)) active(and(X1, X2)) -> and(active(X1), X2) active(fst(X)) -> fst(active(X)) active(head(X)) -> head(active(X)) active(natsFrom(X)) -> natsFrom(active(X)) active(s(X)) -> s(active(X)) active(sel(X1, X2)) -> sel(active(X1), X2) active(sel(X1, X2)) -> sel(X1, active(X2)) active(tail(X)) -> tail(active(X)) active(take(X1, X2)) -> take(active(X1), X2) active(take(X1, X2)) -> take(X1, active(X2)) U11(mark(X1), X2, X3, X4) -> mark(U11(X1, X2, X3, X4)) U12(mark(X1), X2) -> mark(U12(X1, X2)) splitAt(mark(X1), X2) -> mark(splitAt(X1, X2)) splitAt(X1, mark(X2)) -> mark(splitAt(X1, X2)) pair(mark(X1), X2) -> mark(pair(X1, X2)) pair(X1, mark(X2)) -> mark(pair(X1, X2)) cons(mark(X1), X2) -> mark(cons(X1, X2)) afterNth(mark(X1), X2) -> mark(afterNth(X1, X2)) afterNth(X1, mark(X2)) -> mark(afterNth(X1, X2)) snd(mark(X)) -> mark(snd(X)) and(mark(X1), X2) -> mark(and(X1, X2)) fst(mark(X)) -> mark(fst(X)) head(mark(X)) -> mark(head(X)) natsFrom(mark(X)) -> mark(natsFrom(X)) s(mark(X)) -> mark(s(X)) sel(mark(X1), X2) -> mark(sel(X1, X2)) sel(X1, mark(X2)) -> mark(sel(X1, X2)) tail(mark(X)) -> mark(tail(X)) take(mark(X1), X2) -> mark(take(X1, X2)) take(X1, mark(X2)) -> mark(take(X1, X2)) proper(U11(X1, X2, X3, X4)) -> U11(proper(X1), proper(X2), proper(X3), proper(X4)) proper(tt) -> ok(tt) proper(U12(X1, X2)) -> U12(proper(X1), proper(X2)) proper(splitAt(X1, X2)) -> splitAt(proper(X1), proper(X2)) proper(pair(X1, X2)) -> pair(proper(X1), proper(X2)) proper(cons(X1, X2)) -> cons(proper(X1), proper(X2)) proper(afterNth(X1, X2)) -> afterNth(proper(X1), proper(X2)) proper(snd(X)) -> snd(proper(X))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runti Compl Full Rewri 10127