details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	4.16855 seconds
cpu usage	10.1028
user time	9.79048
system time	0.312306
max virtual memory	1.828352E7
max residence set size	613212.0

stage attributes

key	value
starexec-result	YES

output

8.19/3.61 YES 10.05/4.13 proof of /export/starexec/sandbox/benchmark/theBenchmark.hs 10.05/4.13 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 10.05/4.13 10.05/4.13 10.05/4.13 H-Termination with start terms of the given HASKELL could be proven: 10.05/4.13 10.05/4.13 (0) HASKELL 10.05/4.13 (1) BR [EQUIVALENT, 0 ms] 10.05/4.13 (2) HASKELL 10.05/4.13 (3) COR [EQUIVALENT, 0 ms] 10.05/4.13 (4) HASKELL 10.05/4.13 (5) Narrow [SOUND, 0 ms] 10.05/4.13 (6) AND 10.05/4.13 (7) QDP 10.05/4.13 (8) QDPSizeChangeProof [EQUIVALENT, 0 ms] 10.05/4.13 (9) YES 10.05/4.13 (10) QDP 10.05/4.13 (11) QDPSizeChangeProof [EQUIVALENT, 0 ms] 10.05/4.13 (12) YES 10.05/4.13 (13) QDP 10.05/4.13 (14) QDPSizeChangeProof [EQUIVALENT, 0 ms] 10.05/4.13 (15) YES 10.05/4.13 10.05/4.13 10.05/4.13 ---------------------------------------- 10.05/4.13 10.05/4.13 (0) 10.05/4.13 Obligation: 10.05/4.13 mainModule Main 10.05/4.13 module Main where { 10.05/4.13 import qualified Prelude; 10.05/4.13 data List a = Cons a (List a) | Nil ; 10.05/4.13 10.05/4.13 data MyInt = Pos Main.Nat | Neg Main.Nat ; 10.05/4.13 10.05/4.13 data Main.Nat = Succ Main.Nat | Zero ; 10.05/4.13 10.05/4.13 data Main.WHNF a = WHNF a ; 10.05/4.13 10.05/4.13 dsEm :: (a -> b) -> a -> b; 10.05/4.13 dsEm f x = Main.seq x (f x); 10.05/4.13 10.05/4.13 enforceWHNF :: Main.WHNF b -> a -> a; 10.05/4.13 enforceWHNF (Main.WHNF x) y = y; 10.05/4.13 10.05/4.13 foldl' :: (b -> a -> b) -> b -> List a -> b; 10.05/4.13 foldl' f a Nil = a; 10.05/4.13 foldl' f a (Cons x xs) = dsEm (foldl' f) (f a x) xs; 10.05/4.13 10.05/4.13 fromIntMyInt :: MyInt -> MyInt; 10.05/4.13 fromIntMyInt x = x; 10.05/4.13 10.05/4.13 primMulInt :: MyInt -> MyInt -> MyInt; 10.05/4.13 primMulInt (Main.Pos x) (Main.Pos y) = Main.Pos (primMulNat x y); 10.05/4.13 primMulInt (Main.Pos x) (Main.Neg y) = Main.Neg (primMulNat x y); 10.05/4.13 primMulInt (Main.Neg x) (Main.Pos y) = Main.Neg (primMulNat x y); 10.05/4.13 primMulInt (Main.Neg x) (Main.Neg y) = Main.Pos (primMulNat x y); 10.05/4.13 10.05/4.13 primMulNat :: Main.Nat -> Main.Nat -> Main.Nat; 10.05/4.13 primMulNat Main.Zero Main.Zero = Main.Zero; 10.05/4.13 primMulNat Main.Zero (Main.Succ y) = Main.Zero; 10.05/4.13 primMulNat (Main.Succ x) Main.Zero = Main.Zero; 10.05/4.13 primMulNat (Main.Succ x) (Main.Succ y) = primPlusNat (primMulNat x (Main.Succ y)) (Main.Succ y); 10.05/4.13 10.05/4.13 primPlusNat :: Main.Nat -> Main.Nat -> Main.Nat; 10.05/4.13 primPlusNat Main.Zero Main.Zero = Main.Zero; 10.05/4.13 primPlusNat Main.Zero (Main.Succ y) = Main.Succ y; 10.05/4.13 primPlusNat (Main.Succ x) Main.Zero = Main.Succ x; 10.05/4.13 primPlusNat (Main.Succ x) (Main.Succ y) = Main.Succ (Main.Succ (primPlusNat x y)); 10.05/4.13 10.05/4.13 productMyInt :: List MyInt -> MyInt; 10.05/4.13 productMyInt = foldl' srMyInt (fromIntMyInt (Main.Pos (Main.Succ Main.Zero))); 10.05/4.13 10.05/4.13 seq :: a -> b -> b; 10.05/4.13 seq x y = Main.enforceWHNF (Main.WHNF x) y; 10.05/4.13 10.05/4.13 srMyInt :: MyInt -> MyInt -> MyInt; 10.05/4.13 srMyInt = primMulInt; 10.05/4.13 10.05/4.13 } 10.05/4.13 10.05/4.13 ---------------------------------------- 10.05/4.13 10.05/4.13 (1) BR (EQUIVALENT) 10.05/4.13 Replaced joker patterns by fresh variables and removed binding patterns. 10.05/4.13 ---------------------------------------- 10.05/4.13 10.05/4.13 (2) 10.05/4.13 Obligation: 10.05/4.13 mainModule Main 10.05/4.13 module Main where { 10.05/4.13 import qualified Prelude; 10.05/4.13 data List a = Cons a (List a) | Nil ; 10.05/4.13 10.05/4.13 data MyInt = Pos Main.Nat | Neg Main.Nat ; 10.05/4.13 10.05/4.13 data Main.Nat = Succ Main.Nat | Zero ; 10.05/4.13 10.05/4.13 data Main.WHNF a = WHNF a ; popout

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

job log

popout

actions

all output return to Haskell 2019-04-01 06.52