Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runtime_Complexity_Full_Rewriting 2019-04-01 06.11 pair #433307603
details
property
value
status
complete
benchmark
minsort.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n031.star.cs.uiowa.edu
space
AProVE_09_Inductive
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
291.552 seconds
cpu usage
306.794
user time
305.146
system time
1.64815
max virtual memory
1.8281416E7
max residence set size
5169272.0
stage attributes
key
value
starexec-result
WORST_CASE(Omega(n^1), ?)
output
306.62/291.49 WORST_CASE(Omega(n^1), ?) 306.62/291.50 proof of /export/starexec/sandbox/benchmark/theBenchmark.xml 306.62/291.50 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 306.62/291.50 306.62/291.50 306.62/291.50 The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, INF). 306.62/291.50 306.62/291.50 (0) CpxTRS 306.62/291.50 (1) RenamingProof [BOTH BOUNDS(ID, ID), 0 ms] 306.62/291.50 (2) CpxTRS 306.62/291.50 (3) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms] 306.62/291.50 (4) typed CpxTrs 306.62/291.50 (5) OrderProof [LOWER BOUND(ID), 0 ms] 306.62/291.50 (6) typed CpxTrs 306.62/291.50 (7) RewriteLemmaProof [LOWER BOUND(ID), 266 ms] 306.62/291.50 (8) BEST 306.62/291.50 (9) proven lower bound 306.62/291.50 (10) LowerBoundPropagationProof [FINISHED, 0 ms] 306.62/291.50 (11) BOUNDS(n^1, INF) 306.62/291.50 (12) typed CpxTrs 306.62/291.50 (13) RewriteLemmaProof [LOWER BOUND(ID), 36 ms] 306.62/291.50 (14) typed CpxTrs 306.62/291.50 (15) RewriteLemmaProof [LOWER BOUND(ID), 7 ms] 306.62/291.50 (16) typed CpxTrs 306.62/291.50 (17) RewriteLemmaProof [LOWER BOUND(ID), 8 ms] 306.62/291.50 (18) typed CpxTrs 306.62/291.50 306.62/291.50 306.62/291.50 ---------------------------------------- 306.62/291.50 306.62/291.50 (0) 306.62/291.50 Obligation: 306.62/291.50 The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, INF). 306.62/291.50 306.62/291.50 306.62/291.50 The TRS R consists of the following rules: 306.62/291.50 306.62/291.50 le(0, y) -> true 306.62/291.50 le(s(x), 0) -> false 306.62/291.50 le(s(x), s(y)) -> le(x, y) 306.62/291.50 eq(0, 0) -> true 306.62/291.50 eq(0, s(y)) -> false 306.62/291.50 eq(s(x), 0) -> false 306.62/291.50 eq(s(x), s(y)) -> eq(x, y) 306.62/291.50 minsort(nil) -> nil 306.62/291.50 minsort(cons(x, xs)) -> cons(min(cons(x, xs)), minsort(rm(min(cons(x, xs)), cons(x, xs)))) 306.62/291.50 min(nil) -> 0 306.62/291.50 min(cons(x, nil)) -> x 306.62/291.50 min(cons(x, cons(y, xs))) -> if1(le(x, y), x, y, xs) 306.62/291.50 if1(true, x, y, xs) -> min(cons(x, xs)) 306.62/291.50 if1(false, x, y, xs) -> min(cons(y, xs)) 306.62/291.50 rm(x, nil) -> nil 306.62/291.50 rm(x, cons(y, xs)) -> if2(eq(x, y), x, y, xs) 306.62/291.50 if2(true, x, y, xs) -> rm(x, xs) 306.62/291.50 if2(false, x, y, xs) -> cons(y, rm(x, xs)) 306.62/291.50 306.62/291.50 S is empty. 306.62/291.50 Rewrite Strategy: FULL 306.62/291.50 ---------------------------------------- 306.62/291.50 306.62/291.50 (1) RenamingProof (BOTH BOUNDS(ID, ID)) 306.62/291.50 Renamed function symbols to avoid clashes with predefined symbol. 306.62/291.50 ---------------------------------------- 306.62/291.50 306.62/291.50 (2) 306.62/291.50 Obligation: 306.62/291.50 The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, INF). 306.62/291.50 306.62/291.50 306.62/291.50 The TRS R consists of the following rules: 306.62/291.50 306.62/291.50 le(0', y) -> true 306.62/291.50 le(s(x), 0') -> false 306.62/291.50 le(s(x), s(y)) -> le(x, y) 306.62/291.50 eq(0', 0') -> true 306.62/291.50 eq(0', s(y)) -> false 306.62/291.50 eq(s(x), 0') -> false 306.62/291.50 eq(s(x), s(y)) -> eq(x, y) 306.62/291.50 minsort(nil) -> nil 306.62/291.50 minsort(cons(x, xs)) -> cons(min(cons(x, xs)), minsort(rm(min(cons(x, xs)), cons(x, xs)))) 306.62/291.50 min(nil) -> 0' 306.62/291.50 min(cons(x, nil)) -> x 306.62/291.50 min(cons(x, cons(y, xs))) -> if1(le(x, y), x, y, xs) 306.62/291.50 if1(true, x, y, xs) -> min(cons(x, xs)) 306.62/291.50 if1(false, x, y, xs) -> min(cons(y, xs)) 306.62/291.50 rm(x, nil) -> nil 306.62/291.50 rm(x, cons(y, xs)) -> if2(eq(x, y), x, y, xs) 306.62/291.50 if2(true, x, y, xs) -> rm(x, xs) 306.62/291.50 if2(false, x, y, xs) -> cons(y, rm(x, xs)) 306.62/291.50 306.62/291.50 S is empty. 306.62/291.50 Rewrite Strategy: FULL 306.62/291.50 ---------------------------------------- 306.62/291.50 306.62/291.50 (3) TypeInferenceProof (BOTH BOUNDS(ID, ID)) 306.62/291.50 Infered types. 306.62/291.50 ---------------------------------------- 306.62/291.50 306.62/291.50 (4) 306.62/291.50 Obligation:
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
