Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Haskell 2019-04-01 06.52 pair #433317108
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
n123.star.cs.uiowa.edu
space
basic_haskell
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
6.60666 seconds
cpu usage
11.1366
user time
10.7962
system time
0.340469
max virtual memory
1.828352E7
max residence set size
637960.0
stage attributes
key
value
starexec-result
YES
output
8.77/3.80 YES 10.90/4.44 proof of /export/starexec/sandbox/benchmark/theBenchmark.hs 10.90/4.44 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 10.90/4.44 10.90/4.44 10.90/4.44 H-Termination with start terms of the given HASKELL could be proven: 10.90/4.44 10.90/4.44 (0) HASKELL 10.90/4.44 (1) BR [EQUIVALENT, 0 ms] 10.90/4.44 (2) HASKELL 10.90/4.44 (3) COR [EQUIVALENT, 0 ms] 10.90/4.44 (4) HASKELL 10.90/4.44 (5) Narrow [EQUIVALENT, 7 ms] 10.90/4.44 (6) YES 10.90/4.44 10.90/4.44 10.90/4.44 ---------------------------------------- 10.90/4.44 10.90/4.44 (0) 10.90/4.44 Obligation: 10.90/4.44 mainModule Main 10.90/4.44 module Main where { 10.90/4.44 import qualified Prelude; 10.90/4.44 data List a = Cons a (List a) | Nil ; 10.90/4.44 10.90/4.44 data MyBool = MyTrue | MyFalse ; 10.90/4.44 10.90/4.44 data MyInt = Pos Main.Nat | Neg Main.Nat ; 10.90/4.44 10.90/4.44 data Main.Nat = Succ Main.Nat | Zero ; 10.90/4.44 10.90/4.44 data Ordering = LT | EQ | GT ; 10.90/4.44 10.90/4.44 data Main.WHNF a = WHNF a ; 10.90/4.44 10.90/4.44 compareMyInt :: MyInt -> MyInt -> Ordering; 10.90/4.44 compareMyInt = primCmpInt; 10.90/4.44 10.90/4.44 dsEm :: (a -> b) -> a -> b; 10.90/4.44 dsEm f x = Main.seq x (f x); 10.90/4.44 10.90/4.44 enforceWHNF :: Main.WHNF b -> a -> a; 10.90/4.44 enforceWHNF (Main.WHNF x) y = y; 10.90/4.44 10.90/4.44 enumFromMyBool :: MyBool -> List MyBool; 10.90/4.44 enumFromMyBool x = enumFromToMyBool x MyTrue; 10.90/4.44 10.90/4.44 enumFromToMyBool :: MyBool -> MyBool -> List MyBool; 10.90/4.44 enumFromToMyBool x y = map toEnumMyBool (enumFromToMyInt (fromEnumMyBool x) (fromEnumMyBool y)); 10.90/4.44 10.90/4.44 enumFromToMyInt :: MyInt -> MyInt -> List MyInt; 10.90/4.44 enumFromToMyInt = numericEnumFromTo; 10.90/4.44 10.90/4.44 esEsMyInt :: MyInt -> MyInt -> MyBool; 10.90/4.44 esEsMyInt = primEqInt; 10.90/4.44 10.90/4.44 esEsOrdering :: Ordering -> Ordering -> MyBool; 10.90/4.44 esEsOrdering LT LT = MyTrue; 10.90/4.44 esEsOrdering LT EQ = MyFalse; 10.90/4.44 esEsOrdering LT GT = MyFalse; 10.90/4.44 esEsOrdering EQ LT = MyFalse; 10.90/4.44 esEsOrdering EQ EQ = MyTrue; 10.90/4.44 esEsOrdering EQ GT = MyFalse; 10.90/4.44 esEsOrdering GT LT = MyFalse; 10.90/4.44 esEsOrdering GT EQ = MyFalse; 10.90/4.44 esEsOrdering GT GT = MyTrue; 10.90/4.44 10.90/4.44 flip :: (b -> a -> c) -> a -> b -> c; 10.90/4.44 flip f x y = f y x; 10.90/4.44 10.90/4.44 fromEnumMyBool :: MyBool -> MyInt; 10.90/4.44 fromEnumMyBool MyFalse = Main.Pos Main.Zero; 10.90/4.44 fromEnumMyBool MyTrue = Main.Pos (Main.Succ Main.Zero); 10.90/4.44 10.90/4.44 fromIntMyInt :: MyInt -> MyInt; 10.90/4.44 fromIntMyInt x = x; 10.90/4.44 10.90/4.44 fsEsOrdering :: Ordering -> Ordering -> MyBool; 10.90/4.44 fsEsOrdering x y = not (esEsOrdering x y); 10.90/4.44 10.90/4.44 ltEsMyInt :: MyInt -> MyInt -> MyBool; 10.90/4.44 ltEsMyInt x y = fsEsOrdering (compareMyInt x y) GT; 10.90/4.44 10.90/4.44 map :: (a -> b) -> List a -> List b; 10.90/4.44 map f Nil = Nil; 10.90/4.44 map f (Cons x xs) = Cons (f x) (map f xs); 10.90/4.44 10.90/4.44 not :: MyBool -> MyBool; 10.90/4.44 not MyTrue = MyFalse; 10.90/4.44 not MyFalse = MyTrue; 10.90/4.44 10.90/4.44 numericEnumFrom n = Cons n (dsEm numericEnumFrom (psMyInt n (fromIntMyInt (Main.Pos (Main.Succ Main.Zero))))); 10.90/4.44 10.90/4.44 numericEnumFromTo n m = takeWhile (flip ltEsMyInt m) (numericEnumFrom n); 10.90/4.44 10.90/4.44 otherwise :: MyBool; 10.90/4.44 otherwise = MyTrue; 10.90/4.44 10.90/4.44 primCmpInt :: MyInt -> MyInt -> Ordering; 10.90/4.44 primCmpInt (Main.Pos Main.Zero) (Main.Pos Main.Zero) = EQ;
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Haskell 2019-04-01 06.52