details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	4.06141 seconds
cpu usage	9.89335
user time	9.60329
system time	0.290056
max virtual memory	1.8283432E7
max residence set size	588960.0

stage attributes

key	value
starexec-result	YES

output

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