Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runtime_Complexity_Innermost_Rewriting 2019-04-01 06.40 pair #433313286
details
property
value
status
complete
benchmark
selsort.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n133.star.cs.uiowa.edu
space
Rubio_04
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
292.445 seconds
cpu usage
1118.72
user time
1111.43
system time
7.28915
max virtual memory
3.7641488E7
max residence set size
6160136.0
stage attributes
key
value
starexec-result
WORST_CASE(Omega(n^2), O(n^3))
output
1116.06/291.73 WORST_CASE(Omega(n^2), O(n^3)) 1118.42/292.35 proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml 1118.42/292.35 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 1118.42/292.35 1118.42/292.35 1118.42/292.35 The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(n^2, n^3). 1118.42/292.35 1118.42/292.35 (0) CpxTRS 1118.42/292.35 (1) RelTrsToWeightedTrsProof [BOTH BOUNDS(ID, ID), 0 ms] 1118.42/292.35 (2) CpxWeightedTrs 1118.42/292.35 (3) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms] 1118.42/292.35 (4) CpxTypedWeightedTrs 1118.42/292.35 (5) CompletionProof [UPPER BOUND(ID), 0 ms] 1118.42/292.35 (6) CpxTypedWeightedCompleteTrs 1118.42/292.35 (7) NarrowingProof [BOTH BOUNDS(ID, ID), 0 ms] 1118.42/292.35 (8) CpxTypedWeightedCompleteTrs 1118.42/292.35 (9) CpxTypedWeightedTrsToRntsProof [UPPER BOUND(ID), 0 ms] 1118.42/292.35 (10) CpxRNTS 1118.42/292.35 (11) SimplificationProof [BOTH BOUNDS(ID, ID), 0 ms] 1118.42/292.35 (12) CpxRNTS 1118.42/292.35 (13) CpxRntsAnalysisOrderProof [BOTH BOUNDS(ID, ID), 0 ms] 1118.42/292.35 (14) CpxRNTS 1118.42/292.35 (15) ResultPropagationProof [UPPER BOUND(ID), 0 ms] 1118.42/292.35 (16) CpxRNTS 1118.42/292.35 (17) IntTrsBoundProof [UPPER BOUND(ID), 295 ms] 1118.42/292.35 (18) CpxRNTS 1118.42/292.35 (19) IntTrsBoundProof [UPPER BOUND(ID), 189 ms] 1118.42/292.35 (20) CpxRNTS 1118.42/292.35 (21) ResultPropagationProof [UPPER BOUND(ID), 0 ms] 1118.42/292.35 (22) CpxRNTS 1118.42/292.35 (23) IntTrsBoundProof [UPPER BOUND(ID), 473 ms] 1118.42/292.35 (24) CpxRNTS 1118.42/292.35 (25) IntTrsBoundProof [UPPER BOUND(ID), 156 ms] 1118.42/292.35 (26) CpxRNTS 1118.42/292.35 (27) ResultPropagationProof [UPPER BOUND(ID), 0 ms] 1118.42/292.35 (28) CpxRNTS 1118.42/292.35 (29) IntTrsBoundProof [UPPER BOUND(ID), 766 ms] 1118.42/292.35 (30) CpxRNTS 1118.42/292.35 (31) IntTrsBoundProof [UPPER BOUND(ID), 263 ms] 1118.42/292.35 (32) CpxRNTS 1118.42/292.35 (33) ResultPropagationProof [UPPER BOUND(ID), 0 ms] 1118.42/292.35 (34) CpxRNTS 1118.42/292.35 (35) IntTrsBoundProof [UPPER BOUND(ID), 861 ms] 1118.42/292.35 (36) CpxRNTS 1118.42/292.35 (37) IntTrsBoundProof [UPPER BOUND(ID), 211 ms] 1118.42/292.35 (38) CpxRNTS 1118.42/292.35 (39) ResultPropagationProof [UPPER BOUND(ID), 0 ms] 1118.42/292.35 (40) CpxRNTS 1118.42/292.35 (41) IntTrsBoundProof [UPPER BOUND(ID), 1318 ms] 1118.42/292.35 (42) CpxRNTS 1118.42/292.35 (43) IntTrsBoundProof [UPPER BOUND(ID), 565 ms] 1118.42/292.35 (44) CpxRNTS 1118.42/292.35 (45) FinalProof [FINISHED, 0 ms] 1118.42/292.35 (46) BOUNDS(1, n^3) 1118.42/292.35 (47) RenamingProof [BOTH BOUNDS(ID, ID), 0 ms] 1118.42/292.35 (48) CpxTRS 1118.42/292.35 (49) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms] 1118.42/292.35 (50) typed CpxTrs 1118.42/292.35 (51) OrderProof [LOWER BOUND(ID), 5 ms] 1118.42/292.35 (52) typed CpxTrs 1118.42/292.35 (53) RewriteLemmaProof [LOWER BOUND(ID), 261 ms] 1118.42/292.35 (54) BEST 1118.42/292.35 (55) proven lower bound 1118.42/292.35 (56) LowerBoundPropagationProof [FINISHED, 0 ms] 1118.42/292.35 (57) BOUNDS(n^1, INF) 1118.42/292.35 (58) typed CpxTrs 1118.42/292.35 (59) RewriteLemmaProof [LOWER BOUND(ID), 47 ms] 1118.42/292.35 (60) typed CpxTrs 1118.42/292.35 (61) RewriteLemmaProof [LOWER BOUND(ID), 5 ms] 1118.42/292.35 (62) typed CpxTrs 1118.42/292.35 (63) RewriteLemmaProof [LOWER BOUND(ID), 66 ms] 1118.42/292.35 (64) proven lower bound 1118.42/292.35 (65) LowerBoundPropagationProof [FINISHED, 0 ms] 1118.42/292.35 (66) BOUNDS(n^2, INF) 1118.42/292.35 1118.42/292.35 1118.42/292.35 ---------------------------------------- 1118.42/292.35 1118.42/292.35 (0) 1118.42/292.35 Obligation: 1118.42/292.35 The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(n^2, n^3). 1118.42/292.35 1118.42/292.35 1118.42/292.35 The TRS R consists of the following rules: 1118.42/292.35 1118.42/292.35 eq(0, 0) -> true 1118.42/292.35 eq(0, s(Y)) -> false 1118.42/292.35 eq(s(X), 0) -> false 1118.42/292.35 eq(s(X), s(Y)) -> eq(X, Y) 1118.42/292.35 le(0, Y) -> true 1118.42/292.35 le(s(X), 0) -> false 1118.42/292.35 le(s(X), s(Y)) -> le(X, Y) 1118.42/292.35 min(cons(0, nil)) -> 0 1118.42/292.35 min(cons(s(N), nil)) -> s(N) 1118.42/292.35 min(cons(N, cons(M, L))) -> ifmin(le(N, M), cons(N, cons(M, L))) 1118.42/292.35 ifmin(true, cons(N, cons(M, L))) -> min(cons(N, L)) 1118.42/292.35 ifmin(false, cons(N, cons(M, L))) -> min(cons(M, L)) 1118.42/292.35 replace(N, M, nil) -> nil 1118.42/292.35 replace(N, M, cons(K, L)) -> ifrepl(eq(N, K), N, M, cons(K, L)) 1118.42/292.35 ifrepl(true, N, M, cons(K, L)) -> cons(M, L)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runtime_Complexity_Innermost_Rewriting 2019-04-01 06.40
