Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Haskell pair #487599028
details
property
value
status
complete
benchmark
Monad_liftM5_3.hs
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n102.star.cs.uiowa.edu
space
full_haskell
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
5.33746790886 seconds
cpu usage
11.379273504
max memory
6.561792E8
stage attributes
key
value
output-size
12119
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, 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 c => (g -> d -> b -> a -> f -> e) -> c g -> c d -> c b -> c a -> c f -> c e; 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 => (f -> e -> a -> d -> b -> g) -> c f -> c e -> c a -> c d -> c b -> c g; 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 Haskell