Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Haskell 2019-04-01 06.52 pair #433316171
details
property
value
status
complete
benchmark
FiniteMap_plusFM_8.hs
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n177.star.cs.uiowa.edu
space
full_haskell
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
11.4348 seconds
cpu usage
27.7927
user time
26.7051
system time
1.08755
max virtual memory
1.8285568E7
max residence set size
3448488.0
stage attributes
key
value
starexec-result
YES
output
23.75/10.37 YES 26.71/11.13 proof of /export/starexec/sandbox/benchmark/theBenchmark.hs 26.71/11.13 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 26.71/11.13 26.71/11.13 26.71/11.13 H-Termination with start terms of the given HASKELL could be proven: 26.71/11.13 26.71/11.13 (0) HASKELL 26.71/11.13 (1) LR [EQUIVALENT, 0 ms] 26.71/11.13 (2) HASKELL 26.71/11.13 (3) CR [EQUIVALENT, 0 ms] 26.71/11.13 (4) HASKELL 26.71/11.13 (5) BR [EQUIVALENT, 0 ms] 26.71/11.13 (6) HASKELL 26.71/11.13 (7) COR [EQUIVALENT, 13 ms] 26.71/11.13 (8) HASKELL 26.71/11.13 (9) LetRed [EQUIVALENT, 0 ms] 26.71/11.13 (10) HASKELL 26.71/11.13 (11) NumRed [SOUND, 18 ms] 26.71/11.13 (12) HASKELL 26.71/11.13 (13) Narrow [SOUND, 0 ms] 26.71/11.13 (14) AND 26.71/11.13 (15) QDP 26.71/11.13 (16) QDPSizeChangeProof [EQUIVALENT, 0 ms] 26.71/11.13 (17) YES 26.71/11.13 (18) QDP 26.71/11.13 (19) QDPSizeChangeProof [EQUIVALENT, 0 ms] 26.71/11.13 (20) YES 26.71/11.13 (21) QDP 26.71/11.13 (22) DependencyGraphProof [EQUIVALENT, 0 ms] 26.71/11.13 (23) AND 26.71/11.13 (24) QDP 26.71/11.13 (25) QDPSizeChangeProof [EQUIVALENT, 0 ms] 26.71/11.13 (26) YES 26.71/11.13 (27) QDP 26.71/11.13 (28) QDPSizeChangeProof [EQUIVALENT, 0 ms] 26.71/11.13 (29) YES 26.71/11.13 (30) QDP 26.71/11.13 (31) QDPSizeChangeProof [EQUIVALENT, 0 ms] 26.71/11.13 (32) YES 26.71/11.13 (33) QDP 26.71/11.13 (34) DependencyGraphProof [EQUIVALENT, 0 ms] 26.71/11.13 (35) AND 26.71/11.13 (36) QDP 26.71/11.13 (37) QDPSizeChangeProof [EQUIVALENT, 0 ms] 26.71/11.13 (38) YES 26.71/11.13 (39) QDP 26.71/11.13 (40) QDPSizeChangeProof [EQUIVALENT, 0 ms] 26.71/11.13 (41) YES 26.71/11.13 (42) QDP 26.71/11.13 (43) QDPSizeChangeProof [EQUIVALENT, 0 ms] 26.71/11.13 (44) YES 26.71/11.13 (45) QDP 26.71/11.13 (46) QDPSizeChangeProof [EQUIVALENT, 0 ms] 26.71/11.13 (47) YES 26.71/11.13 (48) QDP 26.71/11.13 (49) QDPSizeChangeProof [EQUIVALENT, 0 ms] 26.71/11.13 (50) YES 26.71/11.13 (51) QDP 26.71/11.13 (52) QDPSizeChangeProof [EQUIVALENT, 0 ms] 26.71/11.13 (53) YES 26.71/11.13 26.71/11.13 26.71/11.13 ---------------------------------------- 26.71/11.13 26.71/11.13 (0) 26.71/11.13 Obligation: 26.71/11.13 mainModule Main 26.71/11.13 module FiniteMap where { 26.71/11.13 import qualified Main; 26.71/11.13 import qualified Maybe; 26.71/11.13 import qualified Prelude; 26.71/11.13 data FiniteMap b a = EmptyFM | Branch b a Int (FiniteMap b a) (FiniteMap b a) ; 26.71/11.13 26.71/11.13 instance (Eq a, Eq b) => Eq FiniteMap a b where { 26.71/11.13 } 26.71/11.13 addToFM :: Ord a => FiniteMap a b -> a -> b -> FiniteMap a b; 26.71/11.13 addToFM fm key elt = addToFM_C (\old new ->new) fm key elt; 26.71/11.13 26.71/11.13 addToFM_C :: Ord a => (b -> b -> b) -> FiniteMap a b -> a -> b -> FiniteMap a b; 26.71/11.13 addToFM_C combiner EmptyFM key elt = unitFM key elt; 26.71/11.13 addToFM_C combiner (Branch key elt size fm_l fm_r) new_key new_elt | new_key < key = mkBalBranch key elt (addToFM_C combiner fm_l new_key new_elt) fm_r 26.71/11.13 | new_key > key = mkBalBranch key elt fm_l (addToFM_C combiner fm_r new_key new_elt) 26.71/11.13 | otherwise = Branch new_key (combiner elt new_elt) size fm_l fm_r; 26.71/11.13 26.71/11.13 emptyFM :: FiniteMap a b; 26.71/11.13 emptyFM = EmptyFM; 26.71/11.13 26.71/11.13 findMax :: FiniteMap a b -> (a,b); 26.71/11.13 findMax (Branch key elt _ _ EmptyFM) = (key,elt); 26.71/11.13 findMax (Branch key elt _ _ fm_r) = findMax fm_r; 26.71/11.13 26.71/11.13 findMin :: FiniteMap b a -> (b,a); 26.71/11.13 findMin (Branch key elt _ EmptyFM _) = (key,elt); 26.71/11.13 findMin (Branch key elt _ fm_l _) = findMin fm_l; 26.71/11.13 26.71/11.13 mkBalBranch :: Ord b => b -> a -> FiniteMap b a -> FiniteMap b a -> FiniteMap b a; 26.71/11.13 mkBalBranch key elt fm_L fm_R | size_l + size_r < 2 = mkBranch 1 key elt fm_L fm_R 26.71/11.13 | size_r > sIZE_RATIO * size_l = case fm_R of { 26.71/11.13 Branch _ _ _ fm_rl fm_rr | sizeFM fm_rl < 2 * sizeFM fm_rr -> single_L fm_L fm_R
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Haskell 2019-04-01 06.52