details

property	value
status	complete
benchmark	FiniteMap_foldFM_LE_4.hs
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n043.star.cs.uiowa.edu
space	full_haskell

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	7.69216 seconds
cpu usage	41.0504
user time	39.9078
system time	1.14263
max virtual memory	1.8285568E7
max residence set size	1629712.0

stage attributes

key	value
starexec-result	YES

output

16.80/6.67 YES 20.05/7.57 proof of /export/starexec/sandbox/benchmark/theBenchmark.hs 20.05/7.57 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 20.05/7.57 20.05/7.57 20.05/7.57 H-Termination with start terms of the given HASKELL could be proven: 20.05/7.57 20.05/7.57 (0) HASKELL 20.05/7.57 (1) LR [EQUIVALENT, 0 ms] 20.05/7.57 (2) HASKELL 20.05/7.57 (3) CR [EQUIVALENT, 0 ms] 20.05/7.57 (4) HASKELL 20.05/7.57 (5) IFR [EQUIVALENT, 0 ms] 20.05/7.57 (6) HASKELL 20.05/7.57 (7) BR [EQUIVALENT, 0 ms] 20.05/7.57 (8) HASKELL 20.05/7.57 (9) COR [EQUIVALENT, 7 ms] 20.05/7.57 (10) HASKELL 20.05/7.57 (11) LetRed [EQUIVALENT, 0 ms] 20.05/7.57 (12) HASKELL 20.05/7.57 (13) NumRed [SOUND, 15 ms] 20.05/7.57 (14) HASKELL 20.05/7.57 (15) Narrow [SOUND, 0 ms] 20.05/7.57 (16) AND 20.05/7.57 (17) QDP 20.05/7.57 (18) QDPSizeChangeProof [EQUIVALENT, 0 ms] 20.05/7.57 (19) YES 20.05/7.57 (20) QDP 20.05/7.57 (21) DependencyGraphProof [EQUIVALENT, 0 ms] 20.05/7.57 (22) QDP 20.05/7.57 (23) QDPSizeChangeProof [EQUIVALENT, 262 ms] 20.05/7.57 (24) YES 20.05/7.57 (25) QDP 20.05/7.57 (26) QDPSizeChangeProof [EQUIVALENT, 0 ms] 20.05/7.57 (27) YES 20.05/7.57 (28) QDP 20.05/7.57 (29) QDPSizeChangeProof [EQUIVALENT, 0 ms] 20.05/7.57 (30) YES 20.05/7.57 (31) QDP 20.05/7.57 (32) DependencyGraphProof [EQUIVALENT, 1 ms] 20.05/7.57 (33) AND 20.05/7.57 (34) QDP 20.05/7.57 (35) QDPSizeChangeProof [EQUIVALENT, 0 ms] 20.05/7.57 (36) YES 20.05/7.57 (37) QDP 20.05/7.57 (38) QDPSizeChangeProof [EQUIVALENT, 0 ms] 20.05/7.57 (39) YES 20.05/7.57 (40) QDP 20.05/7.57 (41) QDPSizeChangeProof [EQUIVALENT, 0 ms] 20.05/7.57 (42) YES 20.05/7.57 (43) QDP 20.05/7.57 (44) QDPSizeChangeProof [EQUIVALENT, 0 ms] 20.05/7.57 (45) YES 20.05/7.57 20.05/7.57 20.05/7.57 ---------------------------------------- 20.05/7.57 20.05/7.57 (0) 20.05/7.57 Obligation: 20.05/7.57 mainModule Main 20.05/7.57 module FiniteMap where { 20.05/7.57 import qualified Main; 20.05/7.57 import qualified Maybe; 20.05/7.57 import qualified Prelude; 20.05/7.57 data FiniteMap b a = EmptyFM | Branch b a Int (FiniteMap b a) (FiniteMap b a) ; 20.05/7.57 20.05/7.57 instance (Eq a, Eq b) => Eq FiniteMap b a where { 20.05/7.57 (==) fm_1 fm_2 = sizeFM fm_1 == sizeFM fm_2 && fmToList fm_1 == fmToList fm_2; 20.05/7.57 } 20.05/7.57 fmToList :: FiniteMap b a -> [(b,a)]; 20.05/7.57 fmToList fm = foldFM (\key elt rest ->(key,elt) : rest) [] fm; 20.05/7.57 20.05/7.57 foldFM :: (a -> c -> b -> b) -> b -> FiniteMap a c -> b; 20.05/7.57 foldFM k z EmptyFM = z; 20.05/7.57 foldFM k z (Branch key elt _ fm_l fm_r) = foldFM k (k key elt (foldFM k z fm_r)) fm_l; 20.05/7.57 20.05/7.57 foldFM_LE :: Ord a => (a -> b -> c -> c) -> c -> a -> FiniteMap a b -> c; 20.05/7.57 foldFM_LE k z fr EmptyFM = z; 20.05/7.57 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 20.05/7.57 | otherwise = foldFM_LE k z fr fm_l; 20.05/7.57 20.05/7.57 sizeFM :: FiniteMap a b -> Int; 20.05/7.57 sizeFM EmptyFM = 0; 20.05/7.57 sizeFM (Branch _ _ size _ _) = size; 20.05/7.57 20.05/7.57 } 20.05/7.57 module Maybe where { 20.05/7.57 import qualified FiniteMap; 20.05/7.57 import qualified Main; 20.05/7.57 import qualified Prelude; 20.05/7.57 } 20.05/7.57 module Main where { 20.05/7.57 import qualified FiniteMap; 20.05/7.57 import qualified Maybe; 20.05/7.57 import qualified Prelude; 20.05/7.57 } 20.05/7.57 20.05/7.57 ---------------------------------------- 20.05/7.57 20.05/7.57 (1) LR (EQUIVALENT) popout

output may be truncated. 'popout' for the full output.

job log

popout

actions

all output return to Haskell 2019-04-01 06.52