details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	4.56669 seconds
cpu usage	11.2668
user time	10.9768
system time	0.289927
max virtual memory	1.828352E7
max residence set size	615072.0

stage attributes

key	value
starexec-result	YES

output

8.79/3.92 YES 11.04/4.50 proof of /export/starexec/sandbox2/benchmark/theBenchmark.hs 11.04/4.50 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 11.04/4.50 11.04/4.50 11.04/4.50 H-Termination with start terms of the given HASKELL could be proven: 11.04/4.50 11.04/4.50 (0) HASKELL 11.04/4.50 (1) LR [EQUIVALENT, 0 ms] 11.04/4.50 (2) HASKELL 11.04/4.50 (3) BR [EQUIVALENT, 0 ms] 11.04/4.50 (4) HASKELL 11.04/4.50 (5) COR [EQUIVALENT, 0 ms] 11.04/4.50 (6) HASKELL 11.04/4.50 (7) Narrow [EQUIVALENT, 17 ms] 11.04/4.50 (8) YES 11.04/4.50 11.04/4.50 11.04/4.50 ---------------------------------------- 11.04/4.50 11.04/4.50 (0) 11.04/4.50 Obligation: 11.04/4.50 mainModule Main 11.04/4.50 module Maybe where { 11.04/4.50 import qualified Main; 11.04/4.50 import qualified Monad; 11.04/4.50 import qualified Prelude; 11.04/4.50 } 11.04/4.50 module Main where { 11.04/4.50 import qualified Maybe; 11.04/4.50 import qualified Monad; 11.04/4.50 import qualified Prelude; 11.04/4.50 } 11.04/4.50 module Monad where { 11.04/4.50 import qualified Main; 11.04/4.50 import qualified Maybe; 11.04/4.50 import qualified Prelude; 11.04/4.50 liftM4 :: Monad e => (d -> a -> b -> c -> f) -> e d -> e a -> e b -> e c -> e f; 11.04/4.50 liftM4 f m1 m2 m3 m4 = m1 >>= (\x1 ->m2 >>= (\x2 ->m3 >>= (\x3 ->m4 >>= (\x4 ->return (f x1 x2 x3 x4))))); 11.04/4.50 11.04/4.50 } 11.04/4.50 11.04/4.50 ---------------------------------------- 11.04/4.50 11.04/4.50 (1) LR (EQUIVALENT) 11.04/4.50 Lambda Reductions: 11.04/4.50 The following Lambda expression 11.04/4.50 "\x4->return (f x1 x2 x3 x4)" 11.04/4.50 is transformed to 11.04/4.50 "liftM40 f x1 x2 x3 x4 = return (f x1 x2 x3 x4); 11.04/4.50 " 11.04/4.50 The following Lambda expression 11.04/4.50 "\x3->m4 >>= liftM40 f x1 x2 x3" 11.04/4.50 is transformed to 11.04/4.50 "liftM41 m4 f x1 x2 x3 = m4 >>= liftM40 f x1 x2 x3; 11.04/4.50 " 11.04/4.50 The following Lambda expression 11.04/4.50 "\x2->m3 >>= liftM41 m4 f x1 x2" 11.04/4.50 is transformed to 11.04/4.50 "liftM42 m3 m4 f x1 x2 = m3 >>= liftM41 m4 f x1 x2; 11.04/4.50 " 11.04/4.50 The following Lambda expression 11.04/4.50 "\x1->m2 >>= liftM42 m3 m4 f x1" 11.04/4.50 is transformed to 11.04/4.50 "liftM43 m2 m3 m4 f x1 = m2 >>= liftM42 m3 m4 f x1; 11.04/4.50 " 11.04/4.50 11.04/4.50 ---------------------------------------- 11.04/4.50 11.04/4.50 (2) 11.04/4.50 Obligation: 11.04/4.50 mainModule Main 11.04/4.50 module Maybe where { 11.04/4.50 import qualified Main; 11.04/4.50 import qualified Monad; 11.04/4.50 import qualified Prelude; 11.04/4.50 } 11.04/4.50 module Main where { 11.04/4.50 import qualified Maybe; 11.04/4.50 import qualified Monad; 11.04/4.50 import qualified Prelude; 11.04/4.50 } 11.04/4.50 module Monad where { 11.04/4.50 import qualified Main; 11.04/4.50 import qualified Maybe; 11.04/4.50 import qualified Prelude; 11.04/4.50 liftM4 :: Monad a => (f -> e -> b -> c -> d) -> a f -> a e -> a b -> a c -> a d; 11.04/4.50 liftM4 f m1 m2 m3 m4 = m1 >>= liftM43 m2 m3 m4 f; 11.04/4.50 11.04/4.50 liftM40 f x1 x2 x3 x4 = return (f x1 x2 x3 x4); 11.04/4.50 11.04/4.50 liftM41 m4 f x1 x2 x3 = m4 >>= liftM40 f x1 x2 x3; 11.04/4.50 11.04/4.50 liftM42 m3 m4 f x1 x2 = m3 >>= liftM41 m4 f x1 x2; 11.04/4.50 11.04/4.50 liftM43 m2 m3 m4 f x1 = m2 >>= liftM42 m3 m4 f x1; 11.04/4.50 11.04/4.50 } 11.04/4.50 11.04/4.50 ---------------------------------------- popout

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

job log

popout

actions

all output return to Haskell 2019-04-01 06.52