details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	5.25469 seconds
cpu usage	12.1782
user time	11.8413
system time	0.336847
max virtual memory	1.8285568E7
max residence set size	719672.0

stage attributes

key	value
starexec-result	YES

output

9.91/4.65 YES 12.08/5.21 proof of /export/starexec/sandbox/benchmark/theBenchmark.hs 12.08/5.21 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 12.08/5.21 12.08/5.21 12.08/5.21 H-Termination with start terms of the given HASKELL could be proven: 12.08/5.21 12.08/5.21 (0) HASKELL 12.08/5.21 (1) LR [EQUIVALENT, 0 ms] 12.08/5.21 (2) HASKELL 12.08/5.21 (3) BR [EQUIVALENT, 0 ms] 12.08/5.21 (4) HASKELL 12.08/5.21 (5) COR [EQUIVALENT, 0 ms] 12.08/5.21 (6) HASKELL 12.08/5.21 (7) Narrow [SOUND, 0 ms] 12.08/5.21 (8) AND 12.08/5.21 (9) QDP 12.08/5.21 (10) QDPSizeChangeProof [EQUIVALENT, 0 ms] 12.08/5.21 (11) YES 12.08/5.21 (12) QDP 12.08/5.21 (13) QDPSizeChangeProof [EQUIVALENT, 0 ms] 12.08/5.21 (14) YES 12.08/5.21 12.08/5.21 12.08/5.21 ---------------------------------------- 12.08/5.21 12.08/5.21 (0) 12.08/5.21 Obligation: 12.08/5.21 mainModule Main 12.08/5.21 module FiniteMap where { 12.08/5.21 import qualified Main; 12.08/5.21 import qualified Maybe; 12.08/5.21 import qualified Prelude; 12.08/5.21 data FiniteMap b a = EmptyFM | Branch b a Int (FiniteMap b a) (FiniteMap b a) ; 12.08/5.21 12.08/5.21 eltsFM :: FiniteMap b a -> [a]; 12.08/5.21 eltsFM fm = foldFM (\key elt rest ->elt : rest) [] fm; 12.08/5.21 12.08/5.21 foldFM :: (c -> a -> b -> b) -> b -> FiniteMap c a -> b; 12.08/5.21 foldFM k z EmptyFM = z; 12.08/5.21 foldFM k z (Branch key elt _ fm_l fm_r) = foldFM k (k key elt (foldFM k z fm_r)) fm_l; 12.08/5.21 12.08/5.21 } 12.08/5.21 module Maybe where { 12.08/5.21 import qualified FiniteMap; 12.08/5.21 import qualified Main; 12.08/5.21 import qualified Prelude; 12.08/5.21 } 12.08/5.21 module Main where { 12.08/5.21 import qualified FiniteMap; 12.08/5.21 import qualified Maybe; 12.08/5.21 import qualified Prelude; 12.08/5.21 } 12.08/5.21 12.08/5.21 ---------------------------------------- 12.08/5.21 12.08/5.21 (1) LR (EQUIVALENT) 12.08/5.21 Lambda Reductions: 12.08/5.21 The following Lambda expression 12.08/5.21 "\keyeltrest->elt : rest" 12.08/5.21 is transformed to 12.08/5.21 "eltsFM0 key elt rest = elt : rest; 12.08/5.21 " 12.08/5.21 12.08/5.21 ---------------------------------------- 12.08/5.21 12.08/5.21 (2) 12.08/5.21 Obligation: 12.08/5.21 mainModule Main 12.08/5.21 module FiniteMap where { 12.08/5.21 import qualified Main; 12.08/5.21 import qualified Maybe; 12.08/5.21 import qualified Prelude; 12.08/5.21 data FiniteMap a b = EmptyFM | Branch a b Int (FiniteMap a b) (FiniteMap a b) ; 12.08/5.21 12.08/5.21 eltsFM :: FiniteMap b a -> [a]; 12.08/5.21 eltsFM fm = foldFM eltsFM0 [] fm; 12.08/5.21 12.08/5.21 eltsFM0 key elt rest = elt : rest; 12.08/5.21 12.08/5.21 foldFM :: (a -> b -> c -> c) -> c -> FiniteMap a b -> c; 12.08/5.21 foldFM k z EmptyFM = z; 12.08/5.21 foldFM k z (Branch key elt _ fm_l fm_r) = foldFM k (k key elt (foldFM k z fm_r)) fm_l; 12.08/5.21 12.08/5.21 } 12.08/5.21 module Maybe where { 12.08/5.21 import qualified FiniteMap; 12.08/5.21 import qualified Main; 12.08/5.21 import qualified Prelude; 12.08/5.21 } 12.08/5.21 module Main where { 12.08/5.21 import qualified FiniteMap; 12.08/5.21 import qualified Maybe; 12.08/5.21 import qualified Prelude; 12.08/5.21 } 12.08/5.21 12.08/5.21 ---------------------------------------- 12.08/5.21 12.08/5.21 (3) BR (EQUIVALENT) 12.08/5.21 Replaced joker patterns by fresh variables and removed binding patterns. popout

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

job log

popout

actions

all output return to Haskell 2019-04-01 06.52