details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	5.08329 seconds
cpu usage	12.8267
user time	12.489
system time	0.337696
max virtual memory	1.82858E7
max residence set size	629744.0

stage attributes

key	value
starexec-result	MAYBE

output

10.19/4.36 MAYBE 12.43/5.03 proof of /export/starexec/sandbox/benchmark/theBenchmark.hs 12.43/5.03 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 12.43/5.03 12.43/5.03 12.43/5.03 H-Termination with start terms of the given HASKELL could not be shown: 12.43/5.03 12.43/5.03 (0) HASKELL 12.43/5.03 (1) LR [EQUIVALENT, 0 ms] 12.43/5.03 (2) HASKELL 12.43/5.03 (3) IFR [EQUIVALENT, 0 ms] 12.43/5.03 (4) HASKELL 12.43/5.03 (5) BR [EQUIVALENT, 0 ms] 12.43/5.03 (6) HASKELL 12.43/5.03 (7) COR [EQUIVALENT, 0 ms] 12.43/5.03 (8) HASKELL 12.43/5.03 (9) Narrow [SOUND, 0 ms] 12.43/5.03 (10) AND 12.43/5.03 (11) QDP 12.43/5.03 (12) QDPSizeChangeProof [EQUIVALENT, 0 ms] 12.43/5.03 (13) YES 12.43/5.03 (14) QDP 12.43/5.03 (15) DependencyGraphProof [EQUIVALENT, 0 ms] 12.43/5.03 (16) AND 12.43/5.03 (17) QDP 12.43/5.03 (18) QDPSizeChangeProof [EQUIVALENT, 0 ms] 12.43/5.03 (19) YES 12.43/5.03 (20) QDP 12.43/5.03 (21) QDPSizeChangeProof [EQUIVALENT, 0 ms] 12.43/5.03 (22) YES 12.43/5.03 (23) QDP 12.43/5.03 (24) QDPOrderProof [EQUIVALENT, 36 ms] 12.43/5.03 (25) QDP 12.43/5.03 (26) DependencyGraphProof [EQUIVALENT, 0 ms] 12.43/5.03 (27) QDP 12.43/5.03 (28) MNOCProof [EQUIVALENT, 0 ms] 12.43/5.03 (29) QDP 12.43/5.03 (30) NonTerminationLoopProof [COMPLETE, 0 ms] 12.43/5.03 (31) NO 12.43/5.03 (32) QDP 12.43/5.03 (33) QDPSizeChangeProof [EQUIVALENT, 0 ms] 12.43/5.03 (34) YES 12.43/5.03 (35) Narrow [COMPLETE, 0 ms] 12.43/5.03 (36) TRUE 12.43/5.03 12.43/5.03 12.43/5.03 ---------------------------------------- 12.43/5.03 12.43/5.03 (0) 12.43/5.03 Obligation: 12.43/5.03 mainModule Main 12.43/5.03 module Maybe where { 12.43/5.03 import qualified Main; 12.43/5.03 import qualified Monad; 12.43/5.03 import qualified Prelude; 12.43/5.03 } 12.43/5.03 module Main where { 12.43/5.03 import qualified Maybe; 12.43/5.03 import qualified Monad; 12.43/5.03 import qualified Prelude; 12.43/5.03 } 12.43/5.03 module Monad where { 12.43/5.03 import qualified Main; 12.43/5.03 import qualified Maybe; 12.43/5.03 import qualified Prelude; 12.43/5.03 filterM :: Monad b => (a -> b Bool) -> [a] -> b [a]; 12.43/5.03 filterM _ [] = return []; 12.43/5.03 filterM p (x : xs) = p x >>= (\flg ->filterM p xs >>= (\ys ->return ( if flg then x : ys else ys))); 12.43/5.03 12.43/5.03 } 12.43/5.03 12.43/5.03 ---------------------------------------- 12.43/5.03 12.43/5.03 (1) LR (EQUIVALENT) 12.43/5.03 Lambda Reductions: 12.43/5.03 The following Lambda expression 12.43/5.03 "\ys->return (if flg then x : ys else ys)" 12.43/5.03 is transformed to 12.43/5.03 "filterM0 flg x ys = return (if flg then x : ys else ys); 12.43/5.03 " 12.43/5.03 The following Lambda expression 12.43/5.03 "\flg->filterM p xs >>= filterM0 flg x" 12.43/5.03 is transformed to 12.43/5.03 "filterM1 p xs x flg = filterM p xs >>= filterM0 flg x; 12.43/5.03 " 12.43/5.03 12.43/5.03 ---------------------------------------- 12.43/5.03 12.43/5.03 (2) 12.43/5.03 Obligation: 12.43/5.03 mainModule Main 12.43/5.03 module Maybe where { 12.43/5.03 import qualified Main; 12.43/5.03 import qualified Monad; 12.43/5.03 import qualified Prelude; 12.43/5.03 } 12.43/5.03 module Main where { 12.43/5.03 import qualified Maybe; 12.43/5.03 import qualified Monad; 12.43/5.03 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