Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Haskell 2019-04-01 06.52 pair #433316311
details
property
value
status
complete
benchmark
FiniteMap_listToFM_9.hs
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n176.star.cs.uiowa.edu
space
full_haskell
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
13.3017 seconds
cpu usage
32.5707
user time
31.3524
system time
1.2183
max virtual memory
1.8285568E7
max residence set size
3969636.0
stage attributes
key
value
starexec-result
YES
output
28.69/12.24 YES 31.00/12.89 proof of /export/starexec/sandbox/benchmark/theBenchmark.hs 31.00/12.89 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 31.00/12.89 31.00/12.89 31.00/12.89 H-Termination with start terms of the given HASKELL could be proven: 31.00/12.89 31.00/12.89 (0) HASKELL 31.00/12.89 (1) LR [EQUIVALENT, 0 ms] 31.00/12.89 (2) HASKELL 31.00/12.89 (3) CR [EQUIVALENT, 0 ms] 31.00/12.89 (4) HASKELL 31.00/12.89 (5) IFR [EQUIVALENT, 0 ms] 31.00/12.89 (6) HASKELL 31.00/12.89 (7) BR [EQUIVALENT, 0 ms] 31.00/12.89 (8) HASKELL 31.00/12.89 (9) COR [EQUIVALENT, 0 ms] 31.00/12.89 (10) HASKELL 31.00/12.89 (11) LetRed [EQUIVALENT, 0 ms] 31.00/12.89 (12) HASKELL 31.00/12.89 (13) NumRed [SOUND, 0 ms] 31.00/12.89 (14) HASKELL 31.00/12.89 (15) Narrow [SOUND, 0 ms] 31.00/12.89 (16) AND 31.00/12.89 (17) QDP 31.00/12.89 (18) QDPSizeChangeProof [EQUIVALENT, 0 ms] 31.00/12.89 (19) YES 31.00/12.89 (20) QDP 31.00/12.89 (21) DependencyGraphProof [EQUIVALENT, 0 ms] 31.00/12.89 (22) AND 31.00/12.89 (23) QDP 31.00/12.89 (24) TransformationProof [EQUIVALENT, 1935 ms] 31.00/12.89 (25) QDP 31.00/12.89 (26) DependencyGraphProof [EQUIVALENT, 0 ms] 31.00/12.89 (27) QDP 31.00/12.89 (28) TransformationProof [EQUIVALENT, 0 ms] 31.00/12.89 (29) QDP 31.00/12.89 (30) TransformationProof [EQUIVALENT, 0 ms] 31.00/12.90 (31) QDP 31.00/12.90 (32) TransformationProof [EQUIVALENT, 0 ms] 31.00/12.90 (33) QDP 31.00/12.90 (34) QDPSizeChangeProof [EQUIVALENT, 0 ms] 31.00/12.90 (35) YES 31.00/12.90 (36) QDP 31.00/12.90 (37) QDPSizeChangeProof [EQUIVALENT, 0 ms] 31.00/12.90 (38) YES 31.00/12.90 (39) QDP 31.00/12.90 (40) QDPSizeChangeProof [EQUIVALENT, 0 ms] 31.00/12.90 (41) YES 31.00/12.90 (42) QDP 31.00/12.90 (43) QDPSizeChangeProof [EQUIVALENT, 0 ms] 31.00/12.90 (44) YES 31.00/12.90 (45) QDP 31.00/12.90 (46) QDPSizeChangeProof [EQUIVALENT, 69 ms] 31.00/12.90 (47) YES 31.00/12.90 (48) QDP 31.00/12.90 (49) QDPSizeChangeProof [EQUIVALENT, 0 ms] 31.00/12.90 (50) YES 31.00/12.90 (51) QDP 31.00/12.90 (52) QDPSizeChangeProof [EQUIVALENT, 0 ms] 31.00/12.90 (53) YES 31.00/12.90 (54) QDP 31.00/12.90 (55) QDPSizeChangeProof [EQUIVALENT, 0 ms] 31.00/12.90 (56) YES 31.00/12.90 (57) QDP 31.00/12.90 (58) QDPSizeChangeProof [EQUIVALENT, 0 ms] 31.00/12.90 (59) YES 31.00/12.90 31.00/12.90 31.00/12.90 ---------------------------------------- 31.00/12.90 31.00/12.90 (0) 31.00/12.90 Obligation: 31.00/12.90 mainModule Main 31.00/12.90 module FiniteMap where { 31.00/12.90 import qualified Main; 31.00/12.90 import qualified Maybe; 31.00/12.90 import qualified Prelude; 31.00/12.90 data FiniteMap b a = EmptyFM | Branch b a Int (FiniteMap b a) (FiniteMap b a) ; 31.00/12.90 31.00/12.90 instance (Eq a, Eq b) => Eq FiniteMap a b where { 31.00/12.90 (==) fm_1 fm_2 = sizeFM fm_1 == sizeFM fm_2 && fmToList fm_1 == fmToList fm_2; 31.00/12.90 } 31.00/12.90 addListToFM :: Ord b => FiniteMap b a -> [(b,a)] -> FiniteMap b a; 31.00/12.90 addListToFM fm key_elt_pairs = addListToFM_C (\old new ->new) fm key_elt_pairs; 31.00/12.90 31.00/12.90 addListToFM_C :: Ord a => (b -> b -> b) -> FiniteMap a b -> [(a,b)] -> FiniteMap a b; 31.00/12.90 addListToFM_C combiner fm key_elt_pairs = foldl add fm key_elt_pairs where { 31.00/12.90 add fmap (key,elt) = addToFM_C combiner fmap key elt; 31.00/12.90 }; 31.00/12.90 31.00/12.90 addToFM_C :: Ord b => (a -> a -> a) -> FiniteMap b a -> b -> a -> FiniteMap b a; 31.00/12.90 addToFM_C combiner EmptyFM key elt = unitFM key elt; 31.00/12.90 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 31.00/12.90 | new_key > key = mkBalBranch key elt fm_l (addToFM_C combiner fm_r new_key new_elt) 31.00/12.90 | otherwise = Branch new_key (combiner elt new_elt) size fm_l fm_r; 31.00/12.90 31.00/12.90 emptyFM :: FiniteMap a b; 31.00/12.90 emptyFM = EmptyFM; 31.00/12.90
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Haskell 2019-04-01 06.52