Haskell pair #487598402

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	16.2036349773 seconds
cpu usage	32.479822348
max memory	4.394151936E9

stage attributes

key	value
output-size	166740
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) BR [EQUIVALENT, 0 ms]
(2) HASKELL
(3) COR [EQUIVALENT, 0 ms]
(4) HASKELL
(5) Narrow [SOUND, 0 ms]
(6) AND
    (7) QDP
        (8) QDPOrderProof [EQUIVALENT, 13 ms]
        (9) QDP
        (10) DependencyGraphProof [EQUIVALENT, 0 ms]
        (11) QDP
        (12) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (13) YES
    (14) QDP
        (15) DependencyGraphProof [EQUIVALENT, 0 ms]
        (16) QDP
        (17) QDPOrderProof [EQUIVALENT, 5 ms]
        (18) QDP
        (19) DependencyGraphProof [EQUIVALENT, 0 ms]
        (20) QDP
        (21) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (22) YES
    (23) QDP
        (24) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (25) YES
    (26) QDP
        (27) DependencyGraphProof [EQUIVALENT, 0 ms]
        (28) QDP
        (29) TransformationProof [EQUIVALENT, 0 ms]
        (30) QDP
        (31) UsableRulesProof [EQUIVALENT, 0 ms]
        (32) QDP
        (33) QReductionProof [EQUIVALENT, 0 ms]
        (34) QDP
        (35) MNOCProof [EQUIVALENT, 0 ms]
        (36) QDP
        (37) InductionCalculusProof [EQUIVALENT, 0 ms]
        (38) QDP
        (39) TransformationProof [EQUIVALENT, 0 ms]
        (40) QDP
            (41) DependencyGraphProof [EQUIVALENT, 0 ms]
            (42) QDP
            (43) TransformationProof [EQUIVALENT, 0 ms]
            (44) QDP
            (45) DependencyGraphProof [EQUIVALENT, 0 ms]
            (46) QDP
            (47) TransformationProof [EQUIVALENT, 0 ms]
            (48) QDP
            (49) DependencyGraphProof [EQUIVALENT, 0 ms]
            (50) QDP
            (51) TransformationProof [EQUIVALENT, 0 ms]
            (52) QDP
            (53) DependencyGraphProof [EQUIVALENT, 0 ms]
            (54) QDP
            (55) MNOCProof [EQUIVALENT, 0 ms]
            (56) QDP
            (57) InductionCalculusProof [EQUIVALENT, 0 ms]
            (58) QDP
(59) Narrow [COMPLETE, 0 ms]
(60) TRUE


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

(0)
Obligation:
mainModule Main 
module Main where {
import qualified Prelude;
data Main.Char = Char MyInt ;

data List a = Cons a (List a)  | Nil ;

data MyBool = MyTrue  | MyFalse ;

data MyInt = Pos Main.Nat  | Neg Main.Nat ;

data Main.Nat = Succ Main.Nat  | Zero ;

divMyInt :: MyInt  ->  MyInt  ->  MyInt;
divMyInt = primDivInt;

error :: a;
error = stop MyTrue;

modMyInt :: MyInt  ->  MyInt  ->  MyInt;

popout

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

job log

popout

actions all output return to Haskell