Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Haskell 2019-04-01 06.52 pair #433317043
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
n062.star.cs.uiowa.edu
space
full_haskell
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
4.55538 seconds
cpu usage
11.2907
user time
10.9628
system time
0.327908
max virtual memory
1.828352E7
max residence set size
612044.0
stage attributes
key
value
starexec-result
YES
output
8.90/3.92 YES 11.16/4.47 proof of /export/starexec/sandbox/benchmark/theBenchmark.hs 11.16/4.47 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 11.16/4.47 11.16/4.47 11.16/4.47 H-Termination with start terms of the given HASKELL could be proven: 11.16/4.47 11.16/4.47 (0) HASKELL 11.16/4.47 (1) LR [EQUIVALENT, 0 ms] 11.16/4.47 (2) HASKELL 11.16/4.47 (3) BR [EQUIVALENT, 0 ms] 11.16/4.47 (4) HASKELL 11.16/4.47 (5) COR [EQUIVALENT, 0 ms] 11.16/4.47 (6) HASKELL 11.16/4.47 (7) Narrow [EQUIVALENT, 17 ms] 11.16/4.47 (8) YES 11.16/4.47 11.16/4.47 11.16/4.47 ---------------------------------------- 11.16/4.47 11.16/4.47 (0) 11.16/4.47 Obligation: 11.16/4.47 mainModule Main 11.16/4.47 module Maybe where { 11.16/4.47 import qualified Main; 11.16/4.47 import qualified Monad; 11.16/4.47 import qualified Prelude; 11.16/4.47 } 11.16/4.47 module Main where { 11.16/4.47 import qualified Maybe; 11.16/4.47 import qualified Monad; 11.16/4.47 import qualified Prelude; 11.16/4.47 } 11.16/4.47 module Monad where { 11.16/4.47 import qualified Main; 11.16/4.47 import qualified Maybe; 11.16/4.47 import qualified Prelude; 11.16/4.47 liftM3 :: Monad e => (c -> a -> d -> b) -> e c -> e a -> e d -> e b; 11.16/4.47 liftM3 f m1 m2 m3 = m1 >>= (\x1 ->m2 >>= (\x2 ->m3 >>= (\x3 ->return (f x1 x2 x3)))); 11.16/4.47 11.16/4.47 } 11.16/4.47 11.16/4.47 ---------------------------------------- 11.16/4.47 11.16/4.47 (1) LR (EQUIVALENT) 11.16/4.47 Lambda Reductions: 11.16/4.47 The following Lambda expression 11.16/4.47 "\x3->return (f x1 x2 x3)" 11.16/4.47 is transformed to 11.16/4.47 "liftM30 f x1 x2 x3 = return (f x1 x2 x3); 11.16/4.47 " 11.16/4.47 The following Lambda expression 11.16/4.47 "\x2->m3 >>= liftM30 f x1 x2" 11.16/4.47 is transformed to 11.16/4.47 "liftM31 m3 f x1 x2 = m3 >>= liftM30 f x1 x2; 11.16/4.47 " 11.16/4.47 The following Lambda expression 11.16/4.47 "\x1->m2 >>= liftM31 m3 f x1" 11.16/4.47 is transformed to 11.16/4.47 "liftM32 m2 m3 f x1 = m2 >>= liftM31 m3 f x1; 11.16/4.47 " 11.16/4.47 11.16/4.47 ---------------------------------------- 11.16/4.47 11.16/4.47 (2) 11.16/4.47 Obligation: 11.16/4.47 mainModule Main 11.16/4.47 module Maybe where { 11.16/4.47 import qualified Main; 11.16/4.47 import qualified Monad; 11.16/4.47 import qualified Prelude; 11.16/4.47 } 11.16/4.47 module Main where { 11.16/4.47 import qualified Maybe; 11.16/4.47 import qualified Monad; 11.16/4.47 import qualified Prelude; 11.16/4.47 } 11.16/4.47 module Monad where { 11.16/4.47 import qualified Main; 11.16/4.47 import qualified Maybe; 11.16/4.47 import qualified Prelude; 11.16/4.47 liftM3 :: Monad e => (a -> c -> b -> d) -> e a -> e c -> e b -> e d; 11.16/4.47 liftM3 f m1 m2 m3 = m1 >>= liftM32 m2 m3 f; 11.16/4.47 11.16/4.47 liftM30 f x1 x2 x3 = return (f x1 x2 x3); 11.16/4.47 11.16/4.47 liftM31 m3 f x1 x2 = m3 >>= liftM30 f x1 x2; 11.16/4.47 11.16/4.47 liftM32 m2 m3 f x1 = m2 >>= liftM31 m3 f x1; 11.16/4.47 11.16/4.47 } 11.16/4.47 11.16/4.47 ---------------------------------------- 11.16/4.47 11.16/4.47 (3) BR (EQUIVALENT) 11.16/4.47 Replaced joker patterns by fresh variables and removed binding patterns. 11.16/4.47 ---------------------------------------- 11.16/4.47 11.16/4.47 (4) 11.16/4.47 Obligation:
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Haskell 2019-04-01 06.52