details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	4.24218 seconds
cpu usage	9.98323
user time	9.61075
system time	0.372482
max virtual memory	1.8286052E7
max residence set size	577308.0

stage attributes

key	value
starexec-result	YES

output

7.86/3.63 YES 9.88/4.18 proof of /export/starexec/sandbox/benchmark/theBenchmark.hs 9.88/4.18 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 9.88/4.18 9.88/4.18 9.88/4.18 H-Termination with start terms of the given HASKELL could be proven: 9.88/4.18 9.88/4.18 (0) HASKELL 9.88/4.18 (1) BR [EQUIVALENT, 0 ms] 9.88/4.18 (2) HASKELL 9.88/4.18 (3) COR [EQUIVALENT, 0 ms] 9.88/4.18 (4) HASKELL 9.88/4.18 (5) Narrow [SOUND, 0 ms] 9.88/4.18 (6) QDP 9.88/4.18 (7) QDPSizeChangeProof [EQUIVALENT, 0 ms] 9.88/4.18 (8) YES 9.88/4.18 9.88/4.18 9.88/4.18 ---------------------------------------- 9.88/4.18 9.88/4.18 (0) 9.88/4.18 Obligation: 9.88/4.18 mainModule Main 9.88/4.18 module Main where { 9.88/4.18 import qualified Prelude; 9.88/4.18 data List a = Cons a (List a) | Nil ; 9.88/4.18 9.88/4.18 data MyBool = MyTrue | MyFalse ; 9.88/4.18 9.88/4.18 data Ordering = LT | EQ | GT ; 9.88/4.18 9.88/4.18 foldl :: (b -> a -> b) -> b -> List a -> b; 9.88/4.18 foldl f z Nil = z; 9.88/4.18 foldl f z (Cons x xs) = foldl f (f z x) xs; 9.88/4.18 9.88/4.18 foldl1 :: (a -> a -> a) -> List a -> a; 9.88/4.18 foldl1 f (Cons x xs) = foldl f x xs; 9.88/4.18 9.88/4.18 ltEsOrdering :: Ordering -> Ordering -> MyBool; 9.88/4.18 ltEsOrdering LT LT = MyTrue; 9.88/4.18 ltEsOrdering LT EQ = MyTrue; 9.88/4.18 ltEsOrdering LT GT = MyTrue; 9.88/4.18 ltEsOrdering EQ LT = MyFalse; 9.88/4.18 ltEsOrdering EQ EQ = MyTrue; 9.88/4.18 ltEsOrdering EQ GT = MyTrue; 9.88/4.18 ltEsOrdering GT LT = MyFalse; 9.88/4.18 ltEsOrdering GT EQ = MyFalse; 9.88/4.18 ltEsOrdering GT GT = MyTrue; 9.88/4.18 9.88/4.18 max0 x y MyTrue = x; 9.88/4.18 9.88/4.18 max1 x y MyTrue = y; 9.88/4.18 max1 x y MyFalse = max0 x y otherwise; 9.88/4.18 9.88/4.18 max2 x y = max1 x y (ltEsOrdering x y); 9.88/4.18 9.88/4.18 maxOrdering :: Ordering -> Ordering -> Ordering; 9.88/4.18 maxOrdering x y = max2 x y; 9.88/4.18 9.88/4.18 maximumOrdering :: List Ordering -> Ordering; 9.88/4.18 maximumOrdering = foldl1 maxOrdering; 9.88/4.18 9.88/4.18 otherwise :: MyBool; 9.88/4.18 otherwise = MyTrue; 9.88/4.18 9.88/4.18 } 9.88/4.18 9.88/4.18 ---------------------------------------- 9.88/4.18 9.88/4.18 (1) BR (EQUIVALENT) 9.88/4.18 Replaced joker patterns by fresh variables and removed binding patterns. 9.88/4.18 ---------------------------------------- 9.88/4.18 9.88/4.18 (2) 9.88/4.18 Obligation: 9.88/4.18 mainModule Main 9.88/4.18 module Main where { 9.88/4.18 import qualified Prelude; 9.88/4.18 data List a = Cons a (List a) | Nil ; 9.88/4.18 9.88/4.18 data MyBool = MyTrue | MyFalse ; 9.88/4.18 9.88/4.18 data Ordering = LT | EQ | GT ; 9.88/4.18 9.88/4.18 foldl :: (a -> b -> a) -> a -> List b -> a; 9.88/4.18 foldl f z Nil = z; 9.88/4.18 foldl f z (Cons x xs) = foldl f (f z x) xs; 9.88/4.18 9.88/4.18 foldl1 :: (a -> a -> a) -> List a -> a; 9.88/4.18 foldl1 f (Cons x xs) = foldl f x xs; 9.88/4.18 9.88/4.18 ltEsOrdering :: Ordering -> Ordering -> MyBool; 9.88/4.18 ltEsOrdering LT LT = MyTrue; 9.88/4.18 ltEsOrdering LT EQ = MyTrue; 9.88/4.18 ltEsOrdering LT GT = MyTrue; 9.88/4.18 ltEsOrdering EQ LT = MyFalse; 9.88/4.18 ltEsOrdering EQ EQ = MyTrue; 9.88/4.18 ltEsOrdering EQ GT = MyTrue; 9.88/4.18 ltEsOrdering GT LT = MyFalse; 9.88/4.18 ltEsOrdering GT EQ = 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