details

property	value
status	complete
benchmark	succ_7.hs
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n171.star.cs.uiowa.edu
space	basic_haskell

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	4.16469 seconds
cpu usage	10.0956
user time	9.77147
system time	0.324121
max virtual memory	1.828352E7
max residence set size	600208.0

stage attributes

key	value
starexec-result	YES

output

7.86/3.58 YES 9.96/4.12 proof of /export/starexec/sandbox/benchmark/theBenchmark.hs 9.96/4.12 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 9.96/4.12 9.96/4.12 9.96/4.12 H-Termination with start terms of the given HASKELL could be proven: 9.96/4.12 9.96/4.12 (0) HASKELL 9.96/4.12 (1) BR [EQUIVALENT, 0 ms] 9.96/4.12 (2) HASKELL 9.96/4.12 (3) COR [EQUIVALENT, 0 ms] 9.96/4.12 (4) HASKELL 9.96/4.12 (5) Narrow [EQUIVALENT, 22 ms] 9.96/4.12 (6) YES 9.96/4.12 9.96/4.12 9.96/4.12 ---------------------------------------- 9.96/4.12 9.96/4.12 (0) 9.96/4.12 Obligation: 9.96/4.12 mainModule Main 9.96/4.12 module Main where { 9.96/4.12 import qualified Prelude; 9.96/4.12 data MyBool = MyTrue | MyFalse ; 9.96/4.12 9.96/4.12 data MyInt = Pos Main.Nat | Neg Main.Nat ; 9.96/4.12 9.96/4.12 data Main.Nat = Succ Main.Nat | Zero ; 9.96/4.12 9.96/4.12 data Ordering = LT | EQ | GT ; 9.96/4.12 9.96/4.12 esEsMyInt :: MyInt -> MyInt -> MyBool; 9.96/4.12 esEsMyInt = primEqInt; 9.96/4.12 9.96/4.12 fromEnumOrdering :: Ordering -> MyInt; 9.96/4.12 fromEnumOrdering LT = Main.Pos Main.Zero; 9.96/4.12 fromEnumOrdering EQ = Main.Pos (Main.Succ Main.Zero); 9.96/4.12 fromEnumOrdering GT = Main.Pos (Main.Succ (Main.Succ Main.Zero)); 9.96/4.12 9.96/4.12 primEqInt :: MyInt -> MyInt -> MyBool; 9.96/4.12 primEqInt (Main.Pos (Main.Succ x)) (Main.Pos (Main.Succ y)) = primEqNat x y; 9.96/4.12 primEqInt (Main.Neg (Main.Succ x)) (Main.Neg (Main.Succ y)) = primEqNat x y; 9.96/4.12 primEqInt (Main.Pos Main.Zero) (Main.Neg Main.Zero) = MyTrue; 9.96/4.12 primEqInt (Main.Neg Main.Zero) (Main.Pos Main.Zero) = MyTrue; 9.96/4.12 primEqInt (Main.Neg Main.Zero) (Main.Neg Main.Zero) = MyTrue; 9.96/4.12 primEqInt (Main.Pos Main.Zero) (Main.Pos Main.Zero) = MyTrue; 9.96/4.12 primEqInt vv vw = MyFalse; 9.96/4.12 9.96/4.12 primEqNat :: Main.Nat -> Main.Nat -> MyBool; 9.96/4.12 primEqNat Main.Zero Main.Zero = MyTrue; 9.96/4.12 primEqNat Main.Zero (Main.Succ y) = MyFalse; 9.96/4.12 primEqNat (Main.Succ x) Main.Zero = MyFalse; 9.96/4.12 primEqNat (Main.Succ x) (Main.Succ y) = primEqNat x y; 9.96/4.12 9.96/4.12 primMinusNat :: Main.Nat -> Main.Nat -> MyInt; 9.96/4.12 primMinusNat Main.Zero Main.Zero = Main.Pos Main.Zero; 9.96/4.12 primMinusNat Main.Zero (Main.Succ y) = Main.Neg (Main.Succ y); 9.96/4.12 primMinusNat (Main.Succ x) Main.Zero = Main.Pos (Main.Succ x); 9.96/4.12 primMinusNat (Main.Succ x) (Main.Succ y) = primMinusNat x y; 9.96/4.12 9.96/4.12 primPlusInt :: MyInt -> MyInt -> MyInt; 9.96/4.12 primPlusInt (Main.Pos x) (Main.Neg y) = primMinusNat x y; 9.96/4.12 primPlusInt (Main.Neg x) (Main.Pos y) = primMinusNat y x; 9.96/4.12 primPlusInt (Main.Neg x) (Main.Neg y) = Main.Neg (primPlusNat x y); 9.96/4.12 primPlusInt (Main.Pos x) (Main.Pos y) = Main.Pos (primPlusNat x y); 9.96/4.12 9.96/4.12 primPlusNat :: Main.Nat -> Main.Nat -> Main.Nat; 9.96/4.12 primPlusNat Main.Zero Main.Zero = Main.Zero; 9.96/4.12 primPlusNat Main.Zero (Main.Succ y) = Main.Succ y; 9.96/4.12 primPlusNat (Main.Succ x) Main.Zero = Main.Succ x; 9.96/4.12 primPlusNat (Main.Succ x) (Main.Succ y) = Main.Succ (Main.Succ (primPlusNat x y)); 9.96/4.12 9.96/4.12 psMyInt :: MyInt -> MyInt -> MyInt; 9.96/4.12 psMyInt = primPlusInt; 9.96/4.12 9.96/4.12 pt :: (a -> b) -> (c -> a) -> c -> b; 9.96/4.12 pt f g x = f (g x); 9.96/4.12 9.96/4.12 succOrdering :: Ordering -> Ordering; 9.96/4.12 succOrdering = pt toEnumOrdering (pt (psMyInt (Main.Pos (Main.Succ Main.Zero))) fromEnumOrdering); 9.96/4.12 9.96/4.12 toEnum0 MyTrue vx = GT; 9.96/4.12 9.96/4.12 toEnum1 vx = toEnum0 (esEsMyInt vx (Main.Pos (Main.Succ (Main.Succ Main.Zero)))) vx; 9.96/4.12 9.96/4.12 toEnum2 MyTrue vy = EQ; 9.96/4.12 toEnum2 vz wu = toEnum1 wu; 9.96/4.12 9.96/4.12 toEnum3 vy = toEnum2 (esEsMyInt vy (Main.Pos (Main.Succ Main.Zero))) vy; 9.96/4.12 toEnum3 wv = toEnum1 wv; 9.96/4.12 9.96/4.12 toEnum4 MyTrue ww = LT; 9.96/4.12 toEnum4 wx wy = toEnum3 wy; 9.96/4.13 9.96/4.13 toEnum5 ww = toEnum4 (esEsMyInt ww (Main.Pos Main.Zero)) ww; 9.96/4.13 toEnum5 wz = toEnum3 wz; 9.96/4.13 9.96/4.13 toEnumOrdering :: MyInt -> Ordering; 9.96/4.13 toEnumOrdering ww = toEnum5 ww; 9.96/4.13 toEnumOrdering vy = toEnum3 vy; popout

output may be truncated. 'popout' for the full output.

job log

popout

actions

all output return to Haskell 2019-04-01 06.52