details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	14.6148 seconds
cpu usage	30.1076
user time	28.9742
system time	1.13337
max virtual memory	1.8285568E7
max residence set size	3957020.0

stage attributes

key	value
starexec-result	YES

output

26.77/13.71 YES 29.71/14.50 proof of /export/starexec/sandbox2/benchmark/theBenchmark.hs 29.71/14.50 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 29.71/14.50 29.71/14.50 29.71/14.50 H-Termination with start terms of the given HASKELL could be proven: 29.71/14.50 29.71/14.50 (0) HASKELL 29.71/14.50 (1) LR [EQUIVALENT, 0 ms] 29.71/14.50 (2) HASKELL 29.71/14.50 (3) CR [EQUIVALENT, 0 ms] 29.71/14.50 (4) HASKELL 29.71/14.50 (5) IFR [EQUIVALENT, 0 ms] 29.71/14.50 (6) HASKELL 29.71/14.50 (7) BR [EQUIVALENT, 0 ms] 29.71/14.50 (8) HASKELL 29.71/14.50 (9) COR [EQUIVALENT, 4 ms] 29.71/14.50 (10) HASKELL 29.71/14.50 (11) LetRed [EQUIVALENT, 0 ms] 29.71/14.50 (12) HASKELL 29.71/14.50 (13) NumRed [SOUND, 10 ms] 29.71/14.50 (14) HASKELL 29.71/14.50 (15) Narrow [SOUND, 0 ms] 29.71/14.50 (16) AND 29.71/14.50 (17) QDP 29.71/14.50 (18) QDPSizeChangeProof [EQUIVALENT, 0 ms] 29.71/14.50 (19) YES 29.71/14.50 (20) QDP 29.71/14.50 (21) QDPSizeChangeProof [EQUIVALENT, 11 ms] 29.71/14.50 (22) YES 29.71/14.50 (23) QDP 29.71/14.50 (24) QDPSizeChangeProof [EQUIVALENT, 0 ms] 29.71/14.50 (25) YES 29.71/14.50 (26) QDP 29.71/14.50 (27) QDPSizeChangeProof [EQUIVALENT, 0 ms] 29.71/14.50 (28) YES 29.71/14.50 (29) QDP 29.71/14.50 (30) QDPSizeChangeProof [EQUIVALENT, 155 ms] 29.71/14.50 (31) YES 29.71/14.50 (32) QDP 29.71/14.50 (33) QDPSizeChangeProof [EQUIVALENT, 0 ms] 29.71/14.50 (34) YES 29.71/14.50 (35) QDP 29.71/14.50 (36) QDPSizeChangeProof [EQUIVALENT, 0 ms] 29.71/14.50 (37) YES 29.71/14.50 29.71/14.50 29.71/14.50 ---------------------------------------- 29.71/14.50 29.71/14.50 (0) 29.71/14.50 Obligation: 29.71/14.50 mainModule Main 29.71/14.50 module FiniteMap where { 29.71/14.50 import qualified Main; 29.71/14.50 import qualified Maybe; 29.71/14.50 import qualified Prelude; 29.71/14.50 data FiniteMap a b = EmptyFM | Branch a b Int (FiniteMap a b) (FiniteMap a b) ; 29.71/14.50 29.71/14.50 instance (Eq a, Eq b) => Eq FiniteMap a b where { 29.71/14.50 (==) fm_1 fm_2 = sizeFM fm_1 == sizeFM fm_2 && fmToList fm_1 == fmToList fm_2; 29.71/14.50 } 29.71/14.50 elemFM :: Ord a => a -> FiniteMap a b -> Bool; 29.71/14.50 elemFM key fm = case lookupFM fm key of { 29.71/14.50 Nothing-> False; 29.71/14.50 Just elt-> True; 29.71/14.50 } ; 29.71/14.50 29.71/14.50 fmToList :: FiniteMap b a -> [(b,a)]; 29.71/14.50 fmToList fm = foldFM (\key elt rest ->(key,elt) : rest) [] fm; 29.71/14.50 29.71/14.50 foldFM :: (a -> c -> b -> b) -> b -> FiniteMap a c -> b; 29.71/14.50 foldFM k z EmptyFM = z; 29.71/14.50 foldFM k z (Branch key elt _ fm_l fm_r) = foldFM k (k key elt (foldFM k z fm_r)) fm_l; 29.71/14.50 29.71/14.50 lookupFM :: Ord b => FiniteMap b a -> b -> Maybe a; 29.71/14.50 lookupFM EmptyFM key = Nothing; 29.71/14.50 lookupFM (Branch key elt _ fm_l fm_r) key_to_find | key_to_find < key = lookupFM fm_l key_to_find 29.71/14.50 | key_to_find > key = lookupFM fm_r key_to_find 29.71/14.50 | otherwise = Just elt; 29.71/14.50 29.71/14.50 sizeFM :: FiniteMap a b -> Int; 29.71/14.50 sizeFM EmptyFM = 0; 29.71/14.50 sizeFM (Branch _ _ size _ _) = size; 29.71/14.50 29.71/14.50 } 29.71/14.50 module Maybe where { 29.71/14.50 import qualified FiniteMap; 29.71/14.50 import qualified Main; 29.71/14.50 import qualified Prelude; 29.71/14.50 } 29.71/14.50 module Main where { 29.71/14.50 import qualified FiniteMap; 29.71/14.50 import qualified Maybe; 29.71/14.50 import qualified Prelude; 29.71/14.50 } 29.71/14.50 29.71/14.50 ---------------------------------------- 29.71/14.50 29.71/14.50 (1) LR (EQUIVALENT) 29.71/14.50 Lambda Reductions: popout

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

job log

popout

actions

all output return to Haskell 2019-04-01 06.52