Haskell 2019-04-01 06.52 pair #433316736

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	4.41308 seconds
cpu usage	11.2527
user time	10.9289
system time	0.323839
max virtual memory	1.828352E7
max residence set size	613480.0

stage attributes

key	value
starexec-result	YES

output

9.12/3.84	YES
11.02/4.37	proof of /export/starexec/sandbox/benchmark/theBenchmark.hs
11.02/4.37	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
11.02/4.37	
11.02/4.37	
11.02/4.37	H-Termination with start terms of the given HASKELL could be proven:
11.02/4.37	
11.02/4.37	(0) HASKELL
11.02/4.37	(1) LR [EQUIVALENT, 0 ms]
11.02/4.37	(2) HASKELL
11.02/4.37	(3) BR [EQUIVALENT, 0 ms]
11.02/4.37	(4) HASKELL
11.02/4.37	(5) COR [EQUIVALENT, 0 ms]
11.02/4.37	(6) HASKELL
11.02/4.37	(7) Narrow [SOUND, 0 ms]
11.02/4.37	(8) AND
11.02/4.37	    (9) QDP
11.02/4.37	        (10) QDPSizeChangeProof [EQUIVALENT, 0 ms]
11.02/4.37	        (11) YES
11.02/4.37	    (12) QDP
11.02/4.37	        (13) QDPSizeChangeProof [EQUIVALENT, 0 ms]
11.02/4.37	        (14) YES
11.02/4.37	    (15) QDP
11.02/4.37	        (16) QDPSizeChangeProof [EQUIVALENT, 0 ms]
11.02/4.37	        (17) YES
11.02/4.37	
11.02/4.37	
11.02/4.37	----------------------------------------
11.02/4.37	
11.02/4.37	(0)
11.02/4.37	Obligation:
11.02/4.37	mainModule Main 
11.02/4.37	module Maybe where {
11.02/4.37	import qualified Main;
11.02/4.37	import qualified Monad;
11.02/4.37	import qualified Prelude;
11.02/4.37	}
11.02/4.37	module Main where {
11.02/4.37	import qualified Maybe;
11.02/4.37	import qualified Monad;
11.02/4.37	import qualified Prelude;
11.02/4.37	}
11.02/4.37	module Monad where {
11.02/4.37	import qualified Main;
11.02/4.37	import qualified Maybe;
11.02/4.37	import qualified Prelude;
11.02/4.37	ap :: Monad a => a (b  ->  c)  ->  a b  ->  a c;
11.02/4.37	ap = liftM2 id;
11.02/4.37	
11.02/4.37	liftM2 :: Monad c => (d  ->  a  ->  b)  ->  c d  ->  c a  ->  c b;
11.02/4.37	liftM2 f m1 m2 = m1 >>= (\x1 ->m2 >>= (\x2 ->return (f x1 x2)));
11.02/4.37	
11.02/4.37	}
11.02/4.37	
11.02/4.37	----------------------------------------
11.02/4.37	
11.02/4.37	(1) LR (EQUIVALENT)
11.02/4.37	Lambda Reductions:
11.02/4.37	The following Lambda expression
11.02/4.37	"\x2->return (f x1 x2)"
11.02/4.37	is transformed to
11.02/4.37	"liftM20 f x1 x2 = return (f x1 x2);
11.02/4.37	"
11.02/4.37	The following Lambda expression
11.02/4.37	"\x1->m2 >>= liftM20 f x1"
11.02/4.37	is transformed to
11.02/4.37	"liftM21 m2 f x1 = m2 >>= liftM20 f x1;
11.02/4.37	"
11.02/4.37	
11.02/4.37	----------------------------------------
11.02/4.37	
11.02/4.37	(2)
11.02/4.37	Obligation:
11.02/4.37	mainModule Main 
11.02/4.37	module Maybe where {
11.02/4.37	import qualified Main;
11.02/4.37	import qualified Monad;
11.02/4.37	import qualified Prelude;
11.02/4.37	}
11.02/4.37	module Main where {
11.02/4.37	import qualified Maybe;
11.02/4.37	import qualified Monad;
11.02/4.37	import qualified Prelude;
11.02/4.37	}
11.02/4.37	module Monad where {
11.02/4.37	import qualified Main;
11.02/4.37	import qualified Maybe;
11.02/4.37	import qualified Prelude;
11.02/4.37	ap :: Monad a => a (b  ->  c)  ->  a b  ->  a c;
11.02/4.37	ap = liftM2 id;
11.02/4.37	
11.02/4.37	liftM2 :: Monad b => (d  ->  a  ->  c)  ->  b d  ->  b a  ->  b c;
11.02/4.37	liftM2 f m1 m2 = m1 >>= liftM21 m2 f;
11.02/4.37	
11.02/4.37	liftM20 f x1 x2 = return (f x1 x2);
11.02/4.37	
11.02/4.37	liftM21 m2 f x1 = m2 >>= liftM20 f x1;
11.02/4.37	
11.02/4.37	}
11.02/4.37

popout

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

job log

popout

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