details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	4.0947 seconds
cpu usage	9.64579
user time	9.35375
system time	0.292046
max virtual memory	1.828352E7
max residence set size	553640.0

stage attributes

key	value
starexec-result	YES

output

7.44/3.54 YES 9.59/4.05 proof of /export/starexec/sandbox/benchmark/theBenchmark.hs 9.59/4.05 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 9.59/4.05 9.59/4.05 9.59/4.05 H-Termination with start terms of the given HASKELL could be proven: 9.59/4.05 9.59/4.05 (0) HASKELL 9.59/4.05 (1) BR [EQUIVALENT, 0 ms] 9.59/4.05 (2) HASKELL 9.59/4.05 (3) COR [EQUIVALENT, 0 ms] 9.59/4.05 (4) HASKELL 9.59/4.05 (5) Narrow [EQUIVALENT, 39 ms] 9.59/4.05 (6) YES 9.59/4.05 9.59/4.05 9.59/4.05 ---------------------------------------- 9.59/4.05 9.59/4.05 (0) 9.59/4.05 Obligation: 9.59/4.05 mainModule Main 9.59/4.05 module Main where { 9.59/4.05 import qualified Prelude; 9.59/4.05 data MyBool = MyTrue | MyFalse ; 9.59/4.05 9.59/4.05 data Ordering = LT | EQ | GT ; 9.59/4.05 9.59/4.05 compare0 x y MyTrue = GT; 9.59/4.05 9.59/4.05 compare1 x y MyTrue = LT; 9.59/4.05 compare1 x y MyFalse = compare0 x y otherwise; 9.59/4.05 9.59/4.05 compare2 x y MyTrue = EQ; 9.59/4.05 compare2 x y MyFalse = compare1 x y (ltEsOrdering x y); 9.59/4.05 9.59/4.05 compare3 x y = compare2 x y (esEsOrdering x y); 9.59/4.05 9.59/4.05 compareOrdering :: Ordering -> Ordering -> Ordering; 9.59/4.05 compareOrdering x y = compare3 x y; 9.59/4.05 9.59/4.05 esEsOrdering :: Ordering -> Ordering -> MyBool; 9.59/4.05 esEsOrdering LT LT = MyTrue; 9.59/4.05 esEsOrdering LT EQ = MyFalse; 9.59/4.05 esEsOrdering LT GT = MyFalse; 9.59/4.05 esEsOrdering EQ LT = MyFalse; 9.59/4.05 esEsOrdering EQ EQ = MyTrue; 9.59/4.05 esEsOrdering EQ GT = MyFalse; 9.59/4.05 esEsOrdering GT LT = MyFalse; 9.59/4.05 esEsOrdering GT EQ = MyFalse; 9.59/4.05 esEsOrdering GT GT = MyTrue; 9.59/4.05 9.59/4.05 ltEsOrdering :: Ordering -> Ordering -> MyBool; 9.59/4.05 ltEsOrdering LT LT = MyTrue; 9.59/4.05 ltEsOrdering LT EQ = MyTrue; 9.59/4.05 ltEsOrdering LT GT = MyTrue; 9.59/4.05 ltEsOrdering EQ LT = MyFalse; 9.59/4.05 ltEsOrdering EQ EQ = MyTrue; 9.59/4.05 ltEsOrdering EQ GT = MyTrue; 9.59/4.05 ltEsOrdering GT LT = MyFalse; 9.59/4.05 ltEsOrdering GT EQ = MyFalse; 9.59/4.05 ltEsOrdering GT GT = MyTrue; 9.59/4.05 9.59/4.05 otherwise :: MyBool; 9.59/4.05 otherwise = MyTrue; 9.59/4.05 9.59/4.05 } 9.59/4.05 9.59/4.05 ---------------------------------------- 9.59/4.05 9.59/4.05 (1) BR (EQUIVALENT) 9.59/4.05 Replaced joker patterns by fresh variables and removed binding patterns. 9.59/4.05 ---------------------------------------- 9.59/4.05 9.59/4.05 (2) 9.59/4.05 Obligation: 9.59/4.05 mainModule Main 9.59/4.05 module Main where { 9.59/4.05 import qualified Prelude; 9.59/4.05 data MyBool = MyTrue | MyFalse ; 9.59/4.05 9.59/4.05 data Ordering = LT | EQ | GT ; 9.59/4.05 9.59/4.05 compare0 x y MyTrue = GT; 9.59/4.05 9.59/4.05 compare1 x y MyTrue = LT; 9.59/4.05 compare1 x y MyFalse = compare0 x y otherwise; 9.59/4.05 9.59/4.05 compare2 x y MyTrue = EQ; 9.59/4.05 compare2 x y MyFalse = compare1 x y (ltEsOrdering x y); 9.59/4.05 9.59/4.05 compare3 x y = compare2 x y (esEsOrdering x y); 9.59/4.05 9.59/4.05 compareOrdering :: Ordering -> Ordering -> Ordering; 9.59/4.05 compareOrdering x y = compare3 x y; 9.59/4.05 9.59/4.05 esEsOrdering :: Ordering -> Ordering -> MyBool; 9.59/4.05 esEsOrdering LT LT = MyTrue; 9.59/4.05 esEsOrdering LT EQ = MyFalse; 9.59/4.05 esEsOrdering LT GT = MyFalse; 9.59/4.05 esEsOrdering EQ LT = MyFalse; popout

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

job log

popout

actions

all output return to Haskell 2019-04-01 06.52