Haskell pair #487598280

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	5.81978988647 seconds
cpu usage	11.447486425
max memory	6.21105152E8

stage attributes

key	value
output-size	57645
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: 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) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (12) YES
    (13) QDP
        (14) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (15) YES
    (16) QDP
        (17) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (18) YES
    (19) QDP
        (20) DependencyGraphProof [EQUIVALENT, 0 ms]
        (21) AND
            (22) QDP
                (23) QDPSizeChangeProof [EQUIVALENT, 19 ms]
                (24) YES
            (25) QDP
                (26) MRRProof [EQUIVALENT, 0 ms]
                (27) QDP
                (28) PisEmptyProof [EQUIVALENT, 0 ms]
                (29) YES


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

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

data MyBool = MyTrue  | MyFalse ;

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

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

data Tup2 b a = Tup2 b a ;

error :: a;
error = stop MyTrue;

floatProperFractionFloat (Float vv vw) = Tup2 (quotMyInt vv vw) (msFloat (Float vv vw) (fromIntFloat (quotMyInt vv vw)));

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

msFloat :: Float  ->  Float  ->  Float;
msFloat = primMinusFloat;

msMyInt :: MyInt  ->  MyInt  ->  MyInt;
msMyInt = primMinusInt;

primDivNatS :: Main.Nat  ->  Main.Nat  ->  Main.Nat;
primDivNatS Main.Zero Main.Zero = Main.error;
primDivNatS (Main.Succ x) Main.Zero = Main.error;
primDivNatS (Main.Succ x) (Main.Succ y) = primDivNatS0 x y (primGEqNatS x y);
primDivNatS Main.Zero (Main.Succ x) = Main.Zero;

primDivNatS0 x y MyTrue = Main.Succ (primDivNatS (primMinusNatS x y) (Main.Succ y));
primDivNatS0 x y MyFalse = Main.Zero;

primGEqNatS :: Main.Nat  ->  Main.Nat  ->  MyBool;
primGEqNatS (Main.Succ x) Main.Zero = MyTrue;
primGEqNatS (Main.Succ x) (Main.Succ y) = primGEqNatS x y;
primGEqNatS Main.Zero (Main.Succ x) = MyFalse;
primGEqNatS Main.Zero Main.Zero = MyTrue;

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

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

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

popout

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

job log

popout

actions all output return to Haskell