details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	4.06853 seconds
cpu usage	9.72778
user time	9.43767
system time	0.2901
max virtual memory	1.8285568E7
max residence set size	567396.0

stage attributes

key	value
starexec-result	YES

output

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