Haskell pair #487599109

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	64.1344909668 seconds
cpu usage	101.549860645
max memory	5.242277888E9

stage attributes

key	value
output-size	5339851
starexec-result	MAYBE

output

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


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


MAYBE
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 not be shown:

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

popout

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

job log

popout

actions all output return to Haskell