details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	5.17691 seconds
cpu usage	12.3453
user time	11.968
system time	0.377362
max virtual memory	1.8285568E7
max residence set size	721124.0

stage attributes

key	value
starexec-result	YES

output

10.01/4.54 YES 12.25/5.12 proof of /export/starexec/sandbox/benchmark/theBenchmark.hs 12.25/5.12 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 12.25/5.12 12.25/5.12 12.25/5.12 H-Termination with start terms of the given HASKELL could be proven: 12.25/5.12 12.25/5.12 (0) HASKELL 12.25/5.12 (1) CR [EQUIVALENT, 0 ms] 12.25/5.12 (2) HASKELL 12.25/5.12 (3) BR [EQUIVALENT, 0 ms] 12.25/5.12 (4) HASKELL 12.25/5.12 (5) COR [EQUIVALENT, 0 ms] 12.25/5.12 (6) HASKELL 12.25/5.12 (7) Narrow [SOUND, 0 ms] 12.25/5.12 (8) QDP 12.25/5.12 (9) QDPSizeChangeProof [EQUIVALENT, 0 ms] 12.25/5.12 (10) YES 12.25/5.12 12.25/5.12 12.25/5.12 ---------------------------------------- 12.25/5.12 12.25/5.12 (0) 12.25/5.12 Obligation: 12.25/5.12 mainModule Main 12.25/5.12 module FiniteMap where { 12.25/5.12 import qualified Main; 12.25/5.12 import qualified Maybe; 12.25/5.12 import qualified Prelude; 12.25/5.12 data FiniteMap b a = EmptyFM | Branch b a Int (FiniteMap b a) (FiniteMap b a) ; 12.25/5.12 12.25/5.12 minFM :: Ord a => FiniteMap a b -> Maybe a; 12.25/5.12 minFM EmptyFM = Nothing; 12.25/5.12 minFM (Branch key _ _ fm_l _) = case minFM fm_l of { 12.25/5.12 Nothing-> Just key; 12.25/5.12 Just key1-> Just key1; 12.25/5.12 } ; 12.25/5.12 12.25/5.12 } 12.25/5.12 module Maybe where { 12.25/5.12 import qualified FiniteMap; 12.25/5.12 import qualified Main; 12.25/5.12 import qualified Prelude; 12.25/5.12 } 12.25/5.12 module Main where { 12.25/5.12 import qualified FiniteMap; 12.25/5.12 import qualified Maybe; 12.25/5.12 import qualified Prelude; 12.25/5.12 } 12.25/5.12 12.25/5.12 ---------------------------------------- 12.25/5.12 12.25/5.12 (1) CR (EQUIVALENT) 12.25/5.12 Case Reductions: 12.25/5.12 The following Case expression 12.25/5.12 "case minFM fm_l of { 12.25/5.12 Nothing -> Just key; 12.25/5.12 Just key1 -> Just key1} 12.25/5.12 " 12.25/5.12 is transformed to 12.25/5.12 "minFM0 key Nothing = Just key; 12.25/5.12 minFM0 key (Just key1) = Just key1; 12.25/5.12 " 12.25/5.12 12.25/5.12 ---------------------------------------- 12.25/5.12 12.25/5.12 (2) 12.25/5.12 Obligation: 12.25/5.12 mainModule Main 12.25/5.12 module FiniteMap where { 12.25/5.12 import qualified Main; 12.25/5.12 import qualified Maybe; 12.25/5.12 import qualified Prelude; 12.25/5.12 data FiniteMap b a = EmptyFM | Branch b a Int (FiniteMap b a) (FiniteMap b a) ; 12.25/5.12 12.25/5.12 minFM :: Ord b => FiniteMap b a -> Maybe b; 12.25/5.12 minFM EmptyFM = Nothing; 12.25/5.12 minFM (Branch key _ _ fm_l _) = minFM0 key (minFM fm_l); 12.25/5.12 12.25/5.12 minFM0 key Nothing = Just key; 12.25/5.12 minFM0 key (Just key1) = Just key1; 12.25/5.12 12.25/5.12 } 12.25/5.12 module Maybe where { 12.25/5.12 import qualified FiniteMap; 12.25/5.12 import qualified Main; 12.25/5.12 import qualified Prelude; 12.25/5.12 } 12.25/5.12 module Main where { 12.25/5.12 import qualified FiniteMap; 12.25/5.12 import qualified Maybe; 12.25/5.12 import qualified Prelude; 12.25/5.12 } 12.25/5.12 12.25/5.12 ---------------------------------------- 12.25/5.12 12.25/5.12 (3) BR (EQUIVALENT) 12.25/5.12 Replaced joker patterns by fresh variables and removed binding patterns. 12.25/5.12 ---------------------------------------- 12.25/5.12 popout

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

job log

popout

actions

all output return to Haskell 2019-04-01 06.52