Haskell pair #487598903

details

property	value
status	complete
benchmark	FiniteMap_delListFromFM_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)	13.9193899632 seconds
cpu usage	32.96807348
max memory	4.046872576E9

stage attributes

key	value
output-size	1191858
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, 1 ms]
(8) HASKELL
(9) COR [EQUIVALENT, 0 ms]
(10) HASKELL
(11) LetRed [EQUIVALENT, 0 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) QDPSizeChangeProof [EQUIVALENT, 39 ms]
        (22) YES
    (23) QDP
        (24) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (25) YES
    (26) QDP
        (27) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (28) YES
    (29) QDP
        (30) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (31) YES
    (32) QDP
        (33) DependencyGraphProof [EQUIVALENT, 0 ms]
        (34) AND
            (35) QDP
                (36) QDPSizeChangeProof [EQUIVALENT, 0 ms]
                (37) YES
            (38) QDP
                (39) TransformationProof [EQUIVALENT, 1356 ms]
                (40) QDP
                (41) TransformationProof [EQUIVALENT, 0 ms]
                (42) QDP
                (43) DependencyGraphProof [EQUIVALENT, 0 ms]
                (44) QDP
                (45) TransformationProof [EQUIVALENT, 0 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
    (61) QDP
        (62) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (63) YES
    (64) QDP
        (65) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (66) YES
    (67) QDP
        (68) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (69) YES
    (70) QDP
        (71) QDPSizeChangeProof [EQUIVALENT, 15 ms]
        (72) YES
    (73) QDP
        (74) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (75) YES


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

(0)
Obligation:
mainModule Main 
module FiniteMap where {
import qualified Main;
import qualified Maybe;
import qualified Prelude;

popout

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

job log

popout

actions all output return to Haskell