Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Haskell pair #487599447
details
property
value
status
complete
benchmark
Monad_foldM__3.hs
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n100.star.cs.uiowa.edu
space
full_haskell
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
4.67566013336 seconds
cpu usage
11.983651866
max memory
6.71166464E8
stage attributes
key
value
output-size
9179
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 [SOUND, 0 ms] (8) QDP (9) QDPSizeChangeProof [EQUIVALENT, 0 ms] (10) 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; foldM :: Monad a => (c -> b -> a c) -> c -> [b] -> a c; foldM _ a [] = return a; foldM f a (x : xs) = f a x >>= (\fax ->foldM f fax xs); foldM_ :: Monad c => (b -> a -> c b) -> b -> [a] -> c (); foldM_ f a xs = foldM f a xs >> return (); } ---------------------------------------- (1) LR (EQUIVALENT) Lambda Reductions: The following Lambda expression "\_->q" is transformed to "gtGt0 q _ = q; " The following Lambda expression "\fax->foldM f fax xs" is transformed to "foldM0 f xs fax = foldM f fax xs; " ---------------------------------------- (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; foldM :: Monad b => (a -> c -> b a) -> a -> [c] -> b a; foldM _ a [] = return a; foldM f a (x : xs) = f a x >>= foldM0 f xs; foldM0 f xs fax = foldM f fax xs; foldM_ :: Monad b => (c -> a -> b c) -> c -> [a] -> b (); foldM_ f a xs = foldM f a xs >> return (); } ----------------------------------------
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Haskell