Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runtime_Complexity_Innermost_Rewriting 2019-04-01 06.40 pair #433313363
details
property
value
status
complete
benchmark
minsort.raml.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n043.star.cs.uiowa.edu
space
raML
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
291.672 seconds
cpu usage
361.575
user time
354.997
system time
6.57809
max virtual memory
1.9246604E7
max residence set size
8948272.0
stage attributes
key
value
starexec-result
WORST_CASE(Omega(n^1), O(n^2))
output
361.37/291.57 WORST_CASE(Omega(n^1), O(n^2)) 361.37/291.59 proof of /export/starexec/sandbox/benchmark/theBenchmark.xml 361.37/291.59 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 361.37/291.59 361.37/291.59 361.37/291.59 The Runtime Complexity (innermost) of the given CpxRelTRS could be proven to be BOUNDS(n^1, n^2). 361.37/291.59 361.37/291.59 (0) CpxRelTRS 361.37/291.59 (1) STerminationProof [BOTH CONCRETE BOUNDS(ID, ID), 199 ms] 361.37/291.59 (2) CpxRelTRS 361.37/291.59 (3) RelTrsToWeightedTrsProof [BOTH BOUNDS(ID, ID), 0 ms] 361.37/291.59 (4) CpxWeightedTrs 361.37/291.59 (5) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms] 361.37/291.59 (6) CpxTypedWeightedTrs 361.37/291.59 (7) CompletionProof [UPPER BOUND(ID), 0 ms] 361.37/291.59 (8) CpxTypedWeightedCompleteTrs 361.37/291.59 (9) NarrowingProof [BOTH BOUNDS(ID, ID), 1 ms] 361.37/291.59 (10) CpxTypedWeightedCompleteTrs 361.37/291.59 (11) CpxTypedWeightedTrsToRntsProof [UPPER BOUND(ID), 0 ms] 361.37/291.59 (12) CpxRNTS 361.37/291.59 (13) InliningProof [UPPER BOUND(ID), 718 ms] 361.37/291.59 (14) CpxRNTS 361.37/291.59 (15) SimplificationProof [BOTH BOUNDS(ID, ID), 0 ms] 361.37/291.59 (16) CpxRNTS 361.37/291.59 (17) CpxRntsAnalysisOrderProof [BOTH BOUNDS(ID, ID), 0 ms] 361.37/291.59 (18) CpxRNTS 361.37/291.59 (19) ResultPropagationProof [UPPER BOUND(ID), 0 ms] 361.37/291.59 (20) CpxRNTS 361.37/291.59 (21) IntTrsBoundProof [UPPER BOUND(ID), 1114 ms] 361.37/291.59 (22) CpxRNTS 361.37/291.59 (23) IntTrsBoundProof [UPPER BOUND(ID), 258 ms] 361.37/291.59 (24) CpxRNTS 361.37/291.59 (25) ResultPropagationProof [UPPER BOUND(ID), 0 ms] 361.37/291.59 (26) CpxRNTS 361.37/291.59 (27) IntTrsBoundProof [UPPER BOUND(ID), 383 ms] 361.37/291.59 (28) CpxRNTS 361.37/291.59 (29) IntTrsBoundProof [UPPER BOUND(ID), 83 ms] 361.37/291.59 (30) CpxRNTS 361.37/291.59 (31) ResultPropagationProof [UPPER BOUND(ID), 0 ms] 361.37/291.59 (32) CpxRNTS 361.37/291.59 (33) IntTrsBoundProof [UPPER BOUND(ID), 179 ms] 361.37/291.59 (34) CpxRNTS 361.37/291.59 (35) IntTrsBoundProof [UPPER BOUND(ID), 0 ms] 361.37/291.59 (36) CpxRNTS 361.37/291.59 (37) ResultPropagationProof [UPPER BOUND(ID), 0 ms] 361.37/291.59 (38) CpxRNTS 361.37/291.59 (39) IntTrsBoundProof [UPPER BOUND(ID), 392 ms] 361.37/291.59 (40) CpxRNTS 361.37/291.59 (41) IntTrsBoundProof [UPPER BOUND(ID), 120 ms] 361.37/291.59 (42) CpxRNTS 361.37/291.59 (43) ResultPropagationProof [UPPER BOUND(ID), 0 ms] 361.37/291.59 (44) CpxRNTS 361.37/291.59 (45) IntTrsBoundProof [UPPER BOUND(ID), 254 ms] 361.37/291.59 (46) CpxRNTS 361.37/291.59 (47) IntTrsBoundProof [UPPER BOUND(ID), 64 ms] 361.37/291.59 (48) CpxRNTS 361.37/291.59 (49) ResultPropagationProof [UPPER BOUND(ID), 0 ms] 361.37/291.59 (50) CpxRNTS 361.37/291.59 (51) IntTrsBoundProof [UPPER BOUND(ID), 268 ms] 361.37/291.59 (52) CpxRNTS 361.37/291.59 (53) IntTrsBoundProof [UPPER BOUND(ID), 74 ms] 361.37/291.59 (54) CpxRNTS 361.37/291.59 (55) ResultPropagationProof [UPPER BOUND(ID), 0 ms] 361.37/291.59 (56) CpxRNTS 361.37/291.59 (57) IntTrsBoundProof [UPPER BOUND(ID), 337 ms] 361.37/291.59 (58) CpxRNTS 361.37/291.59 (59) IntTrsBoundProof [UPPER BOUND(ID), 115 ms] 361.37/291.59 (60) CpxRNTS 361.37/291.59 (61) ResultPropagationProof [UPPER BOUND(ID), 0 ms] 361.37/291.59 (62) CpxRNTS 361.37/291.59 (63) IntTrsBoundProof [UPPER BOUND(ID), 177 ms] 361.37/291.59 (64) CpxRNTS 361.37/291.59 (65) IntTrsBoundProof [UPPER BOUND(ID), 52 ms] 361.37/291.59 (66) CpxRNTS 361.37/291.59 (67) FinalProof [FINISHED, 0 ms] 361.37/291.59 (68) BOUNDS(1, n^2) 361.37/291.59 (69) RelTrsToDecreasingLoopProblemProof [LOWER BOUND(ID), 0 ms] 361.37/291.59 (70) TRS for Loop Detection 361.37/291.59 (71) DecreasingLoopProof [LOWER BOUND(ID), 28 ms] 361.37/291.59 (72) BEST 361.37/291.59 (73) proven lower bound 361.37/291.59 (74) LowerBoundPropagationProof [FINISHED, 0 ms] 361.37/291.59 (75) BOUNDS(n^1, INF) 361.37/291.59 (76) TRS for Loop Detection 361.37/291.59 361.37/291.59 361.37/291.59 ---------------------------------------- 361.37/291.59 361.37/291.59 (0) 361.37/291.59 Obligation: 361.37/291.59 The Runtime Complexity (innermost) of the given CpxRelTRS could be proven to be BOUNDS(n^1, n^2). 361.37/291.59 361.37/291.59 361.37/291.59 The TRS R consists of the following rules: 361.37/291.59 361.37/291.59 #less(@x, @y) -> #cklt(#compare(@x, @y)) 361.37/291.59 findMin(@l) -> findMin#1(@l) 361.37/291.59 findMin#1(::(@x, @xs)) -> findMin#2(findMin(@xs), @x) 361.37/291.59 findMin#1(nil) -> nil 361.37/291.59 findMin#2(::(@y, @ys), @x) -> findMin#3(#less(@x, @y), @x, @y, @ys)
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
