Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Haskell pair #487599571
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
n081.star.cs.uiowa.edu
space
full_haskell
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
17.8219630718 seconds
cpu usage
34.977542214
max memory
4.036337664E9
stage attributes
key
value
output-size
669921
starexec-result
YES
output
/export/starexec/sandbox/solver/bin/starexec_run_standard /export/starexec/sandbox/benchmark/theBenchmark.hs /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES proof of /export/starexec/sandbox/benchmark/theBenchmark.hs # AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty H-Termination with start terms of the given HASKELL could be proven: (0) HASKELL (1) LR [EQUIVALENT, 0 ms] (2) HASKELL (3) CR [EQUIVALENT, 0 ms] (4) HASKELL (5) IFR [EQUIVALENT, 0 ms] (6) HASKELL (7) BR [EQUIVALENT, 12 ms] (8) HASKELL (9) COR [EQUIVALENT, 0 ms] (10) HASKELL (11) LetRed [EQUIVALENT, 24 ms] (12) HASKELL (13) NumRed [SOUND, 0 ms] (14) HASKELL (15) Narrow [SOUND, 0 ms] (16) AND (17) QDP (18) QDPSizeChangeProof [EQUIVALENT, 2 ms] (19) YES (20) QDP (21) QDPSizeChangeProof [EQUIVALENT, 0 ms] (22) YES (23) QDP (24) QDPSizeChangeProof [EQUIVALENT, 0 ms] (25) YES (26) QDP (27) QDPSizeChangeProof [EQUIVALENT, 0 ms] (28) YES (29) QDP (30) TransformationProof [EQUIVALENT, 0 ms] (31) QDP (32) TransformationProof [EQUIVALENT, 0 ms] (33) QDP (34) UsableRulesProof [EQUIVALENT, 0 ms] (35) QDP (36) QReductionProof [EQUIVALENT, 0 ms] (37) QDP (38) QDPOrderProof [EQUIVALENT, 147 ms] (39) QDP (40) DependencyGraphProof [EQUIVALENT, 0 ms] (41) QDP (42) QDPSizeChangeProof [EQUIVALENT, 0 ms] (43) YES (44) QDP (45) TransformationProof [EQUIVALENT, 1076 ms] (46) QDP (47) QDPSizeChangeProof [EQUIVALENT, 0 ms] (48) YES (49) QDP (50) QDPSizeChangeProof [EQUIVALENT, 0 ms] (51) YES (52) QDP (53) QDPSizeChangeProof [EQUIVALENT, 0 ms] (54) YES (55) QDP (56) QDPSizeChangeProof [EQUIVALENT, 0 ms] (57) YES (58) QDP (59) QDPSizeChangeProof [EQUIVALENT, 0 ms] (60) YES ---------------------------------------- (0) Obligation: mainModule Main module FiniteMap where { import qualified Main; import qualified Maybe; import qualified Prelude; data FiniteMap a b = EmptyFM | Branch a b Int (FiniteMap a b) (FiniteMap a b) ; instance (Eq a, Eq b) => Eq FiniteMap a b where { (==) fm_1 fm_2 = sizeFM fm_1 == sizeFM fm_2 && fmToList fm_1 == fmToList fm_2; } fmToList :: FiniteMap b a -> [(b,a)]; fmToList fm = foldFM (\key elt rest ->(key,elt) : rest) [] fm; fmToList_LE :: Ord b => FiniteMap b a -> b -> [(b,a)]; fmToList_LE fm fr = foldFM_LE (\key elt rest ->(key,elt) : rest) [] fr fm; foldFM :: (a -> b -> c -> c) -> c -> FiniteMap a b -> c; foldFM k z EmptyFM = z; foldFM k z (Branch key elt _ fm_l fm_r) = foldFM k (k key elt (foldFM k z fm_r)) fm_l;
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Haskell