Haskell 2019-04-01 06.52 pair #433315992

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	8.59952 seconds
cpu usage	16.8994
user time	16.3873
system time	0.512066
max virtual memory	1.828614E7
max residence set size	1281552.0

stage attributes

key	value
starexec-result	YES

output

13.54/5.29	YES
16.69/6.21	proof of /export/starexec/sandbox/benchmark/theBenchmark.hs
16.69/6.21	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
16.69/6.21	
16.69/6.21	
16.69/6.21	H-Termination with start terms of the given HASKELL could be proven:
16.69/6.21	
16.69/6.21	(0) HASKELL
16.69/6.21	(1) CR [EQUIVALENT, 0 ms]
16.69/6.21	(2) HASKELL
16.69/6.21	(3) IFR [EQUIVALENT, 0 ms]
16.69/6.21	(4) HASKELL
16.69/6.21	(5) BR [EQUIVALENT, 0 ms]
16.69/6.21	(6) HASKELL
16.69/6.21	(7) COR [EQUIVALENT, 15 ms]
16.69/6.21	(8) HASKELL
16.69/6.21	(9) LetRed [EQUIVALENT, 0 ms]
16.69/6.21	(10) HASKELL
16.69/6.21	(11) NumRed [SOUND, 0 ms]
16.69/6.21	(12) HASKELL
16.69/6.21	(13) Narrow [SOUND, 0 ms]
16.69/6.21	(14) AND
16.69/6.21	    (15) QDP
16.69/6.21	        (16) QDPSizeChangeProof [EQUIVALENT, 0 ms]
16.69/6.21	        (17) YES
16.69/6.21	    (18) QDP
16.69/6.21	        (19) DependencyGraphProof [EQUIVALENT, 0 ms]
16.69/6.21	        (20) QDP
16.69/6.21	        (21) QDPSizeChangeProof [EQUIVALENT, 219 ms]
16.69/6.21	        (22) YES
16.69/6.21	    (23) QDP
16.69/6.21	        (24) QDPSizeChangeProof [EQUIVALENT, 0 ms]
16.69/6.21	        (25) YES
16.69/6.21	    (26) QDP
16.69/6.21	        (27) QDPSizeChangeProof [EQUIVALENT, 0 ms]
16.69/6.21	        (28) YES
16.69/6.21	    (29) QDP
16.69/6.21	        (30) QDPSizeChangeProof [EQUIVALENT, 0 ms]
16.69/6.21	        (31) YES
16.69/6.21	    (32) QDP
16.69/6.21	        (33) QDPSizeChangeProof [EQUIVALENT, 0 ms]
16.69/6.21	        (34) YES
16.69/6.21	
16.69/6.21	
16.69/6.21	----------------------------------------
16.69/6.21	
16.69/6.21	(0)
16.69/6.21	Obligation:
16.69/6.21	mainModule Main 
16.69/6.21	module Main where {
16.69/6.21	import qualified Prelude;
16.69/6.21	}
16.69/6.21	
16.69/6.21	----------------------------------------
16.69/6.21	
16.69/6.21	(1) CR (EQUIVALENT)
16.69/6.21	Case Reductions:
16.69/6.21	The following Case expression
16.69/6.21	"case compare x y of {
16.69/6.21	EQ  -> o;
16.69/6.21	LT  -> LT;
16.69/6.21	GT  -> GT}
16.69/6.21	"
16.69/6.21	is transformed to
16.69/6.21	"primCompAux0 o EQ = o;
16.69/6.21	primCompAux0 o LT = LT;
16.69/6.21	primCompAux0 o GT = GT;
16.69/6.21	"
16.69/6.21	
16.69/6.21	----------------------------------------
16.69/6.21	
16.69/6.21	(2)
16.69/6.21	Obligation:
16.69/6.21	mainModule Main 
16.69/6.21	module Main where {
16.69/6.21	import qualified Prelude;
16.69/6.21	}
16.69/6.21	
16.69/6.21	----------------------------------------
16.69/6.21	
16.69/6.21	(3) IFR (EQUIVALENT)
16.69/6.21	If Reductions:
16.69/6.21	The following If expression
16.69/6.21	"if primGEqNatS x y then Succ (primDivNatS (primMinusNatS x y) (Succ y)) else Zero"
16.69/6.21	is transformed to
16.69/6.21	"primDivNatS0 x y True = Succ (primDivNatS (primMinusNatS x y) (Succ y));
16.69/6.21	primDivNatS0 x y False = Zero;
16.69/6.21	"
16.69/6.21	The following If expression
16.69/6.21	"if primGEqNatS x y then primModNatS (primMinusNatS x y) (Succ y) else Succ x"
16.69/6.21	is transformed to
16.69/6.21	"primModNatS0 x y True = primModNatS (primMinusNatS x y) (Succ y);
16.69/6.21	primModNatS0 x y False = Succ x;
16.69/6.21	"
16.69/6.21	
16.69/6.21	----------------------------------------
16.69/6.21	
16.69/6.21	(4)
16.69/6.21	Obligation:
16.69/6.21	mainModule Main

popout

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

job log

popout

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