details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	19.6056 seconds
cpu usage	41.5034
user time	40.1818
system time	1.32159
max virtual memory	1.8303084E7
max residence set size	4013984.0

stage attributes

key	value
starexec-result	YES

output

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

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

job log

popout

actions

all output return to Haskell 2019-04-01 06.52