details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	4.36651 seconds
cpu usage	10.668
user time	10.3563
system time	0.311655
max virtual memory	1.8285568E7
max residence set size	595468.0

stage attributes

key	value
starexec-result	YES

output

8.40/3.76 YES 10.30/4.31 proof of /export/starexec/sandbox/benchmark/theBenchmark.hs 10.30/4.31 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 10.30/4.31 10.30/4.31 10.30/4.31 H-Termination with start terms of the given HASKELL could be proven: 10.30/4.31 10.30/4.31 (0) HASKELL 10.30/4.31 (1) BR [EQUIVALENT, 0 ms] 10.30/4.31 (2) HASKELL 10.30/4.31 (3) COR [EQUIVALENT, 0 ms] 10.30/4.31 (4) HASKELL 10.30/4.31 (5) Narrow [SOUND, 0 ms] 10.30/4.31 (6) AND 10.30/4.31 (7) QDP 10.30/4.31 (8) QDPSizeChangeProof [EQUIVALENT, 0 ms] 10.30/4.31 (9) YES 10.30/4.31 (10) QDP 10.30/4.31 (11) QDPSizeChangeProof [EQUIVALENT, 0 ms] 10.30/4.31 (12) YES 10.30/4.31 (13) QDP 10.30/4.31 (14) QDPSizeChangeProof [EQUIVALENT, 0 ms] 10.30/4.31 (15) YES 10.30/4.31 (16) QDP 10.30/4.31 (17) QDPSizeChangeProof [EQUIVALENT, 0 ms] 10.30/4.31 (18) YES 10.30/4.31 10.30/4.31 10.30/4.31 ---------------------------------------- 10.30/4.31 10.30/4.31 (0) 10.30/4.31 Obligation: 10.30/4.31 mainModule Main 10.30/4.31 module Main where { 10.30/4.31 import qualified Prelude; 10.30/4.31 data Float = Float MyInt MyInt ; 10.30/4.31 10.30/4.31 data List a = Cons a (List a) | Nil ; 10.30/4.31 10.30/4.31 data MyBool = MyTrue | MyFalse ; 10.30/4.31 10.30/4.31 data MyInt = Pos Main.Nat | Neg Main.Nat ; 10.30/4.31 10.30/4.31 data Main.Nat = Succ Main.Nat | Zero ; 10.30/4.31 10.30/4.31 any :: (a -> MyBool) -> List a -> MyBool; 10.30/4.31 any p = pt or (map p); 10.30/4.31 10.30/4.31 elemFloat :: Float -> List Float -> MyBool; 10.30/4.31 elemFloat = pt any esEsFloat; 10.30/4.31 10.30/4.31 esEsFloat :: Float -> Float -> MyBool; 10.30/4.31 esEsFloat = primEqFloat; 10.30/4.31 10.30/4.31 esEsMyInt :: MyInt -> MyInt -> MyBool; 10.30/4.31 esEsMyInt = primEqInt; 10.30/4.31 10.30/4.31 foldr :: (b -> a -> a) -> a -> List b -> a; 10.30/4.31 foldr f z Nil = z; 10.30/4.31 foldr f z (Cons x xs) = f x (foldr f z xs); 10.30/4.31 10.30/4.31 map :: (b -> a) -> List b -> List a; 10.30/4.31 map f Nil = Nil; 10.30/4.31 map f (Cons x xs) = Cons (f x) (map f xs); 10.30/4.31 10.30/4.31 or :: List MyBool -> MyBool; 10.30/4.31 or = foldr pePe MyFalse; 10.30/4.31 10.30/4.31 pePe :: MyBool -> MyBool -> MyBool; 10.30/4.31 pePe MyFalse x = x; 10.30/4.31 pePe MyTrue x = MyTrue; 10.30/4.31 10.30/4.31 primEqFloat :: Float -> Float -> MyBool; 10.30/4.31 primEqFloat (Float x1 x2) (Float y1 y2) = esEsMyInt (srMyInt x1 y1) (srMyInt x2 y2); 10.30/4.31 10.30/4.31 primEqInt :: MyInt -> MyInt -> MyBool; 10.30/4.31 primEqInt (Main.Pos (Main.Succ x)) (Main.Pos (Main.Succ y)) = primEqNat x y; 10.30/4.31 primEqInt (Main.Neg (Main.Succ x)) (Main.Neg (Main.Succ y)) = primEqNat x y; 10.30/4.31 primEqInt (Main.Pos Main.Zero) (Main.Neg Main.Zero) = MyTrue; 10.30/4.31 primEqInt (Main.Neg Main.Zero) (Main.Pos Main.Zero) = MyTrue; 10.30/4.31 primEqInt (Main.Neg Main.Zero) (Main.Neg Main.Zero) = MyTrue; 10.30/4.31 primEqInt (Main.Pos Main.Zero) (Main.Pos Main.Zero) = MyTrue; 10.30/4.31 primEqInt vv vw = MyFalse; 10.30/4.31 10.30/4.31 primEqNat :: Main.Nat -> Main.Nat -> MyBool; 10.30/4.31 primEqNat Main.Zero Main.Zero = MyTrue; 10.30/4.31 primEqNat Main.Zero (Main.Succ y) = MyFalse; 10.30/4.31 primEqNat (Main.Succ x) Main.Zero = MyFalse; 10.30/4.31 primEqNat (Main.Succ x) (Main.Succ y) = primEqNat x y; 10.30/4.31 10.30/4.31 primMulInt :: MyInt -> MyInt -> MyInt; 10.30/4.31 primMulInt (Main.Pos x) (Main.Pos y) = Main.Pos (primMulNat x y); 10.30/4.31 primMulInt (Main.Pos x) (Main.Neg y) = Main.Neg (primMulNat x y); 10.30/4.31 primMulInt (Main.Neg x) (Main.Pos y) = Main.Neg (primMulNat x y); 10.30/4.31 primMulInt (Main.Neg x) (Main.Neg y) = Main.Pos (primMulNat x y); 10.30/4.31 10.30/4.31 primMulNat :: Main.Nat -> Main.Nat -> Main.Nat; 10.30/4.31 primMulNat Main.Zero Main.Zero = Main.Zero; 10.30/4.31 primMulNat Main.Zero (Main.Succ y) = Main.Zero; 10.30/4.31 primMulNat (Main.Succ x) Main.Zero = Main.Zero; popout

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

job log

popout

actions

all output return to Haskell 2019-04-01 06.52