details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	11.0294 seconds
cpu usage	26.1223
user time	25.0512
system time	1.07105
max virtual memory	1.8287616E7
max residence set size	3876036.0

stage attributes

key	value
starexec-result	YES

output

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

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

job log

popout

actions

all output return to Haskell 2019-04-01 06.52