details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	5.27305 seconds
cpu usage	12.3901
user time	12.0335
system time	0.356676
max virtual memory	1.82874E7
max residence set size	701084.0

stage attributes

key	value
starexec-result	YES

output

10.03/4.62 YES 12.18/5.19 proof of /export/starexec/sandbox/benchmark/theBenchmark.hs 12.18/5.19 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 12.18/5.19 12.18/5.19 12.18/5.19 H-Termination with start terms of the given HASKELL could be proven: 12.18/5.19 12.18/5.19 (0) HASKELL 12.18/5.19 (1) LR [EQUIVALENT, 0 ms] 12.18/5.19 (2) HASKELL 12.18/5.19 (3) BR [EQUIVALENT, 0 ms] 12.18/5.19 (4) HASKELL 12.18/5.19 (5) COR [EQUIVALENT, 0 ms] 12.18/5.19 (6) HASKELL 12.18/5.19 (7) Narrow [SOUND, 0 ms] 12.18/5.19 (8) AND 12.18/5.19 (9) QDP 12.18/5.19 (10) QDPSizeChangeProof [EQUIVALENT, 0 ms] 12.18/5.19 (11) YES 12.18/5.19 (12) QDP 12.18/5.19 (13) TransformationProof [EQUIVALENT, 0 ms] 12.18/5.19 (14) QDP 12.18/5.19 (15) QDPSizeChangeProof [EQUIVALENT, 0 ms] 12.18/5.19 (16) YES 12.18/5.19 12.18/5.19 12.18/5.19 ---------------------------------------- 12.18/5.19 12.18/5.19 (0) 12.18/5.19 Obligation: 12.18/5.19 mainModule Main 12.18/5.19 module FiniteMap where { 12.18/5.19 import qualified Main; 12.18/5.19 import qualified Maybe; 12.18/5.19 import qualified Prelude; 12.18/5.19 data FiniteMap b a = EmptyFM | Branch b a Int (FiniteMap b a) (FiniteMap b a) ; 12.18/5.19 12.18/5.19 instance (Eq a, Eq b) => Eq FiniteMap b a where { 12.18/5.19 } 12.18/5.19 eltsFM_LE :: Ord a => FiniteMap a b -> a -> [b]; 12.18/5.19 eltsFM_LE fm fr = foldFM_LE (\key elt rest ->elt : rest) [] fr fm; 12.18/5.19 12.18/5.19 foldFM_LE :: Ord b => (b -> c -> a -> a) -> a -> b -> FiniteMap b c -> a; 12.18/5.19 foldFM_LE k z fr EmptyFM = z; 12.18/5.19 foldFM_LE k z fr (Branch key elt _ fm_l fm_r) | key <= fr = foldFM_LE k (k key elt (foldFM_LE k z fr fm_l)) fr fm_r 12.18/5.19 | otherwise = foldFM_LE k z fr fm_l; 12.18/5.19 12.18/5.19 } 12.18/5.19 module Maybe where { 12.18/5.19 import qualified FiniteMap; 12.18/5.19 import qualified Main; 12.18/5.19 import qualified Prelude; 12.18/5.19 } 12.18/5.19 module Main where { 12.18/5.19 import qualified FiniteMap; 12.18/5.19 import qualified Maybe; 12.18/5.19 import qualified Prelude; 12.18/5.19 } 12.18/5.19 12.18/5.19 ---------------------------------------- 12.18/5.19 12.18/5.19 (1) LR (EQUIVALENT) 12.18/5.19 Lambda Reductions: 12.18/5.19 The following Lambda expression 12.18/5.19 "\keyeltrest->elt : rest" 12.18/5.19 is transformed to 12.18/5.19 "eltsFM_LE0 key elt rest = elt : rest; 12.18/5.19 " 12.18/5.19 12.18/5.19 ---------------------------------------- 12.18/5.19 12.18/5.19 (2) 12.18/5.19 Obligation: 12.18/5.19 mainModule Main 12.18/5.19 module FiniteMap where { 12.18/5.19 import qualified Main; 12.18/5.19 import qualified Maybe; 12.18/5.19 import qualified Prelude; 12.18/5.19 data FiniteMap a b = EmptyFM | Branch a b Int (FiniteMap a b) (FiniteMap a b) ; 12.18/5.19 12.18/5.19 instance (Eq a, Eq b) => Eq FiniteMap b a where { 12.18/5.19 } 12.18/5.19 eltsFM_LE :: Ord b => FiniteMap b a -> b -> [a]; 12.18/5.19 eltsFM_LE fm fr = foldFM_LE eltsFM_LE0 [] fr fm; 12.18/5.19 12.18/5.19 eltsFM_LE0 key elt rest = elt : rest; 12.18/5.19 12.18/5.19 foldFM_LE :: Ord a => (a -> c -> b -> b) -> b -> a -> FiniteMap a c -> b; 12.18/5.19 foldFM_LE k z fr EmptyFM = z; 12.18/5.19 foldFM_LE k z fr (Branch key elt _ fm_l fm_r) | key <= fr = foldFM_LE k (k key elt (foldFM_LE k z fr fm_l)) fr fm_r 12.18/5.19 | otherwise = foldFM_LE k z fr fm_l; 12.18/5.19 12.18/5.19 } 12.18/5.19 module Maybe where { 12.18/5.19 import qualified FiniteMap; 12.18/5.19 import qualified Main; 12.18/5.19 import qualified Prelude; 12.18/5.19 } 12.18/5.19 module Main where { 12.18/5.19 import qualified FiniteMap; popout

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

job log

popout

actions

all output return to Haskell 2019-04-01 06.52