Haskell pair #487599097

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	n108.star.cs.uiowa.edu
space	full_haskell

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	4.86714100838 seconds
cpu usage	12.208216643
max memory	6.70855168E8

stage attributes

key	value
output-size	34123
starexec-result	MAYBE

output

/export/starexec/sandbox2/solver/bin/starexec_run_standard /export/starexec/sandbox2/benchmark/theBenchmark.hs /export/starexec/sandbox2/output/output_files


--------------------------------------------------------------------------------


MAYBE
proof of /export/starexec/sandbox2/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) DependencyGraphProof [EQUIVALENT, 0 ms]
        (11) AND
            (12) QDP
                (13) QDPSizeChangeProof [EQUIVALENT, 0 ms]
                (14) YES
            (15) QDP
                (16) MRRProof [EQUIVALENT, 0 ms]
                (17) QDP
                (18) DependencyGraphProof [EQUIVALENT, 0 ms]
                (19) QDP
                (20) NonTerminationLoopProof [COMPLETE, 3 ms]
                (21) NO
            (22) QDP
                (23) QDPSizeChangeProof [EQUIVALENT, 0 ms]
                (24) YES
    (25) QDP
        (26) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (27) YES
(28) Narrow [COMPLETE, 0 ms]
(29) QDP
    (30) DependencyGraphProof [EQUIVALENT, 0 ms]
    (31) 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;
foldM :: Monad b => (a  ->  c  ->  b a)  ->  a  ->  [c]  ->  b a;
foldM _ a [] = return a;
foldM f a (x : xs) = f a x >>= (\fax ->foldM f fax xs);

}

----------------------------------------

(1) LR (EQUIVALENT)
Lambda Reductions:
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;

popout

output may be truncated. 'popout' for the full output.

job log

popout

actions all output return to Haskell