Haskell 2019-04-01 06.52 pair #433317116

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	6.07678 seconds
cpu usage	11.2654
user time	10.9064
system time	0.358961
max virtual memory	1.8290696E7
max residence set size	633560.0

stage attributes

key	value
starexec-result	YES

output

8.74/3.90	YES
11.08/4.53	proof of /export/starexec/sandbox/benchmark/theBenchmark.hs
11.08/4.53	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
11.08/4.53	
11.08/4.53	
11.08/4.53	H-Termination with start terms of the given HASKELL could be proven:
11.08/4.53	
11.08/4.53	(0) HASKELL
11.08/4.53	(1) BR [EQUIVALENT, 0 ms]
11.08/4.53	(2) HASKELL
11.08/4.53	(3) COR [EQUIVALENT, 0 ms]
11.08/4.53	(4) HASKELL
11.08/4.53	(5) Narrow [SOUND, 0 ms]
11.08/4.53	(6) AND
11.08/4.53	    (7) QDP
11.08/4.53	        (8) QDPSizeChangeProof [EQUIVALENT, 0 ms]
11.08/4.53	        (9) YES
11.08/4.53	    (10) QDP
11.08/4.53	        (11) DependencyGraphProof [EQUIVALENT, 0 ms]
11.08/4.53	        (12) AND
11.08/4.53	            (13) QDP
11.08/4.53	                (14) QDPSizeChangeProof [EQUIVALENT, 0 ms]
11.08/4.53	                (15) YES
11.08/4.53	            (16) QDP
11.08/4.53	                (17) MRRProof [EQUIVALENT, 2 ms]
11.08/4.53	                (18) QDP
11.08/4.53	                (19) PisEmptyProof [EQUIVALENT, 0 ms]
11.08/4.53	                (20) YES
11.08/4.53	
11.08/4.53	
11.08/4.53	----------------------------------------
11.08/4.53	
11.08/4.53	(0)
11.08/4.53	Obligation:
11.08/4.53	mainModule Main 
11.08/4.53	module Main where {
11.08/4.53	import qualified Prelude;
11.08/4.53	data Float = Float MyInt MyInt ;
11.08/4.53	
11.08/4.53	data MyBool = MyTrue  | MyFalse ;
11.08/4.53	
11.08/4.53	data MyInt = Pos Main.Nat  | Neg Main.Nat ;
11.08/4.53	
11.08/4.53	data Main.Nat = Succ Main.Nat  | Zero ;
11.08/4.53	
11.08/4.53	data Tup2 b a = Tup2 b a ;
11.08/4.53	
11.08/4.53	error :: a;
11.08/4.53	error = stop MyTrue;
11.08/4.53	
11.08/4.53	floatProperFractionFloat (Float wy wz) = Tup2 (fromIntMyInt (quotMyInt wy wz)) (msFloat (Float wy wz) (fromIntFloat (quotMyInt wy wz)));
11.08/4.53	
11.08/4.53	fromIntFloat :: MyInt  ->  Float;
11.08/4.53	fromIntFloat = primIntToFloat;
11.08/4.53	
11.08/4.53	fromIntMyInt :: MyInt  ->  MyInt;
11.08/4.53	fromIntMyInt x = x;
11.08/4.53	
11.08/4.53	msFloat :: Float  ->  Float  ->  Float;
11.08/4.53	msFloat = primMinusFloat;
11.08/4.53	
11.08/4.53	msMyInt :: MyInt  ->  MyInt  ->  MyInt;
11.08/4.53	msMyInt = primMinusInt;
11.08/4.53	
11.08/4.53	primDivNatS :: Main.Nat  ->  Main.Nat  ->  Main.Nat;
11.08/4.53	primDivNatS Main.Zero Main.Zero = Main.error;
11.08/4.53	primDivNatS (Main.Succ x) Main.Zero = Main.error;
11.08/4.53	primDivNatS (Main.Succ x) (Main.Succ y) = primDivNatS0 x y (primGEqNatS x y);
11.08/4.53	primDivNatS Main.Zero (Main.Succ x) = Main.Zero;
11.08/4.53	
11.08/4.53	primDivNatS0 x y MyTrue = Main.Succ (primDivNatS (primMinusNatS x y) (Main.Succ y));
11.08/4.53	primDivNatS0 x y MyFalse = Main.Zero;
11.08/4.53	
11.08/4.53	primGEqNatS :: Main.Nat  ->  Main.Nat  ->  MyBool;
11.08/4.53	primGEqNatS (Main.Succ x) Main.Zero = MyTrue;
11.08/4.53	primGEqNatS (Main.Succ x) (Main.Succ y) = primGEqNatS x y;
11.08/4.53	primGEqNatS Main.Zero (Main.Succ x) = MyFalse;
11.08/4.53	primGEqNatS Main.Zero Main.Zero = MyTrue;
11.08/4.53	
11.08/4.53	primIntToFloat :: MyInt  ->  Float;
11.08/4.53	primIntToFloat x = Float x (Main.Pos (Main.Succ Main.Zero));
11.08/4.53	
11.08/4.53	primMinusFloat :: Float  ->  Float  ->  Float;
11.08/4.53	primMinusFloat (Float x1 x2) (Float y1 y2) = Float (msMyInt x1 y1) (srMyInt x2 y2);
11.08/4.53	
11.08/4.53	primMinusInt :: MyInt  ->  MyInt  ->  MyInt;
11.08/4.53	primMinusInt (Main.Pos x) (Main.Neg y) = Main.Pos (primPlusNat x y);
11.08/4.53	primMinusInt (Main.Neg x) (Main.Pos y) = Main.Neg (primPlusNat x y);
11.08/4.53	primMinusInt (Main.Neg x) (Main.Neg y) = primMinusNat y x;
11.08/4.53	primMinusInt (Main.Pos x) (Main.Pos y) = primMinusNat x y;
11.08/4.53	
11.08/4.53	primMinusNat :: Main.Nat  ->  Main.Nat  ->  MyInt;
11.08/4.53	primMinusNat Main.Zero Main.Zero = Main.Pos Main.Zero;
11.08/4.53	primMinusNat Main.Zero (Main.Succ y) = Main.Neg (Main.Succ y);
11.08/4.53	primMinusNat (Main.Succ x) Main.Zero = Main.Pos (Main.Succ x);
11.08/4.53	primMinusNat (Main.Succ x) (Main.Succ y) = primMinusNat x y;
11.08/4.53	
11.08/4.53	primMinusNatS :: Main.Nat  ->  Main.Nat  ->  Main.Nat;
11.08/4.53	primMinusNatS (Main.Succ x) (Main.Succ y) = primMinusNatS x y;
11.08/4.53	primMinusNatS Main.Zero (Main.Succ y) = Main.Zero;

popout

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

job log

popout

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