details

property	value
status	complete
benchmark	FiniteMap_filterFM_5.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)	17.6351 seconds
cpu usage	37.084
user time	35.7194
system time	1.36457
max virtual memory	1.8285568E7
max residence set size	4197400.0

stage attributes

key	value
starexec-result	YES

output

33.36/16.60 YES 35.89/17.31 proof of /export/starexec/sandbox2/benchmark/theBenchmark.hs 35.89/17.31 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 35.89/17.31 35.89/17.31 35.89/17.31 H-Termination with start terms of the given HASKELL could be proven: 35.89/17.31 35.89/17.31 (0) HASKELL 35.89/17.31 (1) LR [EQUIVALENT, 0 ms] 35.89/17.31 (2) HASKELL 35.89/17.31 (3) CR [EQUIVALENT, 0 ms] 35.89/17.31 (4) HASKELL 35.89/17.31 (5) BR [EQUIVALENT, 0 ms] 35.89/17.31 (6) HASKELL 35.89/17.31 (7) COR [EQUIVALENT, 14 ms] 35.89/17.31 (8) HASKELL 35.89/17.31 (9) LetRed [EQUIVALENT, 0 ms] 35.89/17.31 (10) HASKELL 35.89/17.31 (11) NumRed [SOUND, 3 ms] 35.89/17.31 (12) HASKELL 35.89/17.31 (13) Narrow [SOUND, 0 ms] 35.89/17.31 (14) AND 35.89/17.31 (15) QDP 35.89/17.31 (16) QDPSizeChangeProof [EQUIVALENT, 0 ms] 35.89/17.31 (17) YES 35.89/17.31 (18) QDP 35.89/17.31 (19) QDPSizeChangeProof [EQUIVALENT, 0 ms] 35.89/17.31 (20) YES 35.89/17.31 (21) QDP 35.89/17.31 (22) QDPSizeChangeProof [EQUIVALENT, 0 ms] 35.89/17.31 (23) YES 35.89/17.31 (24) QDP 35.89/17.31 (25) QDPSizeChangeProof [EQUIVALENT, 0 ms] 35.89/17.31 (26) YES 35.89/17.31 (27) QDP 35.89/17.31 (28) QDPSizeChangeProof [EQUIVALENT, 0 ms] 35.89/17.31 (29) YES 35.89/17.31 (30) QDP 35.89/17.31 (31) QDPSizeChangeProof [EQUIVALENT, 0 ms] 35.89/17.31 (32) YES 35.89/17.31 (33) QDP 35.89/17.31 (34) QDPSizeChangeProof [EQUIVALENT, 0 ms] 35.89/17.31 (35) YES 35.89/17.31 (36) QDP 35.89/17.31 (37) QDPSizeChangeProof [EQUIVALENT, 0 ms] 35.89/17.31 (38) YES 35.89/17.31 (39) QDP 35.89/17.31 (40) QDPSizeChangeProof [EQUIVALENT, 0 ms] 35.89/17.31 (41) YES 35.89/17.31 (42) QDP 35.89/17.31 (43) QDPSizeChangeProof [EQUIVALENT, 0 ms] 35.89/17.31 (44) YES 35.89/17.31 (45) QDP 35.89/17.31 (46) QDPSizeChangeProof [EQUIVALENT, 0 ms] 35.89/17.31 (47) YES 35.89/17.31 (48) QDP 35.89/17.31 (49) QDPSizeChangeProof [EQUIVALENT, 0 ms] 35.89/17.31 (50) YES 35.89/17.31 (51) QDP 35.89/17.31 (52) QDPSizeChangeProof [EQUIVALENT, 0 ms] 35.89/17.31 (53) YES 35.89/17.31 (54) QDP 35.89/17.31 (55) QDPSizeChangeProof [EQUIVALENT, 0 ms] 35.89/17.31 (56) YES 35.89/17.31 (57) QDP 35.89/17.31 (58) QDPSizeChangeProof [EQUIVALENT, 0 ms] 35.89/17.31 (59) YES 35.89/17.31 (60) QDP 35.89/17.31 (61) QDPSizeChangeProof [EQUIVALENT, 0 ms] 35.89/17.31 (62) YES 35.89/17.31 (63) QDP 35.89/17.31 (64) QDPSizeChangeProof [EQUIVALENT, 0 ms] 35.89/17.31 (65) YES 35.89/17.31 35.89/17.31 35.89/17.31 ---------------------------------------- 35.89/17.31 35.89/17.31 (0) 35.89/17.31 Obligation: 35.89/17.31 mainModule Main 35.89/17.31 module FiniteMap where { 35.89/17.31 import qualified Main; 35.89/17.31 import qualified Maybe; 35.89/17.31 import qualified Prelude; 35.89/17.31 data FiniteMap a b = EmptyFM | Branch a b Int (FiniteMap a b) (FiniteMap a b) ; 35.89/17.31 35.89/17.31 instance (Eq a, Eq b) => Eq FiniteMap b a where { 35.89/17.31 } 35.89/17.31 addToFM :: Ord b => FiniteMap b a -> b -> a -> FiniteMap b a; 35.89/17.31 addToFM fm key elt = addToFM_C (\old new ->new) fm key elt; 35.89/17.31 35.89/17.31 addToFM_C :: Ord b => (a -> a -> a) -> FiniteMap b a -> b -> a -> FiniteMap b a; 35.89/17.31 addToFM_C combiner EmptyFM key elt = unitFM key elt; 35.89/17.31 addToFM_C combiner (Branch key elt size fm_l fm_r) new_key new_elt | new_key < key = mkBalBranch key elt (addToFM_C combiner fm_l new_key new_elt) fm_r 35.89/17.31 | new_key > key = mkBalBranch key elt fm_l (addToFM_C combiner fm_r new_key new_elt) 35.89/17.31 | otherwise = Branch new_key (combiner elt new_elt) size fm_l fm_r; 35.89/17.31 35.89/17.31 deleteMax :: Ord a => FiniteMap a b -> FiniteMap a b; 35.89/17.31 deleteMax (Branch key elt _ fm_l EmptyFM) = fm_l; 35.89/17.31 deleteMax (Branch key elt _ fm_l fm_r) = mkBalBranch key elt fm_l (deleteMax fm_r); popout

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

job log

popout

actions

all output return to Haskell 2019-04-01 06.52