details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	17.5773 seconds
cpu usage	34.416
user time	33.189
system time	1.22707
max virtual memory	1.8353612E7
max residence set size	3956572.0

stage attributes

key	value
starexec-result	YES

output

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

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

job log

popout

actions

all output return to Haskell 2019-04-01 06.52