details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	4.39903306961 seconds
cpu usage	10.891197292
max memory	6.17365504E8

stage attributes

key	value
output-size	17880
starexec-result	YES

output

/export/starexec/sandbox2/solver/bin/starexec_run_standard /export/starexec/sandbox2/benchmark/theBenchmark.hs /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES proof of /export/starexec/sandbox2/benchmark/theBenchmark.hs # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty H-Termination with start terms of the given HASKELL could be proven: (0) HASKELL (1) LR [EQUIVALENT, 0 ms] (2) HASKELL (3) BR [EQUIVALENT, 0 ms] (4) HASKELL (5) COR [EQUIVALENT, 0 ms] (6) HASKELL (7) Narrow [EQUIVALENT, 14 ms] (8) YES ---------------------------------------- (0) Obligation: mainModule Main module Maybe where { import qualified Main; import qualified Monad; import qualified Prelude; } module Main where { import qualified Maybe; import qualified Monad; import qualified Prelude; } module Monad where { import qualified Main; import qualified Maybe; import qualified Prelude; liftM5 :: Monad b => (c -> d -> g -> a -> e -> f) -> b c -> b d -> b g -> b a -> b e -> b f; liftM5 f m1 m2 m3 m4 m5 = m1 >>= (\x1 ->m2 >>= (\x2 ->m3 >>= (\x3 ->m4 >>= (\x4 ->m5 >>= (\x5 ->return (f x1 x2 x3 x4 x5)))))); } ---------------------------------------- (1) LR (EQUIVALENT) Lambda Reductions: The following Lambda expression "\x5->return (f x1 x2 x3 x4 x5)" is transformed to "liftM50 f x1 x2 x3 x4 x5 = return (f x1 x2 x3 x4 x5); " The following Lambda expression "\x4->m5 >>= liftM50 f x1 x2 x3 x4" is transformed to "liftM51 m5 f x1 x2 x3 x4 = m5 >>= liftM50 f x1 x2 x3 x4; " The following Lambda expression "\x3->m4 >>= liftM51 m5 f x1 x2 x3" is transformed to "liftM52 m4 m5 f x1 x2 x3 = m4 >>= liftM51 m5 f x1 x2 x3; " The following Lambda expression "\x2->m3 >>= liftM52 m4 m5 f x1 x2" is transformed to "liftM53 m3 m4 m5 f x1 x2 = m3 >>= liftM52 m4 m5 f x1 x2; " The following Lambda expression "\x1->m2 >>= liftM53 m3 m4 m5 f x1" is transformed to "liftM54 m2 m3 m4 m5 f x1 = m2 >>= liftM53 m3 m4 m5 f x1; " ---------------------------------------- (2) Obligation: mainModule Main module Maybe where { import qualified Main; import qualified Monad; import qualified Prelude; } module Main where { import qualified Maybe; import qualified Monad; import qualified Prelude; } module Monad where { import qualified Main; import qualified Maybe; import qualified Prelude; liftM5 :: Monad c => (g -> a -> e -> b -> d -> f) -> c g -> c a -> c e -> c b -> c d -> c f; liftM5 f m1 m2 m3 m4 m5 = m1 >>= liftM54 m2 m3 m4 m5 f; popout

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

job log

popout

actions

all output return to Funct Progr 77531