Haskell 2019-04-01 06.52 pair #433317119

details

property	value
status	complete
benchmark	lines_1.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)	34.1134 seconds
cpu usage	52.0649
user time	50.4189
system time	1.64598
max virtual memory	1.8285568E7
max residence set size	4428708.0

stage attributes

key	value
starexec-result	YES

output

49.70/33.46	YES
51.98/34.06	proof of /export/starexec/sandbox/benchmark/theBenchmark.hs
51.98/34.06	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
51.98/34.06	
51.98/34.06	
51.98/34.06	H-Termination with start terms of the given HASKELL could be proven:
51.98/34.06	
51.98/34.06	(0) HASKELL
51.98/34.06	(1) BR [EQUIVALENT, 0 ms]
51.98/34.06	(2) HASKELL
51.98/34.06	(3) COR [EQUIVALENT, 0 ms]
51.98/34.06	(4) HASKELL
51.98/34.06	(5) Narrow [SOUND, 0 ms]
51.98/34.06	(6) AND
51.98/34.06	    (7) QDP
51.98/34.06	        (8) QDPSizeChangeProof [EQUIVALENT, 0 ms]
51.98/34.06	        (9) YES
51.98/34.06	    (10) QDP
51.98/34.06	        (11) QDPSizeChangeProof [EQUIVALENT, 0 ms]
51.98/34.06	        (12) YES
51.98/34.06	    (13) QDP
51.98/34.06	        (14) TransformationProof [EQUIVALENT, 0 ms]
51.98/34.06	        (15) QDP
51.98/34.06	        (16) TransformationProof [EQUIVALENT, 0 ms]
51.98/34.06	        (17) QDP
51.98/34.06	        (18) TransformationProof [EQUIVALENT, 0 ms]
51.98/34.06	        (19) QDP
51.98/34.06	        (20) QDPSizeChangeProof [EQUIVALENT, 0 ms]
51.98/34.06	        (21) YES
51.98/34.06	
51.98/34.06	
51.98/34.06	----------------------------------------
51.98/34.06	
51.98/34.06	(0)
51.98/34.06	Obligation:
51.98/34.06	mainModule Main 
51.98/34.06	module Main where {
51.98/34.06	import qualified Prelude;
51.98/34.06	data Main.Char = Char MyInt ;
51.98/34.06	
51.98/34.06	data List a = Cons a (List a)  | Nil ;
51.98/34.06	
51.98/34.06	data MyBool = MyTrue  | MyFalse ;
51.98/34.06	
51.98/34.06	data MyInt = Pos Main.Nat  | Neg Main.Nat ;
51.98/34.06	
51.98/34.06	data Main.Nat = Succ Main.Nat  | Zero ;
51.98/34.06	
51.98/34.06	data Tup2 a b = Tup2 a b ;
51.98/34.06	
51.98/34.06	break :: (a  ->  MyBool)  ->  List a  ->  Tup2 (List a) (List a);
51.98/34.06	break p = span (pt not p);
51.98/34.06	
51.98/34.06	esEsChar :: Main.Char  ->  Main.Char  ->  MyBool;
51.98/34.06	esEsChar = primEqChar;
51.98/34.06	
51.98/34.06	lines :: List Main.Char  ->  List (List Main.Char);
51.98/34.06	lines Nil = Nil;
51.98/34.06	lines s = Cons (linesL s) (linesLines0 s (linesS' s));
51.98/34.06	
51.98/34.06	linesL xw = linesL0 xw (linesVu44 xw);
51.98/34.06	
51.98/34.06	linesL0 xw (Tup2 l vv) = l;
51.98/34.06	
51.98/34.06	linesLines0 xw Nil = Nil;
51.98/34.06	linesLines0 xw (Cons vw s'') = lines s'';
51.98/34.06	
51.98/34.06	linesS' xw = linesS'0 xw (linesVu44 xw);
51.98/34.06	
51.98/34.06	linesS'0 xw (Tup2 vx s') = s';
51.98/34.06	
51.98/34.06	linesVu44 xw = break (esEsChar (Main.Char (Main.Pos (Main.Succ (Main.Succ (Main.Succ (Main.Succ (Main.Succ (Main.Succ (Main.Succ (Main.Succ (Main.Succ (Main.Succ Main.Zero))))))))))))) xw;
51.98/34.06	
51.98/34.06	not :: MyBool  ->  MyBool;
51.98/34.06	not MyTrue = MyFalse;
51.98/34.06	not MyFalse = MyTrue;
51.98/34.06	
51.98/34.06	otherwise :: MyBool;
51.98/34.06	otherwise = MyTrue;
51.98/34.06	
51.98/34.06	primEqChar :: Main.Char  ->  Main.Char  ->  MyBool;
51.98/34.06	primEqChar (Main.Char x) (Main.Char y) = primEqInt x y;
51.98/34.06	
51.98/34.06	primEqInt :: MyInt  ->  MyInt  ->  MyBool;
51.98/34.06	primEqInt (Main.Pos (Main.Succ x)) (Main.Pos (Main.Succ y)) = primEqNat x y;
51.98/34.06	primEqInt (Main.Neg (Main.Succ x)) (Main.Neg (Main.Succ y)) = primEqNat x y;
51.98/34.06	primEqInt (Main.Pos Main.Zero) (Main.Neg Main.Zero) = MyTrue;
51.98/34.06	primEqInt (Main.Neg Main.Zero) (Main.Pos Main.Zero) = MyTrue;
51.98/34.06	primEqInt (Main.Neg Main.Zero) (Main.Neg Main.Zero) = MyTrue;
51.98/34.06	primEqInt (Main.Pos Main.Zero) (Main.Pos Main.Zero) = MyTrue;
51.98/34.06	primEqInt vy vz = MyFalse;
51.98/34.06	
51.98/34.06	primEqNat :: Main.Nat  ->  Main.Nat  ->  MyBool;
51.98/34.06	primEqNat Main.Zero Main.Zero = MyTrue;
51.98/34.06	primEqNat Main.Zero (Main.Succ y) = MyFalse;
51.98/34.06	primEqNat (Main.Succ x) Main.Zero = MyFalse;
51.98/34.06	primEqNat (Main.Succ x) (Main.Succ y) = primEqNat x y;
51.98/34.06	
51.98/34.06	pt :: (a  ->  c)  ->  (b  ->  a)  ->  b  ->  c;
51.98/34.06	pt f g x = f (g x);

popout

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

job log

popout

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