details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	22.3875 seconds
cpu usage	39.6991
user time	38.4514
system time	1.24771
max virtual memory	1.8288076E7
max residence set size	3951084.0

stage attributes

key	value
starexec-result	YES

output

36.34/21.43 YES 39.49/22.28 proof of /export/starexec/sandbox/benchmark/theBenchmark.hs 39.49/22.28 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 39.49/22.28 39.49/22.28 39.49/22.28 H-Termination with start terms of the given HASKELL could be proven: 39.49/22.28 39.49/22.28 (0) HASKELL 39.49/22.28 (1) LR [EQUIVALENT, 0 ms] 39.49/22.28 (2) HASKELL 39.49/22.28 (3) CR [EQUIVALENT, 0 ms] 39.49/22.28 (4) HASKELL 39.49/22.28 (5) IFR [EQUIVALENT, 0 ms] 39.49/22.28 (6) HASKELL 39.49/22.28 (7) BR [EQUIVALENT, 15 ms] 39.49/22.28 (8) HASKELL 39.49/22.28 (9) COR [EQUIVALENT, 0 ms] 39.49/22.28 (10) HASKELL 39.49/22.28 (11) LetRed [EQUIVALENT, 13 ms] 39.49/22.28 (12) HASKELL 39.49/22.28 (13) NumRed [SOUND, 0 ms] 39.49/22.28 (14) HASKELL 39.49/22.28 (15) Narrow [SOUND, 0 ms] 39.49/22.28 (16) AND 39.49/22.28 (17) QDP 39.49/22.28 (18) QDPSizeChangeProof [EQUIVALENT, 0 ms] 39.49/22.28 (19) YES 39.49/22.28 (20) QDP 39.49/22.28 (21) QDPSizeChangeProof [EQUIVALENT, 0 ms] 39.49/22.28 (22) YES 39.49/22.28 (23) QDP 39.49/22.28 (24) TransformationProof [EQUIVALENT, 1694 ms] 39.49/22.28 (25) QDP 39.49/22.28 (26) QDPSizeChangeProof [EQUIVALENT, 0 ms] 39.49/22.28 (27) YES 39.49/22.28 (28) QDP 39.49/22.28 (29) QDPSizeChangeProof [EQUIVALENT, 0 ms] 39.49/22.28 (30) YES 39.49/22.28 (31) QDP 39.49/22.28 (32) QDPSizeChangeProof [EQUIVALENT, 55 ms] 39.49/22.28 (33) YES 39.49/22.28 (34) QDP 39.49/22.28 (35) QDPSizeChangeProof [EQUIVALENT, 0 ms] 39.49/22.28 (36) YES 39.49/22.28 (37) QDP 39.49/22.28 (38) TransformationProof [EQUIVALENT, 0 ms] 39.49/22.28 (39) QDP 39.49/22.28 (40) TransformationProof [EQUIVALENT, 0 ms] 39.49/22.28 (41) QDP 39.49/22.28 (42) UsableRulesProof [EQUIVALENT, 0 ms] 39.49/22.28 (43) QDP 39.49/22.28 (44) QReductionProof [EQUIVALENT, 0 ms] 39.49/22.28 (45) QDP 39.49/22.28 (46) QDPOrderProof [EQUIVALENT, 145 ms] 39.49/22.28 (47) QDP 39.49/22.28 (48) DependencyGraphProof [EQUIVALENT, 0 ms] 39.49/22.28 (49) QDP 39.49/22.28 (50) QDPSizeChangeProof [EQUIVALENT, 0 ms] 39.49/22.28 (51) YES 39.49/22.28 (52) QDP 39.49/22.28 (53) QDPSizeChangeProof [EQUIVALENT, 0 ms] 39.49/22.28 (54) YES 39.49/22.28 (55) QDP 39.49/22.28 (56) QDPSizeChangeProof [EQUIVALENT, 0 ms] 39.49/22.28 (57) YES 39.49/22.28 39.49/22.28 39.49/22.28 ---------------------------------------- 39.49/22.28 39.49/22.28 (0) 39.49/22.28 Obligation: 39.49/22.28 mainModule Main 39.49/22.28 module FiniteMap where { 39.49/22.28 import qualified Main; 39.49/22.28 import qualified Maybe; 39.49/22.28 import qualified Prelude; 39.49/22.28 data FiniteMap b a = EmptyFM | Branch b a Int (FiniteMap b a) (FiniteMap b a) ; 39.49/22.28 39.49/22.28 instance (Eq a, Eq b) => Eq FiniteMap a b where { 39.49/22.28 (==) fm_1 fm_2 = sizeFM fm_1 == sizeFM fm_2 && fmToList fm_1 == fmToList fm_2; 39.49/22.28 } 39.49/22.28 fmToList :: FiniteMap a b -> [(a,b)]; 39.49/22.28 fmToList fm = foldFM (\key elt rest ->(key,elt) : rest) [] fm; 39.49/22.28 39.49/22.28 fmToList_LE :: Ord b => FiniteMap b a -> b -> [(b,a)]; 39.49/22.28 fmToList_LE fm fr = foldFM_LE (\key elt rest ->(key,elt) : rest) [] fr fm; 39.49/22.28 39.49/22.28 foldFM :: (a -> c -> b -> b) -> b -> FiniteMap a c -> b; 39.49/22.28 foldFM k z EmptyFM = z; 39.49/22.28 foldFM k z (Branch key elt _ fm_l fm_r) = foldFM k (k key elt (foldFM k z fm_r)) fm_l; 39.49/22.28 39.49/22.28 foldFM_LE :: Ord b => (b -> a -> c -> c) -> c -> b -> FiniteMap b a -> c; 39.49/22.28 foldFM_LE k z fr EmptyFM = z; 39.49/22.28 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 39.49/22.28 | otherwise = foldFM_LE k z fr fm_l; 39.49/22.28 39.49/22.28 sizeFM :: FiniteMap b a -> Int; 39.49/22.28 sizeFM EmptyFM = 0; 39.49/22.28 sizeFM (Branch _ _ size _ _) = size; 39.49/22.28 popout

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

job log

popout

actions

all output return to Haskell 2019-04-01 06.52