Haskell pair #487598559

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	11.6903860569 seconds
cpu usage	25.735532471
max memory	3.95198464E9

stage attributes

key	value
output-size	1036994
starexec-result	YES

output

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


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


YES
proof of /export/starexec/sandbox2/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) LR [EQUIVALENT, 0 ms]
(2) HASKELL
(3) CR [EQUIVALENT, 0 ms]
(4) HASKELL
(5) IFR [EQUIVALENT, 0 ms]
(6) HASKELL
(7) BR [EQUIVALENT, 8 ms]
(8) HASKELL
(9) COR [EQUIVALENT, 0 ms]
(10) HASKELL
(11) LetRed [EQUIVALENT, 26 ms]
(12) HASKELL
(13) NumRed [SOUND, 0 ms]
(14) HASKELL
(15) Narrow [SOUND, 0 ms]
(16) AND
    (17) QDP
        (18) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (19) YES
    (20) QDP
        (21) DependencyGraphProof [EQUIVALENT, 0 ms]
        (22) AND
            (23) QDP
                (24) TransformationProof [EQUIVALENT, 1923 ms]
                (25) QDP
                (26) DependencyGraphProof [EQUIVALENT, 0 ms]
                (27) QDP
                (28) TransformationProof [EQUIVALENT, 0 ms]
                (29) QDP
                (30) TransformationProof [EQUIVALENT, 0 ms]
                (31) QDP
                (32) TransformationProof [EQUIVALENT, 0 ms]
                (33) QDP
                (34) QDPSizeChangeProof [EQUIVALENT, 0 ms]
                (35) YES
            (36) QDP
                (37) QDPSizeChangeProof [EQUIVALENT, 0 ms]
                (38) YES
    (39) QDP
        (40) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (41) YES
    (42) QDP
        (43) QDPSizeChangeProof [EQUIVALENT, 6 ms]
        (44) YES
    (45) QDP
        (46) QDPSizeChangeProof [EQUIVALENT, 29 ms]
        (47) YES
    (48) QDP
        (49) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (50) YES
    (51) QDP
        (52) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (53) YES


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

(0)
Obligation:
mainModule Main 
module FiniteMap where {
import qualified Main;
import qualified Maybe;
import qualified Prelude;
data FiniteMap b a = EmptyFM  | Branch b a Int (FiniteMap b a) (FiniteMap b a) ;

instance (Eq a, Eq b) => Eq FiniteMap b a where { 
(==) fm_1 fm_2 = sizeFM fm_1 == sizeFM fm_2 && fmToList fm_1 == fmToList fm_2;
}
fmToList :: FiniteMap a b  ->  [(a,b)];
fmToList fm = foldFM (\key elt rest ->(key,elt) : rest) [] fm;

foldFM :: (b  ->  c  ->  a  ->  a)  ->  a  ->  FiniteMap b c  ->  a;
foldFM k z EmptyFM = z;
foldFM k z (Branch key elt _ fm_l fm_r) = foldFM k (k key elt (foldFM k z fm_r)) fm_l;

lookupFM :: Ord a => FiniteMap a b  ->  a  ->  Maybe b;
lookupFM EmptyFM key = Nothing;
lookupFM (Branch key elt _ fm_l fm_r) key_to_find  | key_to_find < key = lookupFM fm_l key_to_find
 | key_to_find > key = lookupFM fm_r key_to_find
 | otherwise = Just elt;

lookupWithDefaultFM :: Ord a => FiniteMap a b  ->  b  ->  a  ->  b;
lookupWithDefaultFM fm deflt key = case lookupFM fm key of { 
Nothing-> deflt; 
Just elt-> elt;

popout

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

job log

popout

actions all output return to Haskell