Haskell 2019-04-01 06.52 pair #433317142

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	5.04997 seconds
cpu usage	12.4689
user time	12.0897
system time	0.37921
max virtual memory	1.82858E7
max residence set size	731184.0

stage attributes

key	value
starexec-result	YES

output

10.31/4.40	YES
12.29/4.98	proof of /export/starexec/sandbox/benchmark/theBenchmark.hs
12.29/4.98	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
12.29/4.98	
12.29/4.98	
12.29/4.98	H-Termination with start terms of the given HASKELL could be proven:
12.29/4.98	
12.29/4.98	(0) HASKELL
12.29/4.98	(1) BR [EQUIVALENT, 0 ms]
12.29/4.98	(2) HASKELL
12.29/4.98	(3) COR [EQUIVALENT, 0 ms]
12.29/4.98	(4) HASKELL
12.29/4.98	(5) Narrow [SOUND, 0 ms]
12.29/4.98	(6) AND
12.29/4.98	    (7) QDP
12.29/4.98	        (8) QDPSizeChangeProof [EQUIVALENT, 0 ms]
12.29/4.98	        (9) YES
12.29/4.98	    (10) QDP
12.29/4.98	        (11) QDPSizeChangeProof [EQUIVALENT, 0 ms]
12.29/4.98	        (12) YES
12.29/4.98	    (13) QDP
12.29/4.98	        (14) QDPSizeChangeProof [EQUIVALENT, 0 ms]
12.29/4.98	        (15) YES
12.29/4.98	    (16) QDP
12.29/4.98	        (17) QDPSizeChangeProof [EQUIVALENT, 0 ms]
12.29/4.98	        (18) YES
12.29/4.98	    (19) QDP
12.29/4.98	        (20) QDPSizeChangeProof [EQUIVALENT, 0 ms]
12.29/4.98	        (21) YES
12.29/4.98	    (22) QDP
12.29/4.98	        (23) QDPSizeChangeProof [EQUIVALENT, 0 ms]
12.29/4.98	        (24) YES
12.29/4.98	    (25) QDP
12.29/4.98	        (26) DependencyGraphProof [EQUIVALENT, 0 ms]
12.29/4.98	        (27) AND
12.29/4.98	            (28) QDP
12.29/4.98	                (29) QDPSizeChangeProof [EQUIVALENT, 0 ms]
12.29/4.98	                (30) YES
12.29/4.98	            (31) QDP
12.29/4.98	                (32) QDPOrderProof [EQUIVALENT, 43 ms]
12.29/4.98	                (33) QDP
12.29/4.98	                (34) DependencyGraphProof [EQUIVALENT, 0 ms]
12.29/4.98	                (35) QDP
12.29/4.98	                (36) QDPSizeChangeProof [EQUIVALENT, 0 ms]
12.29/4.98	                (37) YES
12.29/4.98	
12.29/4.98	
12.29/4.98	----------------------------------------
12.29/4.98	
12.29/4.98	(0)
12.29/4.98	Obligation:
12.29/4.98	mainModule Main 
12.29/4.98	module Main where {
12.29/4.98	import qualified Prelude;
12.29/4.98	data MyBool = MyTrue  | MyFalse ;
12.29/4.98	
12.29/4.98	data MyInt = Pos Main.Nat  | Neg Main.Nat ;
12.29/4.98	
12.29/4.98	data Main.Nat = Succ Main.Nat  | Zero ;
12.29/4.98	
12.29/4.98	data Ratio a = CnPc a a ;
12.29/4.98	
12.29/4.98	data Tup2 b a = Tup2 b a ;
12.29/4.98	
12.29/4.98	dot :: (a  ->  b)  ->  (c  ->  a)  ->  c  ->  b;
12.29/4.98	dot f g x = f (g x);
12.29/4.98	
12.29/4.98	error :: a;
12.29/4.98	error = stop MyTrue;
12.29/4.98	
12.29/4.98	fromEnumRatioMyInt :: Ratio MyInt  ->  MyInt;
12.29/4.98	fromEnumRatioMyInt = truncate;
12.29/4.98	
12.29/4.98	fromIntRatioMyInt :: MyInt  ->  Ratio MyInt;
12.29/4.98	fromIntRatioMyInt x = CnPc x (Main.Pos Main.Zero);
12.29/4.98	
12.29/4.98	fst :: Tup2 a b  ->  a;
12.29/4.98	fst (Tup2 x _) = x;
12.29/4.98	
12.29/4.98	pred :: Ratio MyInt  ->  Ratio MyInt;
12.29/4.98	pred = dot toEnumRatioMyInt (dot (subtract (Main.Pos (Main.Succ Main.Zero))) fromEnumRatioMyInt);
12.29/4.98	
12.29/4.98	primDivNatS :: Main.Nat  ->  Main.Nat  ->  Main.Nat;
12.29/4.98	primDivNatS Main.Zero Main.Zero = Main.error;
12.29/4.98	primDivNatS (Main.Succ x) Main.Zero = Main.error;
12.29/4.98	primDivNatS (Main.Succ x) (Main.Succ y) = primDivNatS0 x y (primGEqNatS x y);
12.29/4.98	primDivNatS Main.Zero (Main.Succ x) = Main.Zero;
12.29/4.98	
12.29/4.98	primDivNatS0 x y MyTrue = Main.Succ (primDivNatS (primMinusNatS x y) (Main.Succ y));
12.29/4.98	primDivNatS0 x y MyFalse = Main.Zero;
12.29/4.98	
12.29/4.98	primGEqNatS :: Main.Nat  ->  Main.Nat  ->  MyBool;
12.29/4.98	primGEqNatS (Main.Succ x) Main.Zero = MyTrue;
12.29/4.98	primGEqNatS (Main.Succ x) (Main.Succ y) = primGEqNatS x y;
12.29/4.98	primGEqNatS Main.Zero (Main.Succ x) = MyFalse;
12.29/4.98	primGEqNatS Main.Zero Main.Zero = MyTrue;
12.29/4.98	
12.29/4.98	primMinusInt :: MyInt  ->  MyInt  ->  MyInt;
12.29/4.98	primMinusInt (Main.Pos x) (Main.Neg y) = Main.Pos (primPlusNat x y);
12.29/4.98	primMinusInt (Main.Neg x) (Main.Pos y) = Main.Neg (primPlusNat x y);

popout

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

job log

popout

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