Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Haskell 2019-04-01 06.52 pair #433315948
details
property
value
status
complete
benchmark
FiniteMap_foldFM_LE_5.hs
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n148.star.cs.uiowa.edu
space
full_haskell
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
9.10428 seconds
cpu usage
13.7724
user time
13.4225
system time
0.349906
max virtual memory
1.8285568E7
max residence set size
739868.0
stage attributes
key
value
starexec-result
YES
output
11.82/4.90 YES 13.62/5.43 proof of /export/starexec/sandbox/benchmark/theBenchmark.hs 13.62/5.43 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 13.62/5.43 13.62/5.43 13.62/5.43 H-Termination with start terms of the given HASKELL could be proven: 13.62/5.43 13.62/5.43 (0) HASKELL 13.62/5.43 (1) BR [EQUIVALENT, 0 ms] 13.62/5.43 (2) HASKELL 13.62/5.43 (3) COR [EQUIVALENT, 0 ms] 13.62/5.43 (4) HASKELL 13.62/5.43 (5) Narrow [SOUND, 0 ms] 13.62/5.43 (6) QDP 13.62/5.43 (7) DependencyGraphProof [EQUIVALENT, 0 ms] 13.62/5.43 (8) AND 13.62/5.43 (9) QDP 13.62/5.43 (10) QDPSizeChangeProof [EQUIVALENT, 12 ms] 13.62/5.43 (11) YES 13.62/5.43 (12) QDP 13.62/5.43 (13) QDPSizeChangeProof [EQUIVALENT, 0 ms] 13.62/5.43 (14) YES 13.62/5.43 13.62/5.43 13.62/5.43 ---------------------------------------- 13.62/5.43 13.62/5.43 (0) 13.62/5.43 Obligation: 13.62/5.43 mainModule Main 13.62/5.43 module FiniteMap where { 13.62/5.43 import qualified Main; 13.62/5.43 import qualified Maybe; 13.62/5.43 import qualified Prelude; 13.62/5.43 data FiniteMap a b = EmptyFM | Branch a b Int (FiniteMap a b) (FiniteMap a b) ; 13.62/5.43 13.62/5.43 instance (Eq a, Eq b) => Eq FiniteMap a b where { 13.62/5.43 } 13.62/5.43 foldFM_LE :: Ord c => (c -> b -> a -> a) -> a -> c -> FiniteMap c b -> a; 13.62/5.43 foldFM_LE k z fr EmptyFM = z; 13.62/5.43 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 13.62/5.43 | otherwise = foldFM_LE k z fr fm_l; 13.62/5.43 13.62/5.43 } 13.62/5.43 module Maybe where { 13.62/5.43 import qualified FiniteMap; 13.62/5.43 import qualified Main; 13.62/5.43 import qualified Prelude; 13.62/5.43 } 13.62/5.43 module Main where { 13.62/5.43 import qualified FiniteMap; 13.62/5.43 import qualified Maybe; 13.62/5.43 import qualified Prelude; 13.62/5.43 } 13.62/5.43 13.62/5.43 ---------------------------------------- 13.62/5.43 13.62/5.43 (1) BR (EQUIVALENT) 13.62/5.43 Replaced joker patterns by fresh variables and removed binding patterns. 13.62/5.43 ---------------------------------------- 13.62/5.43 13.62/5.43 (2) 13.62/5.43 Obligation: 13.62/5.43 mainModule Main 13.62/5.43 module FiniteMap where { 13.62/5.43 import qualified Main; 13.62/5.43 import qualified Maybe; 13.62/5.43 import qualified Prelude; 13.62/5.43 data FiniteMap b a = EmptyFM | Branch b a Int (FiniteMap b a) (FiniteMap b a) ; 13.62/5.43 13.62/5.43 instance (Eq a, Eq b) => Eq FiniteMap b a where { 13.62/5.43 } 13.62/5.43 foldFM_LE :: Ord b => (b -> c -> a -> a) -> a -> b -> FiniteMap b c -> a; 13.62/5.43 foldFM_LE k z fr EmptyFM = z; 13.62/5.43 foldFM_LE k z fr (Branch key elt vy fm_l fm_r) | key <= fr = foldFM_LE k (k key elt (foldFM_LE k z fr fm_l)) fr fm_r 13.62/5.43 | otherwise = foldFM_LE k z fr fm_l; 13.62/5.43 13.62/5.43 } 13.62/5.43 module Maybe where { 13.62/5.43 import qualified FiniteMap; 13.62/5.43 import qualified Main; 13.62/5.43 import qualified Prelude; 13.62/5.43 } 13.62/5.43 module Main where { 13.62/5.43 import qualified FiniteMap; 13.62/5.43 import qualified Maybe; 13.62/5.43 import qualified Prelude; 13.62/5.43 } 13.62/5.43 13.62/5.43 ---------------------------------------- 13.62/5.43 13.62/5.43 (3) COR (EQUIVALENT) 13.62/5.43 Cond Reductions: 13.62/5.43 The following Function with conditions 13.62/5.43 "undefined |Falseundefined; 13.62/5.43 " 13.62/5.43 is transformed to 13.62/5.43 "undefined = undefined1; 13.62/5.43 " 13.62/5.43 "undefined0 True = undefined; 13.62/5.43 "
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Haskell 2019-04-01 06.52