details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	4.29209 seconds
cpu usage	9.42954
user time	9.1457
system time	0.283844
max virtual memory	1.828352E7
max residence set size	545720.0

stage attributes

key	value
starexec-result	YES

output

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

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

job log

popout

actions

all output return to Haskell 2019-04-01 06.52