details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	5.34452 seconds
cpu usage	14.5745
user time	14.16
system time	0.414494
max virtual memory	1.8351564E7
max residence set size	783092.0

stage attributes

key	value
starexec-result	NO

output

11.78/4.58 NO 14.44/5.27 proof of /export/starexec/sandbox/benchmark/theBenchmark.hs 14.44/5.27 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 14.44/5.27 14.44/5.27 14.44/5.27 H-Termination with start terms of the given HASKELL could be disproven: 14.44/5.27 14.44/5.27 (0) HASKELL 14.44/5.27 (1) BR [EQUIVALENT, 0 ms] 14.44/5.27 (2) HASKELL 14.44/5.27 (3) COR [EQUIVALENT, 0 ms] 14.44/5.27 (4) HASKELL 14.44/5.27 (5) Narrow [COMPLETE, 0 ms] 14.44/5.27 (6) AND 14.44/5.27 (7) QDP 14.44/5.27 (8) PisEmptyProof [EQUIVALENT, 0 ms] 14.44/5.27 (9) YES 14.44/5.27 (10) QDP 14.44/5.27 (11) NonTerminationLoopProof [COMPLETE, 0 ms] 14.44/5.27 (12) NO 14.44/5.27 (13) QDP 14.44/5.27 14.44/5.27 14.44/5.27 ---------------------------------------- 14.44/5.27 14.44/5.27 (0) 14.44/5.27 Obligation: 14.44/5.27 mainModule Main 14.44/5.27 module Main where { 14.44/5.27 import qualified Prelude; 14.44/5.27 data List a = Cons a (List a) | Nil ; 14.44/5.27 14.44/5.27 data MyBool = MyTrue | MyFalse ; 14.44/5.27 14.44/5.27 data MyInt = Pos Main.Nat | Neg Main.Nat ; 14.44/5.27 14.44/5.27 data Main.Nat = Succ Main.Nat | Zero ; 14.44/5.27 14.44/5.27 data Ordering = LT | EQ | GT ; 14.44/5.27 14.44/5.27 compareMyInt :: MyInt -> MyInt -> Ordering; 14.44/5.27 compareMyInt = primCmpInt; 14.44/5.27 14.44/5.27 enumFromThenOrdering :: Ordering -> Ordering -> List Ordering; 14.44/5.27 enumFromThenOrdering x y = enumFromThenToOrdering x y GT; 14.44/5.27 14.44/5.27 enumFromThenToMyInt :: MyInt -> MyInt -> MyInt -> List MyInt; 14.44/5.27 enumFromThenToMyInt = numericEnumFromThenTo; 14.44/5.27 14.44/5.27 enumFromThenToOrdering :: Ordering -> Ordering -> Ordering -> List Ordering; 14.44/5.27 enumFromThenToOrdering x y z = map toEnumOrdering (enumFromThenToMyInt (fromEnumOrdering x) (fromEnumOrdering y) (fromEnumOrdering z)); 14.44/5.27 14.44/5.27 esEsMyInt :: MyInt -> MyInt -> MyBool; 14.44/5.27 esEsMyInt = primEqInt; 14.44/5.27 14.44/5.27 esEsOrdering :: Ordering -> Ordering -> MyBool; 14.44/5.27 esEsOrdering LT LT = MyTrue; 14.44/5.27 esEsOrdering LT EQ = MyFalse; 14.44/5.27 esEsOrdering LT GT = MyFalse; 14.44/5.27 esEsOrdering EQ LT = MyFalse; 14.44/5.27 esEsOrdering EQ EQ = MyTrue; 14.44/5.27 esEsOrdering EQ GT = MyFalse; 14.44/5.27 esEsOrdering GT LT = MyFalse; 14.44/5.27 esEsOrdering GT EQ = MyFalse; 14.44/5.27 esEsOrdering GT GT = MyTrue; 14.44/5.27 14.44/5.27 flip :: (a -> c -> b) -> c -> a -> b; 14.44/5.27 flip f x y = f y x; 14.44/5.27 14.44/5.27 fromEnumOrdering :: Ordering -> MyInt; 14.44/5.27 fromEnumOrdering LT = Main.Pos Main.Zero; 14.44/5.27 fromEnumOrdering EQ = Main.Pos (Main.Succ Main.Zero); 14.44/5.27 fromEnumOrdering GT = Main.Pos (Main.Succ (Main.Succ Main.Zero)); 14.44/5.27 14.44/5.27 fsEsOrdering :: Ordering -> Ordering -> MyBool; 14.44/5.27 fsEsOrdering x y = not (esEsOrdering x y); 14.44/5.27 14.44/5.27 gtEsMyInt :: MyInt -> MyInt -> MyBool; 14.44/5.27 gtEsMyInt x y = fsEsOrdering (compareMyInt x y) LT; 14.44/5.27 14.44/5.27 iterate :: (a -> a) -> a -> List a; 14.44/5.27 iterate f x = Cons x (iterate f (f x)); 14.44/5.27 14.44/5.27 ltEsMyInt :: MyInt -> MyInt -> MyBool; 14.44/5.27 ltEsMyInt x y = fsEsOrdering (compareMyInt x y) GT; 14.44/5.27 14.44/5.27 map :: (b -> a) -> List b -> List a; 14.44/5.27 map f Nil = Nil; 14.44/5.27 map f (Cons x xs) = Cons (f x) (map f xs); 14.44/5.27 14.44/5.27 msMyInt :: MyInt -> MyInt -> MyInt; 14.44/5.27 msMyInt = primMinusInt; 14.44/5.27 14.44/5.27 not :: MyBool -> MyBool; 14.44/5.27 not MyTrue = MyFalse; 14.44/5.27 not MyFalse = MyTrue; 14.44/5.27 14.44/5.27 numericEnumFromThen n m = iterate (psMyInt (msMyInt m n)) n; 14.44/5.27 14.44/5.27 numericEnumFromThenTo n n' m = takeWhile (numericEnumFromThenToP m n' n) (numericEnumFromThen n n'); popout

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

job log

popout

actions

all output return to Haskell 2019-04-01 06.52