Haskell 2019-04-01 06.52 pair #433317040

details

property	value
status	complete
benchmark	FiniteMap_foldFM_1.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)	4.90917 seconds
cpu usage	11.7043
user time	11.3578
system time	0.346566
max virtual memory	1.8285568E7
max residence set size	705752.0

stage attributes

key	value
starexec-result	YES

output

9.92/4.38	YES
11.55/4.86	proof of /export/starexec/sandbox/benchmark/theBenchmark.hs
11.55/4.86	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
11.55/4.86	
11.55/4.86	
11.55/4.86	H-Termination with start terms of the given HASKELL could be proven:
11.55/4.86	
11.55/4.86	(0) HASKELL
11.55/4.86	(1) BR [EQUIVALENT, 0 ms]
11.55/4.86	(2) HASKELL
11.55/4.86	(3) COR [EQUIVALENT, 0 ms]
11.55/4.86	(4) HASKELL
11.55/4.86	(5) Narrow [SOUND, 0 ms]
11.55/4.86	(6) QDP
11.55/4.86	(7) QDPSizeChangeProof [EQUIVALENT, 0 ms]
11.55/4.86	(8) YES
11.55/4.86	
11.55/4.86	
11.55/4.86	----------------------------------------
11.55/4.86	
11.55/4.86	(0)
11.55/4.86	Obligation:
11.55/4.86	mainModule Main 
11.55/4.86	module FiniteMap where {
11.55/4.86	import qualified Main;
11.55/4.86	import qualified Maybe;
11.55/4.86	import qualified Prelude;
11.55/4.86	data FiniteMap b a = EmptyFM  | Branch b a Int (FiniteMap b a) (FiniteMap b a) ;
11.55/4.86	
11.55/4.86	foldFM :: (a  ->  c  ->  b  ->  b)  ->  b  ->  FiniteMap a c  ->  b;
11.55/4.86	foldFM k z EmptyFM = z;
11.55/4.86	foldFM k z (Branch key elt _ fm_l fm_r) = foldFM k (k key elt (foldFM k z fm_r)) fm_l;
11.55/4.86	
11.55/4.86	}
11.55/4.86	module Maybe where {
11.55/4.86	import qualified FiniteMap;
11.55/4.86	import qualified Main;
11.55/4.86	import qualified Prelude;
11.55/4.86	}
11.55/4.86	module Main where {
11.55/4.86	import qualified FiniteMap;
11.55/4.86	import qualified Maybe;
11.55/4.86	import qualified Prelude;
11.55/4.86	}
11.55/4.86	
11.55/4.86	----------------------------------------
11.55/4.86	
11.55/4.86	(1) BR (EQUIVALENT)
11.55/4.86	Replaced joker patterns by fresh variables and removed binding patterns.
11.55/4.86	----------------------------------------
11.55/4.86	
11.55/4.86	(2)
11.55/4.86	Obligation:
11.55/4.86	mainModule Main 
11.55/4.86	module FiniteMap where {
11.55/4.86	import qualified Main;
11.55/4.86	import qualified Maybe;
11.55/4.86	import qualified Prelude;
11.55/4.86	data FiniteMap b a = EmptyFM  | Branch b a Int (FiniteMap b a) (FiniteMap b a) ;
11.55/4.86	
11.55/4.86	foldFM :: (a  ->  b  ->  c  ->  c)  ->  c  ->  FiniteMap a b  ->  c;
11.55/4.86	foldFM k z EmptyFM = z;
11.55/4.86	foldFM k z (Branch key elt vy fm_l fm_r) = foldFM k (k key elt (foldFM k z fm_r)) fm_l;
11.55/4.86	
11.55/4.86	}
11.55/4.86	module Maybe where {
11.55/4.86	import qualified FiniteMap;
11.55/4.86	import qualified Main;
11.55/4.86	import qualified Prelude;
11.55/4.86	}
11.55/4.86	module Main where {
11.55/4.86	import qualified FiniteMap;
11.55/4.86	import qualified Maybe;
11.55/4.86	import qualified Prelude;
11.55/4.86	}
11.55/4.86	
11.55/4.86	----------------------------------------
11.55/4.86	
11.55/4.86	(3) COR (EQUIVALENT)
11.55/4.86	Cond Reductions:
11.55/4.86	The following Function with conditions
11.55/4.86	"undefined |Falseundefined;
11.55/4.86	"
11.55/4.86	is transformed to
11.55/4.86	"undefined  = undefined1;
11.55/4.86	"
11.55/4.86	"undefined0 True = undefined;
11.55/4.86	"
11.55/4.86	"undefined1  = undefined0 False;
11.55/4.86	"
11.55/4.86	
11.55/4.86	----------------------------------------
11.55/4.86	
11.55/4.86	(4)
11.55/4.86	Obligation:
11.55/4.86	mainModule Main 
11.55/4.86	module FiniteMap where {
11.55/4.86	import qualified Main;
11.55/4.86	import qualified Maybe;
11.55/4.86	import qualified Prelude;

popout

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

job log

popout

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