Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Full Rewri 10127 pair #381903943
details
property
value
status
complete
benchmark
Ex5_DLMMU04_FR.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n057.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
1.79805707932 seconds
cpu usage
4.426008852
max memory
3.11353344E8
stage attributes
key
value
output-size
7679
starexec-result
WORST_CASE(NON_POLY, ?)
output
/export/starexec/sandbox/solver/bin/starexec_run_complexity /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- WORST_CASE(NON_POLY, ?) 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(EXP, INF). (0) CpxTRS (1) RelTrsToDecreasingLoopProblemProof [LOWER BOUND(ID), 0 ms] (2) TRS for Loop Detection (3) DecreasingLoopProof [LOWER BOUND(ID), 0 ms] (4) BEST (5) proven lower bound (6) LowerBoundPropagationProof [FINISHED, 0 ms] (7) BOUNDS(n^1, INF) (8) TRS for Loop Detection (9) DecreasingLoopProof [FINISHED, 163 ms] (10) BOUNDS(EXP, INF) ---------------------------------------- (0) Obligation: The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(EXP, INF). The TRS R consists of the following rules: pairNs -> cons(0, n__incr(n__oddNs)) oddNs -> incr(pairNs) incr(cons(X, XS)) -> cons(s(X), n__incr(activate(XS))) take(0, XS) -> nil take(s(N), cons(X, XS)) -> cons(X, n__take(N, activate(XS))) zip(nil, XS) -> nil zip(X, nil) -> nil zip(cons(X, XS), cons(Y, YS)) -> cons(pair(X, Y), n__zip(activate(XS), activate(YS))) tail(cons(X, XS)) -> activate(XS) repItems(nil) -> nil repItems(cons(X, XS)) -> cons(X, n__cons(X, n__repItems(activate(XS)))) incr(X) -> n__incr(X) oddNs -> n__oddNs take(X1, X2) -> n__take(X1, X2) zip(X1, X2) -> n__zip(X1, X2) cons(X1, X2) -> n__cons(X1, X2) repItems(X) -> n__repItems(X) activate(n__incr(X)) -> incr(activate(X)) activate(n__oddNs) -> oddNs activate(n__take(X1, X2)) -> take(activate(X1), activate(X2)) activate(n__zip(X1, X2)) -> zip(activate(X1), activate(X2)) activate(n__cons(X1, X2)) -> cons(activate(X1), X2) activate(n__repItems(X)) -> repItems(activate(X)) activate(X) -> X S is empty. Rewrite Strategy: FULL ---------------------------------------- (1) RelTrsToDecreasingLoopProblemProof (LOWER BOUND(ID)) Transformed a relative TRS into a decreasing-loop problem. ---------------------------------------- (2) Obligation: Analyzing the following TRS for decreasing loops: The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(EXP, INF). The TRS R consists of the following rules: pairNs -> cons(0, n__incr(n__oddNs)) oddNs -> incr(pairNs) incr(cons(X, XS)) -> cons(s(X), n__incr(activate(XS))) take(0, XS) -> nil take(s(N), cons(X, XS)) -> cons(X, n__take(N, activate(XS))) zip(nil, XS) -> nil zip(X, nil) -> nil zip(cons(X, XS), cons(Y, YS)) -> cons(pair(X, Y), n__zip(activate(XS), activate(YS))) tail(cons(X, XS)) -> activate(XS) repItems(nil) -> nil repItems(cons(X, XS)) -> cons(X, n__cons(X, n__repItems(activate(XS)))) incr(X) -> n__incr(X) oddNs -> n__oddNs take(X1, X2) -> n__take(X1, X2) zip(X1, X2) -> n__zip(X1, X2) cons(X1, X2) -> n__cons(X1, X2) repItems(X) -> n__repItems(X) activate(n__incr(X)) -> incr(activate(X)) activate(n__oddNs) -> oddNs activate(n__take(X1, X2)) -> take(activate(X1), activate(X2)) activate(n__zip(X1, X2)) -> zip(activate(X1), activate(X2)) activate(n__cons(X1, X2)) -> cons(activate(X1), X2) activate(n__repItems(X)) -> repItems(activate(X))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runti Compl Full Rewri 10127