Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Haskell 2019-04-01 06.52 pair #433317341
details
property
value
status
complete
benchmark
notElem_4.hs
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n004.star.cs.uiowa.edu
space
basic_haskell
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
4.35303 seconds
cpu usage
10.6889
user time
10.3688
system time
0.320108
max virtual memory
1.8285568E7
max residence set size
611240.0
stage attributes
key
value
starexec-result
YES
output
8.61/3.76 YES 10.63/4.32 proof of /export/starexec/sandbox/benchmark/theBenchmark.hs 10.63/4.32 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 10.63/4.32 10.63/4.32 10.63/4.32 H-Termination with start terms of the given HASKELL could be proven: 10.63/4.32 10.63/4.32 (0) HASKELL 10.63/4.32 (1) BR [EQUIVALENT, 0 ms] 10.63/4.32 (2) HASKELL 10.63/4.32 (3) COR [EQUIVALENT, 0 ms] 10.63/4.32 (4) HASKELL 10.63/4.32 (5) Narrow [SOUND, 0 ms] 10.63/4.32 (6) AND 10.63/4.32 (7) QDP 10.63/4.32 (8) QDPSizeChangeProof [EQUIVALENT, 0 ms] 10.63/4.32 (9) YES 10.63/4.32 (10) QDP 10.63/4.32 (11) QDPSizeChangeProof [EQUIVALENT, 0 ms] 10.63/4.32 (12) YES 10.63/4.32 (13) QDP 10.63/4.32 (14) QDPSizeChangeProof [EQUIVALENT, 0 ms] 10.63/4.32 (15) YES 10.63/4.32 (16) QDP 10.63/4.32 (17) QDPSizeChangeProof [EQUIVALENT, 0 ms] 10.63/4.32 (18) YES 10.63/4.32 10.63/4.32 10.63/4.32 ---------------------------------------- 10.63/4.32 10.63/4.32 (0) 10.63/4.32 Obligation: 10.63/4.32 mainModule Main 10.63/4.32 module Main where { 10.63/4.32 import qualified Prelude; 10.63/4.32 data Float = Float MyInt MyInt ; 10.63/4.32 10.63/4.32 data List a = Cons a (List a) | Nil ; 10.63/4.32 10.63/4.32 data MyBool = MyTrue | MyFalse ; 10.63/4.32 10.63/4.32 data MyInt = Pos Main.Nat | Neg Main.Nat ; 10.63/4.32 10.63/4.32 data Main.Nat = Succ Main.Nat | Zero ; 10.63/4.32 10.63/4.32 all :: (a -> MyBool) -> List a -> MyBool; 10.63/4.32 all p = pt and (map p); 10.63/4.32 10.63/4.32 and :: List MyBool -> MyBool; 10.63/4.32 and = foldr asAs MyTrue; 10.63/4.32 10.63/4.32 asAs :: MyBool -> MyBool -> MyBool; 10.63/4.32 asAs MyFalse x = MyFalse; 10.63/4.32 asAs MyTrue x = x; 10.63/4.32 10.63/4.32 esEsFloat :: Float -> Float -> MyBool; 10.63/4.32 esEsFloat = primEqFloat; 10.63/4.32 10.63/4.32 esEsMyInt :: MyInt -> MyInt -> MyBool; 10.63/4.32 esEsMyInt = primEqInt; 10.63/4.32 10.63/4.32 foldr :: (b -> a -> a) -> a -> List b -> a; 10.63/4.32 foldr f z Nil = z; 10.63/4.32 foldr f z (Cons x xs) = f x (foldr f z xs); 10.63/4.32 10.63/4.32 fsEsFloat :: Float -> Float -> MyBool; 10.63/4.32 fsEsFloat x y = not (esEsFloat x y); 10.63/4.32 10.63/4.32 map :: (b -> a) -> List b -> List a; 10.63/4.32 map f Nil = Nil; 10.63/4.32 map f (Cons x xs) = Cons (f x) (map f xs); 10.63/4.32 10.63/4.32 not :: MyBool -> MyBool; 10.63/4.32 not MyTrue = MyFalse; 10.63/4.32 not MyFalse = MyTrue; 10.63/4.32 10.63/4.32 notElemFloat :: Float -> List Float -> MyBool; 10.63/4.32 notElemFloat = pt all fsEsFloat; 10.63/4.32 10.63/4.32 primEqFloat :: Float -> Float -> MyBool; 10.63/4.32 primEqFloat (Float x1 x2) (Float y1 y2) = esEsMyInt (srMyInt x1 y1) (srMyInt x2 y2); 10.63/4.32 10.63/4.32 primEqInt :: MyInt -> MyInt -> MyBool; 10.63/4.32 primEqInt (Main.Pos (Main.Succ x)) (Main.Pos (Main.Succ y)) = primEqNat x y; 10.63/4.32 primEqInt (Main.Neg (Main.Succ x)) (Main.Neg (Main.Succ y)) = primEqNat x y; 10.63/4.32 primEqInt (Main.Pos Main.Zero) (Main.Neg Main.Zero) = MyTrue; 10.63/4.32 primEqInt (Main.Neg Main.Zero) (Main.Pos Main.Zero) = MyTrue; 10.63/4.32 primEqInt (Main.Neg Main.Zero) (Main.Neg Main.Zero) = MyTrue; 10.63/4.32 primEqInt (Main.Pos Main.Zero) (Main.Pos Main.Zero) = MyTrue; 10.63/4.32 primEqInt vv vw = MyFalse; 10.63/4.32 10.63/4.32 primEqNat :: Main.Nat -> Main.Nat -> MyBool; 10.63/4.32 primEqNat Main.Zero Main.Zero = MyTrue; 10.63/4.32 primEqNat Main.Zero (Main.Succ y) = MyFalse; 10.63/4.32 primEqNat (Main.Succ x) Main.Zero = MyFalse; 10.63/4.32 primEqNat (Main.Succ x) (Main.Succ y) = primEqNat x y; 10.63/4.32 10.63/4.32 primMulInt :: MyInt -> MyInt -> MyInt; 10.63/4.32 primMulInt (Main.Pos x) (Main.Pos y) = Main.Pos (primMulNat x y); 10.63/4.32 primMulInt (Main.Pos x) (Main.Neg y) = Main.Neg (primMulNat x y);
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Haskell 2019-04-01 06.52