Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Haskell 2019-04-01 06.52 pair #433317466
details
property
value
status
complete
benchmark
enumFrom_4.hs
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n120.star.cs.uiowa.edu
space
basic_haskell
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
4.53245 seconds
cpu usage
11.2577
user time
10.9067
system time
0.351001
max virtual memory
1.8285568E7
max residence set size
623220.0
stage attributes
key
value
starexec-result
MAYBE
output
8.99/3.90 MAYBE 11.11/4.50 proof of /export/starexec/sandbox/benchmark/theBenchmark.hs 11.11/4.50 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 11.11/4.50 11.11/4.50 11.11/4.50 H-Termination with start terms of the given HASKELL could not be shown: 11.11/4.50 11.11/4.50 (0) HASKELL 11.11/4.50 (1) BR [EQUIVALENT, 0 ms] 11.11/4.50 (2) HASKELL 11.11/4.50 (3) COR [EQUIVALENT, 0 ms] 11.11/4.50 (4) HASKELL 11.11/4.50 (5) Narrow [SOUND, 0 ms] 11.11/4.50 (6) AND 11.11/4.50 (7) QDP 11.11/4.50 (8) MRRProof [EQUIVALENT, 121 ms] 11.11/4.50 (9) QDP 11.11/4.50 (10) NonTerminationLoopProof [COMPLETE, 0 ms] 11.11/4.50 (11) NO 11.11/4.50 (12) QDP 11.11/4.50 (13) QDPSizeChangeProof [EQUIVALENT, 0 ms] 11.11/4.50 (14) YES 11.11/4.50 (15) Narrow [COMPLETE, 0 ms] 11.11/4.50 (16) TRUE 11.11/4.50 11.11/4.50 11.11/4.50 ---------------------------------------- 11.11/4.50 11.11/4.50 (0) 11.11/4.50 Obligation: 11.11/4.50 mainModule Main 11.11/4.50 module Main where { 11.11/4.50 import qualified Prelude; 11.11/4.50 data Float = Float MyInt MyInt ; 11.11/4.50 11.11/4.50 data List a = Cons a (List a) | Nil ; 11.11/4.50 11.11/4.50 data MyInt = Pos Main.Nat | Neg Main.Nat ; 11.11/4.50 11.11/4.50 data Main.Nat = Succ Main.Nat | Zero ; 11.11/4.50 11.11/4.50 data Main.WHNF a = WHNF a ; 11.11/4.50 11.11/4.50 dsEm :: (b -> a) -> b -> a; 11.11/4.50 dsEm f x = Main.seq x (f x); 11.11/4.50 11.11/4.50 enforceWHNF :: Main.WHNF a -> b -> b; 11.11/4.50 enforceWHNF (Main.WHNF x) y = y; 11.11/4.50 11.11/4.50 enumFromFloat :: Float -> List Float; 11.11/4.50 enumFromFloat = numericEnumFrom; 11.11/4.50 11.11/4.50 fromIntFloat :: MyInt -> Float; 11.11/4.50 fromIntFloat = primIntToFloat; 11.11/4.50 11.11/4.50 numericEnumFrom n = Cons n (dsEm numericEnumFrom (psFloat n (fromIntFloat (Main.Pos (Main.Succ Main.Zero))))); 11.11/4.50 11.11/4.50 primIntToFloat :: MyInt -> Float; 11.11/4.50 primIntToFloat x = Float x (Main.Pos (Main.Succ Main.Zero)); 11.11/4.50 11.11/4.50 primMinusNat :: Main.Nat -> Main.Nat -> MyInt; 11.11/4.50 primMinusNat Main.Zero Main.Zero = Main.Pos Main.Zero; 11.11/4.50 primMinusNat Main.Zero (Main.Succ y) = Main.Neg (Main.Succ y); 11.11/4.50 primMinusNat (Main.Succ x) Main.Zero = Main.Pos (Main.Succ x); 11.11/4.50 primMinusNat (Main.Succ x) (Main.Succ y) = primMinusNat x y; 11.11/4.50 11.11/4.50 primMulInt :: MyInt -> MyInt -> MyInt; 11.11/4.50 primMulInt (Main.Pos x) (Main.Pos y) = Main.Pos (primMulNat x y); 11.11/4.50 primMulInt (Main.Pos x) (Main.Neg y) = Main.Neg (primMulNat x y); 11.11/4.50 primMulInt (Main.Neg x) (Main.Pos y) = Main.Neg (primMulNat x y); 11.11/4.50 primMulInt (Main.Neg x) (Main.Neg y) = Main.Pos (primMulNat x y); 11.11/4.50 11.11/4.50 primMulNat :: Main.Nat -> Main.Nat -> Main.Nat; 11.11/4.50 primMulNat Main.Zero Main.Zero = Main.Zero; 11.11/4.50 primMulNat Main.Zero (Main.Succ y) = Main.Zero; 11.11/4.50 primMulNat (Main.Succ x) Main.Zero = Main.Zero; 11.11/4.50 primMulNat (Main.Succ x) (Main.Succ y) = primPlusNat (primMulNat x (Main.Succ y)) (Main.Succ y); 11.11/4.50 11.11/4.50 primPlusFloat :: Float -> Float -> Float; 11.11/4.50 primPlusFloat (Float x1 x2) (Float y1 y2) = Float (psMyInt x1 y1) (srMyInt x2 y2); 11.11/4.50 11.11/4.50 primPlusInt :: MyInt -> MyInt -> MyInt; 11.11/4.50 primPlusInt (Main.Pos x) (Main.Neg y) = primMinusNat x y; 11.11/4.50 primPlusInt (Main.Neg x) (Main.Pos y) = primMinusNat y x; 11.11/4.50 primPlusInt (Main.Neg x) (Main.Neg y) = Main.Neg (primPlusNat x y); 11.11/4.50 primPlusInt (Main.Pos x) (Main.Pos y) = Main.Pos (primPlusNat x y); 11.11/4.50 11.11/4.50 primPlusNat :: Main.Nat -> Main.Nat -> Main.Nat; 11.11/4.50 primPlusNat Main.Zero Main.Zero = Main.Zero; 11.11/4.50 primPlusNat Main.Zero (Main.Succ y) = Main.Succ y; 11.11/4.50 primPlusNat (Main.Succ x) Main.Zero = Main.Succ x; 11.11/4.50 primPlusNat (Main.Succ x) (Main.Succ y) = Main.Succ (Main.Succ (primPlusNat x y)); 11.11/4.50 11.11/4.50 psFloat :: Float -> Float -> Float; 11.11/4.50 psFloat = primPlusFloat; 11.11/4.50 11.11/4.50 psMyInt :: MyInt -> MyInt -> MyInt; 11.11/4.50 psMyInt = primPlusInt; 11.11/4.50 11.11/4.50 seq :: a -> b -> b;
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Haskell 2019-04-01 06.52