Haskell 2019-04-01 06.52 pair #433317024

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	4.47447 seconds
cpu usage	11.1353
user time	10.7838
system time	0.351464
max virtual memory	1.828352E7
max residence set size	612388.0

stage attributes

key	value
starexec-result	YES

output

9.13/3.91	YES
10.93/4.43	proof of /export/starexec/sandbox/benchmark/theBenchmark.hs
10.93/4.43	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
10.93/4.43	
10.93/4.43	
10.93/4.43	H-Termination with start terms of the given HASKELL could be proven:
10.93/4.43	
10.93/4.43	(0) HASKELL
10.93/4.43	(1) LR [EQUIVALENT, 0 ms]
10.93/4.43	(2) HASKELL
10.93/4.43	(3) BR [EQUIVALENT, 0 ms]
10.93/4.43	(4) HASKELL
10.93/4.43	(5) COR [EQUIVALENT, 0 ms]
10.93/4.43	(6) HASKELL
10.93/4.43	(7) Narrow [SOUND, 0 ms]
10.93/4.43	(8) QDP
10.93/4.43	(9) QDPSizeChangeProof [EQUIVALENT, 0 ms]
10.93/4.43	(10) YES
10.93/4.43	
10.93/4.43	
10.93/4.43	----------------------------------------
10.93/4.43	
10.93/4.43	(0)
10.93/4.43	Obligation:
10.93/4.43	mainModule Main 
10.93/4.43	module Maybe where {
10.93/4.43	import qualified Main;
10.93/4.43	import qualified Monad;
10.93/4.43	import qualified Prelude;
10.93/4.43	}
10.93/4.43	module Main where {
10.93/4.43	import qualified Maybe;
10.93/4.43	import qualified Monad;
10.93/4.43	import qualified Prelude;
10.93/4.43	}
10.93/4.43	module Monad where {
10.93/4.43	import qualified Main;
10.93/4.43	import qualified Maybe;
10.93/4.43	import qualified Prelude;
10.93/4.43	zipWithM :: Monad a => (b  ->  c  ->  a d)  ->  [b]  ->  [c]  ->  a [d];
10.93/4.43	zipWithM f xs ys = sequence (zipWith f xs ys);
10.93/4.43	
10.93/4.43	}
10.93/4.43	
10.93/4.43	----------------------------------------
10.93/4.43	
10.93/4.43	(1) LR (EQUIVALENT)
10.93/4.43	Lambda Reductions:
10.93/4.43	The following Lambda expression
10.93/4.43	"\xs->return (x : xs)"
10.93/4.43	is transformed to
10.93/4.43	"sequence0 x xs = return (x : xs);
10.93/4.43	"
10.93/4.43	The following Lambda expression
10.93/4.43	"\x->sequence cs >>= sequence0 x"
10.93/4.43	is transformed to
10.93/4.43	"sequence1 cs x = sequence cs >>= sequence0 x;
10.93/4.43	"
10.93/4.43	
10.93/4.43	----------------------------------------
10.93/4.43	
10.93/4.43	(2)
10.93/4.43	Obligation:
10.93/4.43	mainModule Main 
10.93/4.43	module Maybe where {
10.93/4.43	import qualified Main;
10.93/4.43	import qualified Monad;
10.93/4.43	import qualified Prelude;
10.93/4.43	}
10.93/4.43	module Main where {
10.93/4.43	import qualified Maybe;
10.93/4.43	import qualified Monad;
10.93/4.43	import qualified Prelude;
10.93/4.43	}
10.93/4.43	module Monad where {
10.93/4.43	import qualified Main;
10.93/4.43	import qualified Maybe;
10.93/4.43	import qualified Prelude;
10.93/4.43	zipWithM :: Monad b => (c  ->  d  ->  b a)  ->  [c]  ->  [d]  ->  b [a];
10.93/4.43	zipWithM f xs ys = sequence (zipWith f xs ys);
10.93/4.43	
10.93/4.43	}
10.93/4.43	
10.93/4.43	----------------------------------------
10.93/4.43	
10.93/4.43	(3) BR (EQUIVALENT)
10.93/4.43	Replaced joker patterns by fresh variables and removed binding patterns.
10.93/4.43	----------------------------------------
10.93/4.43	
10.93/4.43	(4)
10.93/4.43	Obligation:
10.93/4.43	mainModule Main 
10.93/4.43	module Maybe where {
10.93/4.43	import qualified Main;
10.93/4.43	import qualified Monad;
10.93/4.43	import qualified Prelude;
10.93/4.43	}
10.93/4.43	module Main where {
10.93/4.43	import qualified Maybe;
10.93/4.43	import qualified Monad;

popout

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

job log

popout

actions all output return to Haskell 2019-04-01 06.52