Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Haskell 2019-04-01 06.52 pair #433316290
details
property
value
status
complete
benchmark
FiniteMap_lookupFM_5.hs
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n165.star.cs.uiowa.edu
space
full_haskell
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
9.0755 seconds
cpu usage
13.6217
user time
13.1914
system time
0.430281
max virtual memory
1.8285568E7
max residence set size
841392.0
stage attributes
key
value
starexec-result
YES
output
11.96/5.12 YES 13.43/5.61 proof of /export/starexec/sandbox/benchmark/theBenchmark.hs 13.43/5.61 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 13.43/5.61 13.43/5.61 13.43/5.61 H-Termination with start terms of the given HASKELL could be proven: 13.43/5.61 13.43/5.61 (0) HASKELL 13.43/5.61 (1) BR [EQUIVALENT, 0 ms] 13.43/5.61 (2) HASKELL 13.43/5.61 (3) COR [EQUIVALENT, 0 ms] 13.43/5.61 (4) HASKELL 13.43/5.61 (5) Narrow [SOUND, 0 ms] 13.43/5.61 (6) QDP 13.43/5.61 (7) DependencyGraphProof [EQUIVALENT, 0 ms] 13.43/5.61 (8) AND 13.43/5.61 (9) QDP 13.43/5.61 (10) QDPSizeChangeProof [EQUIVALENT, 0 ms] 13.43/5.61 (11) YES 13.43/5.61 (12) QDP 13.43/5.61 (13) QDPSizeChangeProof [EQUIVALENT, 0 ms] 13.43/5.61 (14) YES 13.43/5.61 (15) QDP 13.43/5.61 (16) QDPSizeChangeProof [EQUIVALENT, 0 ms] 13.43/5.61 (17) YES 13.43/5.61 (18) QDP 13.43/5.61 (19) QDPSizeChangeProof [EQUIVALENT, 0 ms] 13.43/5.61 (20) YES 13.43/5.61 13.43/5.61 13.43/5.61 ---------------------------------------- 13.43/5.61 13.43/5.61 (0) 13.43/5.61 Obligation: 13.43/5.61 mainModule Main 13.43/5.61 module FiniteMap where { 13.43/5.61 import qualified Main; 13.43/5.61 import qualified Maybe; 13.43/5.61 import qualified Prelude; 13.43/5.61 data FiniteMap b a = EmptyFM | Branch b a Int (FiniteMap b a) (FiniteMap b a) ; 13.43/5.61 13.43/5.61 instance (Eq a, Eq b) => Eq FiniteMap b a where { 13.43/5.61 } 13.43/5.61 lookupFM :: Ord b => FiniteMap b a -> b -> Maybe a; 13.43/5.61 lookupFM EmptyFM key = Nothing; 13.43/5.61 lookupFM (Branch key elt _ fm_l fm_r) key_to_find | key_to_find < key = lookupFM fm_l key_to_find 13.43/5.61 | key_to_find > key = lookupFM fm_r key_to_find 13.43/5.61 | otherwise = Just elt; 13.43/5.61 13.43/5.61 } 13.43/5.61 module Maybe where { 13.43/5.61 import qualified FiniteMap; 13.43/5.61 import qualified Main; 13.43/5.61 import qualified Prelude; 13.43/5.61 } 13.43/5.61 module Main where { 13.43/5.61 import qualified FiniteMap; 13.43/5.61 import qualified Maybe; 13.43/5.61 import qualified Prelude; 13.43/5.61 } 13.43/5.61 13.43/5.61 ---------------------------------------- 13.43/5.61 13.43/5.61 (1) BR (EQUIVALENT) 13.43/5.61 Replaced joker patterns by fresh variables and removed binding patterns. 13.43/5.61 ---------------------------------------- 13.43/5.61 13.43/5.61 (2) 13.43/5.61 Obligation: 13.43/5.61 mainModule Main 13.43/5.61 module FiniteMap where { 13.43/5.61 import qualified Main; 13.43/5.61 import qualified Maybe; 13.43/5.61 import qualified Prelude; 13.43/5.61 data FiniteMap b a = EmptyFM | Branch b a Int (FiniteMap b a) (FiniteMap b a) ; 13.43/5.61 13.43/5.61 instance (Eq a, Eq b) => Eq FiniteMap b a where { 13.43/5.61 } 13.43/5.61 lookupFM :: Ord b => FiniteMap b a -> b -> Maybe a; 13.43/5.61 lookupFM EmptyFM key = Nothing; 13.43/5.61 lookupFM (Branch key elt vy fm_l fm_r) key_to_find | key_to_find < key = lookupFM fm_l key_to_find 13.43/5.61 | key_to_find > key = lookupFM fm_r key_to_find 13.43/5.61 | otherwise = Just elt; 13.43/5.61 13.43/5.61 } 13.43/5.61 module Maybe where { 13.43/5.61 import qualified FiniteMap; 13.43/5.61 import qualified Main; 13.43/5.61 import qualified Prelude; 13.43/5.61 } 13.43/5.61 module Main where { 13.43/5.61 import qualified FiniteMap; 13.43/5.61 import qualified Maybe; 13.43/5.61 import qualified Prelude; 13.43/5.61 } 13.43/5.61 13.43/5.61 ---------------------------------------- 13.43/5.61 13.43/5.61 (3) COR (EQUIVALENT) 13.43/5.61 Cond 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