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