Haskell 2019-04-01 06.52 pair #433317217

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	8.69929 seconds
cpu usage	24.2919
user time	23.575
system time	0.716974
max virtual memory	1.8353612E7
max residence set size	1852432.0

stage attributes

key	value
starexec-result	YES

output

21.37/7.85	YES
23.81/8.49	proof of /export/starexec/sandbox/benchmark/theBenchmark.hs
23.81/8.49	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
23.81/8.49	
23.81/8.49	
23.81/8.49	H-Termination with start terms of the given HASKELL could be proven:
23.81/8.49	
23.81/8.49	(0) HASKELL
23.81/8.49	(1) BR [EQUIVALENT, 0 ms]
23.81/8.49	(2) HASKELL
23.81/8.49	(3) COR [EQUIVALENT, 0 ms]
23.81/8.49	(4) HASKELL
23.81/8.49	(5) Narrow [SOUND, 0 ms]
23.81/8.49	(6) AND
23.81/8.49	    (7) QDP
23.81/8.49	        (8) QDPOrderProof [EQUIVALENT, 23 ms]
23.81/8.49	        (9) QDP
23.81/8.49	        (10) DependencyGraphProof [EQUIVALENT, 0 ms]
23.81/8.49	        (11) QDP
23.81/8.49	        (12) QDPSizeChangeProof [EQUIVALENT, 0 ms]
23.81/8.49	        (13) YES
23.81/8.49	    (14) QDP
23.81/8.49	        (15) DependencyGraphProof [EQUIVALENT, 0 ms]
23.81/8.49	        (16) QDP
23.81/8.49	        (17) QDPOrderProof [EQUIVALENT, 7 ms]
23.81/8.49	        (18) QDP
23.81/8.49	        (19) DependencyGraphProof [EQUIVALENT, 0 ms]
23.81/8.49	        (20) QDP
23.81/8.49	        (21) QDPSizeChangeProof [EQUIVALENT, 0 ms]
23.81/8.49	        (22) YES
23.81/8.49	    (23) QDP
23.81/8.49	        (24) QDPSizeChangeProof [EQUIVALENT, 0 ms]
23.81/8.49	        (25) YES
23.81/8.49	    (26) QDP
23.81/8.49	        (27) QDPSizeChangeProof [EQUIVALENT, 0 ms]
23.81/8.49	        (28) YES
23.81/8.49	    (29) QDP
23.81/8.49	        (30) QDPSizeChangeProof [EQUIVALENT, 0 ms]
23.81/8.49	        (31) YES
23.81/8.49	
23.81/8.49	
23.81/8.49	----------------------------------------
23.81/8.49	
23.81/8.49	(0)
23.81/8.49	Obligation:
23.81/8.49	mainModule Main 
23.81/8.49	module Main where {
23.81/8.49	import qualified Prelude;
23.81/8.49	data MyBool = MyTrue  | MyFalse ;
23.81/8.49	
23.81/8.49	data MyInt = Pos Main.Nat  | Neg Main.Nat ;
23.81/8.49	
23.81/8.49	data Main.Nat = Succ Main.Nat  | Zero ;
23.81/8.49	
23.81/8.49	data Ordering = LT  | EQ  | GT ;
23.81/8.49	
23.81/8.49	data Tup2 b a = Tup2 b a ;
23.81/8.49	
23.81/8.49	compareMyInt :: MyInt  ->  MyInt  ->  Ordering;
23.81/8.49	compareMyInt = primCmpInt;
23.81/8.49	
23.81/8.49	divModDivMod0 wx wy d MyTrue = Tup2 (msMyInt (divModQ wx wy) (fromIntMyInt (Main.Pos (Main.Succ Main.Zero)))) (psMyInt (divModR wx wy) d);
23.81/8.49	divModDivMod0 wx wy d MyFalse = divModQr wx wy;
23.81/8.49	
23.81/8.49	divModMyInt :: MyInt  ->  MyInt  ->  Tup2 MyInt MyInt;
23.81/8.49	divModMyInt n d = divModDivMod0 n d d (esEsMyInt (signumMyInt (divModR n d)) (negateMyInt (signumMyInt d)));
23.81/8.49	
23.81/8.49	divModQ wx wy = divModQ1 wx wy (divModVu5 wx wy);
23.81/8.49	
23.81/8.49	divModQ1 wx wy (Tup2 q vv) = q;
23.81/8.49	
23.81/8.49	divModQr wx wy = divModQr0 wx wy (divModVu5 wx wy);
23.81/8.49	
23.81/8.49	divModQr0 wx wy qr = qr;
23.81/8.49	
23.81/8.49	divModR wx wy = divModR0 wx wy (divModVu5 wx wy);
23.81/8.49	
23.81/8.49	divModR0 wx wy (Tup2 vw r) = r;
23.81/8.49	
23.81/8.49	divModVu5 wx wy = quotRemMyInt wx wy;
23.81/8.49	
23.81/8.49	error :: a;
23.81/8.49	error = stop MyTrue;
23.81/8.49	
23.81/8.49	esEsMyInt :: MyInt  ->  MyInt  ->  MyBool;
23.81/8.49	esEsMyInt = primEqInt;
23.81/8.49	
23.81/8.49	esEsOrdering :: Ordering  ->  Ordering  ->  MyBool;
23.81/8.49	esEsOrdering LT LT = MyTrue;
23.81/8.49	esEsOrdering LT EQ = MyFalse;
23.81/8.49	esEsOrdering LT GT = MyFalse;
23.81/8.49	esEsOrdering EQ LT = MyFalse;
23.81/8.49	esEsOrdering EQ EQ = MyTrue;
23.81/8.49	esEsOrdering EQ GT = MyFalse;
23.81/8.49	esEsOrdering GT LT = MyFalse;
23.81/8.49	esEsOrdering GT EQ = MyFalse;
23.81/8.49	esEsOrdering GT GT = MyTrue;
23.81/8.49	
23.81/8.49	fromIntMyInt :: MyInt  ->  MyInt;
23.81/8.49	fromIntMyInt x = x;

popout

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

job log

popout

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