details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	15.712 seconds
cpu usage	29.7764
user time	28.6048
system time	1.1716
max virtual memory	1.8288316E7
max residence set size	3947580.0

stage attributes

key	value
starexec-result	YES

output

27.26/14.98 YES 29.38/15.60 proof of /export/starexec/sandbox/benchmark/theBenchmark.hs 29.38/15.60 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 29.38/15.60 29.38/15.60 29.38/15.60 H-Termination with start terms of the given HASKELL could be proven: 29.38/15.60 29.38/15.60 (0) HASKELL 29.38/15.60 (1) BR [EQUIVALENT, 0 ms] 29.38/15.60 (2) HASKELL 29.38/15.60 (3) COR [EQUIVALENT, 0 ms] 29.38/15.60 (4) HASKELL 29.38/15.60 (5) Narrow [SOUND, 0 ms] 29.38/15.60 (6) AND 29.38/15.60 (7) QDP 29.38/15.60 (8) QDPSizeChangeProof [EQUIVALENT, 0 ms] 29.38/15.60 (9) YES 29.38/15.60 (10) QDP 29.38/15.60 (11) QDPSizeChangeProof [EQUIVALENT, 0 ms] 29.38/15.60 (12) YES 29.38/15.60 (13) QDP 29.38/15.60 (14) QDPSizeChangeProof [EQUIVALENT, 0 ms] 29.38/15.60 (15) YES 29.38/15.60 (16) QDP 29.38/15.60 (17) QDPSizeChangeProof [EQUIVALENT, 0 ms] 29.38/15.60 (18) YES 29.38/15.60 (19) QDP 29.38/15.60 (20) QDPSizeChangeProof [EQUIVALENT, 0 ms] 29.38/15.60 (21) YES 29.38/15.60 29.38/15.60 29.38/15.60 ---------------------------------------- 29.38/15.60 29.38/15.60 (0) 29.38/15.60 Obligation: 29.38/15.60 mainModule Main 29.38/15.60 module Main where { 29.38/15.60 import qualified Prelude; 29.38/15.60 data Float = Float MyInt MyInt ; 29.38/15.60 29.38/15.60 data List a = Cons a (List a) | Nil ; 29.38/15.60 29.38/15.60 data MyBool = MyTrue | MyFalse ; 29.38/15.60 29.38/15.60 data MyInt = Pos Main.Nat | Neg Main.Nat ; 29.38/15.60 29.38/15.60 data Main.Nat = Succ Main.Nat | Zero ; 29.38/15.60 29.38/15.60 data Ordering = LT | EQ | GT ; 29.38/15.60 29.38/15.60 compareFloat :: Float -> Float -> Ordering; 29.38/15.60 compareFloat = primCmpFloat; 29.38/15.60 29.38/15.60 compareMyInt :: MyInt -> MyInt -> Ordering; 29.38/15.60 compareMyInt = primCmpInt; 29.38/15.60 29.38/15.60 esEsOrdering :: Ordering -> Ordering -> MyBool; 29.38/15.60 esEsOrdering LT LT = MyTrue; 29.38/15.60 esEsOrdering LT EQ = MyFalse; 29.38/15.60 esEsOrdering LT GT = MyFalse; 29.38/15.60 esEsOrdering EQ LT = MyFalse; 29.38/15.60 esEsOrdering EQ EQ = MyTrue; 29.38/15.60 esEsOrdering EQ GT = MyFalse; 29.38/15.60 esEsOrdering GT LT = MyFalse; 29.38/15.60 esEsOrdering GT EQ = MyFalse; 29.38/15.60 esEsOrdering GT GT = MyTrue; 29.38/15.60 29.38/15.60 foldl :: (b -> a -> b) -> b -> List a -> b; 29.38/15.60 foldl f z Nil = z; 29.38/15.60 foldl f z (Cons x xs) = foldl f (f z x) xs; 29.38/15.60 29.38/15.60 foldl1 :: (a -> a -> a) -> List a -> a; 29.38/15.60 foldl1 f (Cons x xs) = foldl f x xs; 29.38/15.60 29.38/15.60 fsEsOrdering :: Ordering -> Ordering -> MyBool; 29.38/15.60 fsEsOrdering x y = not (esEsOrdering x y); 29.38/15.60 29.38/15.60 ltEsFloat :: Float -> Float -> MyBool; 29.38/15.60 ltEsFloat x y = fsEsOrdering (compareFloat x y) GT; 29.38/15.60 29.38/15.60 max0 x y MyTrue = x; 29.38/15.60 29.38/15.60 max1 x y MyTrue = y; 29.38/15.60 max1 x y MyFalse = max0 x y otherwise; 29.38/15.60 29.38/15.60 max2 x y = max1 x y (ltEsFloat x y); 29.38/15.60 29.38/15.60 maxFloat :: Float -> Float -> Float; 29.38/15.60 maxFloat x y = max2 x y; 29.38/15.60 29.38/15.60 maximumFloat :: List Float -> Float; 29.38/15.60 maximumFloat = foldl1 maxFloat; 29.38/15.60 29.38/15.60 not :: MyBool -> MyBool; 29.38/15.60 not MyTrue = MyFalse; 29.38/15.60 not MyFalse = MyTrue; 29.38/15.60 29.38/15.60 otherwise :: MyBool; 29.38/15.60 otherwise = MyTrue; 29.38/15.60 popout

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

job log

popout

actions

all output return to Haskell 2019-04-01 06.52