Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Haskell pair #487599639
details
property
value
status
complete
benchmark
Monad_liftM3_4.hs
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n147.star.cs.uiowa.edu
space
full_haskell
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
4.67462682724 seconds
cpu usage
11.446536879
max memory
6.53017088E8
stage attributes
key
value
output-size
11822
starexec-result
YES
output
/export/starexec/sandbox/solver/bin/starexec_run_standard /export/starexec/sandbox/benchmark/theBenchmark.hs /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES proof of /export/starexec/sandbox/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, 10 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; liftM3 :: Monad c => (e -> a -> d -> b) -> c e -> c a -> c d -> c b; liftM3 f m1 m2 m3 = m1 >>= (\x1 ->m2 >>= (\x2 ->m3 >>= (\x3 ->return (f x1 x2 x3)))); } ---------------------------------------- (1) LR (EQUIVALENT) Lambda Reductions: The following Lambda expression "\x3->return (f x1 x2 x3)" is transformed to "liftM30 f x1 x2 x3 = return (f x1 x2 x3); " The following Lambda expression "\x2->m3 >>= liftM30 f x1 x2" is transformed to "liftM31 m3 f x1 x2 = m3 >>= liftM30 f x1 x2; " The following Lambda expression "\x1->m2 >>= liftM31 m3 f x1" is transformed to "liftM32 m2 m3 f x1 = m2 >>= liftM31 m3 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; liftM3 :: Monad a => (e -> c -> b -> d) -> a e -> a c -> a b -> a d; liftM3 f m1 m2 m3 = m1 >>= liftM32 m2 m3 f; liftM30 f x1 x2 x3 = return (f x1 x2 x3); liftM31 m3 f x1 x2 = m3 >>= liftM30 f x1 x2; liftM32 m2 m3 f x1 = m2 >>= liftM31 m3 f x1; } ----------------------------------------
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Haskell