details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	22.2546 seconds
cpu usage	40.4271
user time	39.1736
system time	1.25351
max virtual memory	1.8288076E7
max residence set size	3965356.0

stage attributes

key	value
starexec-result	YES

output

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

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

job log

popout

actions

all output return to Haskell 2019-04-01 06.52