Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Haskell 2019-04-01 06.52 pair #433316234
details
property
value
status
complete
benchmark
FiniteMap_elemFM_10.hs
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n141.star.cs.uiowa.edu
space
full_haskell
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
10.2631 seconds
cpu usage
25.7342
user time
24.6764
system time
1.05778
max virtual memory
1.8285568E7
max residence set size
3368964.0
stage attributes
key
value
starexec-result
YES
output
21.68/8.52 YES 25.41/10.14 proof of /export/starexec/sandbox/benchmark/theBenchmark.hs 25.41/10.14 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 25.41/10.14 25.41/10.14 25.41/10.14 H-Termination with start terms of the given HASKELL could be proven: 25.41/10.14 25.41/10.14 (0) HASKELL 25.41/10.14 (1) LR [EQUIVALENT, 0 ms] 25.41/10.14 (2) HASKELL 25.41/10.14 (3) CR [EQUIVALENT, 0 ms] 25.41/10.14 (4) HASKELL 25.41/10.14 (5) IFR [EQUIVALENT, 0 ms] 25.41/10.14 (6) HASKELL 25.41/10.14 (7) BR [EQUIVALENT, 0 ms] 25.41/10.14 (8) HASKELL 25.41/10.14 (9) COR [EQUIVALENT, 5 ms] 25.41/10.14 (10) HASKELL 25.41/10.14 (11) LetRed [EQUIVALENT, 0 ms] 25.41/10.14 (12) HASKELL 25.41/10.14 (13) NumRed [SOUND, 15 ms] 25.41/10.14 (14) HASKELL 25.41/10.14 (15) Narrow [SOUND, 0 ms] 25.41/10.14 (16) AND 25.41/10.14 (17) QDP 25.41/10.14 (18) QDPSizeChangeProof [EQUIVALENT, 0 ms] 25.41/10.14 (19) YES 25.41/10.14 (20) QDP 25.41/10.14 (21) QDPSizeChangeProof [EQUIVALENT, 120 ms] 25.41/10.14 (22) YES 25.41/10.14 (23) QDP 25.41/10.14 (24) QDPSizeChangeProof [EQUIVALENT, 0 ms] 25.41/10.14 (25) YES 25.41/10.14 (26) QDP 25.41/10.14 (27) DependencyGraphProof [EQUIVALENT, 0 ms] 25.41/10.14 (28) AND 25.41/10.14 (29) QDP 25.41/10.14 (30) QDPSizeChangeProof [EQUIVALENT, 0 ms] 25.41/10.14 (31) YES 25.41/10.14 (32) QDP 25.41/10.14 (33) QDPSizeChangeProof [EQUIVALENT, 0 ms] 25.41/10.14 (34) YES 25.41/10.14 (35) QDP 25.41/10.14 (36) QDPSizeChangeProof [EQUIVALENT, 0 ms] 25.41/10.14 (37) YES 25.41/10.14 (38) QDP 25.41/10.14 (39) QDPSizeChangeProof [EQUIVALENT, 0 ms] 25.41/10.14 (40) YES 25.41/10.14 (41) QDP 25.41/10.14 (42) QDPSizeChangeProof [EQUIVALENT, 0 ms] 25.41/10.14 (43) YES 25.41/10.14 25.41/10.14 25.41/10.14 ---------------------------------------- 25.41/10.14 25.41/10.14 (0) 25.41/10.14 Obligation: 25.41/10.14 mainModule Main 25.41/10.14 module FiniteMap where { 25.41/10.14 import qualified Main; 25.41/10.14 import qualified Maybe; 25.41/10.14 import qualified Prelude; 25.41/10.14 data FiniteMap b a = EmptyFM | Branch b a Int (FiniteMap b a) (FiniteMap b a) ; 25.41/10.14 25.41/10.14 instance (Eq a, Eq b) => Eq FiniteMap a b where { 25.41/10.14 (==) fm_1 fm_2 = sizeFM fm_1 == sizeFM fm_2 && fmToList fm_1 == fmToList fm_2; 25.41/10.14 } 25.41/10.14 elemFM :: Ord a => a -> FiniteMap a b -> Bool; 25.41/10.14 elemFM key fm = case lookupFM fm key of { 25.41/10.14 Nothing-> False; 25.41/10.14 Just elt-> True; 25.41/10.14 } ; 25.41/10.14 25.41/10.14 fmToList :: FiniteMap a b -> [(a,b)]; 25.41/10.14 fmToList fm = foldFM (\key elt rest ->(key,elt) : rest) [] fm; 25.41/10.14 25.41/10.14 foldFM :: (b -> a -> c -> c) -> c -> FiniteMap b a -> c; 25.41/10.14 foldFM k z EmptyFM = z; 25.41/10.14 foldFM k z (Branch key elt _ fm_l fm_r) = foldFM k (k key elt (foldFM k z fm_r)) fm_l; 25.41/10.14 25.41/10.14 lookupFM :: Ord b => FiniteMap b a -> b -> Maybe a; 25.41/10.14 lookupFM EmptyFM key = Nothing; 25.41/10.14 lookupFM (Branch key elt _ fm_l fm_r) key_to_find | key_to_find < key = lookupFM fm_l key_to_find 25.41/10.14 | key_to_find > key = lookupFM fm_r key_to_find 25.41/10.14 | otherwise = Just elt; 25.41/10.14 25.41/10.14 sizeFM :: FiniteMap b a -> Int; 25.41/10.14 sizeFM EmptyFM = 0; 25.41/10.14 sizeFM (Branch _ _ size _ _) = size; 25.41/10.14 25.41/10.14 } 25.41/10.14 module Maybe where { 25.41/10.14 import qualified FiniteMap; 25.41/10.14 import qualified Main; 25.41/10.14 import qualified Prelude; 25.41/10.14 } 25.41/10.14 module Main where { 25.41/10.14 import qualified FiniteMap; 25.41/10.14 import qualified Maybe; 25.41/10.14 import qualified Prelude;
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Haskell 2019-04-01 06.52