Haskell pair #487598390

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	5.24060106277 seconds
cpu usage	9.940898871
max memory	5.94726912E8

stage attributes

key	value
output-size	14779
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 [EQUIVALENT, 28 ms]
(6) YES


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

(0)
Obligation:
mainModule Main 
module Main where {
import qualified Prelude;
data MyBool = MyTrue  | MyFalse ;

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

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

data Ordering = LT  | EQ  | GT ;

absMyInt :: MyInt  ->  MyInt;
absMyInt = absReal;

absReal x = absReal2 x;

absReal0 x MyTrue = negateMyInt x;

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

absReal2 x = absReal1 x (gtEsMyInt x (fromIntMyInt (Main.Pos Main.Zero)));

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

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;

fromIntMyInt :: MyInt  ->  MyInt;
fromIntMyInt x = x;

fsEsOrdering :: Ordering  ->  Ordering  ->  MyBool;
fsEsOrdering x y = not (esEsOrdering x y);

gtEsMyInt :: MyInt  ->  MyInt  ->  MyBool;
gtEsMyInt x y = fsEsOrdering (compareMyInt x y) LT;

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

not :: MyBool  ->  MyBool;
not MyTrue = MyFalse;
not MyFalse = MyTrue;

otherwise :: MyBool;
otherwise = MyTrue;

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;

primNegInt :: MyInt  ->  MyInt;
primNegInt (Main.Pos x) = Main.Neg x;

popout

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

job log

popout

actions all output return to Haskell