details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	22.0067 seconds
cpu usage	38.6384
user time	37.3716
system time	1.26688
max virtual memory	1.8288076E7
max residence set size	3944736.0

stage attributes

key	value
starexec-result	YES

output

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

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

job log

popout

actions

all output return to Haskell 2019-04-01 06.52