Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runtime_Complexity_Full_Rewriting 2019-04-01 06.11 pair #433308225
details
property
value
status
complete
benchmark
ExSec11_1_Luc02a_C.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n013.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
8.31909 seconds
cpu usage
27.5285
user time
25.7609
system time
1.76761
max virtual memory
3.7773928E7
max residence set size
4208456.0
stage attributes
key
value
starexec-result
WORST_CASE(Omega(n^1), O(n^1))
output
27.35/8.25 WORST_CASE(Omega(n^1), O(n^1)) 27.35/8.27 proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml 27.35/8.27 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 27.35/8.27 27.35/8.27 27.35/8.27 The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, n^1). 27.35/8.27 27.35/8.27 (0) CpxTRS 27.35/8.27 (1) NestedDefinedSymbolProof [UPPER BOUND(ID), 0 ms] 27.35/8.27 (2) CpxTRS 27.35/8.27 (3) RelTrsToTrsProof [UPPER BOUND(ID), 0 ms] 27.35/8.27 (4) CpxTRS 27.35/8.27 (5) CpxTrsMatchBoundsTAProof [FINISHED, 66 ms] 27.35/8.27 (6) BOUNDS(1, n^1) 27.35/8.27 (7) RelTrsToDecreasingLoopProblemProof [LOWER BOUND(ID), 0 ms] 27.35/8.27 (8) TRS for Loop Detection 27.35/8.27 (9) DecreasingLoopProof [LOWER BOUND(ID), 0 ms] 27.35/8.27 (10) BEST 27.35/8.27 (11) proven lower bound 27.35/8.27 (12) LowerBoundPropagationProof [FINISHED, 0 ms] 27.35/8.27 (13) BOUNDS(n^1, INF) 27.35/8.27 (14) TRS for Loop Detection 27.35/8.27 27.35/8.27 27.35/8.27 ---------------------------------------- 27.35/8.27 27.35/8.27 (0) 27.35/8.27 Obligation: 27.35/8.27 The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, n^1). 27.35/8.27 27.35/8.27 27.35/8.27 The TRS R consists of the following rules: 27.35/8.27 27.35/8.27 active(terms(N)) -> mark(cons(recip(sqr(N)), terms(s(N)))) 27.35/8.27 active(sqr(0)) -> mark(0) 27.35/8.27 active(sqr(s(X))) -> mark(s(add(sqr(X), dbl(X)))) 27.35/8.27 active(dbl(0)) -> mark(0) 27.35/8.27 active(dbl(s(X))) -> mark(s(s(dbl(X)))) 27.35/8.27 active(add(0, X)) -> mark(X) 27.35/8.27 active(add(s(X), Y)) -> mark(s(add(X, Y))) 27.35/8.27 active(first(0, X)) -> mark(nil) 27.35/8.27 active(first(s(X), cons(Y, Z))) -> mark(cons(Y, first(X, Z))) 27.35/8.27 active(half(0)) -> mark(0) 27.35/8.27 active(half(s(0))) -> mark(0) 27.35/8.27 active(half(s(s(X)))) -> mark(s(half(X))) 27.35/8.27 active(half(dbl(X))) -> mark(X) 27.35/8.27 active(terms(X)) -> terms(active(X)) 27.35/8.27 active(cons(X1, X2)) -> cons(active(X1), X2) 27.35/8.27 active(recip(X)) -> recip(active(X)) 27.35/8.27 active(sqr(X)) -> sqr(active(X)) 27.35/8.27 active(s(X)) -> s(active(X)) 27.35/8.27 active(add(X1, X2)) -> add(active(X1), X2) 27.35/8.27 active(add(X1, X2)) -> add(X1, active(X2)) 27.35/8.27 active(dbl(X)) -> dbl(active(X)) 27.35/8.27 active(first(X1, X2)) -> first(active(X1), X2) 27.35/8.27 active(first(X1, X2)) -> first(X1, active(X2)) 27.35/8.27 active(half(X)) -> half(active(X)) 27.35/8.27 terms(mark(X)) -> mark(terms(X)) 27.35/8.27 cons(mark(X1), X2) -> mark(cons(X1, X2)) 27.35/8.27 recip(mark(X)) -> mark(recip(X)) 27.35/8.27 sqr(mark(X)) -> mark(sqr(X)) 27.35/8.27 s(mark(X)) -> mark(s(X)) 27.35/8.27 add(mark(X1), X2) -> mark(add(X1, X2)) 27.35/8.27 add(X1, mark(X2)) -> mark(add(X1, X2)) 27.35/8.27 dbl(mark(X)) -> mark(dbl(X)) 27.35/8.27 first(mark(X1), X2) -> mark(first(X1, X2)) 27.35/8.27 first(X1, mark(X2)) -> mark(first(X1, X2)) 27.35/8.27 half(mark(X)) -> mark(half(X)) 27.35/8.27 proper(terms(X)) -> terms(proper(X)) 27.35/8.27 proper(cons(X1, X2)) -> cons(proper(X1), proper(X2)) 27.35/8.27 proper(recip(X)) -> recip(proper(X)) 27.35/8.27 proper(sqr(X)) -> sqr(proper(X)) 27.35/8.27 proper(s(X)) -> s(proper(X)) 27.35/8.27 proper(0) -> ok(0) 27.35/8.27 proper(add(X1, X2)) -> add(proper(X1), proper(X2)) 27.35/8.27 proper(dbl(X)) -> dbl(proper(X)) 27.35/8.27 proper(first(X1, X2)) -> first(proper(X1), proper(X2)) 27.35/8.27 proper(nil) -> ok(nil) 27.35/8.27 proper(half(X)) -> half(proper(X)) 27.35/8.27 terms(ok(X)) -> ok(terms(X)) 27.35/8.27 cons(ok(X1), ok(X2)) -> ok(cons(X1, X2)) 27.35/8.27 recip(ok(X)) -> ok(recip(X)) 27.35/8.27 sqr(ok(X)) -> ok(sqr(X)) 27.35/8.27 s(ok(X)) -> ok(s(X)) 27.35/8.27 add(ok(X1), ok(X2)) -> ok(add(X1, X2)) 27.35/8.27 dbl(ok(X)) -> ok(dbl(X)) 27.35/8.27 first(ok(X1), ok(X2)) -> ok(first(X1, X2)) 27.35/8.27 half(ok(X)) -> ok(half(X)) 27.35/8.27 top(mark(X)) -> top(proper(X)) 27.35/8.27 top(ok(X)) -> top(active(X)) 27.35/8.27 27.35/8.27 S is empty. 27.35/8.27 Rewrite Strategy: FULL 27.35/8.27 ---------------------------------------- 27.35/8.27 27.35/8.27 (1) NestedDefinedSymbolProof (UPPER BOUND(ID)) 27.35/8.27 The following defined symbols can occur below the 0th argument of top: proper, active 27.35/8.27 The following defined symbols can occur below the 0th argument of proper: proper, active 27.35/8.27 The following defined symbols can occur below the 0th argument of active: proper, active 27.35/8.27
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runtime_Complexity_Full_Rewriting 2019-04-01 06.11
