Haskell 2019-04-01 06.52 pair #433316354

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	10.5318 seconds
cpu usage	23.8464
user time	22.6654
system time	1.18095
max virtual memory	1.8285568E7
max residence set size	3909804.0

stage attributes

key	value
starexec-result	YES

output

20.12/9.51	YES
23.36/10.39	proof of /export/starexec/sandbox/benchmark/theBenchmark.hs
23.36/10.39	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
23.36/10.39	
23.36/10.39	
23.36/10.39	H-Termination with start terms of the given HASKELL could be proven:
23.36/10.39	
23.36/10.39	(0) HASKELL
23.36/10.39	(1) LR [EQUIVALENT, 0 ms]
23.36/10.39	(2) HASKELL
23.36/10.39	(3) CR [EQUIVALENT, 0 ms]
23.36/10.39	(4) HASKELL
23.36/10.39	(5) IFR [EQUIVALENT, 0 ms]
23.36/10.39	(6) HASKELL
23.36/10.39	(7) BR [EQUIVALENT, 0 ms]
23.36/10.39	(8) HASKELL
23.36/10.39	(9) COR [EQUIVALENT, 6 ms]
23.36/10.39	(10) HASKELL
23.36/10.39	(11) LetRed [EQUIVALENT, 0 ms]
23.36/10.39	(12) HASKELL
23.36/10.39	(13) NumRed [SOUND, 14 ms]
23.36/10.39	(14) HASKELL
23.36/10.39	(15) Narrow [SOUND, 0 ms]
23.36/10.39	(16) AND
23.36/10.39	    (17) QDP
23.36/10.39	        (18) QDPSizeChangeProof [EQUIVALENT, 0 ms]
23.36/10.39	        (19) YES
23.36/10.39	    (20) QDP
23.36/10.39	        (21) QDPSizeChangeProof [EQUIVALENT, 48 ms]
23.36/10.39	        (22) YES
23.36/10.39	    (23) QDP
23.36/10.39	        (24) QDPSizeChangeProof [EQUIVALENT, 0 ms]
23.36/10.39	        (25) YES
23.36/10.39	    (26) QDP
23.36/10.39	        (27) QDPSizeChangeProof [EQUIVALENT, 0 ms]
23.36/10.39	        (28) YES
23.36/10.39	    (29) QDP
23.36/10.39	        (30) QDPSizeChangeProof [EQUIVALENT, 0 ms]
23.36/10.39	        (31) YES
23.36/10.39	    (32) QDP
23.36/10.39	        (33) QDPSizeChangeProof [EQUIVALENT, 0 ms]
23.36/10.39	        (34) YES
23.36/10.39	    (35) QDP
23.36/10.39	        (36) DependencyGraphProof [EQUIVALENT, 0 ms]
23.36/10.39	        (37) AND
23.36/10.39	            (38) QDP
23.36/10.39	                (39) QDPSizeChangeProof [EQUIVALENT, 0 ms]
23.36/10.39	                (40) YES
23.36/10.39	            (41) QDP
23.36/10.39	                (42) TransformationProof [EQUIVALENT, 1479 ms]
23.36/10.39	                (43) QDP
23.36/10.39	                (44) DependencyGraphProof [EQUIVALENT, 0 ms]
23.36/10.39	                (45) QDP
23.36/10.39	                (46) TransformationProof [EQUIVALENT, 0 ms]
23.36/10.39	                (47) QDP
23.36/10.39	                (48) QDPSizeChangeProof [EQUIVALENT, 0 ms]
23.36/10.39	                (49) YES
23.36/10.39	
23.36/10.39	
23.36/10.39	----------------------------------------
23.36/10.39	
23.36/10.39	(0)
23.36/10.39	Obligation:
23.36/10.39	mainModule Main 
23.36/10.39	module FiniteMap where {
23.36/10.39	import qualified Main;
23.36/10.39	import qualified Maybe;
23.36/10.39	import qualified Prelude;
23.36/10.39	data FiniteMap b a = EmptyFM  | Branch b a Int (FiniteMap b a) (FiniteMap b a) ;
23.36/10.39	
23.36/10.39	instance (Eq a, Eq b) => Eq FiniteMap b a where { 
23.36/10.39	(==) fm_1 fm_2 = sizeFM fm_1 == sizeFM fm_2 && fmToList fm_1 == fmToList fm_2;
23.36/10.39	}
23.36/10.39	fmToList :: FiniteMap a b  ->  [(a,b)];
23.36/10.39	fmToList fm = foldFM (\key elt rest ->(key,elt) : rest) [] fm;
23.36/10.39	
23.36/10.39	foldFM :: (c  ->  a  ->  b  ->  b)  ->  b  ->  FiniteMap c a  ->  b;
23.36/10.39	foldFM k z EmptyFM = z;
23.36/10.39	foldFM k z (Branch key elt _ fm_l fm_r) = foldFM k (k key elt (foldFM k z fm_r)) fm_l;
23.36/10.39	
23.36/10.39	foldFM_GE :: Ord c => (c  ->  a  ->  b  ->  b)  ->  b  ->  c  ->  FiniteMap c a  ->  b;
23.36/10.39	foldFM_GE k z fr EmptyFM = z;
23.36/10.39	foldFM_GE k z fr (Branch key elt _ fm_l fm_r)  | key >= fr = foldFM_GE k (k key elt (foldFM_GE k z fr fm_r)) fr fm_l
23.36/10.39	 | otherwise = foldFM_GE k z fr fm_r;
23.36/10.39	
23.36/10.39	sizeFM :: FiniteMap a b  ->  Int;
23.36/10.39	sizeFM EmptyFM = 0;
23.36/10.39	sizeFM (Branch _ _ size _ _) = size;
23.36/10.39	
23.36/10.39	}
23.36/10.39	module Maybe where {
23.36/10.39	import qualified FiniteMap;
23.36/10.39	import qualified Main;
23.36/10.39	import qualified Prelude;
23.36/10.39	}
23.36/10.39	module Main where {
23.36/10.39	import qualified FiniteMap;
23.36/10.39	import qualified Maybe;
23.36/10.39	import qualified Prelude;
23.36/10.39	}

popout

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

job log

popout

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