details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	11.2395 seconds
cpu usage	26.4589
user time	25.2207
system time	1.23821
max virtual memory	1.8287616E7
max residence set size	3851180.0

stage attributes

key	value
starexec-result	YES

output

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

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

job log

popout

actions

all output return to Haskell 2019-04-01 06.52