details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	19.822 seconds
cpu usage	37.5848
user time	36.2846
system time	1.30016
max virtual memory	1.8288076E7
max residence set size	3953928.0

stage attributes

key	value
starexec-result	YES

output

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

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

job log

popout

actions

all output return to Haskell 2019-04-01 06.52