Haskell 2019-04-01 06.52 pair #433316137

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	4.4952 seconds
cpu usage	11.5345
user time	11.2033
system time	0.331229
max virtual memory	1.8285568E7
max residence set size	616080.0

stage attributes

key	value
starexec-result	YES

output

9.04/3.80	YES
11.43/4.45	proof of /export/starexec/sandbox/benchmark/theBenchmark.hs
11.43/4.45	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
11.43/4.45	
11.43/4.45	
11.43/4.45	H-Termination with start terms of the given HASKELL could be proven:
11.43/4.45	
11.43/4.45	(0) HASKELL
11.43/4.45	(1) LR [EQUIVALENT, 0 ms]
11.43/4.45	(2) HASKELL
11.43/4.45	(3) IFR [EQUIVALENT, 0 ms]
11.43/4.45	(4) HASKELL
11.43/4.45	(5) BR [EQUIVALENT, 0 ms]
11.43/4.45	(6) HASKELL
11.43/4.45	(7) COR [EQUIVALENT, 0 ms]
11.43/4.45	(8) HASKELL
11.43/4.45	(9) LetRed [EQUIVALENT, 3 ms]
11.43/4.45	(10) HASKELL
11.43/4.45	(11) NumRed [SOUND, 0 ms]
11.43/4.45	(12) HASKELL
11.43/4.45	(13) Narrow [SOUND, 0 ms]
11.43/4.45	(14) AND
11.43/4.45	    (15) QDP
11.43/4.45	        (16) DependencyGraphProof [EQUIVALENT, 0 ms]
11.43/4.45	        (17) AND
11.43/4.45	            (18) QDP
11.43/4.45	                (19) MRRProof [EQUIVALENT, 11 ms]
11.43/4.45	                (20) QDP
11.43/4.45	                (21) PisEmptyProof [EQUIVALENT, 0 ms]
11.43/4.45	                (22) YES
11.43/4.45	            (23) QDP
11.43/4.45	                (24) QDPSizeChangeProof [EQUIVALENT, 5 ms]
11.43/4.45	                (25) YES
11.43/4.45	    (26) QDP
11.43/4.45	        (27) QDPSizeChangeProof [EQUIVALENT, 0 ms]
11.43/4.45	        (28) YES
11.43/4.45	
11.43/4.45	
11.43/4.45	----------------------------------------
11.43/4.45	
11.43/4.45	(0)
11.43/4.45	Obligation:
11.43/4.45	mainModule Main 
11.43/4.45	module Main where {
11.43/4.45	import qualified Prelude;
11.43/4.45	}
11.43/4.45	
11.43/4.45	----------------------------------------
11.43/4.45	
11.43/4.45	(1) LR (EQUIVALENT)
11.43/4.45	Lambda Reductions:
11.43/4.45	The following Lambda expression
11.43/4.45	"\(m,_)->m"
11.43/4.45	is transformed to
11.43/4.45	"m0 (m,_) = m;
11.43/4.45	"
11.43/4.45	The following Lambda expression
11.43/4.45	"\(q,_)->q"
11.43/4.45	is transformed to
11.43/4.45	"q1 (q,_) = q;
11.43/4.45	"
11.43/4.45	The following Lambda expression
11.43/4.45	"\(_,r)->r"
11.43/4.45	is transformed to
11.43/4.45	"r0 (_,r) = r;
11.43/4.45	"
11.43/4.45	
11.43/4.45	----------------------------------------
11.43/4.45	
11.43/4.45	(2)
11.43/4.45	Obligation:
11.43/4.45	mainModule Main 
11.43/4.45	module Main where {
11.43/4.45	import qualified Prelude;
11.43/4.45	}
11.43/4.45	
11.43/4.45	----------------------------------------
11.43/4.45	
11.43/4.45	(3) IFR (EQUIVALENT)
11.43/4.45	If Reductions:
11.43/4.45	The following If expression
11.43/4.45	"if primGEqNatS x y then Succ (primDivNatS (primMinusNatS x y) (Succ y)) else Zero"
11.43/4.45	is transformed to
11.43/4.45	"primDivNatS0 x y True = Succ (primDivNatS (primMinusNatS x y) (Succ y));
11.43/4.45	primDivNatS0 x y False = Zero;
11.43/4.45	"
11.43/4.45	The following If expression
11.43/4.45	"if primGEqNatS x y then primModNatS (primMinusNatS x y) (Succ y) else Succ x"
11.43/4.45	is transformed to
11.43/4.45	"primModNatS0 x y True = primModNatS (primMinusNatS x y) (Succ y);
11.43/4.45	primModNatS0 x y False = Succ x;
11.43/4.45	"
11.43/4.45	
11.43/4.45	----------------------------------------
11.43/4.45	
11.43/4.45	(4)
11.43/4.45	Obligation:
11.43/4.45	mainModule Main 
11.43/4.45	module Main where {
11.43/4.45	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