details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	9.34164 seconds
cpu usage	17.3442
user time	16.8933
system time	0.450965
max virtual memory	1.8351564E7
max residence set size	809100.0

stage attributes

key	value
starexec-result	YES

output

14.80/8.70 YES 16.99/9.30 proof of /export/starexec/sandbox/benchmark/theBenchmark.hs 16.99/9.30 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 16.99/9.30 16.99/9.30 16.99/9.30 H-Termination with start terms of the given HASKELL could be proven: 16.99/9.30 16.99/9.30 (0) HASKELL 16.99/9.30 (1) CR [EQUIVALENT, 0 ms] 16.99/9.30 (2) HASKELL 16.99/9.30 (3) BR [EQUIVALENT, 0 ms] 16.99/9.30 (4) HASKELL 16.99/9.30 (5) COR [EQUIVALENT, 18 ms] 16.99/9.30 (6) HASKELL 16.99/9.30 (7) Narrow [SOUND, 0 ms] 16.99/9.30 (8) AND 16.99/9.30 (9) QDP 16.99/9.30 (10) QDPSizeChangeProof [EQUIVALENT, 0 ms] 16.99/9.30 (11) YES 16.99/9.30 (12) QDP 16.99/9.30 (13) QDPSizeChangeProof [EQUIVALENT, 0 ms] 16.99/9.30 (14) YES 16.99/9.30 (15) QDP 16.99/9.30 (16) QDPOrderProof [EQUIVALENT, 82 ms] 16.99/9.30 (17) QDP 16.99/9.30 (18) DependencyGraphProof [EQUIVALENT, 0 ms] 16.99/9.30 (19) TRUE 16.99/9.30 (20) QDP 16.99/9.30 (21) QDPSizeChangeProof [EQUIVALENT, 0 ms] 16.99/9.30 (22) YES 16.99/9.30 (23) QDP 16.99/9.30 (24) DependencyGraphProof [EQUIVALENT, 0 ms] 16.99/9.30 (25) QDP 16.99/9.30 (26) QDPSizeChangeProof [EQUIVALENT, 0 ms] 16.99/9.30 (27) YES 16.99/9.30 16.99/9.30 16.99/9.30 ---------------------------------------- 16.99/9.30 16.99/9.30 (0) 16.99/9.30 Obligation: 16.99/9.30 mainModule Main 16.99/9.30 module Maybe where { 16.99/9.30 import qualified List; 16.99/9.30 import qualified Main; 16.99/9.30 import qualified Prelude; 16.99/9.30 } 16.99/9.30 module List where { 16.99/9.30 import qualified Main; 16.99/9.30 import qualified Maybe; 16.99/9.30 import qualified Prelude; 16.99/9.30 merge :: (a -> a -> Ordering) -> [a] -> [a] -> [a]; 16.99/9.30 merge cmp xs [] = xs; 16.99/9.30 merge cmp [] ys = ys; 16.99/9.30 merge cmp (x : xs) (y : ys) = case x `cmp` y of { 16.99/9.30 GT-> y : merge cmp (x : xs) ys; 16.99/9.30 _-> x : merge cmp xs (y : ys); 16.99/9.30 } ; 16.99/9.30 16.99/9.30 merge_pairs :: (a -> a -> Ordering) -> [[a]] -> [[a]]; 16.99/9.30 merge_pairs cmp [] = []; 16.99/9.30 merge_pairs cmp (xs : []) = xs : []; 16.99/9.30 merge_pairs cmp (xs : ys : xss) = merge cmp xs ys : merge_pairs cmp xss; 16.99/9.30 16.99/9.30 mergesort :: (a -> a -> Ordering) -> [a] -> [a]; 16.99/9.30 mergesort cmp = mergesort' cmp . map wrap; 16.99/9.30 16.99/9.30 mergesort' :: (a -> a -> Ordering) -> [[a]] -> [a]; 16.99/9.30 mergesort' cmp [] = []; 16.99/9.30 mergesort' cmp (xs : []) = xs; 16.99/9.30 mergesort' cmp xss = mergesort' cmp (merge_pairs cmp xss); 16.99/9.30 16.99/9.30 sort :: Ord a => [a] -> [a]; 16.99/9.30 sort l = mergesort compare l; 16.99/9.30 16.99/9.30 wrap :: a -> [a]; 16.99/9.30 wrap x = x : []; 16.99/9.30 16.99/9.30 } 16.99/9.30 module Main where { 16.99/9.30 import qualified List; 16.99/9.30 import qualified Maybe; 16.99/9.30 import qualified Prelude; 16.99/9.30 } 16.99/9.30 16.99/9.30 ---------------------------------------- 16.99/9.30 16.99/9.30 (1) CR (EQUIVALENT) 16.99/9.30 Case Reductions: 16.99/9.30 The following Case expression 16.99/9.30 "case cmp x y of { 16.99/9.30 GT -> y : merge cmp (x : xs) ys; 16.99/9.30 _ -> x : merge cmp xs (y : ys)} 16.99/9.30 " 16.99/9.30 is transformed to 16.99/9.30 "merge0 y cmp x xs ys GT = y : merge cmp (x : xs) ys; 16.99/9.30 merge0 y cmp x xs ys _ = x : merge cmp xs (y : ys); 16.99/9.30 " 16.99/9.30 16.99/9.30 ---------------------------------------- popout

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

job log

popout

actions

all output return to Haskell 2019-04-01 06.52