Haskell 2019-04-01 06.52 pair #433317253

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	4.41618 seconds
cpu usage	9.38088
user time	9.05308
system time	0.3278
max virtual memory	1.828352E7
max residence set size	594292.0

stage attributes

key	value
starexec-result	YES

output

7.67/3.90	YES
9.23/4.37	proof of /export/starexec/sandbox/benchmark/theBenchmark.hs
9.23/4.37	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
9.23/4.37	
9.23/4.37	
9.23/4.37	H-Termination with start terms of the given HASKELL could be proven:
9.23/4.37	
9.23/4.37	(0) HASKELL
9.23/4.37	(1) BR [EQUIVALENT, 0 ms]
9.23/4.37	(2) HASKELL
9.23/4.37	(3) COR [EQUIVALENT, 0 ms]
9.23/4.37	(4) HASKELL
9.23/4.37	(5) Narrow [EQUIVALENT, 29 ms]
9.23/4.37	(6) YES
9.23/4.37	
9.23/4.37	
9.23/4.37	----------------------------------------
9.23/4.37	
9.23/4.37	(0)
9.23/4.37	Obligation:
9.23/4.37	mainModule Main 
9.23/4.37	module Main where {
9.23/4.37	import qualified Prelude;
9.23/4.37	data MyBool = MyTrue  | MyFalse ;
9.23/4.37	
9.23/4.37	data Ordering = LT  | EQ  | GT ;
9.23/4.37	
9.23/4.37	data Tup0 = Tup0 ;
9.23/4.37	
9.23/4.37	compareTup0 :: Tup0  ->  Tup0  ->  Ordering;
9.23/4.37	compareTup0 Tup0 Tup0 = EQ;
9.23/4.37	
9.23/4.37	esEsOrdering :: Ordering  ->  Ordering  ->  MyBool;
9.23/4.37	esEsOrdering LT LT = MyTrue;
9.23/4.37	esEsOrdering LT EQ = MyFalse;
9.23/4.37	esEsOrdering LT GT = MyFalse;
9.23/4.37	esEsOrdering EQ LT = MyFalse;
9.23/4.37	esEsOrdering EQ EQ = MyTrue;
9.23/4.37	esEsOrdering EQ GT = MyFalse;
9.23/4.37	esEsOrdering GT LT = MyFalse;
9.23/4.37	esEsOrdering GT EQ = MyFalse;
9.23/4.37	esEsOrdering GT GT = MyTrue;
9.23/4.37	
9.23/4.37	ltTup0 :: Tup0  ->  Tup0  ->  MyBool;
9.23/4.37	ltTup0 x y = esEsOrdering (compareTup0 x y) LT;
9.23/4.37	
9.23/4.37	}
9.23/4.37	
9.23/4.37	----------------------------------------
9.23/4.37	
9.23/4.37	(1) BR (EQUIVALENT)
9.23/4.37	Replaced joker patterns by fresh variables and removed binding patterns.
9.23/4.37	----------------------------------------
9.23/4.37	
9.23/4.37	(2)
9.23/4.37	Obligation:
9.23/4.37	mainModule Main 
9.23/4.37	module Main where {
9.23/4.37	import qualified Prelude;
9.23/4.37	data MyBool = MyTrue  | MyFalse ;
9.23/4.37	
9.23/4.37	data Ordering = LT  | EQ  | GT ;
9.23/4.37	
9.23/4.37	data Tup0 = Tup0 ;
9.23/4.37	
9.23/4.37	compareTup0 :: Tup0  ->  Tup0  ->  Ordering;
9.23/4.37	compareTup0 Tup0 Tup0 = EQ;
9.23/4.37	
9.23/4.37	esEsOrdering :: Ordering  ->  Ordering  ->  MyBool;
9.23/4.37	esEsOrdering LT LT = MyTrue;
9.23/4.37	esEsOrdering LT EQ = MyFalse;
9.23/4.37	esEsOrdering LT GT = MyFalse;
9.23/4.37	esEsOrdering EQ LT = MyFalse;
9.23/4.37	esEsOrdering EQ EQ = MyTrue;
9.23/4.37	esEsOrdering EQ GT = MyFalse;
9.23/4.37	esEsOrdering GT LT = MyFalse;
9.23/4.37	esEsOrdering GT EQ = MyFalse;
9.23/4.37	esEsOrdering GT GT = MyTrue;
9.23/4.37	
9.23/4.37	ltTup0 :: Tup0  ->  Tup0  ->  MyBool;
9.23/4.37	ltTup0 x y = esEsOrdering (compareTup0 x y) LT;
9.23/4.37	
9.23/4.37	}
9.23/4.37	
9.23/4.37	----------------------------------------
9.23/4.37	
9.23/4.37	(3) COR (EQUIVALENT)
9.23/4.37	Cond Reductions:
9.23/4.37	The following Function with conditions
9.23/4.37	"undefined |Falseundefined;
9.23/4.37	"
9.23/4.37	is transformed to
9.23/4.37	"undefined  = undefined1;
9.23/4.37	"
9.23/4.37	"undefined0 True = undefined;
9.23/4.37	"
9.23/4.37	"undefined1  = undefined0 False;
9.23/4.37	"
9.23/4.37	
9.23/4.37	----------------------------------------

popout

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

job log

popout

actions all output return to Haskell 2019-04-01 06.52