Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Haskell pair #487598679
details
property
value
status
complete
benchmark
Monad_zipWithM_1.hs
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n105.star.cs.uiowa.edu
space
full_haskell
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
4.83631896973 seconds
cpu usage
12.544011615
max memory
6.61495808E8
stage attributes
key
value
output-size
64061
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) BR [EQUIVALENT, 0 ms] (4) HASKELL (5) COR [EQUIVALENT, 0 ms] (6) HASKELL (7) Narrow [SOUND, 0 ms] (8) AND (9) QDP (10) QDPSizeChangeProof [EQUIVALENT, 0 ms] (11) YES (12) QDP (13) QDPSizeChangeProof [EQUIVALENT, 0 ms] (14) YES (15) QDP (16) DependencyGraphProof [EQUIVALENT, 0 ms] (17) AND (18) QDP (19) QDPSizeChangeProof [EQUIVALENT, 0 ms] (20) YES (21) QDP (22) QDPSizeChangeProof [EQUIVALENT, 0 ms] (23) YES (24) QDP (25) QDPOrderProof [EQUIVALENT, 3 ms] (26) QDP (27) DependencyGraphProof [EQUIVALENT, 0 ms] (28) QDP (29) MNOCProof [EQUIVALENT, 0 ms] (30) QDP (31) NonTerminationLoopProof [COMPLETE, 3 ms] (32) NO (33) Narrow [COMPLETE, 0 ms] (34) 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; zipWithM :: Monad c => (d -> b -> c a) -> [d] -> [b] -> c [a]; zipWithM f xs ys = sequence (zipWith f xs ys); } ---------------------------------------- (1) LR (EQUIVALENT) Lambda Reductions: The following Lambda expression "\xs->return (x : xs)" is transformed to "sequence0 x xs = return (x : xs); " The following Lambda expression "\x->sequence cs >>= sequence0 x" is transformed to "sequence1 cs x = sequence cs >>= sequence0 x; " ---------------------------------------- (2) Obligation: mainModule Main module Maybe where { import qualified Main; import qualified Monad; import qualified Prelude; } module Main where {
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Haskell