details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	16.2206 seconds
cpu usage	36.3456
user time	35.101
system time	1.24469
max virtual memory	1.8288076E7
max residence set size	3978096.0

stage attributes

key	value
starexec-result	YES

output

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

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

job log

popout

actions

all output return to Haskell 2019-04-01 06.52