Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Full Rewri 10127 pair #381903377
details
property
value
status
complete
benchmark
LISTUTILITIES_nokinds_C.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n040.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
10.3351931572 seconds
cpu usage
37.576977914
max memory
4.29150208E9
stage attributes
key
value
output-size
47968
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, 1018 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(U101(tt, N, XS)) -> mark(fst(splitAt(N, XS))) active(U11(tt, N, XS)) -> mark(snd(splitAt(N, XS))) active(U21(tt, X)) -> mark(X) active(U31(tt, N)) -> mark(N) active(U41(tt, N)) -> mark(cons(N, natsFrom(s(N)))) active(U51(tt, N, XS)) -> mark(head(afterNth(N, XS))) active(U61(tt, Y)) -> mark(Y) active(U71(tt, XS)) -> mark(pair(nil, XS)) active(U81(tt, N, X, XS)) -> mark(U82(splitAt(N, XS), X)) active(U82(pair(YS, ZS), X)) -> mark(pair(cons(X, YS), ZS)) active(U91(tt, XS)) -> mark(XS) active(afterNth(N, XS)) -> mark(U11(and(isNatural(N), isLNat(XS)), N, XS)) active(and(tt, X)) -> mark(X) active(fst(pair(X, Y))) -> mark(U21(and(isLNat(X), isLNat(Y)), X)) active(head(cons(N, XS))) -> mark(U31(and(isNatural(N), isLNat(XS)), N)) active(isLNat(nil)) -> mark(tt) active(isLNat(afterNth(V1, V2))) -> mark(and(isNatural(V1), isLNat(V2))) active(isLNat(cons(V1, V2))) -> mark(and(isNatural(V1), isLNat(V2))) active(isLNat(fst(V1))) -> mark(isPLNat(V1)) active(isLNat(natsFrom(V1))) -> mark(isNatural(V1)) active(isLNat(snd(V1))) -> mark(isPLNat(V1)) active(isLNat(tail(V1))) -> mark(isLNat(V1)) active(isLNat(take(V1, V2))) -> mark(and(isNatural(V1), isLNat(V2))) active(isNatural(0)) -> mark(tt) active(isNatural(head(V1))) -> mark(isLNat(V1)) active(isNatural(s(V1))) -> mark(isNatural(V1)) active(isNatural(sel(V1, V2))) -> mark(and(isNatural(V1), isLNat(V2))) active(isPLNat(pair(V1, V2))) -> mark(and(isLNat(V1), isLNat(V2))) active(isPLNat(splitAt(V1, V2))) -> mark(and(isNatural(V1), isLNat(V2))) active(natsFrom(N)) -> mark(U41(isNatural(N), N)) active(sel(N, XS)) -> mark(U51(and(isNatural(N), isLNat(XS)), N, XS)) active(snd(pair(X, Y))) -> mark(U61(and(isLNat(X), isLNat(Y)), Y)) active(splitAt(0, XS)) -> mark(U71(isLNat(XS), XS)) active(splitAt(s(N), cons(X, XS))) -> mark(U81(and(isNatural(N), and(isNatural(X), isLNat(XS))), N, X, XS)) active(tail(cons(N, XS))) -> mark(U91(and(isNatural(N), isLNat(XS)), XS)) active(take(N, XS)) -> mark(U101(and(isNatural(N), isLNat(XS)), N, XS)) active(U101(X1, X2, X3)) -> U101(active(X1), X2, X3) active(fst(X)) -> fst(active(X)) active(splitAt(X1, X2)) -> splitAt(active(X1), X2) active(splitAt(X1, X2)) -> splitAt(X1, active(X2)) active(U11(X1, X2, X3)) -> U11(active(X1), X2, X3) active(snd(X)) -> snd(active(X)) active(U21(X1, X2)) -> U21(active(X1), X2) active(U31(X1, X2)) -> U31(active(X1), X2) active(U41(X1, X2)) -> U41(active(X1), X2) active(cons(X1, X2)) -> cons(active(X1), X2) active(natsFrom(X)) -> natsFrom(active(X)) active(s(X)) -> s(active(X)) active(U51(X1, X2, X3)) -> U51(active(X1), X2, X3) active(head(X)) -> head(active(X)) active(afterNth(X1, X2)) -> afterNth(active(X1), X2) active(afterNth(X1, X2)) -> afterNth(X1, active(X2)) active(U61(X1, X2)) -> U61(active(X1), X2) active(U71(X1, X2)) -> U71(active(X1), X2) active(pair(X1, X2)) -> pair(active(X1), X2) active(pair(X1, X2)) -> pair(X1, active(X2)) active(U81(X1, X2, X3, X4)) -> U81(active(X1), X2, X3, X4) active(U82(X1, X2)) -> U82(active(X1), X2) active(U91(X1, X2)) -> U91(active(X1), X2) active(and(X1, X2)) -> and(active(X1), X2) active(tail(X)) -> tail(active(X))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runti Compl Full Rewri 10127