Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Haskell pair #487598941
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
n100.star.cs.uiowa.edu
space
full_haskell
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
4.68319702148 seconds
cpu usage
12.21051368
max memory
6.39668224E8
stage attributes
key
value
output-size
14790
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: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 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, 6 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; liftM4 :: Monad e => (d -> b -> c -> f -> a) -> e d -> e b -> e c -> e f -> e a; liftM4 f m1 m2 m3 m4 = m1 >>= (\x1 ->m2 >>= (\x2 ->m3 >>= (\x3 ->m4 >>= (\x4 ->return (f x1 x2 x3 x4))))); } ---------------------------------------- (1) LR (EQUIVALENT) Lambda Reductions: The following Lambda expression "\x4->return (f x1 x2 x3 x4)" is transformed to "liftM40 f x1 x2 x3 x4 = return (f x1 x2 x3 x4); " The following Lambda expression "\x3->m4 >>= liftM40 f x1 x2 x3" is transformed to "liftM41 m4 f x1 x2 x3 = m4 >>= liftM40 f x1 x2 x3; " The following Lambda expression "\x2->m3 >>= liftM41 m4 f x1 x2" is transformed to "liftM42 m3 m4 f x1 x2 = m3 >>= liftM41 m4 f x1 x2; " The following Lambda expression "\x1->m2 >>= liftM42 m3 m4 f x1" is transformed to "liftM43 m2 m3 m4 f x1 = m2 >>= liftM42 m3 m4 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; liftM4 :: Monad a => (f -> b -> c -> d -> e) -> a f -> a b -> a c -> a d -> a e; liftM4 f m1 m2 m3 m4 = m1 >>= liftM43 m2 m3 m4 f; liftM40 f x1 x2 x3 x4 = return (f x1 x2 x3 x4); liftM41 m4 f x1 x2 x3 = m4 >>= liftM40 f x1 x2 x3; liftM42 m3 m4 f x1 x2 = m3 >>= liftM41 m4 f x1 x2;
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Haskell