Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Haskell pair #487598178
details
property
value
status
complete
benchmark
mapM_1.hs
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n074.star.cs.uiowa.edu
space
basic_haskell
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
4.15291619301 seconds
cpu usage
9.876537326
max memory
5.64035584E8
stage attributes
key
value
output-size
9361
starexec-result
YES
output
/export/starexec/sandbox/solver/bin/starexec_run_standard /export/starexec/sandbox/benchmark/theBenchmark.hs /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES proof of /export/starexec/sandbox/benchmark/theBenchmark.hs # AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 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 Main.Maybe a = Nothing | Just a ; gtGtEsMaybe :: Main.Maybe b -> (b -> Main.Maybe a) -> Main.Maybe a; gtGtEsMaybe (Main.Just x) k = k x; gtGtEsMaybe Main.Nothing k = Main.Nothing; map :: (b -> a) -> List b -> List a; map f Nil = Nil; map f (Cons x xs) = Cons (f x) (map f xs); mapM f = pt sequence (map f); pt :: (c -> b) -> (a -> c) -> a -> b; pt f g x = f (g x); returnMaybe :: a -> Main.Maybe a; returnMaybe = Main.Just; sequence Nil = returnMaybe Nil; sequence (Cons c cs) = gtGtEsMaybe c (sequence1 cs); sequence0 x xs = returnMaybe (Cons x xs); sequence1 cs x = gtGtEsMaybe (sequence cs) (sequence0 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 Main.Maybe a = Nothing | Just a ; gtGtEsMaybe :: Main.Maybe a -> (a -> Main.Maybe b) -> Main.Maybe b; gtGtEsMaybe (Main.Just x) k = k x; gtGtEsMaybe Main.Nothing k = Main.Nothing; map :: (b -> a) -> List b -> List a; map f Nil = Nil; map f (Cons x xs) = Cons (f x) (map f xs); mapM f = pt sequence (map f); pt :: (a -> c) -> (b -> a) -> b -> c; pt f g x = f (g x); returnMaybe :: a -> Main.Maybe a; returnMaybe = Main.Just; sequence Nil = returnMaybe Nil; sequence (Cons c cs) = gtGtEsMaybe c (sequence1 cs); sequence0 x xs = returnMaybe (Cons x xs); sequence1 cs x = gtGtEsMaybe (sequence cs) (sequence0 x); }
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Haskell