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	n035.star.cs.uiowa.edu
space	basic_haskell

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	4.16017 seconds
cpu usage	9.60698
user time	9.31488
system time	0.292108
max virtual memory	1.828352E7
max residence set size	568556.0

stage attributes

key	value
starexec-result	YES

output

7.76/3.61 YES 9.51/4.09 proof of /export/starexec/sandbox/benchmark/theBenchmark.hs 9.51/4.09 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 9.51/4.09 9.51/4.09 9.51/4.09 H-Termination with start terms of the given HASKELL could be proven: 9.51/4.09 9.51/4.09 (0) HASKELL 9.51/4.09 (1) BR [EQUIVALENT, 0 ms] 9.51/4.09 (2) HASKELL 9.51/4.09 (3) COR [EQUIVALENT, 0 ms] 9.51/4.09 (4) HASKELL 9.51/4.09 (5) Narrow [SOUND, 0 ms] 9.51/4.09 (6) QDP 9.51/4.09 (7) QDPSizeChangeProof [EQUIVALENT, 0 ms] 9.51/4.09 (8) YES 9.51/4.09 9.51/4.09 9.51/4.09 ---------------------------------------- 9.51/4.09 9.51/4.09 (0) 9.51/4.09 Obligation: 9.51/4.09 mainModule Main 9.51/4.09 module Main where { 9.51/4.09 import qualified Prelude; 9.51/4.09 data List a = Cons a (List a) | Nil ; 9.51/4.09 9.51/4.09 data Main.Maybe a = Nothing | Just a ; 9.51/4.09 9.51/4.09 data Tup0 = Tup0 ; 9.51/4.09 9.51/4.09 foldr :: (a -> b -> b) -> b -> List a -> b; 9.51/4.09 foldr f z Nil = z; 9.51/4.09 foldr f z (Cons x xs) = f x (foldr f z xs); 9.51/4.09 9.51/4.09 gtGt0 q vv = q; 9.51/4.09 9.51/4.09 gtGtEsMaybe :: Main.Maybe a -> (a -> Main.Maybe b) -> Main.Maybe b; 9.51/4.09 gtGtEsMaybe (Main.Just x) k = k x; 9.51/4.09 gtGtEsMaybe Main.Nothing k = Main.Nothing; 9.51/4.09 9.51/4.09 gtGtMaybe :: Main.Maybe b -> Main.Maybe a -> Main.Maybe a; 9.51/4.09 gtGtMaybe p q = gtGtEsMaybe p (gtGt0 q); 9.51/4.09 9.51/4.09 map :: (a -> b) -> List a -> List b; 9.51/4.10 map f Nil = Nil; 9.51/4.10 map f (Cons x xs) = Cons (f x) (map f xs); 9.51/4.10 9.51/4.10 mapM_ f = pt sequence_Maybe (map f); 9.51/4.10 9.51/4.10 pt :: (b -> a) -> (c -> b) -> c -> a; 9.51/4.10 pt f g x = f (g x); 9.51/4.10 9.51/4.10 returnMaybe :: a -> Main.Maybe a; 9.51/4.10 returnMaybe = Main.Just; 9.51/4.10 9.51/4.10 sequence_Maybe :: List (Main.Maybe a) -> Main.Maybe Tup0; 9.51/4.10 sequence_Maybe = foldr gtGtMaybe (returnMaybe Tup0); 9.51/4.10 9.51/4.10 } 9.51/4.10 9.51/4.10 ---------------------------------------- 9.51/4.10 9.51/4.10 (1) BR (EQUIVALENT) 9.51/4.10 Replaced joker patterns by fresh variables and removed binding patterns. 9.51/4.10 ---------------------------------------- 9.51/4.10 9.51/4.10 (2) 9.51/4.10 Obligation: 9.51/4.10 mainModule Main 9.51/4.10 module Main where { 9.51/4.10 import qualified Prelude; 9.51/4.10 data List a = Cons a (List a) | Nil ; 9.51/4.10 9.51/4.10 data Main.Maybe a = Nothing | Just a ; 9.51/4.10 9.51/4.10 data Tup0 = Tup0 ; 9.51/4.10 9.51/4.10 foldr :: (a -> b -> b) -> b -> List a -> b; 9.51/4.10 foldr f z Nil = z; 9.51/4.10 foldr f z (Cons x xs) = f x (foldr f z xs); 9.51/4.10 9.51/4.10 gtGt0 q vv = q; 9.51/4.10 9.51/4.10 gtGtEsMaybe :: Main.Maybe a -> (a -> Main.Maybe b) -> Main.Maybe b; 9.51/4.10 gtGtEsMaybe (Main.Just x) k = k x; 9.51/4.10 gtGtEsMaybe Main.Nothing k = Main.Nothing; 9.51/4.10 9.51/4.10 gtGtMaybe :: Main.Maybe b -> Main.Maybe a -> Main.Maybe a; 9.51/4.10 gtGtMaybe p q = gtGtEsMaybe p (gtGt0 q); 9.51/4.10 9.51/4.10 map :: (b -> a) -> List b -> List a; 9.51/4.10 map f Nil = Nil; 9.51/4.10 map f (Cons x xs) = Cons (f x) (map f xs); 9.51/4.10 9.51/4.10 mapM_ f = pt sequence_Maybe (map f); 9.51/4.10 9.51/4.10 pt :: (b -> c) -> (a -> b) -> a -> c; 9.51/4.10 pt f g x = f (g x); 9.51/4.10 popout

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

job log

popout

actions

all output return to Haskell 2019-04-01 06.52