Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Haskell 2019-04-01 06.52 pair #433317129
details
property
value
status
complete
benchmark
showSigned_1.hs
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n082.star.cs.uiowa.edu
space
basic_haskell
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
4.77801 seconds
cpu usage
12.1123
user time
11.7773
system time
0.334982
max virtual memory
1.8285568E7
max residence set size
654004.0
stage attributes
key
value
starexec-result
YES
output
9.50/4.04 YES 11.98/4.72 proof of /export/starexec/sandbox/benchmark/theBenchmark.hs 11.98/4.72 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 11.98/4.72 11.98/4.72 11.98/4.72 H-Termination with start terms of the given HASKELL could be proven: 11.98/4.72 11.98/4.72 (0) HASKELL 11.98/4.72 (1) BR [EQUIVALENT, 0 ms] 11.98/4.72 (2) HASKELL 11.98/4.72 (3) COR [EQUIVALENT, 0 ms] 11.98/4.72 (4) HASKELL 11.98/4.72 (5) Narrow [SOUND, 0 ms] 11.98/4.72 (6) AND 11.98/4.72 (7) QDP 11.98/4.72 (8) QDPSizeChangeProof [EQUIVALENT, 0 ms] 11.98/4.72 (9) YES 11.98/4.72 (10) QDP 11.98/4.72 (11) QDPSizeChangeProof [EQUIVALENT, 0 ms] 11.98/4.72 (12) YES 11.98/4.72 11.98/4.72 11.98/4.72 ---------------------------------------- 11.98/4.72 11.98/4.72 (0) 11.98/4.72 Obligation: 11.98/4.72 mainModule Main 11.98/4.72 module Main where { 11.98/4.72 import qualified Prelude; 11.98/4.72 data Main.Char = Char MyInt ; 11.98/4.72 11.98/4.72 data List a = Cons a (List a) | Nil ; 11.98/4.72 11.98/4.72 data MyBool = MyTrue | MyFalse ; 11.98/4.72 11.98/4.72 data MyInt = Pos Main.Nat | Neg Main.Nat ; 11.98/4.72 11.98/4.72 data Main.Nat = Succ Main.Nat | Zero ; 11.98/4.72 11.98/4.72 data Ordering = LT | EQ | GT ; 11.98/4.72 11.98/4.72 data Ratio a = CnPc a a ; 11.98/4.72 11.98/4.72 compareMyInt :: MyInt -> MyInt -> Ordering; 11.98/4.72 compareMyInt = primCmpInt; 11.98/4.72 11.98/4.72 compareRatio :: Ratio MyInt -> Ratio MyInt -> Ordering; 11.98/4.72 compareRatio (CnPc x y) (CnPc x' y') = compareMyInt (srMyInt x y') (srMyInt x' y); 11.98/4.72 11.98/4.72 esEsOrdering :: Ordering -> Ordering -> MyBool; 11.98/4.72 esEsOrdering LT LT = MyTrue; 11.98/4.72 esEsOrdering LT EQ = MyFalse; 11.98/4.72 esEsOrdering LT GT = MyFalse; 11.98/4.72 esEsOrdering EQ LT = MyFalse; 11.98/4.72 esEsOrdering EQ EQ = MyTrue; 11.98/4.72 esEsOrdering EQ GT = MyFalse; 11.98/4.72 esEsOrdering GT LT = MyFalse; 11.98/4.72 esEsOrdering GT EQ = MyFalse; 11.98/4.72 esEsOrdering GT GT = MyTrue; 11.98/4.72 11.98/4.72 fromIntMyInt :: MyInt -> MyInt; 11.98/4.72 fromIntMyInt x = x; 11.98/4.72 11.98/4.72 fromIntRatio :: MyInt -> Ratio MyInt; 11.98/4.72 fromIntRatio = intToRatio; 11.98/4.72 11.98/4.72 gtMyInt :: MyInt -> MyInt -> MyBool; 11.98/4.72 gtMyInt x y = esEsOrdering (compareMyInt x y) GT; 11.98/4.72 11.98/4.72 intToRatio x = CnPc (fromIntMyInt x) (fromIntMyInt (Main.Pos (Main.Succ Main.Zero))); 11.98/4.72 11.98/4.72 ltRatio :: Ratio MyInt -> Ratio MyInt -> MyBool; 11.98/4.72 ltRatio x y = esEsOrdering (compareRatio x y) LT; 11.98/4.72 11.98/4.72 negateMyInt :: MyInt -> MyInt; 11.98/4.72 negateMyInt = primNegInt; 11.98/4.72 11.98/4.72 negateRatio :: Ratio MyInt -> Ratio MyInt; 11.98/4.72 negateRatio (CnPc x y) = CnPc (negateMyInt x) y; 11.98/4.72 11.98/4.72 primCmpInt :: MyInt -> MyInt -> Ordering; 11.98/4.72 primCmpInt (Main.Pos Main.Zero) (Main.Pos Main.Zero) = EQ; 11.98/4.72 primCmpInt (Main.Pos Main.Zero) (Main.Neg Main.Zero) = EQ; 11.98/4.72 primCmpInt (Main.Neg Main.Zero) (Main.Pos Main.Zero) = EQ; 11.98/4.72 primCmpInt (Main.Neg Main.Zero) (Main.Neg Main.Zero) = EQ; 11.98/4.72 primCmpInt (Main.Pos x) (Main.Pos y) = primCmpNat x y; 11.98/4.72 primCmpInt (Main.Pos x) (Main.Neg y) = GT; 11.98/4.72 primCmpInt (Main.Neg x) (Main.Pos y) = LT; 11.98/4.72 primCmpInt (Main.Neg x) (Main.Neg y) = primCmpNat y x; 11.98/4.72 11.98/4.72 primCmpNat :: Main.Nat -> Main.Nat -> Ordering; 11.98/4.72 primCmpNat Main.Zero Main.Zero = EQ; 11.98/4.72 primCmpNat Main.Zero (Main.Succ y) = LT; 11.98/4.72 primCmpNat (Main.Succ x) Main.Zero = GT; 11.98/4.72 primCmpNat (Main.Succ x) (Main.Succ y) = primCmpNat x y; 11.98/4.72 11.98/4.72 primMulInt :: MyInt -> MyInt -> MyInt; 11.98/4.72 primMulInt (Main.Pos x) (Main.Pos y) = Main.Pos (primMulNat x y); 11.98/4.72 primMulInt (Main.Pos x) (Main.Neg y) = Main.Neg (primMulNat x y); 11.98/4.72 primMulInt (Main.Neg x) (Main.Pos 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