details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	5.53375 seconds
cpu usage	12.5529
user time	12.2023
system time	0.350656
max virtual memory	1.82858E7
max residence set size	653180.0

stage attributes

key	value
starexec-result	MAYBE

output

10.25/4.90 MAYBE 12.36/5.49 proof of /export/starexec/sandbox/benchmark/theBenchmark.hs 12.36/5.49 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 12.36/5.49 12.36/5.49 12.36/5.49 H-Termination with start terms of the given HASKELL could not be shown: 12.36/5.49 12.36/5.49 (0) HASKELL 12.36/5.49 (1) LR [EQUIVALENT, 0 ms] 12.36/5.49 (2) HASKELL 12.36/5.49 (3) BR [EQUIVALENT, 0 ms] 12.36/5.49 (4) HASKELL 12.36/5.49 (5) COR [EQUIVALENT, 0 ms] 12.36/5.49 (6) HASKELL 12.36/5.49 (7) Narrow [SOUND, 0 ms] 12.36/5.49 (8) AND 12.36/5.49 (9) QDP 12.36/5.49 (10) QDPSizeChangeProof [EQUIVALENT, 0 ms] 12.36/5.49 (11) YES 12.36/5.49 (12) QDP 12.36/5.49 (13) QDPOrderProof [EQUIVALENT, 27 ms] 12.36/5.49 (14) QDP 12.36/5.49 (15) DependencyGraphProof [EQUIVALENT, 0 ms] 12.36/5.49 (16) QDP 12.36/5.49 (17) MNOCProof [EQUIVALENT, 0 ms] 12.36/5.49 (18) QDP 12.36/5.49 (19) NonTerminationLoopProof [COMPLETE, 0 ms] 12.36/5.49 (20) NO 12.36/5.49 (21) QDP 12.36/5.49 (22) QDPSizeChangeProof [EQUIVALENT, 0 ms] 12.36/5.49 (23) YES 12.36/5.49 (24) Narrow [COMPLETE, 0 ms] 12.36/5.49 (25) TRUE 12.36/5.49 12.36/5.49 12.36/5.49 ---------------------------------------- 12.36/5.49 12.36/5.49 (0) 12.36/5.49 Obligation: 12.36/5.49 mainModule Main 12.36/5.49 module Maybe where { 12.36/5.49 import qualified Main; 12.36/5.49 import qualified Monad; 12.36/5.49 import qualified Prelude; 12.36/5.49 } 12.36/5.49 module Main where { 12.36/5.49 import qualified Maybe; 12.36/5.49 import qualified Monad; 12.36/5.49 import qualified Prelude; 12.36/5.49 } 12.36/5.49 module Monad where { 12.36/5.49 import qualified Main; 12.36/5.49 import qualified Maybe; 12.36/5.49 import qualified Prelude; 12.36/5.49 zipWithM :: Monad a => (d -> c -> a b) -> [d] -> [c] -> a [b]; 12.36/5.49 zipWithM f xs ys = sequence (zipWith f xs ys); 12.36/5.49 12.36/5.49 } 12.36/5.49 12.36/5.49 ---------------------------------------- 12.36/5.49 12.36/5.49 (1) LR (EQUIVALENT) 12.36/5.49 Lambda Reductions: 12.36/5.49 The following Lambda expression 12.36/5.49 "\xs->return (x : xs)" 12.36/5.49 is transformed to 12.36/5.49 "sequence0 x xs = return (x : xs); 12.36/5.49 " 12.36/5.49 The following Lambda expression 12.36/5.49 "\x->sequence cs >>= sequence0 x" 12.36/5.49 is transformed to 12.36/5.49 "sequence1 cs x = sequence cs >>= sequence0 x; 12.36/5.49 " 12.36/5.49 12.36/5.49 ---------------------------------------- 12.36/5.49 12.36/5.49 (2) 12.36/5.49 Obligation: 12.36/5.49 mainModule Main 12.36/5.49 module Maybe where { 12.36/5.49 import qualified Main; 12.36/5.49 import qualified Monad; 12.36/5.49 import qualified Prelude; 12.36/5.49 } 12.36/5.49 module Main where { 12.36/5.49 import qualified Maybe; 12.36/5.49 import qualified Monad; 12.36/5.49 import qualified Prelude; 12.36/5.49 } 12.36/5.49 module Monad where { 12.36/5.49 import qualified Main; 12.36/5.49 import qualified Maybe; 12.36/5.49 import qualified Prelude; 12.36/5.49 zipWithM :: Monad c => (d -> b -> c a) -> [d] -> [b] -> c [a]; 12.36/5.49 zipWithM f xs ys = sequence (zipWith f xs ys); 12.36/5.49 12.36/5.49 } 12.36/5.49 12.36/5.49 ---------------------------------------- 12.36/5.49 popout

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

job log

popout

actions

all output return to Haskell 2019-04-01 06.52