Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Full Rewri 10127 pair #381902281
details
property
value
status
complete
benchmark
#4.36.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n052.star.cs.uiowa.edu
space
Strategy_removed_AG01
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
291.47337389 seconds
cpu usage
307.648472211
max memory
5.370781696E9
stage attributes
key
value
output-size
18802
starexec-result
WORST_CASE(Omega(n^2), ?)
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^2), ?) 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^2, 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), 336 ms] (8) BEST (9) proven lower bound (10) LowerBoundPropagationProof [FINISHED, 0 ms] (11) BOUNDS(n^1, INF) (12) typed CpxTrs (13) RewriteLemmaProof [LOWER BOUND(ID), 66 ms] (14) typed CpxTrs (15) RewriteLemmaProof [LOWER BOUND(ID), 0 ms] (16) typed CpxTrs (17) RewriteLemmaProof [LOWER BOUND(ID), 881 ms] (18) proven lower bound (19) LowerBoundPropagationProof [FINISHED, 0 ms] (20) BOUNDS(n^2, INF) ---------------------------------------- (0) Obligation: The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^2, INF). The TRS R consists of the following rules: eq(0, 0) -> true eq(0, s(m)) -> false eq(s(n), 0) -> false eq(s(n), s(m)) -> eq(n, m) le(0, m) -> true le(s(n), 0) -> false le(s(n), s(m)) -> le(n, m) min(cons(0, nil)) -> 0 min(cons(s(n), nil)) -> s(n) min(cons(n, cons(m, x))) -> if_min(le(n, m), cons(n, cons(m, x))) if_min(true, cons(n, cons(m, x))) -> min(cons(n, x)) if_min(false, cons(n, cons(m, x))) -> min(cons(m, x)) replace(n, m, nil) -> nil replace(n, m, cons(k, x)) -> if_replace(eq(n, k), n, m, cons(k, x)) if_replace(true, n, m, cons(k, x)) -> cons(m, x) if_replace(false, n, m, cons(k, x)) -> cons(k, replace(n, m, x)) sort(nil) -> nil sort(cons(n, x)) -> cons(min(cons(n, x)), sort(replace(min(cons(n, x)), n, 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^2, INF). The TRS R consists of the following rules: eq(0', 0') -> true eq(0', s(m)) -> false eq(s(n), 0') -> false eq(s(n), s(m)) -> eq(n, m) le(0', m) -> true le(s(n), 0') -> false le(s(n), s(m)) -> le(n, m) min(cons(0', nil)) -> 0' min(cons(s(n), nil)) -> s(n) min(cons(n, cons(m, x))) -> if_min(le(n, m), cons(n, cons(m, x))) if_min(true, cons(n, cons(m, x))) -> min(cons(n, x)) if_min(false, cons(n, cons(m, x))) -> min(cons(m, x)) replace(n, m, nil) -> nil replace(n, m, cons(k, x)) -> if_replace(eq(n, k), n, m, cons(k, x)) if_replace(true, n, m, cons(k, x)) -> cons(m, x) if_replace(false, n, m, cons(k, x)) -> cons(k, replace(n, m, x)) sort(nil) -> nil sort(cons(n, x)) -> cons(min(cons(n, x)), sort(replace(min(cons(n, x)), n, 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