Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Haskell pair #487599234
details
property
value
status
complete
benchmark
Monad_filterM_2.hs
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n146.star.cs.uiowa.edu
space
full_haskell
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
10.1005961895 seconds
cpu usage
13.10640594
max memory
6.27888128E8
stage attributes
key
value
output-size
69065
starexec-result
MAYBE
output
/export/starexec/sandbox/solver/bin/starexec_run_standard /export/starexec/sandbox/benchmark/theBenchmark.hs /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- MAYBE 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 not be shown: (0) HASKELL (1) LR [EQUIVALENT, 0 ms] (2) HASKELL (3) IFR [EQUIVALENT, 0 ms] (4) HASKELL (5) BR [EQUIVALENT, 0 ms] (6) HASKELL (7) COR [EQUIVALENT, 0 ms] (8) HASKELL (9) Narrow [SOUND, 0 ms] (10) AND (11) QDP (12) DependencyGraphProof [EQUIVALENT, 0 ms] (13) AND (14) QDP (15) QDPSizeChangeProof [EQUIVALENT, 0 ms] (16) YES (17) QDP (18) QDPSizeChangeProof [EQUIVALENT, 0 ms] (19) YES (20) QDP (21) QDPOrderProof [EQUIVALENT, 37 ms] (22) QDP (23) DependencyGraphProof [EQUIVALENT, 0 ms] (24) QDP (25) MNOCProof [EQUIVALENT, 0 ms] (26) QDP (27) NonTerminationLoopProof [COMPLETE, 0 ms] (28) NO (29) QDP (30) QDPSizeChangeProof [EQUIVALENT, 0 ms] (31) YES (32) QDP (33) QDPSizeChangeProof [EQUIVALENT, 0 ms] (34) YES (35) Narrow [COMPLETE, 0 ms] (36) TRUE ---------------------------------------- (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; filterM :: Monad a => (b -> a Bool) -> [b] -> a [b]; filterM _ [] = return []; filterM p (x : xs) = p x >>= (\flg ->filterM p xs >>= (\ys ->return ( if flg then x : ys else ys))); } ---------------------------------------- (1) LR (EQUIVALENT) Lambda Reductions: The following Lambda expression "\ys->return (if flg then x : ys else ys)" is transformed to "filterM0 flg x ys = return (if flg then x : ys else ys); " The following Lambda expression "\flg->filterM p xs >>= filterM0 flg x" is transformed to "filterM1 p xs x flg = filterM p xs >>= filterM0 flg x; " ---------------------------------------- (2) Obligation: mainModule Main module Maybe where { import qualified Main; import qualified Monad;
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Haskell