details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	12.2724 seconds
cpu usage	30.0372
user time	29.0755
system time	0.961766
max virtual memory	1.8287616E7
max residence set size	3218440.0

stage attributes

key	value
starexec-result	YES

output

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