Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Haskell pair #487599570
details
property
value
status
complete
benchmark
Monad_liftM2_3.hs
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n083.star.cs.uiowa.edu
space
full_haskell
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
4.50551199913 seconds
cpu usage
11.284315992
max memory
6.18553344E8
stage attributes
key
value
output-size
6684
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, 18 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; liftM2 :: Monad d => (b -> a -> c) -> d b -> d a -> d c; liftM2 f m1 m2 = m1 >>= (\x1 ->m2 >>= (\x2 ->return (f x1 x2))); } ---------------------------------------- (1) LR (EQUIVALENT) Lambda Reductions: The following Lambda expression "\x2->return (f x1 x2)" is transformed to "liftM20 f x1 x2 = return (f x1 x2); " The following Lambda expression "\x1->m2 >>= liftM20 f x1" is transformed to "liftM21 m2 f x1 = m2 >>= liftM20 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; liftM2 :: Monad a => (c -> d -> b) -> a c -> a d -> a b; liftM2 f m1 m2 = m1 >>= liftM21 m2 f; liftM20 f x1 x2 = return (f x1 x2); liftM21 m2 f x1 = m2 >>= liftM20 f x1; } ---------------------------------------- (3) BR (EQUIVALENT) Replaced joker patterns by fresh variables and removed binding patterns. ---------------------------------------- (4) Obligation: mainModule Main
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Haskell