details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	4.23519 seconds
cpu usage	10.2593
user time	9.95346
system time	0.305814
max virtual memory	1.828352E7
max residence set size	605608.0

stage attributes

key	value
starexec-result	YES

output

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

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

job log

popout

actions

all output return to Haskell 2019-04-01 06.52