Haskell pair #487598639

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	4.64677500725 seconds
cpu usage	11.531972953
max memory	6.77650432E8

stage attributes

key	value
output-size	10329
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;
zipWithM_ :: Monad a => (d  ->  c  ->  a b)  ->  [d]  ->  [c]  ->  a ();
zipWithM_ f xs ys = sequence_ (zipWith f xs ys);

}

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

(1) LR (EQUIVALENT)
Lambda Reductions:
The following Lambda expression
"\_->q"
is transformed to
"gtGt0 q _ = q;
"

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

(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;
zipWithM_ :: Monad a => (b  ->  d  ->  a c)  ->  [b]  ->  [d]  ->  a ();
zipWithM_ f xs ys = sequence_ (zipWith f xs ys);

}

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

(3) BR (EQUIVALENT)
Replaced joker patterns by fresh variables and removed binding patterns.
----------------------------------------

(4)
Obligation:
mainModule Main 
module Maybe where {
import qualified Main;
import qualified Monad;
import qualified Prelude;
}
module Main where {
import qualified Maybe;

popout

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

job log

popout

actions all output return to Haskell