details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	4.10654 seconds
cpu usage	9.81924
user time	9.48659
system time	0.332651
max virtual memory	1.8285568E7
max residence set size	598156.0

stage attributes

key	value
starexec-result	YES

output

7.88/3.56 YES 9.51/4.07 proof of /export/starexec/sandbox/benchmark/theBenchmark.hs 9.51/4.07 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 9.51/4.07 9.51/4.07 9.51/4.07 H-Termination with start terms of the given HASKELL could be proven: 9.51/4.07 9.51/4.07 (0) HASKELL 9.51/4.07 (1) BR [EQUIVALENT, 0 ms] 9.51/4.07 (2) HASKELL 9.51/4.07 (3) COR [EQUIVALENT, 0 ms] 9.51/4.07 (4) HASKELL 9.51/4.07 (5) Narrow [SOUND, 0 ms] 9.51/4.07 (6) QDP 9.51/4.07 (7) QDPSizeChangeProof [EQUIVALENT, 0 ms] 9.51/4.07 (8) YES 9.51/4.07 9.51/4.07 9.51/4.07 ---------------------------------------- 9.51/4.07 9.51/4.07 (0) 9.51/4.07 Obligation: 9.51/4.07 mainModule Main 9.51/4.07 module Main where { 9.51/4.07 import qualified Prelude; 9.51/4.07 data List a = Cons a (List a) | Nil ; 9.51/4.07 9.51/4.07 data MyBool = MyTrue | MyFalse ; 9.51/4.07 9.51/4.07 data Ordering = LT | EQ | GT ; 9.51/4.07 9.51/4.07 any :: (a -> MyBool) -> List a -> MyBool; 9.51/4.07 any p = pt or (map p); 9.51/4.07 9.51/4.07 elemOrdering :: Ordering -> List Ordering -> MyBool; 9.51/4.07 elemOrdering = pt any esEsOrdering; 9.51/4.07 9.51/4.07 esEsOrdering :: Ordering -> Ordering -> MyBool; 9.51/4.07 esEsOrdering LT LT = MyTrue; 9.51/4.07 esEsOrdering LT EQ = MyFalse; 9.51/4.07 esEsOrdering LT GT = MyFalse; 9.51/4.07 esEsOrdering EQ LT = MyFalse; 9.51/4.07 esEsOrdering EQ EQ = MyTrue; 9.51/4.07 esEsOrdering EQ GT = MyFalse; 9.51/4.07 esEsOrdering GT LT = MyFalse; 9.51/4.07 esEsOrdering GT EQ = MyFalse; 9.51/4.07 esEsOrdering GT GT = MyTrue; 9.51/4.07 9.51/4.07 foldr :: (b -> a -> a) -> a -> List b -> a; 9.51/4.07 foldr f z Nil = z; 9.51/4.07 foldr f z (Cons x xs) = f x (foldr f z xs); 9.51/4.07 9.51/4.07 map :: (b -> a) -> List b -> List a; 9.51/4.07 map f Nil = Nil; 9.51/4.07 map f (Cons x xs) = Cons (f x) (map f xs); 9.51/4.07 9.51/4.07 or :: List MyBool -> MyBool; 9.51/4.07 or = foldr pePe MyFalse; 9.51/4.07 9.51/4.07 pePe :: MyBool -> MyBool -> MyBool; 9.51/4.07 pePe MyFalse x = x; 9.51/4.07 pePe MyTrue x = MyTrue; 9.51/4.07 9.51/4.07 pt :: (c -> b) -> (a -> c) -> a -> b; 9.51/4.07 pt f g x = f (g x); 9.51/4.07 9.51/4.07 } 9.51/4.07 9.51/4.07 ---------------------------------------- 9.51/4.07 9.51/4.07 (1) BR (EQUIVALENT) 9.51/4.07 Replaced joker patterns by fresh variables and removed binding patterns. 9.51/4.07 ---------------------------------------- 9.51/4.07 9.51/4.07 (2) 9.51/4.07 Obligation: 9.51/4.07 mainModule Main 9.51/4.07 module Main where { 9.51/4.07 import qualified Prelude; 9.51/4.07 data List a = Cons a (List a) | Nil ; 9.51/4.07 9.51/4.07 data MyBool = MyTrue | MyFalse ; 9.51/4.07 9.51/4.07 data Ordering = LT | EQ | GT ; 9.51/4.07 9.51/4.07 any :: (a -> MyBool) -> List a -> MyBool; 9.51/4.07 any p = pt or (map p); 9.51/4.07 9.51/4.07 elemOrdering :: Ordering -> List Ordering -> MyBool; 9.51/4.07 elemOrdering = pt any esEsOrdering; 9.51/4.07 9.51/4.07 esEsOrdering :: Ordering -> Ordering -> MyBool; 9.51/4.07 esEsOrdering LT LT = MyTrue; 9.51/4.07 esEsOrdering LT EQ = MyFalse; 9.51/4.07 esEsOrdering LT GT = MyFalse; 9.51/4.07 esEsOrdering EQ LT = MyFalse; 9.51/4.07 esEsOrdering EQ EQ = MyTrue; 9.51/4.07 esEsOrdering EQ GT = MyFalse; 9.51/4.07 esEsOrdering GT LT = MyFalse; 9.51/4.07 esEsOrdering GT EQ = MyFalse; popout

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

job log

popout

actions

all output return to Haskell 2019-04-01 06.52