details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	5.52902 seconds
cpu usage	14.2977
user time	13.9488
system time	0.348936
max virtual memory	1.8285568E7
max residence set size	732288.0

stage attributes

key	value
starexec-result	YES

output

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

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

job log

popout

actions

all output return to Haskell 2019-04-01 06.52