Haskell 2019-04-01 06.52 pair #433315826

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	4.51769 seconds
cpu usage	11.5609
user time	11.2413
system time	0.319615
max virtual memory	1.828352E7
max residence set size	661712.0

stage attributes

key	value
starexec-result	YES

output

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

popout

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

job log

popout

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