Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Haskell 2019-04-01 06.52 pair #433316032
details
property
value
status
complete
benchmark
FiniteMap_lookupFM_2.hs
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n150.star.cs.uiowa.edu
space
full_haskell
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
6.58094 seconds
cpu usage
11.501
user time
11.171
system time
0.330032
max virtual memory
1.828352E7
max residence set size
720128.0
stage attributes
key
value
starexec-result
YES
output
9.68/4.43 YES 11.42/4.90 proof of /export/starexec/sandbox2/benchmark/theBenchmark.hs 11.42/4.90 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 11.42/4.90 11.42/4.90 11.42/4.90 H-Termination with start terms of the given HASKELL could be proven: 11.42/4.90 11.42/4.90 (0) HASKELL 11.42/4.90 (1) BR [EQUIVALENT, 0 ms] 11.42/4.90 (2) HASKELL 11.42/4.90 (3) COR [EQUIVALENT, 0 ms] 11.42/4.90 (4) HASKELL 11.42/4.90 (5) Narrow [EQUIVALENT, 0 ms] 11.42/4.90 (6) YES 11.42/4.90 11.42/4.90 11.42/4.90 ---------------------------------------- 11.42/4.90 11.42/4.90 (0) 11.42/4.90 Obligation: 11.42/4.90 mainModule Main 11.42/4.90 module FiniteMap where { 11.42/4.90 import qualified Main; 11.42/4.90 import qualified Maybe; 11.42/4.90 import qualified Prelude; 11.42/4.90 data FiniteMap b a = EmptyFM | Branch b a Int (FiniteMap b a) (FiniteMap b a) ; 11.42/4.90 11.42/4.90 instance (Eq a, Eq b) => Eq FiniteMap a b where { 11.42/4.90 } 11.42/4.90 lookupFM :: Ord a => FiniteMap a b -> a -> Maybe b; 11.42/4.90 lookupFM EmptyFM key = Nothing; 11.42/4.90 lookupFM (Branch key elt _ fm_l fm_r) key_to_find | key_to_find < key = lookupFM fm_l key_to_find 11.42/4.90 | key_to_find > key = lookupFM fm_r key_to_find 11.42/4.90 | otherwise = Just elt; 11.42/4.90 11.42/4.90 } 11.42/4.90 module Maybe where { 11.42/4.90 import qualified FiniteMap; 11.42/4.90 import qualified Main; 11.42/4.90 import qualified Prelude; 11.42/4.90 } 11.42/4.90 module Main where { 11.42/4.90 import qualified FiniteMap; 11.42/4.90 import qualified Maybe; 11.42/4.90 import qualified Prelude; 11.42/4.90 } 11.42/4.90 11.42/4.90 ---------------------------------------- 11.42/4.90 11.42/4.90 (1) BR (EQUIVALENT) 11.42/4.90 Replaced joker patterns by fresh variables and removed binding patterns. 11.42/4.90 ---------------------------------------- 11.42/4.90 11.42/4.90 (2) 11.42/4.90 Obligation: 11.42/4.90 mainModule Main 11.42/4.90 module FiniteMap where { 11.42/4.90 import qualified Main; 11.42/4.90 import qualified Maybe; 11.42/4.90 import qualified Prelude; 11.42/4.90 data FiniteMap b a = EmptyFM | Branch b a Int (FiniteMap b a) (FiniteMap b a) ; 11.42/4.90 11.42/4.90 instance (Eq a, Eq b) => Eq FiniteMap b a where { 11.42/4.90 } 11.42/4.90 lookupFM :: Ord a => FiniteMap a b -> a -> Maybe b; 11.42/4.90 lookupFM EmptyFM key = Nothing; 11.42/4.90 lookupFM (Branch key elt vy fm_l fm_r) key_to_find | key_to_find < key = lookupFM fm_l key_to_find 11.42/4.90 | key_to_find > key = lookupFM fm_r key_to_find 11.42/4.90 | otherwise = Just elt; 11.42/4.90 11.42/4.90 } 11.42/4.90 module Maybe where { 11.42/4.90 import qualified FiniteMap; 11.42/4.90 import qualified Main; 11.42/4.90 import qualified Prelude; 11.42/4.90 } 11.42/4.90 module Main where { 11.42/4.90 import qualified FiniteMap; 11.42/4.90 import qualified Maybe; 11.42/4.90 import qualified Prelude; 11.42/4.90 } 11.42/4.90 11.42/4.90 ---------------------------------------- 11.42/4.90 11.42/4.90 (3) COR (EQUIVALENT) 11.42/4.90 Cond Reductions: 11.42/4.90 The following Function with conditions 11.42/4.90 "undefined |Falseundefined; 11.42/4.90 " 11.42/4.90 is transformed to 11.42/4.90 "undefined = undefined1; 11.42/4.90 " 11.42/4.90 "undefined0 True = undefined; 11.42/4.90 " 11.42/4.90 "undefined1 = undefined0 False; 11.42/4.90 " 11.42/4.90 The following Function with conditions 11.42/4.90 "lookupFM EmptyFM key = Nothing; 11.42/4.90 lookupFM (Branch key elt vy fm_l fm_r) key_to_find|key_to_find < keylookupFM fm_l key_to_find|key_to_find > keylookupFM fm_r key_to_find|otherwiseJust elt; 11.42/4.90 "
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Haskell 2019-04-01 06.52