Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Haskell 2019-04-01 06.52 pair #433317329
details
property
value
status
complete
benchmark
enumFrom_6.hs
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n012.star.cs.uiowa.edu
space
basic_haskell
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
4.62292 seconds
cpu usage
11.2184
user time
10.8714
system time
0.347007
max virtual memory
1.8285568E7
max residence set size
646328.0
stage attributes
key
value
starexec-result
YES
output
8.77/3.92 YES 11.16/4.57 proof of /export/starexec/sandbox/benchmark/theBenchmark.hs 11.16/4.57 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 11.16/4.57 11.16/4.57 11.16/4.57 H-Termination with start terms of the given HASKELL could be proven: 11.16/4.57 11.16/4.57 (0) HASKELL 11.16/4.57 (1) BR [EQUIVALENT, 0 ms] 11.16/4.57 (2) HASKELL 11.16/4.57 (3) COR [EQUIVALENT, 0 ms] 11.16/4.57 (4) HASKELL 11.16/4.57 (5) Narrow [EQUIVALENT, 96 ms] 11.16/4.57 (6) YES 11.16/4.57 11.16/4.57 11.16/4.57 ---------------------------------------- 11.16/4.57 11.16/4.57 (0) 11.16/4.57 Obligation: 11.16/4.57 mainModule Main 11.16/4.57 module Main where { 11.16/4.57 import qualified Prelude; 11.16/4.57 data List a = Cons a (List a) | Nil ; 11.16/4.57 11.16/4.57 data MyBool = MyTrue | MyFalse ; 11.16/4.57 11.16/4.57 data MyInt = Pos Main.Nat | Neg Main.Nat ; 11.16/4.57 11.16/4.57 data Main.Nat = Succ Main.Nat | Zero ; 11.16/4.57 11.16/4.57 data Ordering = LT | EQ | GT ; 11.16/4.57 11.16/4.57 data Main.WHNF a = WHNF a ; 11.16/4.57 11.16/4.57 compareMyInt :: MyInt -> MyInt -> Ordering; 11.16/4.57 compareMyInt = primCmpInt; 11.16/4.57 11.16/4.57 dsEm :: (a -> b) -> a -> b; 11.16/4.57 dsEm f x = Main.seq x (f x); 11.16/4.57 11.16/4.57 enforceWHNF :: Main.WHNF a -> b -> b; 11.16/4.57 enforceWHNF (Main.WHNF x) y = y; 11.16/4.57 11.16/4.57 enumFromOrdering :: Ordering -> List Ordering; 11.16/4.57 enumFromOrdering x = enumFromToOrdering x GT; 11.16/4.57 11.16/4.57 enumFromToMyInt :: MyInt -> MyInt -> List MyInt; 11.16/4.57 enumFromToMyInt = numericEnumFromTo; 11.16/4.57 11.16/4.57 enumFromToOrdering :: Ordering -> Ordering -> List Ordering; 11.16/4.57 enumFromToOrdering x y = map toEnumOrdering (enumFromToMyInt (fromEnumOrdering x) (fromEnumOrdering y)); 11.16/4.57 11.16/4.57 esEsMyInt :: MyInt -> MyInt -> MyBool; 11.16/4.57 esEsMyInt = primEqInt; 11.16/4.57 11.16/4.57 esEsOrdering :: Ordering -> Ordering -> MyBool; 11.16/4.57 esEsOrdering LT LT = MyTrue; 11.16/4.57 esEsOrdering LT EQ = MyFalse; 11.16/4.57 esEsOrdering LT GT = MyFalse; 11.16/4.57 esEsOrdering EQ LT = MyFalse; 11.16/4.57 esEsOrdering EQ EQ = MyTrue; 11.16/4.57 esEsOrdering EQ GT = MyFalse; 11.16/4.57 esEsOrdering GT LT = MyFalse; 11.16/4.57 esEsOrdering GT EQ = MyFalse; 11.16/4.57 esEsOrdering GT GT = MyTrue; 11.16/4.57 11.16/4.57 flip :: (c -> a -> b) -> a -> c -> b; 11.16/4.57 flip f x y = f y x; 11.16/4.57 11.16/4.57 fromEnumOrdering :: Ordering -> MyInt; 11.16/4.57 fromEnumOrdering LT = Main.Pos Main.Zero; 11.16/4.57 fromEnumOrdering EQ = Main.Pos (Main.Succ Main.Zero); 11.16/4.57 fromEnumOrdering GT = Main.Pos (Main.Succ (Main.Succ Main.Zero)); 11.16/4.57 11.16/4.57 fromIntMyInt :: MyInt -> MyInt; 11.16/4.57 fromIntMyInt x = x; 11.16/4.57 11.16/4.57 fsEsOrdering :: Ordering -> Ordering -> MyBool; 11.16/4.57 fsEsOrdering x y = not (esEsOrdering x y); 11.16/4.57 11.16/4.57 ltEsMyInt :: MyInt -> MyInt -> MyBool; 11.16/4.57 ltEsMyInt x y = fsEsOrdering (compareMyInt x y) GT; 11.16/4.57 11.16/4.57 map :: (b -> a) -> List b -> List a; 11.16/4.57 map f Nil = Nil; 11.16/4.57 map f (Cons x xs) = Cons (f x) (map f xs); 11.16/4.57 11.16/4.57 not :: MyBool -> MyBool; 11.16/4.57 not MyTrue = MyFalse; 11.16/4.57 not MyFalse = MyTrue; 11.16/4.57 11.16/4.57 numericEnumFrom n = Cons n (dsEm numericEnumFrom (psMyInt n (fromIntMyInt (Main.Pos (Main.Succ Main.Zero))))); 11.16/4.57 11.16/4.57 numericEnumFromTo n m = takeWhile (flip ltEsMyInt m) (numericEnumFrom n); 11.16/4.57 11.16/4.57 otherwise :: MyBool; 11.16/4.57 otherwise = MyTrue; 11.16/4.57 11.16/4.57 primCmpInt :: MyInt -> MyInt -> Ordering;
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Haskell 2019-04-01 06.52