Haskell 2019-04-01 06.52 pair #433317447

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	7.76737 seconds
cpu usage	11.0783
user time	10.7524
system time	0.325885
max virtual memory	1.82858E7
max residence set size	598192.0

stage attributes

key	value
starexec-result	YES

output

8.98/3.96	YES
10.99/4.49	proof of /export/starexec/sandbox/benchmark/theBenchmark.hs
10.99/4.49	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
10.99/4.49	
10.99/4.49	
10.99/4.49	H-Termination with start terms of the given HASKELL could be proven:
10.99/4.49	
10.99/4.49	(0) HASKELL
10.99/4.49	(1) BR [EQUIVALENT, 0 ms]
10.99/4.49	(2) HASKELL
10.99/4.49	(3) COR [EQUIVALENT, 0 ms]
10.99/4.49	(4) HASKELL
10.99/4.49	(5) Narrow [SOUND, 0 ms]
10.99/4.49	(6) AND
10.99/4.49	    (7) QDP
10.99/4.49	        (8) DependencyGraphProof [EQUIVALENT, 0 ms]
10.99/4.49	        (9) AND
10.99/4.49	            (10) QDP
10.99/4.49	                (11) QDPSizeChangeProof [EQUIVALENT, 13 ms]
10.99/4.49	                (12) YES
10.99/4.49	            (13) QDP
10.99/4.49	                (14) QDPOrderProof [EQUIVALENT, 0 ms]
10.99/4.49	                (15) QDP
10.99/4.49	                (16) DependencyGraphProof [EQUIVALENT, 0 ms]
10.99/4.49	                (17) QDP
10.99/4.49	                (18) QDPSizeChangeProof [EQUIVALENT, 0 ms]
10.99/4.49	                (19) YES
10.99/4.49	    (20) QDP
10.99/4.49	        (21) DependencyGraphProof [EQUIVALENT, 0 ms]
10.99/4.49	        (22) AND
10.99/4.49	            (23) QDP
10.99/4.49	                (24) QDPSizeChangeProof [EQUIVALENT, 0 ms]
10.99/4.49	                (25) YES
10.99/4.49	            (26) QDP
10.99/4.49	                (27) QDPSizeChangeProof [EQUIVALENT, 0 ms]
10.99/4.49	                (28) YES
10.99/4.49	    (29) QDP
10.99/4.49	        (30) QDPSizeChangeProof [EQUIVALENT, 0 ms]
10.99/4.49	        (31) YES
10.99/4.49	
10.99/4.49	
10.99/4.49	----------------------------------------
10.99/4.49	
10.99/4.49	(0)
10.99/4.49	Obligation:
10.99/4.49	mainModule Main 
10.99/4.49	module Main where {
10.99/4.49	import qualified Prelude;
10.99/4.49	data MyBool = MyTrue  | MyFalse ;
10.99/4.49	
10.99/4.49	data MyInt = Pos Main.Nat  | Neg Main.Nat ;
10.99/4.49	
10.99/4.49	data Main.Nat = Succ Main.Nat  | Zero ;
10.99/4.49	
10.99/4.49	error :: a;
10.99/4.49	error = stop MyTrue;
10.99/4.49	
10.99/4.49	modMyInt :: MyInt  ->  MyInt  ->  MyInt;
10.99/4.49	modMyInt = primModInt;
10.99/4.49	
10.99/4.49	primGEqNatS :: Main.Nat  ->  Main.Nat  ->  MyBool;
10.99/4.49	primGEqNatS (Main.Succ x) Main.Zero = MyTrue;
10.99/4.49	primGEqNatS (Main.Succ x) (Main.Succ y) = primGEqNatS x y;
10.99/4.49	primGEqNatS Main.Zero (Main.Succ x) = MyFalse;
10.99/4.49	primGEqNatS Main.Zero Main.Zero = MyTrue;
10.99/4.49	
10.99/4.49	primMinusNatS :: Main.Nat  ->  Main.Nat  ->  Main.Nat;
10.99/4.49	primMinusNatS (Main.Succ x) (Main.Succ y) = primMinusNatS x y;
10.99/4.49	primMinusNatS Main.Zero (Main.Succ y) = Main.Zero;
10.99/4.49	primMinusNatS x Main.Zero = x;
10.99/4.49	
10.99/4.49	primModInt :: MyInt  ->  MyInt  ->  MyInt;
10.99/4.49	primModInt (Main.Pos x) (Main.Pos (Main.Succ y)) = Main.Pos (primModNatS x (Main.Succ y));
10.99/4.49	primModInt (Main.Pos x) (Main.Neg (Main.Succ y)) = Main.Neg (primModNatP x (Main.Succ y));
10.99/4.49	primModInt (Main.Neg x) (Main.Pos (Main.Succ y)) = Main.Pos (primModNatP x (Main.Succ y));
10.99/4.49	primModInt (Main.Neg x) (Main.Neg (Main.Succ y)) = Main.Neg (primModNatS x (Main.Succ y));
10.99/4.49	primModInt vv vw = Main.error;
10.99/4.49	
10.99/4.49	primModNatP :: Main.Nat  ->  Main.Nat  ->  Main.Nat;
10.99/4.49	primModNatP Main.Zero Main.Zero = Main.error;
10.99/4.49	primModNatP Main.Zero (Main.Succ x) = Main.Zero;
10.99/4.49	primModNatP (Main.Succ x) Main.Zero = Main.error;
10.99/4.49	primModNatP (Main.Succ x) (Main.Succ Main.Zero) = Main.Zero;
10.99/4.49	primModNatP (Main.Succ x) (Main.Succ (Main.Succ y)) = primModNatP0 x y (primGEqNatS x y);
10.99/4.49	
10.99/4.49	primModNatP0 x y MyTrue = primModNatP (primMinusNatS x (Main.Succ y)) (Main.Succ (Main.Succ y));
10.99/4.49	primModNatP0 x y MyFalse = primMinusNatS (Main.Succ y) x;
10.99/4.49	
10.99/4.49	primModNatS :: Main.Nat  ->  Main.Nat  ->  Main.Nat;
10.99/4.49	primModNatS Main.Zero Main.Zero = Main.error;
10.99/4.49	primModNatS Main.Zero (Main.Succ x) = Main.Zero;
10.99/4.49	primModNatS (Main.Succ x) Main.Zero = Main.error;
10.99/4.49	primModNatS (Main.Succ x) (Main.Succ Main.Zero) = Main.Zero;
10.99/4.49	primModNatS (Main.Succ x) (Main.Succ (Main.Succ y)) = primModNatS0 x y (primGEqNatS x (Main.Succ y));
10.99/4.49	
10.99/4.49	primModNatS0 x y MyTrue = primModNatS (primMinusNatS x (Main.Succ y)) (Main.Succ (Main.Succ y));
10.99/4.49	primModNatS0 x y MyFalse = Main.Succ x;
10.99/4.49	
10.99/4.49	stop :: MyBool  ->  a;
10.99/4.49	stop MyFalse = stop MyFalse;

popout

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

job log

popout

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