Haskell 2019-04-01 06.52 pair #433316992

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	6.3075 seconds
cpu usage	15.9673
user time	15.5285
system time	0.438788
max virtual memory	1.8285568E7
max residence set size	994920.0

stage attributes

key	value
starexec-result	YES

output

13.69/5.66	YES
15.63/6.25	proof of /export/starexec/sandbox/benchmark/theBenchmark.hs
15.63/6.25	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
15.63/6.25	
15.63/6.25	
15.63/6.25	H-Termination with start terms of the given HASKELL could be proven:
15.63/6.25	
15.63/6.25	(0) HASKELL
15.63/6.25	(1) LR [EQUIVALENT, 0 ms]
15.63/6.25	(2) HASKELL
15.63/6.25	(3) BR [EQUIVALENT, 0 ms]
15.63/6.25	(4) HASKELL
15.63/6.25	(5) COR [EQUIVALENT, 0 ms]
15.63/6.25	(6) HASKELL
15.63/6.25	(7) Narrow [SOUND, 0 ms]
15.63/6.25	(8) AND
15.63/6.25	    (9) QDP
15.63/6.25	        (10) TransformationProof [EQUIVALENT, 4 ms]
15.63/6.25	        (11) QDP
15.63/6.25	        (12) TransformationProof [EQUIVALENT, 0 ms]
15.63/6.25	        (13) QDP
15.63/6.25	        (14) TransformationProof [EQUIVALENT, 0 ms]
15.63/6.25	        (15) QDP
15.63/6.25	        (16) QDPSizeChangeProof [EQUIVALENT, 0 ms]
15.63/6.25	        (17) YES
15.63/6.25	    (18) QDP
15.63/6.25	        (19) TransformationProof [EQUIVALENT, 0 ms]
15.63/6.25	        (20) QDP
15.63/6.25	        (21) TransformationProof [EQUIVALENT, 0 ms]
15.63/6.25	        (22) QDP
15.63/6.25	        (23) QDPSizeChangeProof [EQUIVALENT, 0 ms]
15.63/6.25	        (24) YES
15.63/6.25	    (25) QDP
15.63/6.25	        (26) TransformationProof [EQUIVALENT, 0 ms]
15.63/6.25	        (27) QDP
15.63/6.25	        (28) TransformationProof [EQUIVALENT, 0 ms]
15.63/6.25	        (29) QDP
15.63/6.25	        (30) TransformationProof [EQUIVALENT, 0 ms]
15.63/6.25	        (31) QDP
15.63/6.25	        (32) TransformationProof [EQUIVALENT, 0 ms]
15.63/6.25	        (33) QDP
15.63/6.25	        (34) TransformationProof [EQUIVALENT, 0 ms]
15.63/6.25	        (35) QDP
15.63/6.25	        (36) TransformationProof [EQUIVALENT, 0 ms]
15.63/6.25	        (37) QDP
15.63/6.25	        (38) TransformationProof [EQUIVALENT, 0 ms]
15.63/6.25	        (39) QDP
15.63/6.25	        (40) QDPSizeChangeProof [EQUIVALENT, 0 ms]
15.63/6.25	        (41) YES
15.63/6.25	    (42) QDP
15.63/6.25	        (43) DependencyGraphProof [EQUIVALENT, 0 ms]
15.63/6.25	        (44) AND
15.63/6.25	            (45) QDP
15.63/6.25	                (46) QDPSizeChangeProof [EQUIVALENT, 0 ms]
15.63/6.25	                (47) YES
15.63/6.25	            (48) QDP
15.63/6.25	                (49) QDPSizeChangeProof [EQUIVALENT, 0 ms]
15.63/6.25	                (50) YES
15.63/6.25	
15.63/6.25	
15.63/6.25	----------------------------------------
15.63/6.25	
15.63/6.25	(0)
15.63/6.25	Obligation:
15.63/6.25	mainModule Main 
15.63/6.25	module FiniteMap where {
15.63/6.25	import qualified Main;
15.63/6.25	import qualified Maybe;
15.63/6.25	import qualified Prelude;
15.63/6.25	data FiniteMap a b = EmptyFM  | Branch a b Int (FiniteMap a b) (FiniteMap a b) ;
15.63/6.25	
15.63/6.25	instance (Eq a, Eq b) => Eq FiniteMap b a where { 
15.63/6.25	}
15.63/6.25	fmToList_LE :: Ord b => FiniteMap b a  ->  b  ->  [(b,a)];
15.63/6.25	fmToList_LE fm fr = foldFM_LE (\key elt rest ->(key,elt) : rest) [] fr fm;
15.63/6.25	
15.63/6.25	foldFM_LE :: Ord c => (c  ->  a  ->  b  ->  b)  ->  b  ->  c  ->  FiniteMap c a  ->  b;
15.63/6.25	foldFM_LE k z fr EmptyFM = z;
15.63/6.25	foldFM_LE k z fr (Branch key elt _ fm_l fm_r)  | key <= fr = foldFM_LE k (k key elt (foldFM_LE k z fr fm_l)) fr fm_r
15.63/6.25	 | otherwise = foldFM_LE k z fr fm_l;
15.63/6.25	
15.63/6.25	}
15.63/6.25	module Maybe where {
15.63/6.25	import qualified FiniteMap;
15.63/6.25	import qualified Main;
15.63/6.25	import qualified Prelude;
15.63/6.25	}
15.63/6.25	module Main where {
15.63/6.25	import qualified FiniteMap;
15.63/6.25	import qualified Maybe;
15.63/6.25	import qualified Prelude;
15.63/6.25	}
15.63/6.25	
15.63/6.25	----------------------------------------
15.63/6.25	
15.63/6.25	(1) LR (EQUIVALENT)
15.63/6.25	Lambda Reductions:
15.63/6.25	The following Lambda expression
15.63/6.25	"\keyeltrest->(key,elt) : rest"
15.63/6.25	is transformed to

popout

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

job log

popout

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