Haskell 2019-04-01 06.52 pair #433316267

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	4.59487 seconds
cpu usage	11.7729
user time	11.4326
system time	0.340269
max virtual memory	1.8285568E7
max residence set size	628500.0

stage attributes

key	value
starexec-result	YES

output

9.27/3.92	YES
11.58/4.54	proof of /export/starexec/sandbox/benchmark/theBenchmark.hs
11.58/4.54	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
11.58/4.54	
11.58/4.54	
11.58/4.54	H-Termination with start terms of the given HASKELL could be proven:
11.58/4.54	
11.58/4.54	(0) HASKELL
11.58/4.54	(1) LR [EQUIVALENT, 0 ms]
11.58/4.54	(2) HASKELL
11.58/4.54	(3) IFR [EQUIVALENT, 0 ms]
11.58/4.54	(4) HASKELL
11.58/4.54	(5) BR [EQUIVALENT, 0 ms]
11.58/4.54	(6) HASKELL
11.58/4.54	(7) COR [EQUIVALENT, 0 ms]
11.58/4.54	(8) HASKELL
11.58/4.54	(9) Narrow [SOUND, 0 ms]
11.58/4.54	(10) QDP
11.58/4.54	(11) QDPSizeChangeProof [EQUIVALENT, 0 ms]
11.58/4.54	(12) YES
11.58/4.54	
11.58/4.54	
11.58/4.54	----------------------------------------
11.58/4.54	
11.58/4.54	(0)
11.58/4.54	Obligation:
11.58/4.54	mainModule Main 
11.58/4.54	module Maybe where {
11.58/4.54	import qualified Main;
11.58/4.54	import qualified Monad;
11.58/4.54	import qualified Prelude;
11.58/4.54	}
11.58/4.54	module Main where {
11.58/4.54	import qualified Maybe;
11.58/4.54	import qualified Monad;
11.58/4.54	import qualified Prelude;
11.58/4.54	}
11.58/4.54	module Monad where {
11.58/4.54	import qualified Main;
11.58/4.54	import qualified Maybe;
11.58/4.54	import qualified Prelude;
11.58/4.54	filterM :: Monad b => (a  ->  b Bool)  ->  [a]  ->  b [a];
11.58/4.54	filterM _ [] = return [];
11.58/4.54	filterM p (x : xs) = p x >>= (\flg ->filterM p xs >>= (\ys ->return ( if flg then x : ys else ys)));
11.58/4.54	
11.58/4.54	}
11.58/4.54	
11.58/4.54	----------------------------------------
11.58/4.54	
11.58/4.54	(1) LR (EQUIVALENT)
11.58/4.54	Lambda Reductions:
11.58/4.54	The following Lambda expression
11.58/4.54	"\ys->return (if flg then x : ys else ys)"
11.58/4.54	is transformed to
11.58/4.54	"filterM0 flg x ys = return (if flg then x : ys else ys);
11.58/4.54	"
11.58/4.54	The following Lambda expression
11.58/4.54	"\flg->filterM p xs >>= filterM0 flg x"
11.58/4.54	is transformed to
11.58/4.54	"filterM1 p xs x flg = filterM p xs >>= filterM0 flg x;
11.58/4.54	"
11.58/4.54	
11.58/4.54	----------------------------------------
11.58/4.54	
11.58/4.54	(2)
11.58/4.54	Obligation:
11.58/4.54	mainModule Main 
11.58/4.54	module Maybe where {
11.58/4.54	import qualified Main;
11.58/4.54	import qualified Monad;
11.58/4.54	import qualified Prelude;
11.58/4.54	}
11.58/4.54	module Main where {
11.58/4.54	import qualified Maybe;
11.58/4.54	import qualified Monad;
11.58/4.54	import qualified Prelude;
11.58/4.54	}
11.58/4.54	module Monad where {
11.58/4.54	import qualified Main;
11.58/4.54	import qualified Maybe;
11.58/4.54	import qualified Prelude;
11.58/4.54	filterM :: Monad b => (a  ->  b Bool)  ->  [a]  ->  b [a];
11.58/4.54	filterM _ [] = return [];
11.58/4.54	filterM p (x : xs) = p x >>= filterM1 p xs x;
11.58/4.54	
11.58/4.54	filterM0 flg x ys = return ( if flg then x : ys else ys);
11.58/4.54	
11.58/4.54	filterM1 p xs x flg = filterM p xs >>= filterM0 flg x;
11.58/4.54	
11.58/4.54	}
11.58/4.54	
11.58/4.54	----------------------------------------
11.58/4.54	
11.58/4.54	(3) IFR (EQUIVALENT)
11.58/4.54	If Reductions:
11.58/4.54	The following If expression
11.58/4.54	"if flg then x : ys else ys"
11.58/4.54	is transformed to
11.58/4.54	"filterM00 x ys True = x : ys;
11.58/4.54	filterM00 x ys False = ys;

popout

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

job log

popout

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