Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Haskell 2019-04-01 06.52 pair #433317417
details
property
value
status
complete
benchmark
showSigned_2.hs
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n178.star.cs.uiowa.edu
space
basic_haskell
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
5.2544 seconds
cpu usage
12.9308
user time
12.509
system time
0.421798
max virtual memory
1.8287936E7
max residence set size
835708.0
stage attributes
key
value
starexec-result
YES
output
10.35/4.45 YES 12.39/5.05 proof of /export/starexec/sandbox/benchmark/theBenchmark.hs 12.39/5.05 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 12.39/5.05 12.39/5.05 12.39/5.05 H-Termination with start terms of the given HASKELL could be proven: 12.39/5.05 12.39/5.05 (0) HASKELL 12.39/5.05 (1) BR [EQUIVALENT, 0 ms] 12.39/5.05 (2) HASKELL 12.39/5.05 (3) COR [EQUIVALENT, 0 ms] 12.39/5.05 (4) HASKELL 12.39/5.05 (5) Narrow [SOUND, 0 ms] 12.39/5.05 (6) QDP 12.39/5.05 (7) QDPSizeChangeProof [EQUIVALENT, 0 ms] 12.39/5.05 (8) YES 12.39/5.05 12.39/5.05 12.39/5.05 ---------------------------------------- 12.39/5.05 12.39/5.05 (0) 12.39/5.05 Obligation: 12.39/5.05 mainModule Main 12.39/5.05 module Main where { 12.39/5.05 import qualified Prelude; 12.39/5.05 data Main.Char = Char MyInt ; 12.39/5.05 12.39/5.05 data Float = Float MyInt MyInt ; 12.39/5.05 12.39/5.05 data List a = Cons a (List a) | Nil ; 12.39/5.05 12.39/5.05 data MyBool = MyTrue | MyFalse ; 12.39/5.05 12.39/5.05 data MyInt = Pos Main.Nat | Neg Main.Nat ; 12.39/5.05 12.39/5.05 data Main.Nat = Succ Main.Nat | Zero ; 12.39/5.05 12.39/5.05 data Ordering = LT | EQ | GT ; 12.39/5.05 12.39/5.05 compareFloat :: Float -> Float -> Ordering; 12.39/5.05 compareFloat = primCmpFloat; 12.39/5.05 12.39/5.05 compareMyInt :: MyInt -> MyInt -> Ordering; 12.39/5.05 compareMyInt = primCmpInt; 12.39/5.05 12.39/5.05 esEsOrdering :: Ordering -> Ordering -> MyBool; 12.39/5.05 esEsOrdering LT LT = MyTrue; 12.39/5.05 esEsOrdering LT EQ = MyFalse; 12.39/5.05 esEsOrdering LT GT = MyFalse; 12.39/5.05 esEsOrdering EQ LT = MyFalse; 12.39/5.05 esEsOrdering EQ EQ = MyTrue; 12.39/5.05 esEsOrdering EQ GT = MyFalse; 12.39/5.05 esEsOrdering GT LT = MyFalse; 12.39/5.05 esEsOrdering GT EQ = MyFalse; 12.39/5.05 esEsOrdering GT GT = MyTrue; 12.39/5.05 12.39/5.05 fromIntFloat :: MyInt -> Float; 12.39/5.05 fromIntFloat = primIntToFloat; 12.39/5.05 12.39/5.05 gtMyInt :: MyInt -> MyInt -> MyBool; 12.39/5.05 gtMyInt x y = esEsOrdering (compareMyInt x y) GT; 12.39/5.05 12.39/5.05 ltFloat :: Float -> Float -> MyBool; 12.39/5.05 ltFloat x y = esEsOrdering (compareFloat x y) LT; 12.39/5.05 12.39/5.05 negateFloat :: Float -> Float; 12.39/5.05 negateFloat = primNegFloat; 12.39/5.05 12.39/5.05 negateMyInt :: MyInt -> MyInt; 12.39/5.05 negateMyInt = primNegInt; 12.39/5.05 12.39/5.05 primCmpFloat :: Float -> Float -> Ordering; 12.39/5.05 primCmpFloat (Float x1 x2) (Float y1 y2) = compareMyInt (srMyInt x1 y1) (srMyInt x2 y2); 12.39/5.05 12.39/5.05 primCmpInt :: MyInt -> MyInt -> Ordering; 12.39/5.05 primCmpInt (Main.Pos Main.Zero) (Main.Pos Main.Zero) = EQ; 12.39/5.05 primCmpInt (Main.Pos Main.Zero) (Main.Neg Main.Zero) = EQ; 12.39/5.05 primCmpInt (Main.Neg Main.Zero) (Main.Pos Main.Zero) = EQ; 12.39/5.05 primCmpInt (Main.Neg Main.Zero) (Main.Neg Main.Zero) = EQ; 12.39/5.05 primCmpInt (Main.Pos x) (Main.Pos y) = primCmpNat x y; 12.39/5.05 primCmpInt (Main.Pos x) (Main.Neg y) = GT; 12.39/5.05 primCmpInt (Main.Neg x) (Main.Pos y) = LT; 12.39/5.05 primCmpInt (Main.Neg x) (Main.Neg y) = primCmpNat y x; 12.39/5.05 12.39/5.05 primCmpNat :: Main.Nat -> Main.Nat -> Ordering; 12.39/5.05 primCmpNat Main.Zero Main.Zero = EQ; 12.39/5.05 primCmpNat Main.Zero (Main.Succ y) = LT; 12.39/5.05 primCmpNat (Main.Succ x) Main.Zero = GT; 12.39/5.05 primCmpNat (Main.Succ x) (Main.Succ y) = primCmpNat x y; 12.39/5.05 12.39/5.05 primIntToFloat :: MyInt -> Float; 12.39/5.05 primIntToFloat x = Float x (Main.Pos (Main.Succ Main.Zero)); 12.39/5.05 12.39/5.05 primMulInt :: MyInt -> MyInt -> MyInt; 12.39/5.05 primMulInt (Main.Pos x) (Main.Pos y) = Main.Pos (primMulNat x y); 12.39/5.05 primMulInt (Main.Pos x) (Main.Neg y) = Main.Neg (primMulNat x y); 12.39/5.05 primMulInt (Main.Neg x) (Main.Pos y) = Main.Neg (primMulNat x y); 12.39/5.05 primMulInt (Main.Neg x) (Main.Neg y) = Main.Pos (primMulNat x y); 12.39/5.05 12.39/5.05 primMulNat :: Main.Nat -> Main.Nat -> Main.Nat;
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Haskell 2019-04-01 06.52