details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	22.3379 seconds
cpu usage	39.3282
user time	38.0849
system time	1.24337
max virtual memory	1.8288076E7
max residence set size	3962364.0

stage attributes

key	value
starexec-result	YES

output

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

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

job log

popout

actions

all output return to Haskell 2019-04-01 06.52