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