Haskell 2019-04-01 06.52 pair #433317328

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	6.76609 seconds
cpu usage	12.6728
user time	12.3003
system time	0.372562
max virtual memory	1.8285568E7
max residence set size	666864.0

stage attributes

key	value
starexec-result	YES

output

10.05/4.02	YES
12.42/4.65	proof of /export/starexec/sandbox/benchmark/theBenchmark.hs
12.42/4.65	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
12.42/4.65	
12.42/4.65	
12.42/4.65	H-Termination with start terms of the given HASKELL could be proven:
12.42/4.65	
12.42/4.65	(0) HASKELL
12.42/4.65	(1) BR [EQUIVALENT, 0 ms]
12.42/4.65	(2) HASKELL
12.42/4.65	(3) COR [EQUIVALENT, 0 ms]
12.42/4.65	(4) HASKELL
12.42/4.65	(5) Narrow [SOUND, 0 ms]
12.42/4.65	(6) AND
12.42/4.65	    (7) QDP
12.42/4.65	        (8) QDPSizeChangeProof [EQUIVALENT, 0 ms]
12.42/4.65	        (9) YES
12.42/4.65	    (10) QDP
12.42/4.65	        (11) QDPSizeChangeProof [EQUIVALENT, 0 ms]
12.42/4.65	        (12) YES
12.42/4.65	    (13) QDP
12.42/4.65	        (14) QDPSizeChangeProof [EQUIVALENT, 0 ms]
12.42/4.65	        (15) YES
12.42/4.65	    (16) QDP
12.42/4.65	        (17) QDPSizeChangeProof [EQUIVALENT, 0 ms]
12.42/4.65	        (18) YES
12.42/4.65	    (19) QDP
12.42/4.65	        (20) TransformationProof [EQUIVALENT, 0 ms]
12.42/4.65	        (21) QDP
12.42/4.65	        (22) QDPSizeChangeProof [EQUIVALENT, 0 ms]
12.42/4.65	        (23) YES
12.42/4.65	
12.42/4.65	
12.42/4.65	----------------------------------------
12.42/4.65	
12.42/4.65	(0)
12.42/4.65	Obligation:
12.42/4.65	mainModule Main 
12.42/4.65	module Main where {
12.42/4.65	import qualified Prelude;
12.42/4.65	data Main.Char = Char MyInt ;
12.42/4.65	
12.42/4.65	data Integer = Integer MyInt ;
12.42/4.65	
12.42/4.65	data List a = Cons a (List a)  | Nil ;
12.42/4.66	
12.42/4.66	data MyBool = MyTrue  | MyFalse ;
12.42/4.66	
12.42/4.66	data MyInt = Pos Main.Nat  | Neg Main.Nat ;
12.42/4.66	
12.42/4.66	data Main.Nat = Succ Main.Nat  | Zero ;
12.42/4.66	
12.42/4.66	data Tup2 b a = Tup2 b a ;
12.42/4.66	
12.42/4.66	concat :: List (List a)  ->  List a;
12.42/4.66	concat = foldr psPs Nil;
12.42/4.66	
12.42/4.66	concatMap :: (b  ->  List a)  ->  List b  ->  List a;
12.42/4.66	concatMap f = pt concat (map f);
12.42/4.66	
12.42/4.66	foldl :: (b  ->  a  ->  b)  ->  b  ->  List a  ->  b;
12.42/4.66	foldl f z Nil = z;
12.42/4.66	foldl f z (Cons x xs) = foldl f (f z x) xs;
12.42/4.66	
12.42/4.66	foldl1 :: (a  ->  a  ->  a)  ->  List a  ->  a;
12.42/4.66	foldl1 f (Cons x xs) = foldl f x xs;
12.42/4.66	
12.42/4.66	foldr :: (b  ->  a  ->  a)  ->  a  ->  List b  ->  a;
12.42/4.66	foldr f z Nil = z;
12.42/4.66	foldr f z (Cons x xs) = f x (foldr f z xs);
12.42/4.66	
12.42/4.66	fromIntegerMyInt :: Integer  ->  MyInt;
12.42/4.66	fromIntegerMyInt (Integer x) = x;
12.42/4.66	
12.42/4.66	fromIntegral = pt fromIntegerMyInt toIntegerMyInt;
12.42/4.66	
12.42/4.66	map :: (b  ->  a)  ->  List b  ->  List a;
12.42/4.66	map f Nil = Nil;
12.42/4.66	map f (Cons x xs) = Cons (f x) (map f xs);
12.42/4.66	
12.42/4.66	nonnull :: (Main.Char  ->  MyBool)  ->  List Main.Char  ->  List (Tup2 (List Main.Char) (List Main.Char));
12.42/4.66	nonnull p s = concatMap nonnull0 (Cons (span p s) Nil);
12.42/4.66	
12.42/4.66	nonnull0 vu68 = nonnull00 vu68;
12.42/4.66	
12.42/4.66	nonnull00 (Tup2 (Cons vy vz) t) = Cons (Tup2 (Cons vy vz) t) Nil;
12.42/4.66	nonnull00 wu = Nil;
12.42/4.66	
12.42/4.66	otherwise :: MyBool;
12.42/4.66	otherwise = MyTrue;
12.42/4.66	
12.42/4.66	primMinusNat :: Main.Nat  ->  Main.Nat  ->  MyInt;
12.42/4.66	primMinusNat Main.Zero Main.Zero = Main.Pos Main.Zero;
12.42/4.66	primMinusNat Main.Zero (Main.Succ y) = Main.Neg (Main.Succ y);
12.42/4.66	primMinusNat (Main.Succ x) Main.Zero = Main.Pos (Main.Succ x);
12.42/4.66	primMinusNat (Main.Succ x) (Main.Succ y) = primMinusNat x y;
12.42/4.66	
12.42/4.66	primMulInt :: MyInt  ->  MyInt  ->  MyInt;
12.42/4.66	primMulInt (Main.Pos x) (Main.Pos y) = Main.Pos (primMulNat x y);
12.42/4.66	primMulInt (Main.Pos x) (Main.Neg y) = Main.Neg (primMulNat x y);

popout

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

job log

popout

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