details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	4.24511 seconds
cpu usage	9.99167
user time	9.66503
system time	0.326646
max virtual memory	1.828352E7
max residence set size	588372.0

stage attributes

key	value
starexec-result	YES

output

8.06/3.66 YES 9.83/4.15 proof of /export/starexec/sandbox/benchmark/theBenchmark.hs 9.83/4.15 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 9.83/4.15 9.83/4.15 9.83/4.15 H-Termination with start terms of the given HASKELL could be proven: 9.83/4.15 9.83/4.15 (0) HASKELL 9.83/4.15 (1) BR [EQUIVALENT, 0 ms] 9.83/4.15 (2) HASKELL 9.83/4.15 (3) COR [EQUIVALENT, 0 ms] 9.83/4.15 (4) HASKELL 9.83/4.15 (5) Narrow [EQUIVALENT, 30 ms] 9.83/4.15 (6) YES 9.83/4.15 9.83/4.15 9.83/4.15 ---------------------------------------- 9.83/4.15 9.83/4.15 (0) 9.83/4.15 Obligation: 9.83/4.15 mainModule Main 9.83/4.15 module Main where { 9.83/4.15 import qualified Prelude; 9.83/4.15 data MyBool = MyTrue | MyFalse ; 9.83/4.15 9.83/4.15 data Ordering = LT | EQ | GT ; 9.83/4.15 9.83/4.15 ltEsOrdering :: Ordering -> Ordering -> MyBool; 9.83/4.15 ltEsOrdering LT LT = MyTrue; 9.83/4.15 ltEsOrdering LT EQ = MyTrue; 9.83/4.15 ltEsOrdering LT GT = MyTrue; 9.83/4.15 ltEsOrdering EQ LT = MyFalse; 9.83/4.15 ltEsOrdering EQ EQ = MyTrue; 9.83/4.15 ltEsOrdering EQ GT = MyTrue; 9.83/4.15 ltEsOrdering GT LT = MyFalse; 9.83/4.15 ltEsOrdering GT EQ = MyFalse; 9.83/4.15 ltEsOrdering GT GT = MyTrue; 9.83/4.15 9.83/4.15 min0 x y MyTrue = y; 9.83/4.15 9.83/4.15 min1 x y MyTrue = x; 9.83/4.15 min1 x y MyFalse = min0 x y otherwise; 9.83/4.15 9.83/4.15 min2 x y = min1 x y (ltEsOrdering x y); 9.83/4.15 9.83/4.15 minOrdering :: Ordering -> Ordering -> Ordering; 9.83/4.15 minOrdering x y = min2 x y; 9.83/4.15 9.83/4.15 otherwise :: MyBool; 9.83/4.15 otherwise = MyTrue; 9.83/4.15 9.83/4.15 } 9.83/4.15 9.83/4.15 ---------------------------------------- 9.83/4.15 9.83/4.15 (1) BR (EQUIVALENT) 9.83/4.15 Replaced joker patterns by fresh variables and removed binding patterns. 9.83/4.15 ---------------------------------------- 9.83/4.15 9.83/4.15 (2) 9.83/4.15 Obligation: 9.83/4.15 mainModule Main 9.83/4.15 module Main where { 9.83/4.15 import qualified Prelude; 9.83/4.15 data MyBool = MyTrue | MyFalse ; 9.83/4.15 9.83/4.15 data Ordering = LT | EQ | GT ; 9.83/4.15 9.83/4.15 ltEsOrdering :: Ordering -> Ordering -> MyBool; 9.83/4.15 ltEsOrdering LT LT = MyTrue; 9.83/4.15 ltEsOrdering LT EQ = MyTrue; 9.83/4.15 ltEsOrdering LT GT = MyTrue; 9.83/4.15 ltEsOrdering EQ LT = MyFalse; 9.83/4.15 ltEsOrdering EQ EQ = MyTrue; 9.83/4.15 ltEsOrdering EQ GT = MyTrue; 9.83/4.15 ltEsOrdering GT LT = MyFalse; 9.83/4.15 ltEsOrdering GT EQ = MyFalse; 9.83/4.15 ltEsOrdering GT GT = MyTrue; 9.83/4.15 9.83/4.15 min0 x y MyTrue = y; 9.83/4.15 9.83/4.15 min1 x y MyTrue = x; 9.83/4.15 min1 x y MyFalse = min0 x y otherwise; 9.83/4.15 9.83/4.15 min2 x y = min1 x y (ltEsOrdering x y); 9.83/4.15 9.83/4.15 minOrdering :: Ordering -> Ordering -> Ordering; 9.83/4.15 minOrdering x y = min2 x y; 9.83/4.15 9.83/4.15 otherwise :: MyBool; 9.83/4.15 otherwise = MyTrue; 9.83/4.15 9.83/4.15 } 9.83/4.15 9.83/4.15 ---------------------------------------- 9.83/4.15 9.83/4.15 (3) COR (EQUIVALENT) 9.83/4.15 Cond Reductions: 9.83/4.15 The following Function with conditions 9.83/4.15 "undefined |Falseundefined; popout

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

job log

popout

actions

all output return to Haskell 2019-04-01 06.52