Haskell 2019-04-01 06.52 pair #433316175

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	4.58091 seconds
cpu usage	11.5543
user time	11.2146
system time	0.339666
max virtual memory	1.828352E7
max residence set size	734944.0

stage attributes

key	value
starexec-result	YES

output

9.19/3.92	YES
11.32/4.53	proof of /export/starexec/sandbox/benchmark/theBenchmark.hs
11.32/4.53	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
11.32/4.53	
11.32/4.53	
11.32/4.53	H-Termination with start terms of the given HASKELL could be proven:
11.32/4.53	
11.32/4.53	(0) HASKELL
11.32/4.53	(1) LR [EQUIVALENT, 0 ms]
11.32/4.53	(2) HASKELL
11.32/4.53	(3) BR [EQUIVALENT, 0 ms]
11.32/4.53	(4) HASKELL
11.32/4.53	(5) COR [EQUIVALENT, 0 ms]
11.32/4.53	(6) HASKELL
11.32/4.53	(7) LetRed [EQUIVALENT, 0 ms]
11.32/4.53	(8) HASKELL
11.32/4.53	(9) NumRed [SOUND, 0 ms]
11.32/4.53	(10) HASKELL
11.32/4.53	(11) Narrow [SOUND, 0 ms]
11.32/4.53	(12) AND
11.32/4.53	    (13) QDP
11.32/4.53	        (14) QDPSizeChangeProof [EQUIVALENT, 0 ms]
11.32/4.53	        (15) YES
11.32/4.53	    (16) QDP
11.32/4.53	        (17) QDPSizeChangeProof [EQUIVALENT, 0 ms]
11.32/4.53	        (18) YES
11.32/4.53	    (19) QDP
11.32/4.53	        (20) QDPSizeChangeProof [EQUIVALENT, 0 ms]
11.32/4.53	        (21) YES
11.32/4.53	
11.32/4.53	
11.32/4.53	----------------------------------------
11.32/4.53	
11.32/4.53	(0)
11.32/4.53	Obligation:
11.32/4.53	mainModule Main 
11.32/4.53	module Main where {
11.32/4.53	import qualified Prelude;
11.32/4.53	}
11.32/4.53	
11.32/4.53	----------------------------------------
11.32/4.53	
11.32/4.53	(1) LR (EQUIVALENT)
11.32/4.53	Lambda Reductions:
11.32/4.53	The following Lambda expression
11.32/4.53	"\(m,_)->m"
11.32/4.53	is transformed to
11.32/4.53	"m0 (m,_) = m;
11.32/4.53	"
11.32/4.53	
11.32/4.53	----------------------------------------
11.32/4.53	
11.32/4.53	(2)
11.32/4.53	Obligation:
11.32/4.53	mainModule Main 
11.32/4.53	module Main where {
11.32/4.53	import qualified Prelude;
11.32/4.53	}
11.32/4.53	
11.32/4.53	----------------------------------------
11.32/4.53	
11.32/4.53	(3) BR (EQUIVALENT)
11.32/4.53	Replaced joker patterns by fresh variables and removed binding patterns.
11.32/4.53	----------------------------------------
11.32/4.53	
11.32/4.53	(4)
11.32/4.53	Obligation:
11.32/4.53	mainModule Main 
11.32/4.53	module Main where {
11.32/4.53	import qualified Prelude;
11.32/4.53	}
11.32/4.53	
11.32/4.53	----------------------------------------
11.32/4.53	
11.32/4.53	(5) COR (EQUIVALENT)
11.32/4.53	Cond Reductions:
11.32/4.53	The following Function with conditions
11.32/4.53	"undefined |Falseundefined;
11.32/4.53	"
11.32/4.53	is transformed to
11.32/4.53	"undefined  = undefined1;
11.32/4.53	"
11.32/4.53	"undefined0 True = undefined;
11.32/4.53	"
11.32/4.53	"undefined1  = undefined0 False;
11.32/4.53	"
11.32/4.53	The following Function with conditions
11.32/4.53	"power wv 0 = 1.0;
11.32/4.53	power x ww@(y+1) = fromInt x * power x y;
11.32/4.53	power x y = 1.0 / power x (`negate` y);
11.32/4.53	"
11.32/4.53	is transformed to
11.32/4.53	"power wv xw = power4 wv xw;
11.32/4.53	power x ww = power2 x ww;
11.32/4.53	power x y = power0 x y;
11.32/4.53	"
11.32/4.53	"power0 x y = 1.0 / power x (`negate` y);
11.32/4.53	"
11.32/4.53	"power1 True x ww = fromInt x * power x (ww - 1);
11.32/4.53	power1 wx wy wz = power0 wy wz;

popout

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

job log

popout

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