Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runtime_Complexity_Full_Rewriting 2019-04-01 06.11 pair #433307839
details
property
value
status
complete
benchmark
quick.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n177.star.cs.uiowa.edu
space
Rubio_04
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
291.593 seconds
cpu usage
311.071
user time
309.228
system time
1.84329
max virtual memory
1.8281556E7
max residence set size
5248640.0
stage attributes
key
value
starexec-result
WORST_CASE(Omega(n^2), ?)
output
310.94/291.55 WORST_CASE(Omega(n^2), ?) 310.94/291.56 proof of /export/starexec/sandbox/benchmark/theBenchmark.xml 310.94/291.56 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 310.94/291.56 310.94/291.56 310.94/291.56 The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^2, INF). 310.94/291.56 310.94/291.56 (0) CpxTRS 310.94/291.56 (1) RenamingProof [BOTH BOUNDS(ID, ID), 0 ms] 310.94/291.56 (2) CpxTRS 310.94/291.56 (3) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms] 310.94/291.56 (4) typed CpxTrs 310.94/291.56 (5) OrderProof [LOWER BOUND(ID), 0 ms] 310.94/291.56 (6) typed CpxTrs 310.94/291.56 (7) RewriteLemmaProof [LOWER BOUND(ID), 291 ms] 310.94/291.56 (8) BEST 310.94/291.56 (9) proven lower bound 310.94/291.56 (10) LowerBoundPropagationProof [FINISHED, 0 ms] 310.94/291.56 (11) BOUNDS(n^1, INF) 310.94/291.56 (12) typed CpxTrs 310.94/291.56 (13) RewriteLemmaProof [LOWER BOUND(ID), 86 ms] 310.94/291.56 (14) typed CpxTrs 310.94/291.56 (15) RewriteLemmaProof [LOWER BOUND(ID), 16 ms] 310.94/291.56 (16) typed CpxTrs 310.94/291.56 (17) RewriteLemmaProof [LOWER BOUND(ID), 23 ms] 310.94/291.56 (18) typed CpxTrs 310.94/291.56 (19) RewriteLemmaProof [LOWER BOUND(ID), 88 ms] 310.94/291.56 (20) proven lower bound 310.94/291.56 (21) LowerBoundPropagationProof [FINISHED, 0 ms] 310.94/291.56 (22) BOUNDS(n^2, INF) 310.94/291.56 310.94/291.56 310.94/291.56 ---------------------------------------- 310.94/291.56 310.94/291.56 (0) 310.94/291.56 Obligation: 310.94/291.56 The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^2, INF). 310.94/291.56 310.94/291.56 310.94/291.56 The TRS R consists of the following rules: 310.94/291.56 310.94/291.56 le(0, Y) -> true 310.94/291.56 le(s(X), 0) -> false 310.94/291.56 le(s(X), s(Y)) -> le(X, Y) 310.94/291.56 app(nil, Y) -> Y 310.94/291.56 app(cons(N, L), Y) -> cons(N, app(L, Y)) 310.94/291.56 low(N, nil) -> nil 310.94/291.56 low(N, cons(M, L)) -> iflow(le(M, N), N, cons(M, L)) 310.94/291.56 iflow(true, N, cons(M, L)) -> cons(M, low(N, L)) 310.94/291.56 iflow(false, N, cons(M, L)) -> low(N, L) 310.94/291.56 high(N, nil) -> nil 310.94/291.56 high(N, cons(M, L)) -> ifhigh(le(M, N), N, cons(M, L)) 310.94/291.56 ifhigh(true, N, cons(M, L)) -> high(N, L) 310.94/291.56 ifhigh(false, N, cons(M, L)) -> cons(M, high(N, L)) 310.94/291.56 quicksort(nil) -> nil 310.94/291.56 quicksort(cons(N, L)) -> app(quicksort(low(N, L)), cons(N, quicksort(high(N, L)))) 310.94/291.56 310.94/291.56 S is empty. 310.94/291.56 Rewrite Strategy: FULL 310.94/291.56 ---------------------------------------- 310.94/291.56 310.94/291.56 (1) RenamingProof (BOTH BOUNDS(ID, ID)) 310.94/291.56 Renamed function symbols to avoid clashes with predefined symbol. 310.94/291.56 ---------------------------------------- 310.94/291.56 310.94/291.56 (2) 310.94/291.56 Obligation: 310.94/291.56 The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^2, INF). 310.94/291.56 310.94/291.56 310.94/291.56 The TRS R consists of the following rules: 310.94/291.56 310.94/291.56 le(0', Y) -> true 310.94/291.56 le(s(X), 0') -> false 310.94/291.56 le(s(X), s(Y)) -> le(X, Y) 310.94/291.56 app(nil, Y) -> Y 310.94/291.56 app(cons(N, L), Y) -> cons(N, app(L, Y)) 310.94/291.56 low(N, nil) -> nil 310.94/291.56 low(N, cons(M, L)) -> iflow(le(M, N), N, cons(M, L)) 310.94/291.56 iflow(true, N, cons(M, L)) -> cons(M, low(N, L)) 310.94/291.56 iflow(false, N, cons(M, L)) -> low(N, L) 310.94/291.56 high(N, nil) -> nil 310.94/291.56 high(N, cons(M, L)) -> ifhigh(le(M, N), N, cons(M, L)) 310.94/291.56 ifhigh(true, N, cons(M, L)) -> high(N, L) 310.94/291.56 ifhigh(false, N, cons(M, L)) -> cons(M, high(N, L)) 310.94/291.56 quicksort(nil) -> nil 310.94/291.56 quicksort(cons(N, L)) -> app(quicksort(low(N, L)), cons(N, quicksort(high(N, L)))) 310.94/291.56 310.94/291.56 S is empty. 310.94/291.56 Rewrite Strategy: FULL 310.94/291.56 ---------------------------------------- 310.94/291.56 310.94/291.56 (3) TypeInferenceProof (BOTH BOUNDS(ID, ID)) 310.94/291.56 Infered types. 310.94/291.56 ---------------------------------------- 310.94/291.56 310.94/291.56 (4) 310.94/291.56 Obligation: 310.94/291.56 TRS: 310.94/291.56 Rules:
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
