Haskell pair #487599136

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	5.69579911232 seconds
cpu usage	14.952672069
max memory	7.6048384E8

stage attributes

key	value
output-size	101081
starexec-result	YES

output

/export/starexec/sandbox/solver/bin/starexec_run_standard /export/starexec/sandbox/benchmark/theBenchmark.hs /export/starexec/sandbox/output/output_files


--------------------------------------------------------------------------------


YES
proof of /export/starexec/sandbox/benchmark/theBenchmark.hs
# AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty


H-Termination with start terms of the given HASKELL could be proven:

(0) HASKELL
(1) CR [EQUIVALENT, 0 ms]
(2) HASKELL
(3) BR [EQUIVALENT, 0 ms]
(4) HASKELL
(5) COR [EQUIVALENT, 18 ms]
(6) HASKELL
(7) Narrow [SOUND, 0 ms]
(8) AND
    (9) QDP
        (10) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (11) YES
    (12) QDP
        (13) DependencyGraphProof [EQUIVALENT, 0 ms]
        (14) QDP
        (15) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (16) YES
    (17) QDP
        (18) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (19) YES
    (20) QDP
        (21) TransformationProof [EQUIVALENT, 0 ms]
        (22) QDP
        (23) DependencyGraphProof [EQUIVALENT, 0 ms]
        (24) QDP
        (25) UsableRulesProof [EQUIVALENT, 0 ms]
        (26) QDP
        (27) QReductionProof [EQUIVALENT, 0 ms]
        (28) QDP
        (29) TransformationProof [EQUIVALENT, 0 ms]
        (30) QDP
        (31) UsableRulesProof [EQUIVALENT, 0 ms]
        (32) QDP
        (33) QReductionProof [EQUIVALENT, 0 ms]
        (34) QDP
        (35) TransformationProof [EQUIVALENT, 0 ms]
        (36) QDP
        (37) TransformationProof [EQUIVALENT, 0 ms]
        (38) QDP
        (39) TransformationProof [EQUIVALENT, 0 ms]
        (40) QDP
        (41) DependencyGraphProof [EQUIVALENT, 0 ms]
        (42) AND
            (43) QDP
                (44) QDPSizeChangeProof [EQUIVALENT, 0 ms]
                (45) YES
            (46) QDP
                (47) QDPSizeChangeProof [EQUIVALENT, 0 ms]
                (48) YES
            (49) QDP
                (50) QDPSizeChangeProof [EQUIVALENT, 0 ms]
                (51) YES


----------------------------------------

(0)
Obligation:
mainModule Main 
module Maybe where {
import qualified List;
import qualified Main;
import qualified Prelude;
}
module List where {
import qualified Main;
import qualified Maybe;
import qualified Prelude;
merge :: (a  ->  a  ->  Ordering)  ->  [a]  ->  [a]  ->  [a];
merge cmp xs [] = xs;
merge cmp [] ys = ys;
merge cmp (x : xs) (y : ys) = case x `cmp` y of { 
GT-> y : merge cmp (x : xs) ys; 
_-> x : merge cmp xs (y : ys); 
 } ;

merge_pairs :: (a  ->  a  ->  Ordering)  ->  [[a]]  ->  [[a]];
merge_pairs cmp [] = [];
merge_pairs cmp (xs : []) = xs : [];
merge_pairs cmp (xs : ys : xss) = merge cmp xs ys : merge_pairs cmp xss;

mergesort :: (a  ->  a  ->  Ordering)  ->  [a]  ->  [a];
mergesort cmp = mergesort' cmp . map wrap;

mergesort' :: (a  ->  a  ->  Ordering)  ->  [[a]]  ->  [a];
mergesort' cmp [] = [];
mergesort' cmp (xs : []) = xs;

popout

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

job log

popout

actions all output return to Haskell