details

property	value
status	complete
benchmark	FiniteMap_listToFM_12.hs
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n086.star.cs.uiowa.edu
space	full_haskell

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	13.7924 seconds
cpu usage	35.6938
user time	34.4584
system time	1.23544
max virtual memory	1.8287616E7
max residence set size	3961348.0

stage attributes

key	value
starexec-result	YES

output

31.96/12.71 YES 34.22/13.41 proof of /export/starexec/sandbox/benchmark/theBenchmark.hs 34.22/13.41 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 34.22/13.41 34.22/13.41 34.22/13.41 H-Termination with start terms of the given HASKELL could be proven: 34.22/13.41 34.22/13.41 (0) HASKELL 34.22/13.41 (1) LR [EQUIVALENT, 0 ms] 34.22/13.41 (2) HASKELL 34.22/13.41 (3) CR [EQUIVALENT, 0 ms] 34.22/13.41 (4) HASKELL 34.22/13.41 (5) IFR [EQUIVALENT, 0 ms] 34.22/13.41 (6) HASKELL 34.22/13.41 (7) BR [EQUIVALENT, 2 ms] 34.22/13.41 (8) HASKELL 34.22/13.41 (9) COR [EQUIVALENT, 0 ms] 34.22/13.41 (10) HASKELL 34.22/13.41 (11) LetRed [EQUIVALENT, 0 ms] 34.22/13.41 (12) HASKELL 34.22/13.41 (13) NumRed [SOUND, 0 ms] 34.22/13.41 (14) HASKELL 34.22/13.41 (15) Narrow [SOUND, 0 ms] 34.22/13.41 (16) AND 34.22/13.41 (17) QDP 34.22/13.41 (18) QDPSizeChangeProof [EQUIVALENT, 0 ms] 34.22/13.41 (19) YES 34.22/13.41 (20) QDP 34.22/13.41 (21) TransformationProof [EQUIVALENT, 2320 ms] 34.22/13.41 (22) QDP 34.22/13.41 (23) QDPSizeChangeProof [EQUIVALENT, 0 ms] 34.22/13.41 (24) YES 34.22/13.41 (25) QDP 34.22/13.41 (26) QDPSizeChangeProof [EQUIVALENT, 36 ms] 34.22/13.41 (27) YES 34.22/13.41 (28) QDP 34.22/13.41 (29) QDPSizeChangeProof [EQUIVALENT, 60 ms] 34.22/13.41 (30) YES 34.22/13.41 (31) QDP 34.22/13.41 (32) QDPSizeChangeProof [EQUIVALENT, 0 ms] 34.22/13.41 (33) YES 34.22/13.41 (34) QDP 34.22/13.41 (35) QDPSizeChangeProof [EQUIVALENT, 0 ms] 34.22/13.41 (36) YES 34.22/13.41 (37) QDP 34.22/13.41 (38) QDPSizeChangeProof [EQUIVALENT, 0 ms] 34.22/13.41 (39) YES 34.22/13.41 (40) QDP 34.22/13.41 (41) QDPSizeChangeProof [EQUIVALENT, 0 ms] 34.22/13.41 (42) YES 34.22/13.41 (43) QDP 34.22/13.41 (44) QDPSizeChangeProof [EQUIVALENT, 0 ms] 34.22/13.41 (45) YES 34.22/13.41 34.22/13.41 34.22/13.41 ---------------------------------------- 34.22/13.41 34.22/13.41 (0) 34.22/13.41 Obligation: 34.22/13.41 mainModule Main 34.22/13.41 module FiniteMap where { 34.22/13.41 import qualified Main; 34.22/13.41 import qualified Maybe; 34.22/13.41 import qualified Prelude; 34.22/13.41 data FiniteMap a b = EmptyFM | Branch a b Int (FiniteMap a b) (FiniteMap a b) ; 34.22/13.41 34.22/13.41 instance (Eq a, Eq b) => Eq FiniteMap a b where { 34.22/13.41 (==) fm_1 fm_2 = sizeFM fm_1 == sizeFM fm_2 && fmToList fm_1 == fmToList fm_2; 34.22/13.41 } 34.22/13.41 addListToFM :: Ord b => FiniteMap b a -> [(b,a)] -> FiniteMap b a; 34.22/13.41 addListToFM fm key_elt_pairs = addListToFM_C (\old new ->new) fm key_elt_pairs; 34.22/13.41 34.22/13.41 addListToFM_C :: Ord b => (a -> a -> a) -> FiniteMap b a -> [(b,a)] -> FiniteMap b a; 34.22/13.41 addListToFM_C combiner fm key_elt_pairs = foldl add fm key_elt_pairs where { 34.22/13.41 add fmap (key,elt) = addToFM_C combiner fmap key elt; 34.22/13.41 }; 34.22/13.41 34.22/13.41 addToFM_C :: Ord a => (b -> b -> b) -> FiniteMap a b -> a -> b -> FiniteMap a b; 34.22/13.41 addToFM_C combiner EmptyFM key elt = unitFM key elt; 34.22/13.41 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 34.22/13.41 | new_key > key = mkBalBranch key elt fm_l (addToFM_C combiner fm_r new_key new_elt) 34.22/13.41 | otherwise = Branch new_key (combiner elt new_elt) size fm_l fm_r; 34.22/13.41 34.22/13.41 emptyFM :: FiniteMap b a; 34.22/13.41 emptyFM = EmptyFM; 34.22/13.41 34.22/13.41 findMax :: FiniteMap a b -> (a,b); 34.22/13.41 findMax (Branch key elt _ _ EmptyFM) = (key,elt); 34.22/13.41 findMax (Branch key elt _ _ fm_r) = findMax fm_r; 34.22/13.41 34.22/13.41 findMin :: FiniteMap a b -> (a,b); 34.22/13.41 findMin (Branch key elt _ EmptyFM _) = (key,elt); 34.22/13.41 findMin (Branch key elt _ fm_l _) = findMin fm_l; 34.22/13.41 34.22/13.41 fmToList :: FiniteMap b a -> [(b,a)]; 34.22/13.41 fmToList fm = foldFM (\key elt rest ->(key,elt) : rest) [] fm; 34.22/13.41 34.22/13.41 foldFM :: (a -> c -> b -> b) -> b -> FiniteMap a c -> b; 34.22/13.41 foldFM k z EmptyFM = z; 34.22/13.41 foldFM k z (Branch key elt _ fm_l fm_r) = foldFM k (k key elt (foldFM k z fm_r)) fm_l; popout

output may be truncated. 'popout' for the full output.

job log

popout

actions

all output return to Haskell 2019-04-01 06.52