Haskell 2019-04-01 06.52 pair #433316337

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	10.0065 seconds
cpu usage	24.9221
user time	23.8853
system time	1.03683
max virtual memory	1.8287616E7
max residence set size	3534552.0

stage attributes

key	value
starexec-result	YES

output

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

popout

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

job log

popout

actions all output return to Haskell 2019-04-01 06.52