Haskell pair #487598284

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	6.74148797989 seconds
cpu usage	11.097980474
max memory	6.37341696E8

stage attributes

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


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

(0)
Obligation:
mainModule Main 
module Main where {
import qualified Prelude;
data List a = Cons a (List a)  | Nil ;

data MyBool = MyTrue  | MyFalse ;

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

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

data Ordering = LT  | EQ  | GT ;

data Main.WHNF a = WHNF a ;

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

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

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

enumFromMyBool :: MyBool  ->  List MyBool;
enumFromMyBool x = enumFromToMyBool x MyTrue;

enumFromToMyBool :: MyBool  ->  MyBool  ->  List MyBool;
enumFromToMyBool x y = map toEnumMyBool (enumFromToMyInt (fromEnumMyBool x) (fromEnumMyBool y));

enumFromToMyInt :: MyInt  ->  MyInt  ->  List MyInt;
enumFromToMyInt = numericEnumFromTo;

esEsMyInt :: MyInt  ->  MyInt  ->  MyBool;
esEsMyInt = primEqInt;

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;

flip :: (c  ->  a  ->  b)  ->  a  ->  c  ->  b;
flip f x y = f y x;

fromEnumMyBool :: MyBool  ->  MyInt;
fromEnumMyBool MyFalse = Main.Pos Main.Zero;
fromEnumMyBool MyTrue = Main.Pos (Main.Succ Main.Zero);

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

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

ltEsMyInt :: MyInt  ->  MyInt  ->  MyBool;
ltEsMyInt x y = fsEsOrdering (compareMyInt x y) GT;

map :: (a  ->  b)  ->  List a  ->  List b;
map f Nil = Nil;
map f (Cons x xs) = Cons (f x) (map f xs);

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

numericEnumFrom n = Cons n (dsEm numericEnumFrom (psMyInt n (fromIntMyInt (Main.Pos (Main.Succ Main.Zero)))));

numericEnumFromTo n m = takeWhile (flip ltEsMyInt m) (numericEnumFrom n);

popout

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

job log

popout

actions all output return to Haskell