Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Haskell 2019-04-01 06.52 pair #433315855
details
property
value
status
complete
benchmark
Monad_foldM_2.hs
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n122.star.cs.uiowa.edu
space
full_haskell
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
4.6896 seconds
cpu usage
11.4817
user time
11.165
system time
0.316706
max virtual memory
1.828548E7
max residence set size
619336.0
stage attributes
key
value
starexec-result
MAYBE
output
9.37/4.12 MAYBE 11.32/4.65 proof of /export/starexec/sandbox2/benchmark/theBenchmark.hs 11.32/4.65 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 11.32/4.65 11.32/4.65 11.32/4.65 H-Termination with start terms of the given HASKELL could not be shown: 11.32/4.65 11.32/4.65 (0) HASKELL 11.32/4.65 (1) LR [EQUIVALENT, 0 ms] 11.32/4.65 (2) HASKELL 11.32/4.65 (3) BR [EQUIVALENT, 0 ms] 11.32/4.65 (4) HASKELL 11.32/4.65 (5) COR [EQUIVALENT, 0 ms] 11.32/4.65 (6) HASKELL 11.32/4.65 (7) Narrow [SOUND, 0 ms] 11.32/4.65 (8) AND 11.32/4.65 (9) QDP 11.32/4.65 (10) DependencyGraphProof [EQUIVALENT, 0 ms] 11.32/4.65 (11) AND 11.32/4.65 (12) QDP 11.32/4.65 (13) QDPSizeChangeProof [EQUIVALENT, 0 ms] 11.32/4.65 (14) YES 11.32/4.65 (15) QDP 11.32/4.65 (16) MRRProof [EQUIVALENT, 0 ms] 11.32/4.65 (17) QDP 11.32/4.65 (18) DependencyGraphProof [EQUIVALENT, 0 ms] 11.32/4.65 (19) QDP 11.32/4.65 (20) NonTerminationLoopProof [COMPLETE, 2 ms] 11.32/4.65 (21) NO 11.32/4.65 (22) QDP 11.32/4.65 (23) QDPSizeChangeProof [EQUIVALENT, 0 ms] 11.32/4.65 (24) YES 11.32/4.65 (25) QDP 11.32/4.65 (26) QDPSizeChangeProof [EQUIVALENT, 0 ms] 11.32/4.65 (27) YES 11.32/4.65 (28) Narrow [COMPLETE, 0 ms] 11.32/4.65 (29) QDP 11.32/4.65 (30) DependencyGraphProof [EQUIVALENT, 0 ms] 11.32/4.65 (31) TRUE 11.32/4.65 11.32/4.65 11.32/4.65 ---------------------------------------- 11.32/4.65 11.32/4.65 (0) 11.32/4.65 Obligation: 11.32/4.65 mainModule Main 11.32/4.65 module Maybe where { 11.32/4.65 import qualified Main; 11.32/4.65 import qualified Monad; 11.32/4.65 import qualified Prelude; 11.32/4.65 } 11.32/4.65 module Main where { 11.32/4.65 import qualified Maybe; 11.32/4.65 import qualified Monad; 11.32/4.65 import qualified Prelude; 11.32/4.65 } 11.32/4.65 module Monad where { 11.32/4.65 import qualified Main; 11.32/4.65 import qualified Maybe; 11.32/4.65 import qualified Prelude; 11.32/4.65 foldM :: Monad c => (b -> a -> c b) -> b -> [a] -> c b; 11.32/4.65 foldM _ a [] = return a; 11.32/4.65 foldM f a (x : xs) = f a x >>= (\fax ->foldM f fax xs); 11.32/4.65 11.32/4.65 } 11.32/4.65 11.32/4.65 ---------------------------------------- 11.32/4.65 11.32/4.65 (1) LR (EQUIVALENT) 11.32/4.65 Lambda Reductions: 11.32/4.65 The following Lambda expression 11.32/4.65 "\fax->foldM f fax xs" 11.32/4.65 is transformed to 11.32/4.65 "foldM0 f xs fax = foldM f fax xs; 11.32/4.65 " 11.32/4.65 11.32/4.65 ---------------------------------------- 11.32/4.65 11.32/4.65 (2) 11.32/4.65 Obligation: 11.32/4.65 mainModule Main 11.32/4.65 module Maybe where { 11.32/4.65 import qualified Main; 11.32/4.65 import qualified Monad; 11.32/4.65 import qualified Prelude; 11.32/4.65 } 11.32/4.65 module Main where { 11.32/4.65 import qualified Maybe; 11.32/4.65 import qualified Monad; 11.32/4.65 import qualified Prelude; 11.32/4.65 } 11.32/4.65 module Monad where { 11.32/4.65 import qualified Main; 11.32/4.65 import qualified Maybe; 11.32/4.65 import qualified Prelude; 11.32/4.65 foldM :: Monad c => (a -> b -> c a) -> a -> [b] -> c a; 11.32/4.65 foldM _ a [] = return a; 11.32/4.65 foldM f a (x : xs) = f a x >>= foldM0 f xs; 11.32/4.65 11.32/4.65 foldM0 f xs fax = foldM f fax xs;
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Haskell 2019-04-01 06.52