details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	9.16589 seconds
cpu usage	12.3179
user time	11.9537
system time	0.3642
max virtual memory	1.8285568E7
max residence set size	750652.0

stage attributes

key	value
starexec-result	YES

output

10.13/4.59 YES 12.24/5.13 proof of /export/starexec/sandbox/benchmark/theBenchmark.hs 12.24/5.13 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 12.24/5.13 12.24/5.13 12.24/5.13 H-Termination with start terms of the given HASKELL could be proven: 12.24/5.13 12.24/5.13 (0) HASKELL 12.24/5.13 (1) CR [EQUIVALENT, 0 ms] 12.24/5.13 (2) HASKELL 12.24/5.13 (3) BR [EQUIVALENT, 0 ms] 12.24/5.13 (4) HASKELL 12.24/5.13 (5) COR [EQUIVALENT, 0 ms] 12.24/5.13 (6) HASKELL 12.24/5.13 (7) Narrow [SOUND, 0 ms] 12.24/5.13 (8) QDP 12.24/5.13 (9) DependencyGraphProof [EQUIVALENT, 0 ms] 12.24/5.13 (10) AND 12.24/5.13 (11) QDP 12.24/5.13 (12) QDPSizeChangeProof [EQUIVALENT, 0 ms] 12.24/5.13 (13) YES 12.24/5.13 (14) QDP 12.24/5.13 (15) QDPSizeChangeProof [EQUIVALENT, 0 ms] 12.24/5.13 (16) YES 12.24/5.13 (17) QDP 12.24/5.13 (18) QDPSizeChangeProof [EQUIVALENT, 0 ms] 12.24/5.13 (19) YES 12.24/5.13 12.24/5.13 12.24/5.13 ---------------------------------------- 12.24/5.13 12.24/5.13 (0) 12.24/5.13 Obligation: 12.24/5.13 mainModule Main 12.24/5.13 module FiniteMap where { 12.24/5.13 import qualified Main; 12.24/5.13 import qualified Maybe; 12.24/5.13 import qualified Prelude; 12.24/5.13 data FiniteMap a b = EmptyFM | Branch a b Int (FiniteMap a b) (FiniteMap a b) ; 12.24/5.13 12.24/5.13 instance (Eq a, Eq b) => Eq FiniteMap b a where { 12.24/5.13 } 12.24/5.13 elemFM :: Ord b => b -> FiniteMap b a -> Bool; 12.24/5.13 elemFM key fm = case lookupFM fm key of { 12.24/5.13 Nothing-> False; 12.24/5.13 Just elt-> True; 12.24/5.13 } ; 12.24/5.13 12.24/5.13 lookupFM :: Ord b => FiniteMap b a -> b -> Maybe a; 12.24/5.13 lookupFM EmptyFM key = Nothing; 12.24/5.13 lookupFM (Branch key elt _ fm_l fm_r) key_to_find | key_to_find < key = lookupFM fm_l key_to_find 12.24/5.13 | key_to_find > key = lookupFM fm_r key_to_find 12.24/5.13 | otherwise = Just elt; 12.24/5.13 12.24/5.13 } 12.24/5.13 module Maybe where { 12.24/5.13 import qualified FiniteMap; 12.24/5.13 import qualified Main; 12.24/5.13 import qualified Prelude; 12.24/5.13 } 12.24/5.13 module Main where { 12.24/5.13 import qualified FiniteMap; 12.24/5.13 import qualified Maybe; 12.24/5.13 import qualified Prelude; 12.24/5.13 } 12.24/5.13 12.24/5.13 ---------------------------------------- 12.24/5.13 12.24/5.13 (1) CR (EQUIVALENT) 12.24/5.13 Case Reductions: 12.24/5.13 The following Case expression 12.24/5.13 "case lookupFM fm key of { 12.24/5.13 Nothing -> False; 12.24/5.13 Just elt -> True} 12.24/5.13 " 12.24/5.13 is transformed to 12.24/5.13 "elemFM0 Nothing = False; 12.24/5.13 elemFM0 (Just elt) = True; 12.24/5.13 " 12.24/5.13 12.24/5.13 ---------------------------------------- 12.24/5.13 12.24/5.13 (2) 12.24/5.13 Obligation: 12.24/5.13 mainModule Main 12.24/5.13 module FiniteMap where { 12.24/5.13 import qualified Main; 12.24/5.13 import qualified Maybe; 12.24/5.13 import qualified Prelude; 12.24/5.13 data FiniteMap b a = EmptyFM | Branch b a Int (FiniteMap b a) (FiniteMap b a) ; 12.24/5.13 12.24/5.13 instance (Eq a, Eq b) => Eq FiniteMap a b where { 12.24/5.13 } 12.24/5.13 elemFM :: Ord b => b -> FiniteMap b a -> Bool; 12.24/5.13 elemFM key fm = elemFM0 (lookupFM fm key); 12.24/5.13 12.24/5.13 elemFM0 Nothing = False; 12.24/5.13 elemFM0 (Just elt) = True; 12.24/5.13 12.24/5.13 lookupFM :: Ord a => FiniteMap a b -> a -> Maybe b; popout

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

job log

popout

actions

all output return to Haskell 2019-04-01 06.52