Funct Progr 77531 pair #381920885

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	4.12545800209 seconds
cpu usage	10.07780197
max memory	5.70544128E8

stage attributes

key	value
output-size	28120
starexec-result	YES

output

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


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


YES
proof of /export/starexec/sandbox2/benchmark/theBenchmark.hs
# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 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, 1 ms]
        (9) YES
    (10) QDP
        (11) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (12) YES
    (13) QDP
        (14) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (15) YES


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

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

foldl' :: (b  ->  a  ->  b)  ->  b  ->  List a  ->  b;
foldl' f a Nil = a;
foldl' f a (Cons x xs) = dsEm (foldl' f) (f a x) xs;

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

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

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

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

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

productFloat :: List Float  ->  Float;
productFloat = foldl' srFloat (fromIntFloat (Main.Pos (Main.Succ Main.Zero)));

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

srFloat :: Float  ->  Float  ->  Float;
srFloat = primMulFloat;

srMyInt :: MyInt  ->  MyInt  ->  MyInt;
srMyInt = primMulInt;

}

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

popout

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

job log

popout

actions all output return to Funct Progr 77531