details

property	value
status	complete
benchmark	Monad_filterM_3.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.47092 seconds
cpu usage	11.1956
user time	10.8661
system time	0.329532
max virtual memory	1.8285568E7
max residence set size	644120.0

stage attributes

key	value
starexec-result	YES

output

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