Haskell 2019-04-01 06.52 pair #433317411

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	4.60215 seconds
cpu usage	11.039
user time	10.7261
system time	0.312885
max virtual memory	1.8285568E7
max residence set size	558228.0

stage attributes

key	value
starexec-result	MAYBE

output

8.95/4.00	MAYBE
10.95/4.55	proof of /export/starexec/sandbox/benchmark/theBenchmark.hs
10.95/4.55	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
10.95/4.55	
10.95/4.55	
10.95/4.55	H-Termination with start terms of the given HASKELL could not be shown:
10.95/4.55	
10.95/4.55	(0) HASKELL
10.95/4.55	(1) BR [EQUIVALENT, 0 ms]
10.95/4.55	(2) HASKELL
10.95/4.55	(3) COR [EQUIVALENT, 0 ms]
10.95/4.55	(4) HASKELL
10.95/4.55	(5) Narrow [SOUND, 0 ms]
10.95/4.55	(6) AND
10.95/4.55	    (7) QDP
10.95/4.55	        (8) MNOCProof [EQUIVALENT, 0 ms]
10.95/4.55	        (9) QDP
10.95/4.55	        (10) NonTerminationLoopProof [COMPLETE, 0 ms]
10.95/4.55	        (11) NO
10.95/4.55	    (12) QDP
10.95/4.55	        (13) QDPSizeChangeProof [EQUIVALENT, 0 ms]
10.95/4.55	        (14) YES
10.95/4.55	    (15) QDP
10.95/4.55	        (16) QDPSizeChangeProof [EQUIVALENT, 0 ms]
10.95/4.55	        (17) YES
10.95/4.55	    (18) QDP
10.95/4.55	        (19) QDPSizeChangeProof [EQUIVALENT, 0 ms]
10.95/4.55	        (20) YES
10.95/4.55	(21) Narrow [COMPLETE, 0 ms]
10.95/4.55	(22) TRUE
10.95/4.55	
10.95/4.55	
10.95/4.55	----------------------------------------
10.95/4.55	
10.95/4.55	(0)
10.95/4.55	Obligation:
10.95/4.55	mainModule Main 
10.95/4.55	module Main where {
10.95/4.55	import qualified Prelude;
10.95/4.55	data List a = Cons a (List a)  | Nil ;
10.95/4.55	
10.95/4.55	data MyInt = Pos Main.Nat  | Neg Main.Nat ;
10.95/4.55	
10.95/4.55	data Main.Nat = Succ Main.Nat  | Zero ;
10.95/4.55	
10.95/4.55	enumFromThenMyInt :: MyInt  ->  MyInt  ->  List MyInt;
10.95/4.55	enumFromThenMyInt = numericEnumFromThen;
10.95/4.55	
10.95/4.55	iterate :: (a  ->  a)  ->  a  ->  List a;
10.95/4.55	iterate f x = Cons x (iterate f (f x));
10.95/4.55	
10.95/4.55	msMyInt :: MyInt  ->  MyInt  ->  MyInt;
10.95/4.55	msMyInt = primMinusInt;
10.95/4.55	
10.95/4.55	numericEnumFromThen n m = iterate (psMyInt (msMyInt m n)) n;
10.95/4.55	
10.95/4.55	primMinusInt :: MyInt  ->  MyInt  ->  MyInt;
10.95/4.55	primMinusInt (Main.Pos x) (Main.Neg y) = Main.Pos (primPlusNat x y);
10.95/4.55	primMinusInt (Main.Neg x) (Main.Pos y) = Main.Neg (primPlusNat x y);
10.95/4.55	primMinusInt (Main.Neg x) (Main.Neg y) = primMinusNat y x;
10.95/4.55	primMinusInt (Main.Pos x) (Main.Pos y) = primMinusNat x y;
10.95/4.55	
10.95/4.55	primMinusNat :: Main.Nat  ->  Main.Nat  ->  MyInt;
10.95/4.55	primMinusNat Main.Zero Main.Zero = Main.Pos Main.Zero;
10.95/4.55	primMinusNat Main.Zero (Main.Succ y) = Main.Neg (Main.Succ y);
10.95/4.55	primMinusNat (Main.Succ x) Main.Zero = Main.Pos (Main.Succ x);
10.95/4.55	primMinusNat (Main.Succ x) (Main.Succ y) = primMinusNat x y;
10.95/4.55	
10.95/4.55	primPlusInt :: MyInt  ->  MyInt  ->  MyInt;
10.95/4.55	primPlusInt (Main.Pos x) (Main.Neg y) = primMinusNat x y;
10.95/4.55	primPlusInt (Main.Neg x) (Main.Pos y) = primMinusNat y x;
10.95/4.55	primPlusInt (Main.Neg x) (Main.Neg y) = Main.Neg (primPlusNat x y);
10.95/4.55	primPlusInt (Main.Pos x) (Main.Pos y) = Main.Pos (primPlusNat x y);
10.95/4.55	
10.95/4.55	primPlusNat :: Main.Nat  ->  Main.Nat  ->  Main.Nat;
10.95/4.55	primPlusNat Main.Zero Main.Zero = Main.Zero;
10.95/4.55	primPlusNat Main.Zero (Main.Succ y) = Main.Succ y;
10.95/4.55	primPlusNat (Main.Succ x) Main.Zero = Main.Succ x;
10.95/4.55	primPlusNat (Main.Succ x) (Main.Succ y) = Main.Succ (Main.Succ (primPlusNat x y));
10.95/4.55	
10.95/4.55	psMyInt :: MyInt  ->  MyInt  ->  MyInt;
10.95/4.55	psMyInt = primPlusInt;
10.95/4.55	
10.95/4.55	}
10.95/4.55	
10.95/4.55	----------------------------------------
10.95/4.55	
10.95/4.55	(1) BR (EQUIVALENT)
10.95/4.55	Replaced joker patterns by fresh variables and removed binding patterns.
10.95/4.55	----------------------------------------
10.95/4.55	
10.95/4.55	(2)
10.95/4.55	Obligation:
10.95/4.55	mainModule Main 
10.95/4.55	module Main where {
10.95/4.55	import qualified Prelude;
10.95/4.55	data List a = Cons a (List a)  | Nil ;
10.95/4.55	
10.95/4.55	data MyInt = Pos Main.Nat  | Neg Main.Nat ;
10.95/4.55

popout

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

job log

popout

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