Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Haskell 2019-04-01 06.52 pair #433316957
details
property
value
status
complete
benchmark
FiniteMap_addListToFM_C_1.hs
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n113.star.cs.uiowa.edu
space
full_haskell
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
15.1467 seconds
cpu usage
33.7396
user time
32.4976
system time
1.24203
max virtual memory
1.8285568E7
max residence set size
3978848.0
stage attributes
key
value
starexec-result
YES
output
30.13/14.11 YES 32.63/14.80 proof of /export/starexec/sandbox/benchmark/theBenchmark.hs 32.63/14.80 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 32.63/14.80 32.63/14.80 32.63/14.80 H-Termination with start terms of the given HASKELL could be proven: 32.63/14.80 32.63/14.80 (0) HASKELL 32.63/14.80 (1) LR [EQUIVALENT, 0 ms] 32.63/14.80 (2) HASKELL 32.63/14.80 (3) CR [EQUIVALENT, 0 ms] 32.63/14.80 (4) HASKELL 32.63/14.80 (5) IFR [EQUIVALENT, 0 ms] 32.63/14.80 (6) HASKELL 32.63/14.80 (7) BR [EQUIVALENT, 3 ms] 32.63/14.80 (8) HASKELL 32.63/14.80 (9) COR [EQUIVALENT, 0 ms] 32.63/14.80 (10) HASKELL 32.63/14.80 (11) LetRed [EQUIVALENT, 0 ms] 32.63/14.80 (12) HASKELL 32.63/14.80 (13) NumRed [SOUND, 0 ms] 32.63/14.80 (14) HASKELL 32.63/14.80 (15) Narrow [SOUND, 0 ms] 32.63/14.80 (16) AND 32.63/14.80 (17) QDP 32.63/14.80 (18) QDPSizeChangeProof [EQUIVALENT, 0 ms] 32.63/14.80 (19) YES 32.63/14.80 (20) QDP 32.63/14.80 (21) QDPSizeChangeProof [EQUIVALENT, 21 ms] 32.63/14.80 (22) YES 32.63/14.80 (23) QDP 32.63/14.80 (24) QDPSizeChangeProof [EQUIVALENT, 185 ms] 32.63/14.80 (25) YES 32.63/14.80 (26) QDP 32.63/14.80 (27) QDPSizeChangeProof [EQUIVALENT, 0 ms] 32.63/14.80 (28) YES 32.63/14.80 (29) QDP 32.63/14.80 (30) QDPSizeChangeProof [EQUIVALENT, 0 ms] 32.63/14.80 (31) YES 32.63/14.80 (32) QDP 32.63/14.80 (33) QDPSizeChangeProof [EQUIVALENT, 0 ms] 32.63/14.80 (34) YES 32.71/14.80 (35) QDP 32.71/14.80 (36) QDPSizeChangeProof [EQUIVALENT, 0 ms] 32.71/14.80 (37) YES 32.71/14.80 (38) QDP 32.71/14.80 (39) QDPSizeChangeProof [EQUIVALENT, 0 ms] 32.71/14.80 (40) YES 32.71/14.80 (41) QDP 32.71/14.80 (42) QDPSizeChangeProof [EQUIVALENT, 0 ms] 32.71/14.80 (43) YES 32.71/14.80 32.71/14.80 32.71/14.80 ---------------------------------------- 32.71/14.80 32.71/14.80 (0) 32.71/14.80 Obligation: 32.71/14.80 mainModule Main 32.71/14.80 module FiniteMap where { 32.71/14.80 import qualified Main; 32.71/14.80 import qualified Maybe; 32.71/14.80 import qualified Prelude; 32.71/14.80 data FiniteMap b a = EmptyFM | Branch b a Int (FiniteMap b a) (FiniteMap b a) ; 32.71/14.80 32.71/14.80 instance (Eq a, Eq b) => Eq FiniteMap a b where { 32.71/14.80 (==) fm_1 fm_2 = sizeFM fm_1 == sizeFM fm_2 && fmToList fm_1 == fmToList fm_2; 32.71/14.80 } 32.71/14.80 addListToFM_C :: Ord a => (b -> b -> b) -> FiniteMap a b -> [(a,b)] -> FiniteMap a b; 32.71/14.80 addListToFM_C combiner fm key_elt_pairs = foldl add fm key_elt_pairs where { 32.71/14.80 add fmap (key,elt) = addToFM_C combiner fmap key elt; 32.71/14.80 }; 32.71/14.80 32.71/14.80 addToFM_C :: Ord a => (b -> b -> b) -> FiniteMap a b -> a -> b -> FiniteMap a b; 32.71/14.80 addToFM_C combiner EmptyFM key elt = unitFM key elt; 32.71/14.80 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 32.71/14.80 | new_key > key = mkBalBranch key elt fm_l (addToFM_C combiner fm_r new_key new_elt) 32.71/14.80 | otherwise = Branch new_key (combiner elt new_elt) size fm_l fm_r; 32.71/14.80 32.71/14.80 emptyFM :: FiniteMap b a; 32.71/14.80 emptyFM = EmptyFM; 32.71/14.80 32.71/14.80 findMax :: FiniteMap a b -> (a,b); 32.71/14.80 findMax (Branch key elt _ _ EmptyFM) = (key,elt); 32.71/14.80 findMax (Branch key elt _ _ fm_r) = findMax fm_r; 32.71/14.80 32.71/14.80 findMin :: FiniteMap a b -> (a,b); 32.71/14.80 findMin (Branch key elt _ EmptyFM _) = (key,elt); 32.71/14.80 findMin (Branch key elt _ fm_l _) = findMin fm_l; 32.71/14.80 32.71/14.80 fmToList :: FiniteMap b a -> [(b,a)]; 32.71/14.80 fmToList fm = foldFM (\key elt rest ->(key,elt) : rest) [] fm; 32.71/14.80 32.71/14.80 foldFM :: (a -> b -> c -> c) -> c -> FiniteMap a b -> c; 32.71/14.80 foldFM k z EmptyFM = z; 32.71/14.80 foldFM k z (Branch key elt _ fm_l fm_r) = foldFM k (k key elt (foldFM k z fm_r)) fm_l; 32.71/14.80 32.71/14.80 mkBalBranch :: Ord a => a -> b -> FiniteMap a b -> FiniteMap a b -> FiniteMap a b; 32.71/14.80 mkBalBranch key elt fm_L fm_R | size_l + size_r < 2 = mkBranch 1 key elt fm_L fm_R 32.71/14.80 | size_r > sIZE_RATIO * size_l = case fm_R of { 32.71/14.80 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