Haskell 2019-04-01 06.52 pair #433317143

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	4.22842 seconds
cpu usage	10.4197
user time	10.0912
system time	0.328475
max virtual memory	1.828352E7
max residence set size	553636.0

stage attributes

key	value
starexec-result	YES

output

8.36/3.63	YES
9.93/4.16	proof of /export/starexec/sandbox/benchmark/theBenchmark.hs
9.93/4.16	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
9.93/4.16	
9.93/4.16	
9.93/4.16	H-Termination with start terms of the given HASKELL could be proven:
9.93/4.16	
9.93/4.16	(0) HASKELL
9.93/4.16	(1) BR [EQUIVALENT, 0 ms]
9.93/4.16	(2) HASKELL
9.93/4.16	(3) COR [EQUIVALENT, 0 ms]
9.93/4.16	(4) HASKELL
9.93/4.16	(5) Narrow [SOUND, 0 ms]
9.93/4.16	(6) AND
9.93/4.16	    (7) QDP
9.93/4.16	        (8) QDPSizeChangeProof [EQUIVALENT, 0 ms]
9.93/4.16	        (9) YES
9.93/4.16	    (10) QDP
9.93/4.16	        (11) QDPSizeChangeProof [EQUIVALENT, 0 ms]
9.93/4.16	        (12) YES
9.93/4.16	
9.93/4.16	
9.93/4.16	----------------------------------------
9.93/4.16	
9.93/4.16	(0)
9.93/4.16	Obligation:
9.93/4.16	mainModule Main 
9.93/4.16	module Main where {
9.93/4.16	import qualified Prelude;
9.93/4.16	data Main.Char = Char MyInt ;
9.93/4.16	
9.93/4.16	data List a = Cons a (List a)  | Nil ;
9.93/4.16	
9.93/4.16	data MyBool = MyTrue  | MyFalse ;
9.93/4.16	
9.93/4.16	data MyInt = Pos Main.Nat  | Neg Main.Nat ;
9.93/4.16	
9.93/4.16	data Main.Nat = Succ Main.Nat  | Zero ;
9.93/4.16	
9.93/4.16	all :: (a  ->  MyBool)  ->  List a  ->  MyBool;
9.93/4.16	all p = pt and (map p);
9.93/4.16	
9.93/4.16	and :: List MyBool  ->  MyBool;
9.93/4.16	and = foldr asAs MyTrue;
9.93/4.16	
9.93/4.16	asAs :: MyBool  ->  MyBool  ->  MyBool;
9.93/4.16	asAs MyFalse x = MyFalse;
9.93/4.16	asAs MyTrue x = x;
9.93/4.16	
9.93/4.16	esEsChar :: Main.Char  ->  Main.Char  ->  MyBool;
9.93/4.16	esEsChar = primEqChar;
9.93/4.16	
9.93/4.16	foldr :: (b  ->  a  ->  a)  ->  a  ->  List b  ->  a;
9.93/4.16	foldr f z Nil = z;
9.93/4.16	foldr f z (Cons x xs) = f x (foldr f z xs);
9.93/4.16	
9.93/4.16	fsEsChar :: Main.Char  ->  Main.Char  ->  MyBool;
9.93/4.16	fsEsChar x y = not (esEsChar x y);
9.93/4.16	
9.93/4.16	map :: (a  ->  b)  ->  List a  ->  List b;
9.93/4.16	map f Nil = Nil;
9.93/4.16	map f (Cons x xs) = Cons (f x) (map f xs);
9.93/4.16	
9.93/4.16	not :: MyBool  ->  MyBool;
9.93/4.16	not MyTrue = MyFalse;
9.93/4.16	not MyFalse = MyTrue;
9.93/4.16	
9.93/4.16	notElemChar :: Main.Char  ->  List Main.Char  ->  MyBool;
9.93/4.16	notElemChar = pt all fsEsChar;
9.93/4.16	
9.93/4.16	primEqChar :: Main.Char  ->  Main.Char  ->  MyBool;
9.93/4.16	primEqChar (Main.Char x) (Main.Char y) = primEqInt x y;
9.93/4.16	
9.93/4.16	primEqInt :: MyInt  ->  MyInt  ->  MyBool;
9.93/4.16	primEqInt (Main.Pos (Main.Succ x)) (Main.Pos (Main.Succ y)) = primEqNat x y;
9.93/4.16	primEqInt (Main.Neg (Main.Succ x)) (Main.Neg (Main.Succ y)) = primEqNat x y;
9.93/4.16	primEqInt (Main.Pos Main.Zero) (Main.Neg Main.Zero) = MyTrue;
9.93/4.16	primEqInt (Main.Neg Main.Zero) (Main.Pos Main.Zero) = MyTrue;
9.93/4.16	primEqInt (Main.Neg Main.Zero) (Main.Neg Main.Zero) = MyTrue;
9.93/4.16	primEqInt (Main.Pos Main.Zero) (Main.Pos Main.Zero) = MyTrue;
9.93/4.16	primEqInt vv vw = MyFalse;
9.93/4.16	
9.93/4.16	primEqNat :: Main.Nat  ->  Main.Nat  ->  MyBool;
9.93/4.16	primEqNat Main.Zero Main.Zero = MyTrue;
9.93/4.16	primEqNat Main.Zero (Main.Succ y) = MyFalse;
9.93/4.16	primEqNat (Main.Succ x) Main.Zero = MyFalse;
9.93/4.16	primEqNat (Main.Succ x) (Main.Succ y) = primEqNat x y;
9.93/4.16	
9.93/4.16	pt :: (c  ->  b)  ->  (a  ->  c)  ->  a  ->  b;
9.93/4.16	pt f g x = f (g x);
9.93/4.16	
9.93/4.16	}
9.93/4.16	
9.93/4.16	----------------------------------------
9.93/4.16	
9.93/4.16	(1) BR (EQUIVALENT)
9.93/4.16	Replaced joker patterns by fresh variables and removed binding patterns.
9.93/4.16	----------------------------------------
9.93/4.16	
9.93/4.16	(2)

popout

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

job log

popout

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