Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Haskell 2019-04-01 06.52 pair #433315952
details
property
value
status
complete
benchmark
FiniteMap_plusFM_C_1.hs
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n033.star.cs.uiowa.edu
space
full_haskell
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
34.4544 seconds
cpu usage
61.0132
user time
59.4139
system time
1.59927
max virtual memory
1.8288076E7
max residence set size
5171968.0
stage attributes
key
value
starexec-result
YES
output
56.63/33.23 YES 59.42/33.99 proof of /export/starexec/sandbox2/benchmark/theBenchmark.hs 59.42/33.99 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 59.42/33.99 59.42/33.99 59.42/33.99 H-Termination with start terms of the given HASKELL could be proven: 59.42/33.99 59.42/33.99 (0) HASKELL 59.42/33.99 (1) LR [EQUIVALENT, 0 ms] 59.42/33.99 (2) HASKELL 59.42/33.99 (3) CR [EQUIVALENT, 0 ms] 59.42/33.99 (4) HASKELL 59.42/33.99 (5) IFR [EQUIVALENT, 0 ms] 59.42/33.99 (6) HASKELL 59.42/33.99 (7) BR [EQUIVALENT, 0 ms] 59.42/33.99 (8) HASKELL 59.42/33.99 (9) COR [EQUIVALENT, 0 ms] 59.42/33.99 (10) HASKELL 59.42/33.99 (11) LetRed [EQUIVALENT, 0 ms] 59.42/33.99 (12) HASKELL 59.42/33.99 (13) NumRed [SOUND, 0 ms] 59.42/33.99 (14) HASKELL 59.42/33.99 (15) Narrow [SOUND, 0 ms] 59.42/33.99 (16) AND 59.42/33.99 (17) QDP 59.42/33.99 (18) QDPSizeChangeProof [EQUIVALENT, 0 ms] 59.42/33.99 (19) YES 59.42/33.99 (20) QDP 59.42/33.99 (21) TransformationProof [EQUIVALENT, 3761 ms] 59.42/33.99 (22) QDP 59.42/33.99 (23) TransformationProof [EQUIVALENT, 0 ms] 59.42/33.99 (24) QDP 59.42/33.99 (25) QDPSizeChangeProof [EQUIVALENT, 0 ms] 59.42/33.99 (26) YES 59.42/33.99 (27) QDP 59.42/33.99 (28) QDPOrderProof [EQUIVALENT, 94 ms] 59.42/33.99 (29) QDP 59.42/33.99 (30) DependencyGraphProof [EQUIVALENT, 0 ms] 59.42/33.99 (31) TRUE 59.42/33.99 (32) QDP 59.42/33.99 (33) QDPSizeChangeProof [EQUIVALENT, 0 ms] 59.42/33.99 (34) YES 59.42/33.99 (35) QDP 59.42/33.99 (36) QDPSizeChangeProof [EQUIVALENT, 0 ms] 59.42/33.99 (37) YES 59.42/33.99 (38) QDP 59.42/33.99 (39) QDPSizeChangeProof [EQUIVALENT, 0 ms] 59.42/33.99 (40) YES 59.42/33.99 (41) QDP 59.42/33.99 (42) QDPSizeChangeProof [EQUIVALENT, 0 ms] 59.42/33.99 (43) YES 59.42/33.99 (44) QDP 59.42/33.99 (45) QDPSizeChangeProof [EQUIVALENT, 0 ms] 59.42/33.99 (46) YES 59.42/33.99 (47) QDP 59.42/33.99 (48) QDPSizeChangeProof [EQUIVALENT, 106 ms] 59.42/33.99 (49) YES 59.42/33.99 (50) QDP 59.42/33.99 (51) QDPSizeChangeProof [EQUIVALENT, 0 ms] 59.42/33.99 (52) YES 59.42/33.99 (53) QDP 59.42/33.99 (54) QDPSizeChangeProof [EQUIVALENT, 0 ms] 59.42/33.99 (55) YES 59.42/33.99 (56) QDP 59.42/33.99 (57) QDPSizeChangeProof [EQUIVALENT, 0 ms] 59.42/33.99 (58) YES 59.42/33.99 (59) QDP 59.42/33.99 (60) QDPSizeChangeProof [EQUIVALENT, 0 ms] 59.42/33.99 (61) YES 59.42/33.99 59.42/33.99 59.42/33.99 ---------------------------------------- 59.42/33.99 59.42/33.99 (0) 59.42/33.99 Obligation: 59.42/33.99 mainModule Main 59.42/33.99 module FiniteMap where { 59.42/33.99 import qualified Main; 59.42/33.99 import qualified Maybe; 59.42/33.99 import qualified Prelude; 59.42/33.99 data FiniteMap a b = EmptyFM | Branch a b Int (FiniteMap a b) (FiniteMap a b) ; 59.42/33.99 59.42/33.99 instance (Eq a, Eq b) => Eq FiniteMap a b where { 59.42/33.99 (==) fm_1 fm_2 = sizeFM fm_1 == sizeFM fm_2 && fmToList fm_1 == fmToList fm_2; 59.42/33.99 } 59.42/33.99 addToFM :: Ord b => FiniteMap b a -> b -> a -> FiniteMap b a; 59.42/33.99 addToFM fm key elt = addToFM_C (\old new ->new) fm key elt; 59.42/33.99 59.42/33.99 addToFM_C :: Ord b => (a -> a -> a) -> FiniteMap b a -> b -> a -> FiniteMap b a; 59.42/33.99 addToFM_C combiner EmptyFM key elt = unitFM key elt; 59.42/33.99 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 59.42/33.99 | new_key > key = mkBalBranch key elt fm_l (addToFM_C combiner fm_r new_key new_elt) 59.42/33.99 | otherwise = Branch new_key (combiner elt new_elt) size fm_l fm_r; 59.42/33.99 59.42/33.99 emptyFM :: FiniteMap b a; 59.42/33.99 emptyFM = EmptyFM; 59.42/33.99 59.42/33.99 findMax :: FiniteMap a b -> (a,b); 59.42/33.99 findMax (Branch key elt _ _ EmptyFM) = (key,elt); 59.42/33.99 findMax (Branch key elt _ _ fm_r) = findMax 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