Haskell pair #487598405

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	4.70840811729 seconds
cpu usage	11.372151209
max memory	5.94608128E8

stage attributes

key	value
output-size	67411
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) QDP
(7) QDPSizeChangeProof [EQUIVALENT, 0 ms]
(8) 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 Ordering = LT  | EQ  | GT ;

absFloat :: Float  ->  Float;
absFloat = absReal;

absReal x = absReal2 x;

absReal0 x MyTrue = negateFloat x;

absReal1 x MyTrue = x;
absReal1 x MyFalse = absReal0 x otherwise;

absReal2 x = absReal1 x (gtEsFloat x (fromIntFloat (Main.Pos Main.Zero)));

compareFloat :: Float  ->  Float  ->  Ordering;
compareFloat = primCmpFloat;

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

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

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

gtEsFloat :: Float  ->  Float  ->  MyBool;
gtEsFloat x y = fsEsOrdering (compareFloat x y) LT;

negateFloat :: Float  ->  Float;
negateFloat = primNegFloat;

negateMyInt :: MyInt  ->  MyInt;
negateMyInt = primNegInt;

otherwise :: MyBool;
otherwise = MyTrue;

primCmpFloat :: Float  ->  Float  ->  Ordering;
primCmpFloat (Float x1 x2) (Float y1 y2) = compareMyInt (srMyInt x1 y1) (srMyInt x2 y2);

primCmpInt :: MyInt  ->  MyInt  ->  Ordering;
primCmpInt (Main.Pos Main.Zero) (Main.Pos Main.Zero) = EQ;
primCmpInt (Main.Pos Main.Zero) (Main.Neg Main.Zero) = EQ;
primCmpInt (Main.Neg Main.Zero) (Main.Pos Main.Zero) = EQ;
primCmpInt (Main.Neg Main.Zero) (Main.Neg Main.Zero) = EQ;
primCmpInt (Main.Pos x) (Main.Pos y) = primCmpNat x y;
primCmpInt (Main.Pos x) (Main.Neg y) = GT;
primCmpInt (Main.Neg x) (Main.Pos y) = LT;
primCmpInt (Main.Neg x) (Main.Neg y) = primCmpNat y x;

primCmpNat :: Main.Nat  ->  Main.Nat  ->  Ordering;
primCmpNat Main.Zero Main.Zero = EQ;
primCmpNat Main.Zero (Main.Succ y) = LT;
primCmpNat (Main.Succ x) Main.Zero = GT;
primCmpNat (Main.Succ x) (Main.Succ y) = primCmpNat x y;

primIntToFloat :: MyInt  ->  Float;

popout

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

job log

popout

actions all output return to Haskell