details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	4.17587 seconds
cpu usage	9.92283
user time	9.6263
system time	0.296536
max virtual memory	1.828352E7
max residence set size	563788.0

stage attributes

key	value
starexec-result	YES

output

7.93/3.59 YES 9.86/4.13 proof of /export/starexec/sandbox2/benchmark/theBenchmark.hs 9.86/4.13 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 9.86/4.13 9.86/4.13 9.86/4.13 H-Termination with start terms of the given HASKELL could be proven: 9.86/4.13 9.86/4.13 (0) HASKELL 9.86/4.13 (1) BR [EQUIVALENT, 0 ms] 9.86/4.13 (2) HASKELL 9.86/4.13 (3) COR [EQUIVALENT, 0 ms] 9.86/4.13 (4) HASKELL 9.86/4.13 (5) Narrow [EQUIVALENT, 23 ms] 9.86/4.13 (6) YES 9.86/4.13 9.86/4.13 9.86/4.13 ---------------------------------------- 9.86/4.13 9.86/4.13 (0) 9.86/4.13 Obligation: 9.86/4.13 mainModule Main 9.86/4.13 module Main where { 9.86/4.13 import qualified Prelude; 9.86/4.13 data MyBool = MyTrue | MyFalse ; 9.86/4.13 9.86/4.13 data MyInt = Pos Main.Nat | Neg Main.Nat ; 9.86/4.13 9.86/4.13 data Main.Nat = Succ Main.Nat | Zero ; 9.86/4.13 9.86/4.13 esEsMyInt :: MyInt -> MyInt -> MyBool; 9.86/4.13 esEsMyInt = primEqInt; 9.86/4.13 9.86/4.13 flip :: (a -> b -> c) -> b -> a -> c; 9.86/4.13 flip f x y = f y x; 9.86/4.13 9.86/4.13 fromEnumMyBool :: MyBool -> MyInt; 9.86/4.13 fromEnumMyBool MyFalse = Main.Pos Main.Zero; 9.86/4.13 fromEnumMyBool MyTrue = Main.Pos (Main.Succ Main.Zero); 9.86/4.13 9.86/4.13 msMyInt :: MyInt -> MyInt -> MyInt; 9.86/4.13 msMyInt = primMinusInt; 9.86/4.13 9.86/4.13 predMyBool :: MyBool -> MyBool; 9.86/4.13 predMyBool = pt toEnumMyBool (pt (subtractMyInt (Main.Pos (Main.Succ Main.Zero))) fromEnumMyBool); 9.86/4.13 9.86/4.13 primEqInt :: MyInt -> MyInt -> MyBool; 9.86/4.13 primEqInt (Main.Pos (Main.Succ x)) (Main.Pos (Main.Succ y)) = primEqNat x y; 9.86/4.13 primEqInt (Main.Neg (Main.Succ x)) (Main.Neg (Main.Succ y)) = primEqNat x y; 9.86/4.13 primEqInt (Main.Pos Main.Zero) (Main.Neg Main.Zero) = MyTrue; 9.86/4.13 primEqInt (Main.Neg Main.Zero) (Main.Pos Main.Zero) = MyTrue; 9.86/4.13 primEqInt (Main.Neg Main.Zero) (Main.Neg Main.Zero) = MyTrue; 9.86/4.13 primEqInt (Main.Pos Main.Zero) (Main.Pos Main.Zero) = MyTrue; 9.86/4.13 primEqInt vv vw = MyFalse; 9.86/4.13 9.86/4.13 primEqNat :: Main.Nat -> Main.Nat -> MyBool; 9.86/4.13 primEqNat Main.Zero Main.Zero = MyTrue; 9.86/4.13 primEqNat Main.Zero (Main.Succ y) = MyFalse; 9.86/4.13 primEqNat (Main.Succ x) Main.Zero = MyFalse; 9.86/4.13 primEqNat (Main.Succ x) (Main.Succ y) = primEqNat x y; 9.86/4.13 9.86/4.13 primMinusInt :: MyInt -> MyInt -> MyInt; 9.86/4.13 primMinusInt (Main.Pos x) (Main.Neg y) = Main.Pos (primPlusNat x y); 9.86/4.13 primMinusInt (Main.Neg x) (Main.Pos y) = Main.Neg (primPlusNat x y); 9.86/4.13 primMinusInt (Main.Neg x) (Main.Neg y) = primMinusNat y x; 9.86/4.13 primMinusInt (Main.Pos x) (Main.Pos y) = primMinusNat x y; 9.86/4.13 9.86/4.13 primMinusNat :: Main.Nat -> Main.Nat -> MyInt; 9.86/4.13 primMinusNat Main.Zero Main.Zero = Main.Pos Main.Zero; 9.86/4.13 primMinusNat Main.Zero (Main.Succ y) = Main.Neg (Main.Succ y); 9.86/4.13 primMinusNat (Main.Succ x) Main.Zero = Main.Pos (Main.Succ x); 9.86/4.13 primMinusNat (Main.Succ x) (Main.Succ y) = primMinusNat x y; 9.86/4.13 9.86/4.13 primPlusNat :: Main.Nat -> Main.Nat -> Main.Nat; 9.86/4.13 primPlusNat Main.Zero Main.Zero = Main.Zero; 9.86/4.13 primPlusNat Main.Zero (Main.Succ y) = Main.Succ y; 9.86/4.13 primPlusNat (Main.Succ x) Main.Zero = Main.Succ x; 9.86/4.13 primPlusNat (Main.Succ x) (Main.Succ y) = Main.Succ (Main.Succ (primPlusNat x y)); 9.86/4.13 9.86/4.13 pt :: (a -> c) -> (b -> a) -> b -> c; 9.86/4.13 pt f g x = f (g x); 9.86/4.13 9.86/4.13 subtractMyInt :: MyInt -> MyInt -> MyInt; 9.86/4.13 subtractMyInt = flip msMyInt; 9.86/4.13 9.86/4.13 toEnum0 MyTrue vx = MyTrue; 9.86/4.13 9.86/4.13 toEnum1 vx = toEnum0 (esEsMyInt vx (Main.Pos (Main.Succ Main.Zero))) vx; 9.86/4.13 9.86/4.13 toEnum2 MyTrue vy = MyFalse; 9.86/4.13 toEnum2 vz wu = toEnum1 wu; 9.86/4.13 9.86/4.13 toEnum3 vy = toEnum2 (esEsMyInt vy (Main.Pos Main.Zero)) vy; 9.86/4.13 toEnum3 wv = toEnum1 wv; 9.86/4.13 9.86/4.13 toEnumMyBool :: MyInt -> MyBool; 9.86/4.13 toEnumMyBool vy = toEnum3 vy; 9.86/4.13 toEnumMyBool vx = toEnum1 vx; 9.86/4.13 9.86/4.13 } 9.86/4.13 popout

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

job log

popout

actions

all output return to Haskell 2019-04-01 06.52