Haskell 2019-04-01 06.52 pair #433317446

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	4.78952 seconds
cpu usage	11.8432
user time	11.4922
system time	0.351001
max virtual memory	1.82858E7
max residence set size	635556.0

stage attributes

key	value
starexec-result	NO

output

9.32/4.09	NO
11.51/4.73	proof of /export/starexec/sandbox/benchmark/theBenchmark.hs
11.51/4.73	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
11.51/4.73	
11.51/4.73	
11.51/4.73	H-Termination with start terms of the given HASKELL could be disproven:
11.51/4.73	
11.51/4.73	(0) HASKELL
11.51/4.73	(1) BR [EQUIVALENT, 0 ms]
11.51/4.73	(2) HASKELL
11.51/4.73	(3) COR [EQUIVALENT, 0 ms]
11.51/4.73	(4) HASKELL
11.51/4.73	(5) Narrow [COMPLETE, 0 ms]
11.51/4.73	(6) AND
11.51/4.73	    (7) QDP
11.51/4.73	        (8) PisEmptyProof [EQUIVALENT, 0 ms]
11.51/4.73	        (9) YES
11.51/4.73	    (10) QDP
11.51/4.73	        (11) NonTerminationLoopProof [COMPLETE, 0 ms]
11.51/4.73	        (12) NO
11.51/4.73	    (13) QDP
11.51/4.73	
11.51/4.73	
11.51/4.73	----------------------------------------
11.51/4.73	
11.51/4.73	(0)
11.51/4.73	Obligation:
11.51/4.73	mainModule Main 
11.51/4.73	module Main where {
11.51/4.73	import qualified Prelude;
11.51/4.73	data List a = Cons a (List a)  | Nil ;
11.51/4.73	
11.51/4.73	data MyBool = MyTrue  | MyFalse ;
11.51/4.73	
11.51/4.73	data MyInt = Pos Main.Nat  | Neg Main.Nat ;
11.51/4.73	
11.51/4.73	data Main.Nat = Succ Main.Nat  | Zero ;
11.51/4.73	
11.51/4.73	data Ordering = LT  | EQ  | GT ;
11.51/4.73	
11.51/4.73	compareMyInt :: MyInt  ->  MyInt  ->  Ordering;
11.51/4.73	compareMyInt = primCmpInt;
11.51/4.73	
11.51/4.73	enumFromThenMyBool :: MyBool  ->  MyBool  ->  List MyBool;
11.51/4.73	enumFromThenMyBool x y = enumFromThenToMyBool x y MyTrue;
11.51/4.73	
11.51/4.73	enumFromThenToMyBool :: MyBool  ->  MyBool  ->  MyBool  ->  List MyBool;
11.51/4.73	enumFromThenToMyBool x y z = map toEnumMyBool (enumFromThenToMyInt (fromEnumMyBool x) (fromEnumMyBool y) (fromEnumMyBool z));
11.51/4.73	
11.51/4.73	enumFromThenToMyInt :: MyInt  ->  MyInt  ->  MyInt  ->  List MyInt;
11.51/4.73	enumFromThenToMyInt = numericEnumFromThenTo;
11.51/4.73	
11.51/4.73	esEsMyInt :: MyInt  ->  MyInt  ->  MyBool;
11.51/4.73	esEsMyInt = primEqInt;
11.51/4.73	
11.51/4.73	esEsOrdering :: Ordering  ->  Ordering  ->  MyBool;
11.51/4.73	esEsOrdering LT LT = MyTrue;
11.51/4.73	esEsOrdering LT EQ = MyFalse;
11.51/4.73	esEsOrdering LT GT = MyFalse;
11.51/4.73	esEsOrdering EQ LT = MyFalse;
11.51/4.73	esEsOrdering EQ EQ = MyTrue;
11.51/4.73	esEsOrdering EQ GT = MyFalse;
11.51/4.73	esEsOrdering GT LT = MyFalse;
11.51/4.73	esEsOrdering GT EQ = MyFalse;
11.51/4.73	esEsOrdering GT GT = MyTrue;
11.51/4.73	
11.51/4.73	flip :: (b  ->  a  ->  c)  ->  a  ->  b  ->  c;
11.51/4.73	flip f x y = f y x;
11.51/4.73	
11.51/4.73	fromEnumMyBool :: MyBool  ->  MyInt;
11.51/4.73	fromEnumMyBool MyFalse = Main.Pos Main.Zero;
11.51/4.73	fromEnumMyBool MyTrue = Main.Pos (Main.Succ Main.Zero);
11.51/4.73	
11.51/4.73	fsEsOrdering :: Ordering  ->  Ordering  ->  MyBool;
11.51/4.73	fsEsOrdering x y = not (esEsOrdering x y);
11.51/4.73	
11.51/4.73	gtEsMyInt :: MyInt  ->  MyInt  ->  MyBool;
11.51/4.73	gtEsMyInt x y = fsEsOrdering (compareMyInt x y) LT;
11.51/4.73	
11.51/4.73	iterate :: (a  ->  a)  ->  a  ->  List a;
11.51/4.73	iterate f x = Cons x (iterate f (f x));
11.51/4.73	
11.51/4.73	ltEsMyInt :: MyInt  ->  MyInt  ->  MyBool;
11.51/4.73	ltEsMyInt x y = fsEsOrdering (compareMyInt x y) GT;
11.51/4.73	
11.51/4.73	map :: (a  ->  b)  ->  List a  ->  List b;
11.51/4.73	map f Nil = Nil;
11.51/4.73	map f (Cons x xs) = Cons (f x) (map f xs);
11.51/4.73	
11.51/4.73	msMyInt :: MyInt  ->  MyInt  ->  MyInt;
11.51/4.73	msMyInt = primMinusInt;
11.51/4.73	
11.51/4.73	not :: MyBool  ->  MyBool;
11.51/4.73	not MyTrue = MyFalse;
11.51/4.73	not MyFalse = MyTrue;
11.51/4.73	
11.51/4.73	numericEnumFromThen n m = iterate (psMyInt (msMyInt m n)) n;
11.51/4.73	
11.51/4.73	numericEnumFromThenTo n n' m = takeWhile (numericEnumFromThenToP m n' n) (numericEnumFromThen n n');
11.51/4.73

popout

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

job log

popout

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