details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	8.10502 seconds
cpu usage	14.1794
user time	13.8075
system time	0.371909
max virtual memory	1.8285568E7
max residence set size	686404.0

stage attributes

key	value
starexec-result	YES

output

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

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

job log

popout

actions

all output return to Haskell 2019-04-01 06.52