Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Haskell 2019-04-01 06.52 pair #433316209
details
property
value
status
complete
benchmark
List_sort_3.hs
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n178.star.cs.uiowa.edu
space
full_haskell
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
5.64831 seconds
cpu usage
15.03
user time
14.6413
system time
0.388678
max virtual memory
1.8351564E7
max residence set size
724752.0
stage attributes
key
value
starexec-result
YES
output
12.83/5.03 YES 14.80/5.61 proof of /export/starexec/sandbox/benchmark/theBenchmark.hs 14.80/5.61 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 14.80/5.61 14.80/5.61 14.80/5.61 H-Termination with start terms of the given HASKELL could be proven: 14.80/5.61 14.80/5.61 (0) HASKELL 14.80/5.61 (1) CR [EQUIVALENT, 0 ms] 14.80/5.61 (2) HASKELL 14.80/5.61 (3) BR [EQUIVALENT, 0 ms] 14.80/5.61 (4) HASKELL 14.80/5.61 (5) COR [EQUIVALENT, 22 ms] 14.80/5.61 (6) HASKELL 14.80/5.61 (7) Narrow [SOUND, 0 ms] 14.80/5.61 (8) AND 14.80/5.61 (9) QDP 14.80/5.61 (10) QDPSizeChangeProof [EQUIVALENT, 0 ms] 14.80/5.61 (11) YES 14.80/5.61 (12) QDP 14.80/5.61 (13) QDPSizeChangeProof [EQUIVALENT, 0 ms] 14.80/5.61 (14) YES 14.80/5.61 (15) QDP 14.80/5.61 (16) QDPOrderProof [EQUIVALENT, 68 ms] 14.80/5.61 (17) QDP 14.80/5.61 (18) DependencyGraphProof [EQUIVALENT, 0 ms] 14.80/5.61 (19) TRUE 14.80/5.61 (20) QDP 14.80/5.61 (21) QDPSizeChangeProof [EQUIVALENT, 0 ms] 14.80/5.61 (22) YES 14.80/5.61 (23) QDP 14.80/5.61 (24) DependencyGraphProof [EQUIVALENT, 0 ms] 14.80/5.61 (25) QDP 14.80/5.61 (26) QDPSizeChangeProof [EQUIVALENT, 0 ms] 14.80/5.61 (27) YES 14.80/5.61 14.80/5.61 14.80/5.61 ---------------------------------------- 14.80/5.61 14.80/5.61 (0) 14.80/5.61 Obligation: 14.80/5.61 mainModule Main 14.80/5.61 module Maybe where { 14.80/5.61 import qualified List; 14.80/5.61 import qualified Main; 14.80/5.61 import qualified Prelude; 14.80/5.61 } 14.80/5.61 module List where { 14.80/5.61 import qualified Main; 14.80/5.61 import qualified Maybe; 14.80/5.61 import qualified Prelude; 14.80/5.61 merge :: (a -> a -> Ordering) -> [a] -> [a] -> [a]; 14.80/5.61 merge cmp xs [] = xs; 14.80/5.61 merge cmp [] ys = ys; 14.80/5.61 merge cmp (x : xs) (y : ys) = case x `cmp` y of { 14.80/5.61 GT-> y : merge cmp (x : xs) ys; 14.80/5.61 _-> x : merge cmp xs (y : ys); 14.80/5.61 } ; 14.80/5.61 14.80/5.61 merge_pairs :: (a -> a -> Ordering) -> [[a]] -> [[a]]; 14.80/5.61 merge_pairs cmp [] = []; 14.80/5.61 merge_pairs cmp (xs : []) = xs : []; 14.80/5.61 merge_pairs cmp (xs : ys : xss) = merge cmp xs ys : merge_pairs cmp xss; 14.80/5.61 14.80/5.61 mergesort :: (a -> a -> Ordering) -> [a] -> [a]; 14.80/5.61 mergesort cmp = mergesort' cmp . map wrap; 14.80/5.61 14.80/5.61 mergesort' :: (a -> a -> Ordering) -> [[a]] -> [a]; 14.80/5.61 mergesort' cmp [] = []; 14.80/5.61 mergesort' cmp (xs : []) = xs; 14.80/5.61 mergesort' cmp xss = mergesort' cmp (merge_pairs cmp xss); 14.80/5.61 14.80/5.61 sort :: Ord a => [a] -> [a]; 14.80/5.61 sort l = mergesort compare l; 14.80/5.61 14.80/5.61 wrap :: a -> [a]; 14.80/5.61 wrap x = x : []; 14.80/5.61 14.80/5.61 } 14.80/5.61 module Main where { 14.80/5.61 import qualified List; 14.80/5.61 import qualified Maybe; 14.80/5.61 import qualified Prelude; 14.80/5.61 } 14.80/5.61 14.80/5.61 ---------------------------------------- 14.80/5.61 14.80/5.61 (1) CR (EQUIVALENT) 14.80/5.61 Case Reductions: 14.80/5.61 The following Case expression 14.80/5.61 "case cmp x y of { 14.80/5.61 GT -> y : merge cmp (x : xs) ys; 14.80/5.61 _ -> x : merge cmp xs (y : ys)} 14.80/5.61 " 14.80/5.61 is transformed to 14.80/5.61 "merge0 y cmp x xs ys GT = y : merge cmp (x : xs) ys; 14.80/5.61 merge0 y cmp x xs ys _ = x : merge cmp xs (y : ys); 14.80/5.61 " 14.80/5.61 14.80/5.61 ----------------------------------------
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Haskell 2019-04-01 06.52