Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Full Rewri 10127 pair #381903471
details
property
value
status
complete
benchmark
Ex1_Luc04b_GM.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n027.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
296.888948202 seconds
cpu usage
1112.88955975
max memory
1.5469633536E10
stage attributes
key
value
output-size
14362
starexec-result
WORST_CASE(Omega(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), ?) 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, INF). (0) CpxTRS (1) RenamingProof [BOTH BOUNDS(ID, ID), 0 ms] (2) CpxTRS (3) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms] (4) typed CpxTrs (5) OrderProof [LOWER BOUND(ID), 0 ms] (6) typed CpxTrs (7) RewriteLemmaProof [LOWER BOUND(ID), 8643 ms] (8) BEST (9) proven lower bound (10) LowerBoundPropagationProof [FINISHED, 0 ms] (11) BOUNDS(n^1, INF) (12) typed CpxTrs ---------------------------------------- (0) Obligation: The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, INF). The TRS R consists of the following rules: a__nats -> cons(0, incr(nats)) a__pairs -> cons(0, incr(odds)) a__odds -> a__incr(a__pairs) a__incr(cons(X, XS)) -> cons(s(mark(X)), incr(XS)) a__head(cons(X, XS)) -> mark(X) a__tail(cons(X, XS)) -> mark(XS) mark(nats) -> a__nats mark(incr(X)) -> a__incr(mark(X)) mark(pairs) -> a__pairs mark(odds) -> a__odds mark(head(X)) -> a__head(mark(X)) mark(tail(X)) -> a__tail(mark(X)) mark(cons(X1, X2)) -> cons(mark(X1), X2) mark(0) -> 0 mark(s(X)) -> s(mark(X)) a__nats -> nats a__incr(X) -> incr(X) a__pairs -> pairs a__odds -> odds a__head(X) -> head(X) a__tail(X) -> tail(X) S is empty. Rewrite Strategy: FULL ---------------------------------------- (1) RenamingProof (BOTH BOUNDS(ID, ID)) Renamed function symbols to avoid clashes with predefined symbol. ---------------------------------------- (2) Obligation: The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, INF). The TRS R consists of the following rules: a__nats -> cons(0', incr(nats)) a__pairs -> cons(0', incr(odds)) a__odds -> a__incr(a__pairs) a__incr(cons(X, XS)) -> cons(s(mark(X)), incr(XS)) a__head(cons(X, XS)) -> mark(X) a__tail(cons(X, XS)) -> mark(XS) mark(nats) -> a__nats mark(incr(X)) -> a__incr(mark(X)) mark(pairs) -> a__pairs mark(odds) -> a__odds mark(head(X)) -> a__head(mark(X)) mark(tail(X)) -> a__tail(mark(X)) mark(cons(X1, X2)) -> cons(mark(X1), X2) mark(0') -> 0' mark(s(X)) -> s(mark(X)) a__nats -> nats a__incr(X) -> incr(X) a__pairs -> pairs a__odds -> odds a__head(X) -> head(X) a__tail(X) -> tail(X) S is empty. Rewrite Strategy: FULL ----------------------------------------
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runti Compl Full Rewri 10127