Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Haskell 2019-04-01 06.52 pair #433316304
details
property
value
status
complete
benchmark
FiniteMap_fmToList_LE_8.hs
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n077.star.cs.uiowa.edu
space
full_haskell
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
5.30842 seconds
cpu usage
12.6273
user time
12.2316
system time
0.395705
max virtual memory
1.8291144E7
max residence set size
766788.0
stage attributes
key
value
starexec-result
YES
output
10.25/4.58 YES 12.31/5.16 proof of /export/starexec/sandbox/benchmark/theBenchmark.hs 12.31/5.16 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 12.31/5.16 12.31/5.16 12.31/5.16 H-Termination with start terms of the given HASKELL could be proven: 12.31/5.16 12.31/5.16 (0) HASKELL 12.31/5.16 (1) LR [EQUIVALENT, 0 ms] 12.31/5.16 (2) HASKELL 12.31/5.16 (3) BR [EQUIVALENT, 0 ms] 12.31/5.16 (4) HASKELL 12.31/5.16 (5) COR [EQUIVALENT, 0 ms] 12.31/5.16 (6) HASKELL 12.31/5.16 (7) Narrow [SOUND, 0 ms] 12.31/5.16 (8) AND 12.31/5.16 (9) QDP 12.31/5.16 (10) DependencyGraphProof [EQUIVALENT, 0 ms] 12.31/5.16 (11) AND 12.31/5.16 (12) QDP 12.31/5.16 (13) QDPSizeChangeProof [EQUIVALENT, 0 ms] 12.31/5.16 (14) YES 12.31/5.16 (15) QDP 12.31/5.16 (16) QDPSizeChangeProof [EQUIVALENT, 0 ms] 12.31/5.16 (17) YES 12.31/5.16 (18) QDP 12.31/5.16 (19) TransformationProof [EQUIVALENT, 0 ms] 12.31/5.16 (20) QDP 12.31/5.16 (21) TransformationProof [EQUIVALENT, 0 ms] 12.31/5.16 (22) QDP 12.31/5.16 (23) QDPSizeChangeProof [EQUIVALENT, 0 ms] 12.31/5.16 (24) YES 12.31/5.16 (25) QDP 12.31/5.16 (26) TransformationProof [EQUIVALENT, 0 ms] 12.31/5.16 (27) QDP 12.31/5.16 (28) QDPSizeChangeProof [EQUIVALENT, 0 ms] 12.31/5.16 (29) YES 12.31/5.16 12.31/5.16 12.31/5.16 ---------------------------------------- 12.31/5.16 12.31/5.16 (0) 12.31/5.16 Obligation: 12.31/5.16 mainModule Main 12.31/5.16 module FiniteMap where { 12.31/5.16 import qualified Main; 12.31/5.16 import qualified Maybe; 12.31/5.16 import qualified Prelude; 12.31/5.16 data FiniteMap a b = EmptyFM | Branch a b Int (FiniteMap a b) (FiniteMap a b) ; 12.31/5.16 12.31/5.16 fmToList_LE :: Ord a => FiniteMap a b -> a -> [(a,b)]; 12.31/5.16 fmToList_LE fm fr = foldFM_LE (\key elt rest ->(key,elt) : rest) [] fr fm; 12.31/5.16 12.31/5.16 foldFM_LE :: Ord b => (b -> c -> a -> a) -> a -> b -> FiniteMap b c -> a; 12.31/5.16 foldFM_LE k z fr EmptyFM = z; 12.31/5.16 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 12.31/5.16 | otherwise = foldFM_LE k z fr fm_l; 12.31/5.16 12.31/5.16 } 12.31/5.16 module Maybe where { 12.31/5.16 import qualified FiniteMap; 12.31/5.16 import qualified Main; 12.31/5.16 import qualified Prelude; 12.31/5.16 } 12.31/5.16 module Main where { 12.31/5.16 import qualified FiniteMap; 12.31/5.16 import qualified Maybe; 12.31/5.16 import qualified Prelude; 12.31/5.16 } 12.31/5.16 12.31/5.16 ---------------------------------------- 12.31/5.16 12.31/5.16 (1) LR (EQUIVALENT) 12.31/5.16 Lambda Reductions: 12.31/5.16 The following Lambda expression 12.31/5.16 "\keyeltrest->(key,elt) : rest" 12.31/5.16 is transformed to 12.31/5.16 "fmToList_LE0 key elt rest = (key,elt) : rest; 12.31/5.16 " 12.31/5.16 12.31/5.16 ---------------------------------------- 12.31/5.16 12.31/5.16 (2) 12.31/5.16 Obligation: 12.31/5.16 mainModule Main 12.31/5.16 module FiniteMap where { 12.31/5.16 import qualified Main; 12.31/5.16 import qualified Maybe; 12.31/5.16 import qualified Prelude; 12.31/5.16 data FiniteMap b a = EmptyFM | Branch b a Int (FiniteMap b a) (FiniteMap b a) ; 12.31/5.16 12.31/5.16 fmToList_LE :: Ord b => FiniteMap b a -> b -> [(b,a)]; 12.31/5.16 fmToList_LE fm fr = foldFM_LE fmToList_LE0 [] fr fm; 12.31/5.16 12.31/5.16 fmToList_LE0 key elt rest = (key,elt) : rest; 12.31/5.16 12.31/5.16 foldFM_LE :: Ord a => (a -> c -> b -> b) -> b -> a -> FiniteMap a c -> b; 12.31/5.16 foldFM_LE k z fr EmptyFM = z; 12.31/5.16 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 12.31/5.16 | otherwise = foldFM_LE k z fr fm_l;
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Haskell 2019-04-01 06.52