Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Full Rewri 10127 pair #381903917
details
property
value
status
complete
benchmark
ExAppendixB_AEL03_C.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n055.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
11.5735301971 seconds
cpu usage
40.346888158
max memory
4.387848192E9
stage attributes
key
value
output-size
26189
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), 4 ms] (2) CpxTRS (3) RelTrsToTrsProof [UPPER BOUND(ID), 0 ms] (4) CpxTRS (5) CpxTrsMatchBoundsTAProof [FINISHED, 292 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(from(X)) -> mark(cons(X, from(s(X)))) active(2ndspos(0, Z)) -> mark(rnil) active(2ndspos(s(N), cons(X, Z))) -> mark(2ndspos(s(N), cons2(X, Z))) active(2ndspos(s(N), cons2(X, cons(Y, Z)))) -> mark(rcons(posrecip(Y), 2ndsneg(N, Z))) active(2ndsneg(0, Z)) -> mark(rnil) active(2ndsneg(s(N), cons(X, Z))) -> mark(2ndsneg(s(N), cons2(X, Z))) active(2ndsneg(s(N), cons2(X, cons(Y, Z)))) -> mark(rcons(negrecip(Y), 2ndspos(N, Z))) active(pi(X)) -> mark(2ndspos(X, from(0))) active(plus(0, Y)) -> mark(Y) active(plus(s(X), Y)) -> mark(s(plus(X, Y))) active(times(0, Y)) -> mark(0) active(times(s(X), Y)) -> mark(plus(Y, times(X, Y))) active(square(X)) -> mark(times(X, X)) active(s(X)) -> s(active(X)) active(posrecip(X)) -> posrecip(active(X)) active(negrecip(X)) -> negrecip(active(X)) active(cons(X1, X2)) -> cons(active(X1), X2) active(cons2(X1, X2)) -> cons2(X1, active(X2)) active(rcons(X1, X2)) -> rcons(active(X1), X2) active(rcons(X1, X2)) -> rcons(X1, active(X2)) active(from(X)) -> from(active(X)) active(2ndspos(X1, X2)) -> 2ndspos(active(X1), X2) active(2ndspos(X1, X2)) -> 2ndspos(X1, active(X2)) active(2ndsneg(X1, X2)) -> 2ndsneg(active(X1), X2) active(2ndsneg(X1, X2)) -> 2ndsneg(X1, active(X2)) active(pi(X)) -> pi(active(X)) active(plus(X1, X2)) -> plus(active(X1), X2) active(plus(X1, X2)) -> plus(X1, active(X2)) active(times(X1, X2)) -> times(active(X1), X2) active(times(X1, X2)) -> times(X1, active(X2)) active(square(X)) -> square(active(X)) s(mark(X)) -> mark(s(X)) posrecip(mark(X)) -> mark(posrecip(X)) negrecip(mark(X)) -> mark(negrecip(X)) cons(mark(X1), X2) -> mark(cons(X1, X2)) cons2(X1, mark(X2)) -> mark(cons2(X1, X2)) rcons(mark(X1), X2) -> mark(rcons(X1, X2)) rcons(X1, mark(X2)) -> mark(rcons(X1, X2)) from(mark(X)) -> mark(from(X)) 2ndspos(mark(X1), X2) -> mark(2ndspos(X1, X2)) 2ndspos(X1, mark(X2)) -> mark(2ndspos(X1, X2)) 2ndsneg(mark(X1), X2) -> mark(2ndsneg(X1, X2)) 2ndsneg(X1, mark(X2)) -> mark(2ndsneg(X1, X2)) pi(mark(X)) -> mark(pi(X)) plus(mark(X1), X2) -> mark(plus(X1, X2)) plus(X1, mark(X2)) -> mark(plus(X1, X2)) times(mark(X1), X2) -> mark(times(X1, X2)) times(X1, mark(X2)) -> mark(times(X1, X2)) square(mark(X)) -> mark(square(X)) proper(0) -> ok(0) proper(s(X)) -> s(proper(X)) proper(posrecip(X)) -> posrecip(proper(X)) proper(negrecip(X)) -> negrecip(proper(X)) proper(nil) -> ok(nil) proper(cons(X1, X2)) -> cons(proper(X1), proper(X2)) proper(cons2(X1, X2)) -> cons2(proper(X1), proper(X2)) proper(rnil) -> ok(rnil) proper(rcons(X1, X2)) -> rcons(proper(X1), proper(X2)) proper(from(X)) -> from(proper(X)) proper(2ndspos(X1, X2)) -> 2ndspos(proper(X1), proper(X2)) proper(2ndsneg(X1, X2)) -> 2ndsneg(proper(X1), proper(X2))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runti Compl Full Rewri 10127