Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Haskell 2019-04-01 06.52 pair #433316830
details
property
value
status
complete
benchmark
FiniteMap_fmToList_GE_9.hs
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n093.star.cs.uiowa.edu
space
full_haskell
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
12.1737 seconds
cpu usage
28.2712
user time
27.0141
system time
1.25711
max virtual memory
1.8285568E7
max residence set size
3944756.0
stage attributes
key
value
starexec-result
YES
output
24.73/11.18 YES 27.94/12.05 proof of /export/starexec/sandbox/benchmark/theBenchmark.hs 27.94/12.05 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 27.94/12.05 27.94/12.05 27.94/12.05 H-Termination with start terms of the given HASKELL could be proven: 27.94/12.05 27.94/12.05 (0) HASKELL 27.94/12.05 (1) LR [EQUIVALENT, 0 ms] 27.94/12.05 (2) HASKELL 27.94/12.05 (3) CR [EQUIVALENT, 0 ms] 27.94/12.05 (4) HASKELL 27.94/12.05 (5) IFR [EQUIVALENT, 0 ms] 27.94/12.05 (6) HASKELL 27.94/12.05 (7) BR [EQUIVALENT, 8 ms] 27.94/12.05 (8) HASKELL 27.94/12.05 (9) COR [EQUIVALENT, 0 ms] 27.94/12.05 (10) HASKELL 27.94/12.05 (11) LetRed [EQUIVALENT, 10 ms] 27.94/12.05 (12) HASKELL 27.94/12.05 (13) NumRed [SOUND, 0 ms] 27.94/12.05 (14) HASKELL 27.94/12.05 (15) Narrow [SOUND, 0 ms] 27.94/12.05 (16) AND 27.94/12.05 (17) QDP 27.94/12.05 (18) QDPSizeChangeProof [EQUIVALENT, 2 ms] 27.94/12.05 (19) YES 27.94/12.05 (20) QDP 27.94/12.05 (21) TransformationProof [EQUIVALENT, 1799 ms] 27.94/12.05 (22) QDP 27.94/12.05 (23) TransformationProof [EQUIVALENT, 0 ms] 27.94/12.05 (24) QDP 27.94/12.05 (25) TransformationProof [EQUIVALENT, 0 ms] 27.94/12.05 (26) QDP 27.94/12.05 (27) TransformationProof [EQUIVALENT, 0 ms] 27.94/12.05 (28) QDP 27.94/12.05 (29) QDPSizeChangeProof [EQUIVALENT, 0 ms] 27.94/12.05 (30) YES 27.94/12.05 (31) QDP 27.94/12.05 (32) TransformationProof [EQUIVALENT, 1330 ms] 27.94/12.05 (33) QDP 27.94/12.05 (34) TransformationProof [EQUIVALENT, 0 ms] 27.94/12.05 (35) QDP 27.94/12.05 (36) TransformationProof [EQUIVALENT, 0 ms] 27.94/12.05 (37) QDP 27.94/12.05 (38) TransformationProof [EQUIVALENT, 0 ms] 27.94/12.05 (39) QDP 27.94/12.05 (40) QDPSizeChangeProof [EQUIVALENT, 0 ms] 27.94/12.05 (41) YES 27.94/12.05 (42) QDP 27.94/12.05 (43) QDPSizeChangeProof [EQUIVALENT, 0 ms] 27.94/12.05 (44) YES 27.94/12.05 (45) QDP 27.94/12.05 (46) QDPSizeChangeProof [EQUIVALENT, 57 ms] 27.94/12.05 (47) YES 27.94/12.05 (48) QDP 27.94/12.05 (49) QDPSizeChangeProof [EQUIVALENT, 0 ms] 27.94/12.05 (50) YES 27.94/12.05 (51) QDP 27.94/12.05 (52) QDPSizeChangeProof [EQUIVALENT, 0 ms] 27.94/12.05 (53) YES 27.94/12.05 (54) QDP 27.94/12.05 (55) QDPSizeChangeProof [EQUIVALENT, 0 ms] 27.94/12.05 (56) YES 27.94/12.05 27.94/12.05 27.94/12.05 ---------------------------------------- 27.94/12.05 27.94/12.05 (0) 27.94/12.05 Obligation: 27.94/12.05 mainModule Main 27.94/12.05 module FiniteMap where { 27.94/12.05 import qualified Main; 27.94/12.05 import qualified Maybe; 27.94/12.05 import qualified Prelude; 27.94/12.05 data FiniteMap a b = EmptyFM | Branch a b Int (FiniteMap a b) (FiniteMap a b) ; 27.94/12.05 27.94/12.05 instance (Eq a, Eq b) => Eq FiniteMap a b where { 27.94/12.05 (==) fm_1 fm_2 = sizeFM fm_1 == sizeFM fm_2 && fmToList fm_1 == fmToList fm_2; 27.94/12.05 } 27.94/12.05 fmToList :: FiniteMap b a -> [(b,a)]; 27.94/12.05 fmToList fm = foldFM (\key elt rest ->(key,elt) : rest) [] fm; 27.94/12.05 27.94/12.05 fmToList_GE :: Ord a => FiniteMap a b -> a -> [(a,b)]; 27.94/12.05 fmToList_GE fm fr = foldFM_GE (\key elt rest ->(key,elt) : rest) [] fr fm; 27.94/12.05 27.94/12.05 foldFM :: (a -> b -> c -> c) -> c -> FiniteMap a b -> c; 27.94/12.05 foldFM k z EmptyFM = z; 27.94/12.05 foldFM k z (Branch key elt _ fm_l fm_r) = foldFM k (k key elt (foldFM k z fm_r)) fm_l; 27.94/12.05 27.94/12.05 foldFM_GE :: Ord c => (c -> a -> b -> b) -> b -> c -> FiniteMap c a -> b; 27.94/12.05 foldFM_GE k z fr EmptyFM = z; 27.94/12.05 foldFM_GE k z fr (Branch key elt _ fm_l fm_r) | key >= fr = foldFM_GE k (k key elt (foldFM_GE k z fr fm_r)) fr fm_l 27.94/12.05 | otherwise = foldFM_GE k z fr fm_r; 27.94/12.05 27.94/12.05 sizeFM :: FiniteMap a b -> Int; 27.94/12.05 sizeFM EmptyFM = 0; 27.94/12.05 sizeFM (Branch _ _ size _ _) = size; 27.94/12.05 27.94/12.05 }
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Haskell 2019-04-01 06.52