details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	5.88182 seconds
cpu usage	9.99398
user time	9.70312
system time	0.290858
max virtual memory	1.828352E7
max residence set size	562732.0

stage attributes

key	value
starexec-result	YES

output

7.72/3.56 YES 9.67/4.11 proof of /export/starexec/sandbox/benchmark/theBenchmark.hs 9.67/4.11 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 9.67/4.11 9.67/4.11 9.67/4.11 H-Termination with start terms of the given HASKELL could be proven: 9.67/4.11 9.67/4.11 (0) HASKELL 9.67/4.11 (1) BR [EQUIVALENT, 0 ms] 9.67/4.11 (2) HASKELL 9.67/4.11 (3) COR [EQUIVALENT, 0 ms] 9.67/4.11 (4) HASKELL 9.67/4.11 (5) Narrow [EQUIVALENT, 27 ms] 9.67/4.11 (6) YES 9.67/4.11 9.67/4.11 9.67/4.11 ---------------------------------------- 9.67/4.11 9.67/4.11 (0) 9.67/4.11 Obligation: 9.67/4.11 mainModule Main 9.67/4.11 module Main where { 9.67/4.11 import qualified Prelude; 9.67/4.11 data MyBool = MyTrue | MyFalse ; 9.67/4.11 9.67/4.11 data MyInt = Pos Main.Nat | Neg Main.Nat ; 9.67/4.11 9.67/4.11 data Main.Nat = Succ Main.Nat | Zero ; 9.67/4.11 9.67/4.11 data Tup0 = Tup0 ; 9.67/4.11 9.67/4.11 esEsMyInt :: MyInt -> MyInt -> MyBool; 9.67/4.11 esEsMyInt = primEqInt; 9.67/4.11 9.67/4.11 flip :: (b -> c -> a) -> c -> b -> a; 9.67/4.11 flip f x y = f y x; 9.67/4.11 9.67/4.11 fromEnumTup0 :: Tup0 -> MyInt; 9.67/4.11 fromEnumTup0 Tup0 = Main.Pos Main.Zero; 9.67/4.11 9.67/4.11 msMyInt :: MyInt -> MyInt -> MyInt; 9.67/4.11 msMyInt = primMinusInt; 9.67/4.11 9.67/4.11 predTup0 :: Tup0 -> Tup0; 9.67/4.11 predTup0 = pt toEnumTup0 (pt (subtractMyInt (Main.Pos (Main.Succ Main.Zero))) fromEnumTup0); 9.67/4.11 9.67/4.11 primEqInt :: MyInt -> MyInt -> MyBool; 9.67/4.11 primEqInt (Main.Pos (Main.Succ x)) (Main.Pos (Main.Succ y)) = primEqNat x y; 9.67/4.11 primEqInt (Main.Neg (Main.Succ x)) (Main.Neg (Main.Succ y)) = primEqNat x y; 9.67/4.11 primEqInt (Main.Pos Main.Zero) (Main.Neg Main.Zero) = MyTrue; 9.67/4.11 primEqInt (Main.Neg Main.Zero) (Main.Pos Main.Zero) = MyTrue; 9.67/4.11 primEqInt (Main.Neg Main.Zero) (Main.Neg Main.Zero) = MyTrue; 9.67/4.11 primEqInt (Main.Pos Main.Zero) (Main.Pos Main.Zero) = MyTrue; 9.67/4.11 primEqInt vv vw = MyFalse; 9.67/4.11 9.67/4.11 primEqNat :: Main.Nat -> Main.Nat -> MyBool; 9.67/4.11 primEqNat Main.Zero Main.Zero = MyTrue; 9.67/4.11 primEqNat Main.Zero (Main.Succ y) = MyFalse; 9.67/4.11 primEqNat (Main.Succ x) Main.Zero = MyFalse; 9.67/4.11 primEqNat (Main.Succ x) (Main.Succ y) = primEqNat x y; 9.67/4.11 9.67/4.11 primMinusInt :: MyInt -> MyInt -> MyInt; 9.67/4.11 primMinusInt (Main.Pos x) (Main.Neg y) = Main.Pos (primPlusNat x y); 9.67/4.11 primMinusInt (Main.Neg x) (Main.Pos y) = Main.Neg (primPlusNat x y); 9.67/4.11 primMinusInt (Main.Neg x) (Main.Neg y) = primMinusNat y x; 9.67/4.11 primMinusInt (Main.Pos x) (Main.Pos y) = primMinusNat x y; 9.67/4.11 9.67/4.11 primMinusNat :: Main.Nat -> Main.Nat -> MyInt; 9.67/4.11 primMinusNat Main.Zero Main.Zero = Main.Pos Main.Zero; 9.67/4.11 primMinusNat Main.Zero (Main.Succ y) = Main.Neg (Main.Succ y); 9.67/4.11 primMinusNat (Main.Succ x) Main.Zero = Main.Pos (Main.Succ x); 9.67/4.11 primMinusNat (Main.Succ x) (Main.Succ y) = primMinusNat x y; 9.67/4.11 9.67/4.11 primPlusNat :: Main.Nat -> Main.Nat -> Main.Nat; 9.67/4.11 primPlusNat Main.Zero Main.Zero = Main.Zero; 9.67/4.11 primPlusNat Main.Zero (Main.Succ y) = Main.Succ y; 9.67/4.11 primPlusNat (Main.Succ x) Main.Zero = Main.Succ x; 9.67/4.11 primPlusNat (Main.Succ x) (Main.Succ y) = Main.Succ (Main.Succ (primPlusNat x y)); 9.67/4.11 9.67/4.11 pt :: (a -> c) -> (b -> a) -> b -> c; 9.67/4.11 pt f g x = f (g x); 9.67/4.11 9.67/4.11 subtractMyInt :: MyInt -> MyInt -> MyInt; 9.67/4.11 subtractMyInt = flip msMyInt; 9.67/4.11 9.67/4.11 toEnum0 MyTrue vx = Tup0; 9.67/4.11 9.67/4.11 toEnum1 vx = toEnum0 (esEsMyInt vx (Main.Pos Main.Zero)) vx; 9.67/4.11 9.67/4.11 toEnumTup0 :: MyInt -> Tup0; 9.67/4.11 toEnumTup0 vx = toEnum1 vx; 9.67/4.11 9.67/4.11 } 9.67/4.11 9.67/4.11 ---------------------------------------- 9.67/4.11 9.67/4.11 (1) BR (EQUIVALENT) 9.67/4.11 Replaced joker patterns by fresh variables and removed binding patterns. 9.67/4.11 ---------------------------------------- 9.67/4.11 popout

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

job log

popout

actions

all output return to Haskell 2019-04-01 06.52