details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	4.34169 seconds
cpu usage	10.7575
user time	10.4435
system time	0.313996
max virtual memory	1.8285568E7
max residence set size	593764.0

stage attributes

key	value
starexec-result	YES

output

8.50/3.72 YES 10.61/4.30 proof of /export/starexec/sandbox/benchmark/theBenchmark.hs 10.61/4.30 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 10.61/4.30 10.61/4.30 10.61/4.30 H-Termination with start terms of the given HASKELL could be proven: 10.61/4.30 10.61/4.30 (0) HASKELL 10.61/4.30 (1) BR [EQUIVALENT, 0 ms] 10.61/4.30 (2) HASKELL 10.61/4.30 (3) COR [EQUIVALENT, 0 ms] 10.61/4.30 (4) HASKELL 10.61/4.30 (5) Narrow [SOUND, 0 ms] 10.61/4.30 (6) QDP 10.61/4.30 (7) DependencyGraphProof [EQUIVALENT, 0 ms] 10.61/4.30 (8) AND 10.61/4.30 (9) QDP 10.61/4.30 (10) QDPSizeChangeProof [EQUIVALENT, 0 ms] 10.61/4.30 (11) YES 10.61/4.30 (12) QDP 10.61/4.30 (13) QDPSizeChangeProof [EQUIVALENT, 0 ms] 10.61/4.30 (14) YES 10.61/4.30 (15) QDP 10.61/4.30 (16) QDPSizeChangeProof [EQUIVALENT, 0 ms] 10.61/4.30 (17) YES 10.61/4.30 (18) QDP 10.61/4.30 (19) QDPSizeChangeProof [EQUIVALENT, 0 ms] 10.61/4.30 (20) YES 10.61/4.30 10.61/4.30 10.61/4.30 ---------------------------------------- 10.61/4.30 10.61/4.30 (0) 10.61/4.30 Obligation: 10.61/4.30 mainModule Main 10.61/4.30 module Main where { 10.61/4.30 import qualified Prelude; 10.61/4.30 data List a = Cons a (List a) | Nil ; 10.61/4.30 10.61/4.30 data Main.Maybe a = Nothing | Just a ; 10.61/4.30 10.61/4.30 data MyBool = MyTrue | MyFalse ; 10.61/4.30 10.61/4.30 data MyInt = Pos Main.Nat | Neg Main.Nat ; 10.61/4.30 10.61/4.30 data Main.Nat = Succ Main.Nat | Zero ; 10.61/4.30 10.61/4.30 data Tup2 b a = Tup2 b a ; 10.61/4.30 10.61/4.30 esEsMyInt :: MyInt -> MyInt -> MyBool; 10.61/4.30 esEsMyInt = primEqInt; 10.61/4.30 10.61/4.30 lookup k Nil = lookup3 k Nil; 10.61/4.30 lookup k (Cons (Tup2 x y) xys) = lookup2 k (Cons (Tup2 x y) xys); 10.61/4.30 10.61/4.30 lookup0 k x y xys MyTrue = lookup k xys; 10.61/4.30 10.61/4.30 lookup1 k x y xys MyTrue = Main.Just y; 10.61/4.30 lookup1 k x y xys MyFalse = lookup0 k x y xys otherwise; 10.61/4.30 10.61/4.30 lookup2 k (Cons (Tup2 x y) xys) = lookup1 k x y xys (esEsMyInt k x); 10.61/4.30 10.61/4.30 lookup3 k Nil = Main.Nothing; 10.61/4.30 lookup3 wu wv = lookup2 wu wv; 10.61/4.30 10.61/4.30 otherwise :: MyBool; 10.61/4.30 otherwise = MyTrue; 10.61/4.30 10.61/4.30 primEqInt :: MyInt -> MyInt -> MyBool; 10.61/4.30 primEqInt (Main.Pos (Main.Succ x)) (Main.Pos (Main.Succ y)) = primEqNat x y; 10.61/4.30 primEqInt (Main.Neg (Main.Succ x)) (Main.Neg (Main.Succ y)) = primEqNat x y; 10.61/4.30 primEqInt (Main.Pos Main.Zero) (Main.Neg Main.Zero) = MyTrue; 10.61/4.30 primEqInt (Main.Neg Main.Zero) (Main.Pos Main.Zero) = MyTrue; 10.61/4.30 primEqInt (Main.Neg Main.Zero) (Main.Neg Main.Zero) = MyTrue; 10.61/4.30 primEqInt (Main.Pos Main.Zero) (Main.Pos Main.Zero) = MyTrue; 10.61/4.30 primEqInt vv vw = MyFalse; 10.61/4.30 10.61/4.30 primEqNat :: Main.Nat -> Main.Nat -> MyBool; 10.61/4.30 primEqNat Main.Zero Main.Zero = MyTrue; 10.61/4.30 primEqNat Main.Zero (Main.Succ y) = MyFalse; 10.61/4.30 primEqNat (Main.Succ x) Main.Zero = MyFalse; 10.61/4.30 primEqNat (Main.Succ x) (Main.Succ y) = primEqNat x y; 10.61/4.30 10.61/4.30 } 10.61/4.30 10.61/4.30 ---------------------------------------- 10.61/4.30 10.61/4.30 (1) BR (EQUIVALENT) 10.61/4.30 Replaced joker patterns by fresh variables and removed binding patterns. 10.61/4.30 ---------------------------------------- 10.61/4.30 10.61/4.30 (2) 10.61/4.30 Obligation: 10.61/4.30 mainModule Main 10.61/4.30 module Main where { 10.61/4.30 import qualified Prelude; 10.61/4.30 data List a = Cons a (List a) | Nil ; 10.61/4.30 10.61/4.30 data Main.Maybe a = Nothing | Just a ; 10.61/4.30 popout

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

job log

popout

actions

all output return to Haskell 2019-04-01 06.52