Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Haskell 2019-04-01 06.52 pair #433317387
details
property
value
status
complete
benchmark
fromEnum_2.hs
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n037.star.cs.uiowa.edu
space
basic_haskell
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
4.59264 seconds
cpu usage
11.1659
user time
10.7838
system time
0.382115
max virtual memory
1.8285568E7
max residence set size
637360.0
stage attributes
key
value
starexec-result
YES
output
9.04/3.97 YES 11.10/4.54 proof of /export/starexec/sandbox/benchmark/theBenchmark.hs 11.10/4.54 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 11.10/4.54 11.10/4.54 11.10/4.54 H-Termination with start terms of the given HASKELL could be proven: 11.10/4.54 11.10/4.54 (0) HASKELL 11.10/4.54 (1) BR [EQUIVALENT, 0 ms] 11.10/4.54 (2) HASKELL 11.10/4.54 (3) COR [EQUIVALENT, 0 ms] 11.10/4.54 (4) HASKELL 11.10/4.54 (5) Narrow [SOUND, 0 ms] 11.10/4.54 (6) AND 11.10/4.54 (7) QDP 11.10/4.54 (8) QDPSizeChangeProof [EQUIVALENT, 0 ms] 11.10/4.54 (9) YES 11.10/4.54 (10) QDP 11.10/4.54 (11) DependencyGraphProof [EQUIVALENT, 0 ms] 11.10/4.54 (12) AND 11.10/4.54 (13) QDP 11.10/4.54 (14) QDPSizeChangeProof [EQUIVALENT, 0 ms] 11.10/4.54 (15) YES 11.10/4.54 (16) QDP 11.10/4.54 (17) MRRProof [EQUIVALENT, 2 ms] 11.10/4.54 (18) QDP 11.10/4.54 (19) PisEmptyProof [EQUIVALENT, 0 ms] 11.10/4.54 (20) YES 11.10/4.54 11.10/4.54 11.10/4.54 ---------------------------------------- 11.10/4.54 11.10/4.54 (0) 11.10/4.54 Obligation: 11.10/4.54 mainModule Main 11.10/4.54 module Main where { 11.10/4.54 import qualified Prelude; 11.10/4.54 data MyBool = MyTrue | MyFalse ; 11.10/4.54 11.10/4.54 data MyInt = Pos Main.Nat | Neg Main.Nat ; 11.10/4.54 11.10/4.54 data Main.Nat = Succ Main.Nat | Zero ; 11.10/4.54 11.10/4.54 data Ratio a = CnPc a a ; 11.10/4.54 11.10/4.54 data Tup2 a b = Tup2 a b ; 11.10/4.54 11.10/4.54 error :: a; 11.10/4.54 error = stop MyTrue; 11.10/4.54 11.10/4.54 fromEnumRatio :: Ratio MyInt -> MyInt; 11.10/4.54 fromEnumRatio = truncateRatio; 11.10/4.54 11.10/4.54 fromIntMyInt :: MyInt -> MyInt; 11.10/4.54 fromIntMyInt x = x; 11.10/4.54 11.10/4.54 primDivNatS :: Main.Nat -> Main.Nat -> Main.Nat; 11.10/4.54 primDivNatS Main.Zero Main.Zero = Main.error; 11.10/4.54 primDivNatS (Main.Succ x) Main.Zero = Main.error; 11.10/4.54 primDivNatS (Main.Succ x) (Main.Succ y) = primDivNatS0 x y (primGEqNatS x y); 11.10/4.54 primDivNatS Main.Zero (Main.Succ x) = Main.Zero; 11.10/4.54 11.10/4.54 primDivNatS0 x y MyTrue = Main.Succ (primDivNatS (primMinusNatS x y) (Main.Succ y)); 11.10/4.54 primDivNatS0 x y MyFalse = Main.Zero; 11.10/4.54 11.10/4.54 primGEqNatS :: Main.Nat -> Main.Nat -> MyBool; 11.10/4.54 primGEqNatS (Main.Succ x) Main.Zero = MyTrue; 11.10/4.54 primGEqNatS (Main.Succ x) (Main.Succ y) = primGEqNatS x y; 11.10/4.54 primGEqNatS Main.Zero (Main.Succ x) = MyFalse; 11.10/4.54 primGEqNatS Main.Zero Main.Zero = MyTrue; 11.10/4.54 11.10/4.54 primMinusNatS :: Main.Nat -> Main.Nat -> Main.Nat; 11.10/4.54 primMinusNatS (Main.Succ x) (Main.Succ y) = primMinusNatS x y; 11.10/4.54 primMinusNatS Main.Zero (Main.Succ y) = Main.Zero; 11.10/4.54 primMinusNatS x Main.Zero = x; 11.10/4.54 11.10/4.54 primModNatS :: Main.Nat -> Main.Nat -> Main.Nat; 11.10/4.54 primModNatS Main.Zero Main.Zero = Main.error; 11.10/4.54 primModNatS Main.Zero (Main.Succ x) = Main.Zero; 11.10/4.54 primModNatS (Main.Succ x) Main.Zero = Main.error; 11.10/4.54 primModNatS (Main.Succ x) (Main.Succ Main.Zero) = Main.Zero; 11.10/4.54 primModNatS (Main.Succ x) (Main.Succ (Main.Succ y)) = primModNatS0 x y (primGEqNatS x (Main.Succ y)); 11.10/4.54 11.10/4.54 primModNatS0 x y MyTrue = primModNatS (primMinusNatS x (Main.Succ y)) (Main.Succ (Main.Succ y)); 11.10/4.54 primModNatS0 x y MyFalse = Main.Succ x; 11.10/4.54 11.10/4.54 primQrmInt :: MyInt -> MyInt -> Tup2 MyInt MyInt; 11.10/4.54 primQrmInt x y = Tup2 (primQuotInt x y) (primRemInt x y); 11.10/4.54 11.10/4.54 primQuotInt :: MyInt -> MyInt -> MyInt; 11.10/4.54 primQuotInt (Main.Pos x) (Main.Pos (Main.Succ y)) = Main.Pos (primDivNatS x (Main.Succ y)); 11.10/4.54 primQuotInt (Main.Pos x) (Main.Neg (Main.Succ y)) = Main.Neg (primDivNatS x (Main.Succ y)); 11.10/4.54 primQuotInt (Main.Neg x) (Main.Pos (Main.Succ y)) = Main.Neg (primDivNatS x (Main.Succ y)); 11.10/4.54 primQuotInt (Main.Neg x) (Main.Neg (Main.Succ y)) = Main.Pos (primDivNatS x (Main.Succ y)); 11.10/4.54 primQuotInt ww wx = Main.error; 11.10/4.54 11.10/4.54 primRemInt :: MyInt -> MyInt -> MyInt; 11.10/4.54 primRemInt (Main.Pos x) (Main.Pos (Main.Succ y)) = Main.Pos (primModNatS x (Main.Succ y)); 11.10/4.54 primRemInt (Main.Pos x) (Main.Neg (Main.Succ y)) = Main.Pos (primModNatS x (Main.Succ y)); 11.10/4.54 primRemInt (Main.Neg x) (Main.Pos (Main.Succ y)) = Main.Neg (primModNatS x (Main.Succ 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