Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Funct Progr 77531 pair #381920877
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
n050.star.cs.uiowa.edu
space
basic_haskell
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
4.07346796989 seconds
cpu usage
10.196308118
max memory
5.75336448E8
stage attributes
key
value
output-size
14218
starexec-result
YES
output
/export/starexec/sandbox2/solver/bin/starexec_run_standard /export/starexec/sandbox2/benchmark/theBenchmark.hs /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES proof of /export/starexec/sandbox2/benchmark/theBenchmark.hs # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty H-Termination with start terms of the given HASKELL could be proven: (0) HASKELL (1) BR [EQUIVALENT, 0 ms] (2) HASKELL (3) COR [EQUIVALENT, 0 ms] (4) HASKELL (5) Narrow [SOUND, 0 ms] (6) QDP (7) QDPSizeChangeProof [EQUIVALENT, 0 ms] (8) YES ---------------------------------------- (0) Obligation: mainModule Main module Main where { import qualified Prelude; data List a = Cons a (List a) | Nil ; data MyBool = MyTrue | MyFalse ; data Ordering = LT | EQ | GT ; all :: (a -> MyBool) -> List a -> MyBool; all p = pt and (map p); and :: List MyBool -> MyBool; and = foldr asAs MyTrue; asAs :: MyBool -> MyBool -> MyBool; asAs MyFalse x = MyFalse; asAs MyTrue x = x; esEsOrdering :: Ordering -> Ordering -> MyBool; esEsOrdering LT LT = MyTrue; esEsOrdering LT EQ = MyFalse; esEsOrdering LT GT = MyFalse; esEsOrdering EQ LT = MyFalse; esEsOrdering EQ EQ = MyTrue; esEsOrdering EQ GT = MyFalse; esEsOrdering GT LT = MyFalse; esEsOrdering GT EQ = MyFalse; esEsOrdering GT GT = MyTrue; foldr :: (a -> b -> b) -> b -> List a -> b; foldr f z Nil = z; foldr f z (Cons x xs) = f x (foldr f z xs); fsEsOrdering :: Ordering -> Ordering -> MyBool; fsEsOrdering x y = not (esEsOrdering x y); map :: (a -> b) -> List a -> List b; map f Nil = Nil; map f (Cons x xs) = Cons (f x) (map f xs); not :: MyBool -> MyBool; not MyTrue = MyFalse; not MyFalse = MyTrue; notElemOrdering :: Ordering -> List Ordering -> MyBool; notElemOrdering = pt all fsEsOrdering; pt :: (b -> c) -> (a -> b) -> a -> c; pt f g x = f (g x); } ---------------------------------------- (1) BR (EQUIVALENT) Replaced joker patterns by fresh variables and removed binding patterns. ---------------------------------------- (2) Obligation: mainModule Main module Main where { import qualified Prelude; data List a = Cons a (List a) | Nil ; data MyBool = MyTrue | MyFalse ; data Ordering = LT | EQ | GT ; all :: (a -> MyBool) -> List a -> MyBool; all p = pt and (map p);
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Funct Progr 77531