Haskell 2019-04-01 06.52 pair #433316564

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	5.03658 seconds
cpu usage	11.7088
user time	11.3634
system time	0.345393
max virtual memory	1.8285568E7
max residence set size	715868.0

stage attributes

key	value
starexec-result	YES

output

9.58/4.42	YES
11.31/4.97	proof of /export/starexec/sandbox2/benchmark/theBenchmark.hs
11.31/4.97	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
11.31/4.97	
11.31/4.97	
11.31/4.97	H-Termination with start terms of the given HASKELL could be proven:
11.31/4.97	
11.31/4.97	(0) HASKELL
11.31/4.97	(1) CR [EQUIVALENT, 0 ms]
11.31/4.97	(2) HASKELL
11.31/4.97	(3) BR [EQUIVALENT, 0 ms]
11.31/4.97	(4) HASKELL
11.31/4.97	(5) COR [EQUIVALENT, 0 ms]
11.31/4.97	(6) HASKELL
11.31/4.97	(7) Narrow [SOUND, 0 ms]
11.31/4.97	(8) QDP
11.31/4.97	(9) QDPSizeChangeProof [EQUIVALENT, 0 ms]
11.31/4.97	(10) YES
11.31/4.97	
11.31/4.97	
11.31/4.97	----------------------------------------
11.31/4.97	
11.31/4.97	(0)
11.31/4.97	Obligation:
11.31/4.97	mainModule Main 
11.31/4.97	module FiniteMap where {
11.31/4.97	import qualified Main;
11.31/4.97	import qualified Maybe;
11.31/4.97	import qualified Prelude;
11.31/4.97	data FiniteMap b a = EmptyFM  | Branch b a Int (FiniteMap b a) (FiniteMap b a) ;
11.31/4.97	
11.31/4.97	minFM :: Ord a => FiniteMap a b  ->  Maybe a;
11.31/4.97	minFM EmptyFM = Nothing;
11.31/4.97	minFM (Branch key _ _ fm_l _) = case minFM fm_l of { 
11.31/4.97	Nothing-> Just key; 
11.31/4.97	Just key1-> Just key1; 
11.31/4.97	 } ;
11.31/4.97	
11.31/4.97	}
11.31/4.97	module Maybe where {
11.31/4.97	import qualified FiniteMap;
11.31/4.97	import qualified Main;
11.31/4.97	import qualified Prelude;
11.31/4.97	}
11.31/4.97	module Main where {
11.31/4.97	import qualified FiniteMap;
11.31/4.97	import qualified Maybe;
11.31/4.97	import qualified Prelude;
11.31/4.97	}
11.31/4.97	
11.31/4.97	----------------------------------------
11.31/4.97	
11.31/4.97	(1) CR (EQUIVALENT)
11.31/4.97	Case Reductions:
11.31/4.97	The following Case expression
11.31/4.97	"case minFM fm_l of {
11.31/4.97	Nothing  -> Just key;
11.31/4.97	Just key1  -> Just key1}
11.31/4.97	"
11.31/4.97	is transformed to
11.31/4.97	"minFM0 key Nothing = Just key;
11.31/4.97	minFM0 key (Just key1) = Just key1;
11.31/4.97	"
11.31/4.97	
11.31/4.97	----------------------------------------
11.31/4.97	
11.31/4.97	(2)
11.31/4.97	Obligation:
11.31/4.97	mainModule Main 
11.31/4.97	module FiniteMap where {
11.31/4.97	import qualified Main;
11.31/4.97	import qualified Maybe;
11.31/4.97	import qualified Prelude;
11.31/4.97	data FiniteMap b a = EmptyFM  | Branch b a Int (FiniteMap b a) (FiniteMap b a) ;
11.31/4.97	
11.31/4.97	minFM :: Ord b => FiniteMap b a  ->  Maybe b;
11.31/4.97	minFM EmptyFM = Nothing;
11.31/4.97	minFM (Branch key _ _ fm_l _) = minFM0 key (minFM fm_l);
11.31/4.97	
11.31/4.97	minFM0 key Nothing = Just key;
11.31/4.97	minFM0 key (Just key1) = Just key1;
11.31/4.97	
11.31/4.97	}
11.31/4.97	module Maybe where {
11.31/4.97	import qualified FiniteMap;
11.31/4.97	import qualified Main;
11.31/4.97	import qualified Prelude;
11.31/4.97	}
11.31/4.97	module Main where {
11.31/4.97	import qualified FiniteMap;
11.31/4.97	import qualified Maybe;
11.31/4.97	import qualified Prelude;
11.31/4.97	}
11.31/4.97	
11.31/4.97	----------------------------------------
11.31/4.97	
11.31/4.97	(3) BR (EQUIVALENT)
11.31/4.97	Replaced joker patterns by fresh variables and removed binding patterns.
11.31/4.97	----------------------------------------
11.31/4.97

popout

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

job log

popout

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