Haskell pair #487599531

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	21.2245059013 seconds
cpu usage	42.744940926
max memory	4.059090944E9

stage attributes

key	value
output-size	1188728
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, 0 ms]
(8) HASKELL
(9) COR [EQUIVALENT, 0 ms]
(10) HASKELL
(11) LetRed [EQUIVALENT, 51 ms]
(12) HASKELL
(13) NumRed [SOUND, 0 ms]
(14) HASKELL
(15) Narrow [SOUND, 0 ms]
(16) AND
    (17) QDP
        (18) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (19) YES
    (20) QDP
        (21) QDPOrderProof [EQUIVALENT, 114 ms]
        (22) QDP
        (23) DependencyGraphProof [EQUIVALENT, 0 ms]
        (24) AND
            (25) QDP
                (26) QDPSizeChangeProof [EQUIVALENT, 0 ms]
                (27) YES
            (28) QDP
                (29) QDPSizeChangeProof [EQUIVALENT, 0 ms]
                (30) YES
    (31) QDP
        (32) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (33) YES
    (34) QDP
        (35) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (36) YES
    (37) QDP
        (38) TransformationProof [EQUIVALENT, 0 ms]
        (39) QDP
        (40) TransformationProof [EQUIVALENT, 0 ms]
        (41) QDP
        (42) UsableRulesProof [EQUIVALENT, 0 ms]
        (43) QDP
        (44) QReductionProof [EQUIVALENT, 0 ms]
        (45) QDP
        (46) TransformationProof [EQUIVALENT, 0 ms]
        (47) QDP
        (48) TransformationProof [EQUIVALENT, 0 ms]
        (49) QDP
        (50) UsableRulesProof [EQUIVALENT, 0 ms]
        (51) QDP
        (52) QReductionProof [EQUIVALENT, 0 ms]
        (53) QDP
        (54) TransformationProof [EQUIVALENT, 0 ms]
        (55) QDP
        (56) TransformationProof [EQUIVALENT, 0 ms]
        (57) QDP
        (58) TransformationProof [EQUIVALENT, 0 ms]
        (59) QDP
        (60) TransformationProof [EQUIVALENT, 0 ms]
        (61) QDP
        (62) TransformationProof [EQUIVALENT, 0 ms]
        (63) QDP
        (64) UsableRulesProof [EQUIVALENT, 0 ms]
        (65) QDP
        (66) QReductionProof [EQUIVALENT, 0 ms]
        (67) QDP
        (68) TransformationProof [EQUIVALENT, 0 ms]
        (69) QDP
        (70) UsableRulesProof [EQUIVALENT, 0 ms]
        (71) QDP
        (72) QReductionProof [EQUIVALENT, 0 ms]
        (73) QDP
        (74) TransformationProof [EQUIVALENT, 0 ms]
        (75) QDP
        (76) TransformationProof [EQUIVALENT, 0 ms]
        (77) QDP
        (78) UsableRulesProof [EQUIVALENT, 0 ms]
        (79) QDP
        (80) QReductionProof [EQUIVALENT, 0 ms]
        (81) QDP
        (82) QDPOrderProof [EQUIVALENT, 7 ms]
        (83) QDP
        (84) DependencyGraphProof [EQUIVALENT, 0 ms]
        (85) TRUE
    (86) QDP

popout

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

job log

popout

actions all output return to Haskell