details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	4.55251 seconds
cpu usage	11.4787
user time	11.1611
system time	0.317557
max virtual memory	1.828352E7
max residence set size	643512.0

stage attributes

key	value
starexec-result	YES

output

9.12/3.92 YES 11.32/4.50 proof of /export/starexec/sandbox/benchmark/theBenchmark.hs 11.32/4.50 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 11.32/4.50 11.32/4.50 11.32/4.50 H-Termination with start terms of the given HASKELL could be proven: 11.32/4.50 11.32/4.50 (0) HASKELL 11.32/4.50 (1) LR [EQUIVALENT, 0 ms] 11.32/4.50 (2) HASKELL 11.32/4.50 (3) BR [EQUIVALENT, 0 ms] 11.32/4.50 (4) HASKELL 11.32/4.50 (5) COR [EQUIVALENT, 0 ms] 11.32/4.50 (6) HASKELL 11.32/4.50 (7) Narrow [SOUND, 0 ms] 11.32/4.50 (8) QDP 11.32/4.50 (9) QDPSizeChangeProof [EQUIVALENT, 0 ms] 11.32/4.50 (10) YES 11.32/4.50 11.32/4.50 11.32/4.50 ---------------------------------------- 11.32/4.50 11.32/4.50 (0) 11.32/4.50 Obligation: 11.32/4.50 mainModule Main 11.32/4.50 module Maybe where { 11.32/4.50 import qualified Main; 11.32/4.50 import qualified Monad; 11.32/4.50 import qualified Prelude; 11.32/4.50 } 11.32/4.50 module Main where { 11.32/4.50 import qualified Maybe; 11.32/4.50 import qualified Monad; 11.32/4.50 import qualified Prelude; 11.32/4.50 } 11.32/4.50 module Monad where { 11.32/4.50 import qualified Main; 11.32/4.50 import qualified Maybe; 11.32/4.50 import qualified Prelude; 11.32/4.50 zipWithM_ :: Monad b => (d -> a -> b c) -> [d] -> [a] -> b (); 11.32/4.50 zipWithM_ f xs ys = sequence_ (zipWith f xs ys); 11.32/4.50 11.32/4.50 } 11.32/4.50 11.32/4.50 ---------------------------------------- 11.32/4.50 11.32/4.50 (1) LR (EQUIVALENT) 11.32/4.50 Lambda Reductions: 11.32/4.50 The following Lambda expression 11.32/4.50 "\_->q" 11.32/4.50 is transformed to 11.32/4.50 "gtGt0 q _ = q; 11.32/4.50 " 11.32/4.50 11.32/4.50 ---------------------------------------- 11.32/4.50 11.32/4.50 (2) 11.32/4.50 Obligation: 11.32/4.50 mainModule Main 11.32/4.50 module Maybe where { 11.32/4.50 import qualified Main; 11.32/4.50 import qualified Monad; 11.32/4.50 import qualified Prelude; 11.32/4.50 } 11.32/4.50 module Main where { 11.32/4.50 import qualified Maybe; 11.32/4.50 import qualified Monad; 11.32/4.50 import qualified Prelude; 11.32/4.50 } 11.32/4.50 module Monad where { 11.32/4.50 import qualified Main; 11.32/4.50 import qualified Maybe; 11.32/4.50 import qualified Prelude; 11.32/4.50 zipWithM_ :: Monad c => (b -> a -> c d) -> [b] -> [a] -> c (); 11.32/4.50 zipWithM_ f xs ys = sequence_ (zipWith f xs ys); 11.32/4.50 11.32/4.50 } 11.32/4.50 11.32/4.50 ---------------------------------------- 11.32/4.50 11.32/4.50 (3) BR (EQUIVALENT) 11.32/4.50 Replaced joker patterns by fresh variables and removed binding patterns. 11.32/4.50 ---------------------------------------- 11.32/4.50 11.32/4.50 (4) 11.32/4.50 Obligation: 11.32/4.50 mainModule Main 11.32/4.50 module Maybe where { 11.32/4.50 import qualified Main; 11.32/4.50 import qualified Monad; 11.32/4.50 import qualified Prelude; 11.32/4.50 } 11.32/4.50 module Main where { 11.32/4.50 import qualified Maybe; 11.32/4.50 import qualified Monad; 11.32/4.50 import qualified Prelude; 11.32/4.50 } 11.32/4.50 module Monad where { 11.32/4.50 import qualified Main; 11.32/4.50 import qualified Maybe; popout

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

job log

popout

actions

all output return to Haskell 2019-04-01 06.52