Haskell pair #487598424

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	4.57069993019 seconds
cpu usage	11.37961286
max memory	6.4108544E8

stage attributes

key	value
output-size	36673
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) MRRProof [EQUIVALENT, 117 ms]
        (9) QDP
        (10) NonTerminationLoopProof [COMPLETE, 0 ms]
        (11) NO
    (12) QDP
        (13) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (14) YES
(15) Narrow [COMPLETE, 0 ms]
(16) TRUE


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

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

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

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

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

data Main.WHNF a = WHNF a ;

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

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

enumFromFloat :: Float  ->  List Float;
enumFromFloat = numericEnumFrom;

fromIntFloat :: MyInt  ->  Float;
fromIntFloat = primIntToFloat;

numericEnumFrom n = Cons n (dsEm numericEnumFrom (psFloat n (fromIntFloat (Main.Pos (Main.Succ Main.Zero)))));

primIntToFloat :: MyInt  ->  Float;
primIntToFloat x = Float x (Main.Pos (Main.Succ Main.Zero));

primMinusNat :: Main.Nat  ->  Main.Nat  ->  MyInt;
primMinusNat Main.Zero Main.Zero = Main.Pos Main.Zero;
primMinusNat Main.Zero (Main.Succ y) = Main.Neg (Main.Succ y);
primMinusNat (Main.Succ x) Main.Zero = Main.Pos (Main.Succ x);
primMinusNat (Main.Succ x) (Main.Succ y) = primMinusNat x y;

primMulInt :: MyInt  ->  MyInt  ->  MyInt;
primMulInt (Main.Pos x) (Main.Pos y) = Main.Pos (primMulNat x y);
primMulInt (Main.Pos x) (Main.Neg y) = Main.Neg (primMulNat x y);
primMulInt (Main.Neg x) (Main.Pos y) = Main.Neg (primMulNat x y);
primMulInt (Main.Neg x) (Main.Neg y) = Main.Pos (primMulNat x y);

primMulNat :: Main.Nat  ->  Main.Nat  ->  Main.Nat;
primMulNat Main.Zero Main.Zero = Main.Zero;
primMulNat Main.Zero (Main.Succ y) = Main.Zero;
primMulNat (Main.Succ x) Main.Zero = Main.Zero;
primMulNat (Main.Succ x) (Main.Succ y) = primPlusNat (primMulNat x (Main.Succ y)) (Main.Succ y);

primPlusFloat :: Float  ->  Float  ->  Float;
primPlusFloat (Float x1 x2) (Float y1 y2) = Float (psMyInt x1 y1) (srMyInt x2 y2);

primPlusInt :: MyInt  ->  MyInt  ->  MyInt;
primPlusInt (Main.Pos x) (Main.Neg y) = primMinusNat x y;
primPlusInt (Main.Neg x) (Main.Pos y) = primMinusNat y x;
primPlusInt (Main.Neg x) (Main.Neg y) = Main.Neg (primPlusNat x y);
primPlusInt (Main.Pos x) (Main.Pos y) = Main.Pos (primPlusNat x y);

primPlusNat :: Main.Nat  ->  Main.Nat  ->  Main.Nat;
primPlusNat Main.Zero Main.Zero = Main.Zero;
primPlusNat Main.Zero (Main.Succ y) = Main.Succ y;
primPlusNat (Main.Succ x) Main.Zero = Main.Succ x;
primPlusNat (Main.Succ x) (Main.Succ y) = Main.Succ (Main.Succ (primPlusNat x y));

psFloat :: Float  ->  Float  ->  Float;

popout

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

job log

popout

actions all output return to Haskell