Haskell pair #487598272

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	16.2792799473 seconds
cpu usage	32.37237144
max memory	4.213137408E9

stage attributes

key	value
output-size	139495
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) BR [EQUIVALENT, 0 ms]
(2) HASKELL
(3) COR [EQUIVALENT, 0 ms]
(4) HASKELL
(5) Narrow [SOUND, 0 ms]
(6) AND
    (7) QDP
        (8) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (9) YES
    (10) QDP
        (11) QDPPairToRuleProof [EQUIVALENT, 0 ms]
        (12) AND
            (13) QDP
                (14) DependencyGraphProof [EQUIVALENT, 0 ms]
                (15) QDP
                (16) TransformationProof [EQUIVALENT, 0 ms]
                (17) QDP
                (18) UsableRulesProof [EQUIVALENT, 0 ms]
                (19) QDP
                (20) QReductionProof [EQUIVALENT, 0 ms]
                (21) QDP
                (22) InductionCalculusProof [EQUIVALENT, 0 ms]
                (23) QDP
                (24) NonInfProof [EQUIVALENT, 32 ms]
                (25) AND
                    (26) QDP
                        (27) DependencyGraphProof [EQUIVALENT, 0 ms]
                        (28) TRUE
                    (29) QDP
                        (30) DependencyGraphProof [EQUIVALENT, 0 ms]
                        (31) TRUE
            (32) QDP
                (33) QDPSizeChangeProof [EQUIVALENT, 0 ms]
                (34) YES


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

(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 ;

data Ordering = LT  | EQ  | GT ;

data Main.WHNF a = WHNF a ;

compareMyInt :: MyInt  ->  MyInt  ->  Ordering;
compareMyInt = primCmpInt;

dsEm :: (a  ->  b)  ->  a  ->  b;
dsEm f x = Main.seq x (f x);

enforceWHNF :: Main.WHNF b  ->  a  ->  a;
enforceWHNF (Main.WHNF x) y = y;

enumFromChar :: Main.Char  ->  List Main.Char;
enumFromChar c = map toEnumChar (enumFromToMyInt (fromEnumChar c) (fromEnumChar maxBoundChar));

enumFromToMyInt :: MyInt  ->  MyInt  ->  List MyInt;
enumFromToMyInt = numericEnumFromTo;

esEsOrdering :: Ordering  ->  Ordering  ->  MyBool;
esEsOrdering LT LT = MyTrue;
esEsOrdering LT EQ = MyFalse;
esEsOrdering LT GT = MyFalse;
esEsOrdering EQ LT = MyFalse;
esEsOrdering EQ EQ = MyTrue;
esEsOrdering EQ GT = MyFalse;
esEsOrdering GT LT = MyFalse;
esEsOrdering GT EQ = MyFalse;
esEsOrdering GT GT = MyTrue;

flip :: (c  ->  b  ->  a)  ->  b  ->  c  ->  a;
flip f x y = f y x;

popout

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

job log

popout

actions all output return to Haskell