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