Haskell 2019-04-01 06.52 pair #433316896

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	8.58258 seconds
cpu usage	20.5961
user time	19.8331
system time	0.763014
max virtual memory	1.8285568E7
max residence set size	2574020.0

stage attributes

key	value
starexec-result	YES

output

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