Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Haskell 2019-04-01 06.52 pair #433316784
details
property
value
status
complete
benchmark
FiniteMap_fmToList_LE_9.hs
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n084.star.cs.uiowa.edu
space
full_haskell
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
22.5673 seconds
cpu usage
39.7369
user time
38.5103
system time
1.22664
max virtual memory
1.8288076E7
max residence set size
3951684.0
stage attributes
key
value
starexec-result
YES
output
36.30/21.61 YES 39.28/22.42 proof of /export/starexec/sandbox/benchmark/theBenchmark.hs 39.28/22.42 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 39.28/22.42 39.28/22.42 39.28/22.42 H-Termination with start terms of the given HASKELL could be proven: 39.28/22.42 39.28/22.42 (0) HASKELL 39.28/22.42 (1) LR [EQUIVALENT, 0 ms] 39.28/22.42 (2) HASKELL 39.28/22.42 (3) CR [EQUIVALENT, 0 ms] 39.28/22.42 (4) HASKELL 39.28/22.42 (5) IFR [EQUIVALENT, 0 ms] 39.28/22.42 (6) HASKELL 39.28/22.42 (7) BR [EQUIVALENT, 12 ms] 39.28/22.42 (8) HASKELL 39.28/22.42 (9) COR [EQUIVALENT, 0 ms] 39.28/22.42 (10) HASKELL 39.28/22.42 (11) LetRed [EQUIVALENT, 23 ms] 39.28/22.42 (12) HASKELL 39.28/22.42 (13) NumRed [SOUND, 0 ms] 39.28/22.42 (14) HASKELL 39.28/22.42 (15) Narrow [SOUND, 0 ms] 39.28/22.42 (16) AND 39.28/22.42 (17) QDP 39.28/22.42 (18) QDPSizeChangeProof [EQUIVALENT, 0 ms] 39.28/22.42 (19) YES 39.28/22.42 (20) QDP 39.28/22.42 (21) QDPSizeChangeProof [EQUIVALENT, 0 ms] 39.28/22.42 (22) YES 39.28/22.42 (23) QDP 39.28/22.42 (24) QDPSizeChangeProof [EQUIVALENT, 0 ms] 39.28/22.42 (25) YES 39.28/22.42 (26) QDP 39.28/22.42 (27) QDPSizeChangeProof [EQUIVALENT, 0 ms] 39.28/22.42 (28) YES 39.28/22.42 (29) QDP 39.28/22.42 (30) TransformationProof [EQUIVALENT, 1524 ms] 39.28/22.42 (31) QDP 39.28/22.42 (32) QDPSizeChangeProof [EQUIVALENT, 0 ms] 39.28/22.42 (33) YES 39.28/22.42 (34) QDP 39.28/22.42 (35) QDPSizeChangeProof [EQUIVALENT, 0 ms] 39.28/22.42 (36) YES 39.28/22.42 (37) QDP 39.28/22.42 (38) QDPSizeChangeProof [EQUIVALENT, 0 ms] 39.28/22.42 (39) YES 39.28/22.42 (40) QDP 39.28/22.42 (41) TransformationProof [EQUIVALENT, 0 ms] 39.28/22.42 (42) QDP 39.28/22.42 (43) TransformationProof [EQUIVALENT, 0 ms] 39.28/22.42 (44) QDP 39.28/22.42 (45) UsableRulesProof [EQUIVALENT, 0 ms] 39.28/22.42 (46) QDP 39.28/22.42 (47) QReductionProof [EQUIVALENT, 2 ms] 39.28/22.42 (48) QDP 39.28/22.42 (49) QDPOrderProof [EQUIVALENT, 147 ms] 39.28/22.42 (50) QDP 39.28/22.42 (51) DependencyGraphProof [EQUIVALENT, 0 ms] 39.28/22.42 (52) QDP 39.28/22.42 (53) QDPSizeChangeProof [EQUIVALENT, 0 ms] 39.28/22.42 (54) YES 39.28/22.42 (55) QDP 39.28/22.42 (56) QDPSizeChangeProof [EQUIVALENT, 0 ms] 39.28/22.42 (57) YES 39.28/22.42 (58) QDP 39.28/22.42 (59) QDPSizeChangeProof [EQUIVALENT, 0 ms] 39.28/22.42 (60) YES 39.28/22.42 39.28/22.42 39.28/22.42 ---------------------------------------- 39.28/22.42 39.28/22.42 (0) 39.28/22.42 Obligation: 39.28/22.42 mainModule Main 39.28/22.42 module FiniteMap where { 39.28/22.42 import qualified Main; 39.28/22.42 import qualified Maybe; 39.28/22.42 import qualified Prelude; 39.28/22.42 data FiniteMap a b = EmptyFM | Branch a b Int (FiniteMap a b) (FiniteMap a b) ; 39.28/22.42 39.28/22.42 instance (Eq a, Eq b) => Eq FiniteMap a b where { 39.28/22.42 (==) fm_1 fm_2 = sizeFM fm_1 == sizeFM fm_2 && fmToList fm_1 == fmToList fm_2; 39.28/22.42 } 39.28/22.42 fmToList :: FiniteMap b a -> [(b,a)]; 39.28/22.42 fmToList fm = foldFM (\key elt rest ->(key,elt) : rest) [] fm; 39.28/22.42 39.28/22.42 fmToList_LE :: Ord a => FiniteMap a b -> a -> [(a,b)]; 39.28/22.42 fmToList_LE fm fr = foldFM_LE (\key elt rest ->(key,elt) : rest) [] fr fm; 39.28/22.42 39.28/22.42 foldFM :: (c -> a -> b -> b) -> b -> FiniteMap c a -> b; 39.28/22.42 foldFM k z EmptyFM = z; 39.28/22.42 foldFM k z (Branch key elt _ fm_l fm_r) = foldFM k (k key elt (foldFM k z fm_r)) fm_l; 39.28/22.42 39.28/22.42 foldFM_LE :: Ord c => (c -> a -> b -> b) -> b -> c -> FiniteMap c a -> b; 39.28/22.42 foldFM_LE k z fr EmptyFM = z; 39.28/22.42 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 39.28/22.42 | otherwise = foldFM_LE k z fr fm_l; 39.28/22.42 39.28/22.42 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