Haskell 2019-04-01 06.52 pair #433316128

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	17.7297 seconds
cpu usage	36.5368
user time	35.244
system time	1.29286
max virtual memory	1.8353612E7
max residence set size	3966936.0

stage attributes

key	value
starexec-result	YES

output

33.42/16.85	YES
36.10/17.62	proof of /export/starexec/sandbox/benchmark/theBenchmark.hs
36.10/17.62	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
36.10/17.62	
36.10/17.62	
36.10/17.62	H-Termination with start terms of the given HASKELL could be proven:
36.10/17.62	
36.10/17.62	(0) HASKELL
36.10/17.62	(1) CR [EQUIVALENT, 0 ms]
36.10/17.62	(2) HASKELL
36.10/17.62	(3) IFR [EQUIVALENT, 0 ms]
36.10/17.62	(4) HASKELL
36.10/17.62	(5) BR [EQUIVALENT, 0 ms]
36.10/17.62	(6) HASKELL
36.10/17.62	(7) COR [EQUIVALENT, 0 ms]
36.10/17.62	(8) HASKELL
36.10/17.62	(9) LetRed [EQUIVALENT, 0 ms]
36.10/17.62	(10) HASKELL
36.10/17.62	(11) NumRed [SOUND, 0 ms]
36.10/17.62	(12) HASKELL
36.10/17.62	(13) Narrow [SOUND, 0 ms]
36.10/17.62	(14) AND
36.10/17.62	    (15) QDP
36.10/17.62	        (16) QDPSizeChangeProof [EQUIVALENT, 0 ms]
36.10/17.62	        (17) YES
36.10/17.62	    (18) QDP
36.10/17.62	        (19) QDPOrderProof [EQUIVALENT, 522 ms]
36.10/17.62	        (20) QDP
36.10/17.62	        (21) QDPSizeChangeProof [EQUIVALENT, 0 ms]
36.10/17.62	        (22) YES
36.10/17.62	    (23) QDP
36.10/17.62	        (24) QDPSizeChangeProof [EQUIVALENT, 0 ms]
36.10/17.62	        (25) YES
36.10/17.62	    (26) QDP
36.10/17.62	        (27) DependencyGraphProof [EQUIVALENT, 0 ms]
36.10/17.62	        (28) QDP
36.10/17.62	        (29) QDPSizeChangeProof [EQUIVALENT, 33 ms]
36.10/17.62	        (30) YES
36.10/17.62	    (31) QDP
36.10/17.62	        (32) QDPSizeChangeProof [EQUIVALENT, 0 ms]
36.10/17.62	        (33) YES
36.10/17.62	    (34) QDP
36.10/17.62	        (35) QDPSizeChangeProof [EQUIVALENT, 0 ms]
36.10/17.62	        (36) YES
36.10/17.62	    (37) QDP
36.10/17.62	        (38) DependencyGraphProof [EQUIVALENT, 0 ms]
36.10/17.62	        (39) QDP
36.10/17.62	        (40) QDPSizeChangeProof [EQUIVALENT, 42 ms]
36.10/17.62	        (41) YES
36.10/17.62	    (42) QDP
36.10/17.62	        (43) QDPSizeChangeProof [EQUIVALENT, 0 ms]
36.10/17.62	        (44) YES
36.10/17.62	    (45) QDP
36.10/17.62	        (46) QDPSizeChangeProof [EQUIVALENT, 0 ms]
36.10/17.62	        (47) YES
36.10/17.62	    (48) QDP
36.10/17.62	        (49) QDPSizeChangeProof [EQUIVALENT, 0 ms]
36.10/17.62	        (50) YES
36.10/17.62	
36.10/17.62	
36.10/17.62	----------------------------------------
36.10/17.62	
36.10/17.62	(0)
36.10/17.62	Obligation:
36.10/17.62	mainModule Main 
36.10/17.62	module Maybe where {
36.10/17.62	import qualified List;
36.10/17.62	import qualified Main;
36.10/17.62	import qualified Prelude;
36.10/17.62	}
36.10/17.62	module List where {
36.10/17.62	import qualified Main;
36.10/17.62	import qualified Maybe;
36.10/17.62	import qualified Prelude;
36.10/17.62	merge :: (a  ->  a  ->  Ordering)  ->  [a]  ->  [a]  ->  [a];
36.10/17.62	merge cmp xs [] = xs;
36.10/17.62	merge cmp [] ys = ys;
36.10/17.62	merge cmp (x : xs) (y : ys) = case x `cmp` y of { 
36.10/17.62	GT-> y : merge cmp (x : xs) ys; 
36.10/17.62	_-> x : merge cmp xs (y : ys); 
36.10/17.62	 } ;
36.10/17.62	
36.10/17.62	merge_pairs :: (a  ->  a  ->  Ordering)  ->  [[a]]  ->  [[a]];
36.10/17.62	merge_pairs cmp [] = [];
36.10/17.62	merge_pairs cmp (xs : []) = xs : [];
36.10/17.62	merge_pairs cmp (xs : ys : xss) = merge cmp xs ys : merge_pairs cmp xss;
36.10/17.62	
36.10/17.62	mergesort :: (a  ->  a  ->  Ordering)  ->  [a]  ->  [a];
36.10/17.62	mergesort cmp = mergesort' cmp . map wrap;
36.10/17.62	
36.10/17.62	mergesort' :: (a  ->  a  ->  Ordering)  ->  [[a]]  ->  [a];
36.10/17.62	mergesort' cmp [] = [];
36.10/17.62	mergesort' cmp (xs : []) = xs;
36.10/17.62	mergesort' cmp xss = mergesort' cmp (merge_pairs cmp xss);
36.10/17.62	
36.10/17.62	sort :: Ord a => [a]  ->  [a];
36.10/17.62	sort l = mergesort compare l;
36.10/17.62	
36.10/17.62	wrap :: a  ->  [a];
36.10/17.62	wrap x = 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