details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	4.15012 seconds
cpu usage	9.96467
user time	9.64886
system time	0.31581
max virtual memory	1.8286232E7
max residence set size	595904.0

stage attributes

key	value
starexec-result	YES

output

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

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

job log

popout

actions

all output return to Haskell 2019-04-01 06.52