Haskell 2019-04-01 06.52 pair #433315931

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	4.34429 seconds
cpu usage	10.4898
user time	10.1367
system time	0.353099
max virtual memory	1.8286248E7
max residence set size	581948.0

stage attributes

key	value
starexec-result	YES

output

7.99/3.64	YES
10.19/4.25	proof of /export/starexec/sandbox/benchmark/theBenchmark.hs
10.19/4.25	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
10.19/4.25	
10.19/4.25	
10.19/4.25	H-Termination with start terms of the given HASKELL could be proven:
10.19/4.25	
10.19/4.25	(0) HASKELL
10.19/4.25	(1) CR [EQUIVALENT, 0 ms]
10.19/4.25	(2) HASKELL
10.19/4.25	(3) BR [EQUIVALENT, 0 ms]
10.19/4.25	(4) HASKELL
10.19/4.25	(5) COR [EQUIVALENT, 0 ms]
10.19/4.25	(6) HASKELL
10.19/4.25	(7) LetRed [EQUIVALENT, 0 ms]
10.19/4.25	(8) HASKELL
10.19/4.25	(9) Narrow [SOUND, 0 ms]
10.19/4.25	(10) QDP
10.19/4.25	(11) QDPSizeChangeProof [EQUIVALENT, 0 ms]
10.19/4.25	(12) YES
10.19/4.25	
10.19/4.25	
10.19/4.25	----------------------------------------
10.19/4.25	
10.19/4.25	(0)
10.19/4.25	Obligation:
10.19/4.25	mainModule Main 
10.19/4.25	module Maybe where {
10.19/4.25	import qualified Main;
10.19/4.25	import qualified Prelude;
10.19/4.25	mapMaybe :: (b  ->  Maybe a)  ->  [b]  ->  [a];
10.19/4.25	mapMaybe _ [] = [];
10.19/4.25	mapMaybe f (x : xs) = let { 
10.19/4.25	rs = mapMaybe f xs;
10.19/4.25	} in case f x of { 
10.19/4.25	Nothing-> rs; 
10.19/4.25	Just r-> r : rs; 
10.19/4.25	 } ;
10.19/4.25	
10.19/4.25	}
10.19/4.25	module Main where {
10.19/4.25	import qualified Maybe;
10.19/4.25	import qualified Prelude;
10.19/4.25	}
10.19/4.25	
10.19/4.25	----------------------------------------
10.19/4.25	
10.19/4.25	(1) CR (EQUIVALENT)
10.19/4.25	Case Reductions:
10.19/4.25	The following Case expression
10.19/4.25	"case f x of {
10.19/4.25	Nothing  -> rs;
10.19/4.25	Just r  -> r : rs}
10.19/4.25	"
10.19/4.25	is transformed to
10.19/4.25	"mapMaybe0 Nothing = rs;
10.19/4.25	mapMaybe0 (Just r) = r : rs;
10.19/4.25	"
10.19/4.25	
10.19/4.25	----------------------------------------
10.19/4.25	
10.19/4.25	(2)
10.19/4.25	Obligation:
10.19/4.25	mainModule Main 
10.19/4.25	module Maybe where {
10.19/4.25	import qualified Main;
10.19/4.25	import qualified Prelude;
10.19/4.25	mapMaybe :: (b  ->  Maybe a)  ->  [b]  ->  [a];
10.19/4.25	mapMaybe _ [] = [];
10.19/4.25	mapMaybe f (x : xs) = let { 
10.19/4.25	mapMaybe0 Nothing = rs;
10.19/4.25	mapMaybe0 (Just r) = r : rs;
10.19/4.25	rs = mapMaybe f xs;
10.19/4.25	} in mapMaybe0 (f x);
10.19/4.25	
10.19/4.25	}
10.19/4.25	module Main where {
10.19/4.25	import qualified Maybe;
10.19/4.25	import qualified Prelude;
10.19/4.25	}
10.19/4.25	
10.19/4.25	----------------------------------------
10.19/4.25	
10.19/4.25	(3) BR (EQUIVALENT)
10.19/4.25	Replaced joker patterns by fresh variables and removed binding patterns.
10.19/4.25	----------------------------------------
10.19/4.25	
10.19/4.25	(4)
10.19/4.25	Obligation:
10.19/4.25	mainModule Main 
10.19/4.25	module Maybe where {
10.19/4.25	import qualified Main;
10.19/4.25	import qualified Prelude;
10.19/4.25	mapMaybe :: (a  ->  Maybe b)  ->  [a]  ->  [b];
10.19/4.25	mapMaybe vy [] = [];
10.19/4.25	mapMaybe f (x : xs) = let { 
10.19/4.25	mapMaybe0 Nothing = rs;
10.19/4.25	mapMaybe0 (Just r) = r : rs;
10.19/4.25	rs = mapMaybe f xs;
10.19/4.25	} in mapMaybe0 (f x);

popout

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

job log

popout

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