Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Haskell 2019-04-01 06.52 pair #433317264
details
property
value
status
complete
benchmark
succ_2.hs
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n088.star.cs.uiowa.edu
space
basic_haskell
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
5.25536 seconds
cpu usage
14.275
user time
13.888
system time
0.38706
max virtual memory
1.82858E7
max residence set size
751452.0
stage attributes
key
value
starexec-result
YES
output
11.60/4.48 YES 14.14/5.18 proof of /export/starexec/sandbox/benchmark/theBenchmark.hs 14.14/5.18 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 14.14/5.18 14.14/5.18 14.14/5.18 H-Termination with start terms of the given HASKELL could be proven: 14.14/5.18 14.14/5.18 (0) HASKELL 14.14/5.18 (1) BR [EQUIVALENT, 0 ms] 14.14/5.18 (2) HASKELL 14.14/5.18 (3) COR [EQUIVALENT, 0 ms] 14.14/5.18 (4) HASKELL 14.14/5.18 (5) Narrow [SOUND, 0 ms] 14.14/5.18 (6) AND 14.14/5.18 (7) QDP 14.14/5.18 (8) QDPSizeChangeProof [EQUIVALENT, 0 ms] 14.14/5.18 (9) YES 14.14/5.18 (10) QDP 14.14/5.18 (11) QDPSizeChangeProof [EQUIVALENT, 0 ms] 14.14/5.18 (12) YES 14.14/5.18 (13) QDP 14.14/5.18 (14) QDPSizeChangeProof [EQUIVALENT, 0 ms] 14.14/5.18 (15) YES 14.14/5.18 (16) QDP 14.14/5.18 (17) QDPSizeChangeProof [EQUIVALENT, 0 ms] 14.14/5.18 (18) YES 14.14/5.18 (19) QDP 14.14/5.18 (20) QDPSizeChangeProof [EQUIVALENT, 0 ms] 14.14/5.18 (21) YES 14.14/5.18 (22) QDP 14.14/5.18 (23) QDPSizeChangeProof [EQUIVALENT, 0 ms] 14.14/5.18 (24) YES 14.14/5.18 (25) QDP 14.14/5.18 (26) DependencyGraphProof [EQUIVALENT, 0 ms] 14.14/5.18 (27) AND 14.14/5.18 (28) QDP 14.14/5.18 (29) QDPSizeChangeProof [EQUIVALENT, 0 ms] 14.14/5.18 (30) YES 14.14/5.18 (31) QDP 14.14/5.18 (32) QDPOrderProof [EQUIVALENT, 30 ms] 14.14/5.18 (33) QDP 14.14/5.18 (34) DependencyGraphProof [EQUIVALENT, 0 ms] 14.14/5.18 (35) QDP 14.14/5.18 (36) QDPSizeChangeProof [EQUIVALENT, 0 ms] 14.14/5.18 (37) YES 14.14/5.18 14.14/5.18 14.14/5.18 ---------------------------------------- 14.14/5.18 14.14/5.18 (0) 14.14/5.18 Obligation: 14.14/5.18 mainModule Main 14.14/5.18 module Main where { 14.14/5.18 import qualified Prelude; 14.14/5.18 data MyBool = MyTrue | MyFalse ; 14.14/5.18 14.14/5.18 data MyInt = Pos Main.Nat | Neg Main.Nat ; 14.14/5.18 14.14/5.18 data Main.Nat = Succ Main.Nat | Zero ; 14.14/5.18 14.14/5.18 data Ratio a = CnPc a a ; 14.14/5.18 14.14/5.18 data Tup2 b a = Tup2 b a ; 14.14/5.18 14.14/5.18 error :: a; 14.14/5.18 error = stop MyTrue; 14.14/5.18 14.14/5.18 fromEnumRatio :: Ratio MyInt -> MyInt; 14.14/5.18 fromEnumRatio = truncateRatio; 14.14/5.18 14.14/5.18 fromIntMyInt :: MyInt -> MyInt; 14.14/5.18 fromIntMyInt x = x; 14.14/5.18 14.14/5.18 fromIntRatio :: MyInt -> Ratio MyInt; 14.14/5.18 fromIntRatio = intToRatio; 14.14/5.18 14.14/5.18 intToRatio x = CnPc (fromIntMyInt x) (fromIntMyInt (Main.Pos (Main.Succ Main.Zero))); 14.14/5.18 14.14/5.18 primDivNatS :: Main.Nat -> Main.Nat -> Main.Nat; 14.14/5.18 primDivNatS Main.Zero Main.Zero = Main.error; 14.14/5.18 primDivNatS (Main.Succ x) Main.Zero = Main.error; 14.14/5.18 primDivNatS (Main.Succ x) (Main.Succ y) = primDivNatS0 x y (primGEqNatS x y); 14.14/5.18 primDivNatS Main.Zero (Main.Succ x) = Main.Zero; 14.14/5.18 14.14/5.18 primDivNatS0 x y MyTrue = Main.Succ (primDivNatS (primMinusNatS x y) (Main.Succ y)); 14.14/5.18 primDivNatS0 x y MyFalse = Main.Zero; 14.14/5.18 14.14/5.18 primGEqNatS :: Main.Nat -> Main.Nat -> MyBool; 14.14/5.18 primGEqNatS (Main.Succ x) Main.Zero = MyTrue; 14.14/5.18 primGEqNatS (Main.Succ x) (Main.Succ y) = primGEqNatS x y; 14.14/5.18 primGEqNatS Main.Zero (Main.Succ x) = MyFalse; 14.14/5.18 primGEqNatS Main.Zero Main.Zero = MyTrue; 14.14/5.18 14.14/5.18 primMinusNat :: Main.Nat -> Main.Nat -> MyInt; 14.14/5.18 primMinusNat Main.Zero Main.Zero = Main.Pos Main.Zero; 14.14/5.18 primMinusNat Main.Zero (Main.Succ y) = Main.Neg (Main.Succ y); 14.14/5.18 primMinusNat (Main.Succ x) Main.Zero = Main.Pos (Main.Succ x); 14.14/5.18 primMinusNat (Main.Succ x) (Main.Succ y) = primMinusNat x y; 14.14/5.18 14.14/5.18 primMinusNatS :: 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