Haskell pair #487599396

details

property	value
status	complete
benchmark	Monad_filterM_1.hs
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n101.star.cs.uiowa.edu
space	full_haskell

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	5.00707888603 seconds
cpu usage	12.706003485
max memory	6.95353344E8

stage attributes

key	value
output-size	36317
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) 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) QDPOrderProof [EQUIVALENT, 0 ms]
        (13) QDP
        (14) DependencyGraphProof [EQUIVALENT, 0 ms]
        (15) QDP
        (16) MNOCProof [EQUIVALENT, 0 ms]
        (17) QDP
        (18) NonTerminationLoopProof [COMPLETE, 0 ms]
        (19) NO
    (20) QDP
        (21) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (22) YES
    (23) QDP
        (24) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (25) YES
(26) Narrow [COMPLETE, 0 ms]
(27) 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 b => (a  ->  b Bool)  ->  [a]  ->  b [a];
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;
import qualified Prelude;
}
module Main where {
import qualified Maybe;
import qualified Monad;
import qualified Prelude;
}
module Monad where {
import qualified Main;

popout

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

job log

popout

actions all output return to Haskell