Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Haskell 2019-04-01 06.52 pair #433317331
details
property
value
status
complete
benchmark
index_4.hs
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n084.star.cs.uiowa.edu
space
basic_haskell
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
5.43363 seconds
cpu usage
14.2287
user time
13.8432
system time
0.385526
max virtual memory
1.8285568E7
max residence set size
737044.0
stage attributes
key
value
starexec-result
YES
output
11.50/4.69 YES 13.84/5.32 proof of /export/starexec/sandbox/benchmark/theBenchmark.hs 13.84/5.32 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 13.84/5.32 13.84/5.32 13.84/5.32 H-Termination with start terms of the given HASKELL could be proven: 13.84/5.32 13.84/5.32 (0) HASKELL 13.84/5.32 (1) BR [EQUIVALENT, 0 ms] 13.84/5.32 (2) HASKELL 13.84/5.32 (3) COR [EQUIVALENT, 0 ms] 13.84/5.32 (4) HASKELL 13.84/5.32 (5) Narrow [SOUND, 0 ms] 13.84/5.32 (6) AND 13.84/5.32 (7) QDP 13.84/5.32 (8) QDPSizeChangeProof [EQUIVALENT, 0 ms] 13.84/5.32 (9) YES 13.84/5.32 (10) QDP 13.84/5.32 (11) QDPSizeChangeProof [EQUIVALENT, 0 ms] 13.84/5.32 (12) YES 13.84/5.32 13.84/5.32 13.84/5.32 ---------------------------------------- 13.84/5.32 13.84/5.32 (0) 13.84/5.32 Obligation: 13.84/5.32 mainModule Main 13.84/5.32 module Main where { 13.84/5.32 import qualified Prelude; 13.84/5.32 data List a = Cons a (List a) | Nil ; 13.84/5.32 13.84/5.32 data MyBool = MyTrue | MyFalse ; 13.84/5.32 13.84/5.32 data MyInt = Pos Main.Nat | Neg Main.Nat ; 13.84/5.32 13.84/5.32 data Main.Nat = Succ Main.Nat | Zero ; 13.84/5.32 13.84/5.32 data Ordering = LT | EQ | GT ; 13.84/5.32 13.84/5.32 data Tup2 a b = Tup2 a b ; 13.84/5.32 13.84/5.32 data Main.WHNF a = WHNF a ; 13.84/5.32 13.84/5.32 asAs :: MyBool -> MyBool -> MyBool; 13.84/5.32 asAs MyFalse x = MyFalse; 13.84/5.32 asAs MyTrue x = x; 13.84/5.32 13.84/5.32 compare0 x y MyTrue = GT; 13.84/5.32 13.84/5.32 compare1 x y MyTrue = LT; 13.84/5.32 compare1 x y MyFalse = compare0 x y otherwise; 13.84/5.32 13.84/5.32 compare2 x y MyTrue = EQ; 13.84/5.32 compare2 x y MyFalse = compare1 x y (ltEsOrdering x y); 13.84/5.32 13.84/5.32 compare3 x y = compare2 x y (esEsOrdering x y); 13.84/5.32 13.84/5.32 compareOrdering :: Ordering -> Ordering -> Ordering; 13.84/5.32 compareOrdering x y = compare3 x y; 13.84/5.32 13.84/5.32 concat :: List (List a) -> List a; 13.84/5.32 concat = foldr psPs Nil; 13.84/5.32 13.84/5.32 concatMap :: (b -> List a) -> List b -> List a; 13.84/5.32 concatMap f = pt concat (map f); 13.84/5.32 13.84/5.32 dsEm :: (b -> a) -> b -> a; 13.84/5.32 dsEm f x = Main.seq x (f x); 13.84/5.32 13.84/5.32 enforceWHNF :: Main.WHNF b -> a -> a; 13.84/5.32 enforceWHNF (Main.WHNF x) y = y; 13.84/5.32 13.84/5.32 error :: a; 13.84/5.32 error = stop MyTrue; 13.84/5.32 13.84/5.32 esEsOrdering :: Ordering -> Ordering -> MyBool; 13.84/5.32 esEsOrdering LT LT = MyTrue; 13.84/5.32 esEsOrdering LT EQ = MyFalse; 13.84/5.32 esEsOrdering LT GT = MyFalse; 13.84/5.32 esEsOrdering EQ LT = MyFalse; 13.84/5.32 esEsOrdering EQ EQ = MyTrue; 13.84/5.32 esEsOrdering EQ GT = MyFalse; 13.84/5.32 esEsOrdering GT LT = MyFalse; 13.84/5.32 esEsOrdering GT EQ = MyFalse; 13.84/5.32 esEsOrdering GT GT = MyTrue; 13.84/5.32 13.84/5.32 foldl' :: (a -> b -> a) -> a -> List b -> a; 13.84/5.32 foldl' f a Nil = a; 13.84/5.32 foldl' f a (Cons x xs) = dsEm (foldl' f) (f a x) xs; 13.84/5.32 13.84/5.32 foldr :: (a -> b -> b) -> b -> List a -> b; 13.84/5.32 foldr f z Nil = z; 13.84/5.32 foldr f z (Cons x xs) = f x (foldr f z xs); 13.84/5.32 13.84/5.32 fromIntMyInt :: MyInt -> MyInt; 13.84/5.32 fromIntMyInt x = x; 13.84/5.32 13.84/5.32 fsEsOrdering :: Ordering -> Ordering -> MyBool; 13.84/5.32 fsEsOrdering x y = not (esEsOrdering x y); 13.84/5.32
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Haskell 2019-04-01 06.52