Haskell 2019-04-01 06.52 pair #433317037

details

property	value
status	complete
benchmark	FiniteMap_fmToList_1.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)	5.10763 seconds
cpu usage	12.0391
user time	11.6489
system time	0.390179
max virtual memory	1.8288292E7
max residence set size	739160.0

stage attributes

key	value
starexec-result	YES

output

9.67/4.42	YES
11.93/5.03	proof of /export/starexec/sandbox/benchmark/theBenchmark.hs
11.93/5.03	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
11.93/5.03	
11.93/5.03	
11.93/5.03	H-Termination with start terms of the given HASKELL could be proven:
11.93/5.03	
11.93/5.03	(0) HASKELL
11.93/5.03	(1) LR [EQUIVALENT, 0 ms]
11.93/5.03	(2) HASKELL
11.93/5.03	(3) BR [EQUIVALENT, 0 ms]
11.93/5.03	(4) HASKELL
11.93/5.03	(5) COR [EQUIVALENT, 0 ms]
11.93/5.03	(6) HASKELL
11.93/5.03	(7) Narrow [SOUND, 0 ms]
11.93/5.03	(8) AND
11.93/5.03	    (9) QDP
11.93/5.03	        (10) QDPSizeChangeProof [EQUIVALENT, 0 ms]
11.93/5.03	        (11) YES
11.93/5.03	    (12) QDP
11.93/5.03	        (13) QDPSizeChangeProof [EQUIVALENT, 0 ms]
11.93/5.03	        (14) YES
11.93/5.03	
11.93/5.03	
11.93/5.03	----------------------------------------
11.93/5.03	
11.93/5.03	(0)
11.93/5.03	Obligation:
11.93/5.03	mainModule Main 
11.93/5.03	module FiniteMap where {
11.93/5.03	import qualified Main;
11.93/5.03	import qualified Maybe;
11.93/5.03	import qualified Prelude;
11.93/5.03	data FiniteMap b a = EmptyFM  | Branch b a Int (FiniteMap b a) (FiniteMap b a) ;
11.93/5.03	
11.93/5.03	fmToList :: FiniteMap b a  ->  [(b,a)];
11.93/5.03	fmToList fm = foldFM (\key elt rest ->(key,elt) : rest) [] fm;
11.93/5.03	
11.93/5.03	foldFM :: (b  ->  c  ->  a  ->  a)  ->  a  ->  FiniteMap b c  ->  a;
11.93/5.03	foldFM k z EmptyFM = z;
11.93/5.03	foldFM k z (Branch key elt _ fm_l fm_r) = foldFM k (k key elt (foldFM k z fm_r)) fm_l;
11.93/5.03	
11.93/5.03	}
11.93/5.03	module Maybe where {
11.93/5.03	import qualified FiniteMap;
11.93/5.03	import qualified Main;
11.93/5.03	import qualified Prelude;
11.93/5.03	}
11.93/5.03	module Main where {
11.93/5.03	import qualified FiniteMap;
11.93/5.03	import qualified Maybe;
11.93/5.03	import qualified Prelude;
11.93/5.03	}
11.93/5.03	
11.93/5.03	----------------------------------------
11.93/5.03	
11.93/5.03	(1) LR (EQUIVALENT)
11.93/5.03	Lambda Reductions:
11.93/5.03	The following Lambda expression
11.93/5.03	"\keyeltrest->(key,elt) : rest"
11.93/5.03	is transformed to
11.93/5.03	"fmToList0 key elt rest = (key,elt) : rest;
11.93/5.03	"
11.93/5.03	
11.93/5.03	----------------------------------------
11.93/5.03	
11.93/5.03	(2)
11.93/5.03	Obligation:
11.93/5.03	mainModule Main 
11.93/5.03	module FiniteMap where {
11.93/5.03	import qualified Main;
11.93/5.03	import qualified Maybe;
11.93/5.03	import qualified Prelude;
11.93/5.03	data FiniteMap a b = EmptyFM  | Branch a b Int (FiniteMap a b) (FiniteMap a b) ;
11.93/5.03	
11.93/5.03	fmToList :: FiniteMap b a  ->  [(b,a)];
11.93/5.03	fmToList fm = foldFM fmToList0 [] fm;
11.93/5.03	
11.93/5.03	fmToList0 key elt rest = (key,elt) : rest;
11.93/5.03	
11.93/5.03	foldFM :: (c  ->  a  ->  b  ->  b)  ->  b  ->  FiniteMap c a  ->  b;
11.93/5.03	foldFM k z EmptyFM = z;
11.93/5.03	foldFM k z (Branch key elt _ fm_l fm_r) = foldFM k (k key elt (foldFM k z fm_r)) fm_l;
11.93/5.03	
11.93/5.03	}
11.93/5.03	module Maybe where {
11.93/5.03	import qualified FiniteMap;
11.93/5.03	import qualified Main;
11.93/5.03	import qualified Prelude;
11.93/5.03	}
11.93/5.03	module Main where {
11.93/5.03	import qualified FiniteMap;
11.93/5.03	import qualified Maybe;
11.93/5.03	import qualified Prelude;
11.93/5.03	}
11.93/5.03	
11.93/5.03	----------------------------------------
11.93/5.03	
11.93/5.03	(3) BR (EQUIVALENT)
11.93/5.03	Replaced joker patterns by fresh variables and removed binding patterns.

popout

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

job log

popout

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