Haskell pair #487598805

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	20.2615020275 seconds
cpu usage	40.06879107
max memory	4.064608256E9

stage attributes

key	value
output-size	2584120
starexec-result	YES

output

/export/starexec/sandbox2/solver/bin/starexec_run_standard /export/starexec/sandbox2/benchmark/theBenchmark.hs /export/starexec/sandbox2/output/output_files


--------------------------------------------------------------------------------


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

popout

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

job log

popout

actions all output return to Haskell