details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	4.09533 seconds
cpu usage	9.65815
user time	9.32622
system time	0.331931
max virtual memory	1.828352E7
max residence set size	603936.0

stage attributes

key	value
starexec-result	YES

output

7.90/3.58 YES 9.56/4.05 proof of /export/starexec/sandbox/benchmark/theBenchmark.hs 9.56/4.05 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 9.56/4.05 9.56/4.05 9.56/4.05 H-Termination with start terms of the given HASKELL could be proven: 9.56/4.05 9.56/4.05 (0) HASKELL 9.56/4.05 (1) BR [EQUIVALENT, 0 ms] 9.56/4.05 (2) HASKELL 9.56/4.05 (3) COR [EQUIVALENT, 0 ms] 9.56/4.05 (4) HASKELL 9.56/4.05 (5) Narrow [SOUND, 0 ms] 9.56/4.05 (6) QDP 9.56/4.05 (7) DependencyGraphProof [EQUIVALENT, 0 ms] 9.56/4.05 (8) AND 9.56/4.05 (9) QDP 9.56/4.05 (10) QDPSizeChangeProof [EQUIVALENT, 0 ms] 9.56/4.05 (11) YES 9.56/4.05 (12) QDP 9.56/4.05 (13) QDPSizeChangeProof [EQUIVALENT, 0 ms] 9.56/4.05 (14) YES 9.56/4.05 9.56/4.05 9.56/4.05 ---------------------------------------- 9.56/4.05 9.56/4.05 (0) 9.56/4.05 Obligation: 9.56/4.05 mainModule Main 9.56/4.05 module Main where { 9.56/4.05 import qualified Prelude; 9.56/4.05 data List a = Cons a (List a) | Nil ; 9.56/4.05 9.56/4.05 data Main.Maybe a = Nothing | Just a ; 9.56/4.05 9.56/4.05 data MyBool = MyTrue | MyFalse ; 9.56/4.05 9.56/4.05 data Tup2 b a = Tup2 b a ; 9.56/4.05 9.56/4.05 esEsMyBool :: MyBool -> MyBool -> MyBool; 9.56/4.05 esEsMyBool MyFalse MyFalse = MyTrue; 9.56/4.05 esEsMyBool MyFalse MyTrue = MyFalse; 9.56/4.05 esEsMyBool MyTrue MyFalse = MyFalse; 9.56/4.05 esEsMyBool MyTrue MyTrue = MyTrue; 9.56/4.05 9.56/4.05 lookup k Nil = lookup3 k Nil; 9.56/4.05 lookup k (Cons (Tup2 x y) xys) = lookup2 k (Cons (Tup2 x y) xys); 9.56/4.05 9.56/4.05 lookup0 k x y xys MyTrue = lookup k xys; 9.56/4.05 9.56/4.05 lookup1 k x y xys MyTrue = Main.Just y; 9.56/4.05 lookup1 k x y xys MyFalse = lookup0 k x y xys otherwise; 9.56/4.05 9.56/4.05 lookup2 k (Cons (Tup2 x y) xys) = lookup1 k x y xys (esEsMyBool k x); 9.56/4.05 9.56/4.05 lookup3 k Nil = Main.Nothing; 9.56/4.05 lookup3 vy vz = lookup2 vy vz; 9.56/4.05 9.56/4.05 otherwise :: MyBool; 9.56/4.05 otherwise = MyTrue; 9.56/4.05 9.56/4.05 } 9.56/4.05 9.56/4.05 ---------------------------------------- 9.56/4.05 9.56/4.05 (1) BR (EQUIVALENT) 9.56/4.05 Replaced joker patterns by fresh variables and removed binding patterns. 9.56/4.05 ---------------------------------------- 9.56/4.05 9.56/4.05 (2) 9.56/4.05 Obligation: 9.56/4.05 mainModule Main 9.56/4.05 module Main where { 9.56/4.05 import qualified Prelude; 9.56/4.05 data List a = Cons a (List a) | Nil ; 9.56/4.05 9.56/4.05 data Main.Maybe a = Nothing | Just a ; 9.56/4.05 9.56/4.05 data MyBool = MyTrue | MyFalse ; 9.56/4.05 9.56/4.05 data Tup2 b a = Tup2 b a ; 9.56/4.05 9.56/4.05 esEsMyBool :: MyBool -> MyBool -> MyBool; 9.56/4.05 esEsMyBool MyFalse MyFalse = MyTrue; 9.56/4.05 esEsMyBool MyFalse MyTrue = MyFalse; 9.56/4.05 esEsMyBool MyTrue MyFalse = MyFalse; 9.56/4.05 esEsMyBool MyTrue MyTrue = MyTrue; 9.56/4.05 9.56/4.05 lookup k Nil = lookup3 k Nil; 9.56/4.05 lookup k (Cons (Tup2 x y) xys) = lookup2 k (Cons (Tup2 x y) xys); 9.56/4.05 9.56/4.05 lookup0 k x y xys MyTrue = lookup k xys; 9.56/4.05 9.56/4.05 lookup1 k x y xys MyTrue = Main.Just y; 9.56/4.05 lookup1 k x y xys MyFalse = lookup0 k x y xys otherwise; 9.56/4.05 9.56/4.05 lookup2 k (Cons (Tup2 x y) xys) = lookup1 k x y xys (esEsMyBool k x); 9.56/4.05 9.56/4.05 lookup3 k Nil = Main.Nothing; 9.56/4.05 lookup3 vy vz = lookup2 vy vz; popout

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

job log

popout

actions

all output return to Haskell 2019-04-01 06.52