7.68/3.43	YES
9.23/3.88	proof of /export/starexec/sandbox2/benchmark/theBenchmark.hs
9.23/3.88	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
9.23/3.88	
9.23/3.88	
9.23/3.88	H-Termination with start terms of the given HASKELL could be proven:
9.23/3.88	
9.23/3.88	(0) HASKELL
9.23/3.88	(1) BR [EQUIVALENT, 0 ms]
9.23/3.88	(2) HASKELL
9.23/3.88	(3) COR [EQUIVALENT, 0 ms]
9.23/3.88	(4) HASKELL
9.23/3.88	(5) Narrow [EQUIVALENT, 0 ms]
9.23/3.88	(6) YES
9.23/3.88	
9.23/3.88	
9.23/3.88	----------------------------------------
9.23/3.88	
9.23/3.88	(0)
9.23/3.88	Obligation:
9.23/3.88	mainModule Main 
9.23/3.88	module Main where {
9.23/3.88	import qualified Prelude;
9.23/3.88	data Ordering = LT  | EQ  | GT ;
9.23/3.88	
9.23/3.88	data Tup0 = Tup0 ;
9.23/3.88	
9.23/3.88	compareTup0 :: Tup0  ->  Tup0  ->  Ordering;
9.23/3.88	compareTup0 Tup0 Tup0 = EQ;
9.23/3.88	
9.23/3.88	}
9.23/3.88	
9.23/3.88	----------------------------------------
9.23/3.88	
9.23/3.88	(1) BR (EQUIVALENT)
9.23/3.88	Replaced joker patterns by fresh variables and removed binding patterns.
9.23/3.88	----------------------------------------
9.23/3.88	
9.23/3.88	(2)
9.23/3.88	Obligation:
9.23/3.88	mainModule Main 
9.23/3.88	module Main where {
9.23/3.88	import qualified Prelude;
9.23/3.88	data Ordering = LT  | EQ  | GT ;
9.23/3.88	
9.23/3.88	data Tup0 = Tup0 ;
9.23/3.88	
9.23/3.88	compareTup0 :: Tup0  ->  Tup0  ->  Ordering;
9.23/3.88	compareTup0 Tup0 Tup0 = EQ;
9.23/3.88	
9.23/3.88	}
9.23/3.88	
9.23/3.88	----------------------------------------
9.23/3.88	
9.23/3.88	(3) COR (EQUIVALENT)
9.23/3.88	Cond Reductions:
9.23/3.88	The following Function with conditions
9.23/3.88	"undefined |Falseundefined;
9.23/3.88	"
9.23/3.88	is transformed to
9.23/3.88	"undefined  = undefined1;
9.23/3.88	"
9.23/3.88	"undefined0 True = undefined;
9.23/3.88	"
9.23/3.88	"undefined1  = undefined0 False;
9.23/3.88	"
9.23/3.88	
9.23/3.88	----------------------------------------
9.23/3.88	
9.23/3.88	(4)
9.23/3.88	Obligation:
9.23/3.88	mainModule Main 
9.23/3.88	module Main where {
9.23/3.88	import qualified Prelude;
9.23/3.88	data Ordering = LT  | EQ  | GT ;
9.23/3.88	
9.23/3.88	data Tup0 = Tup0 ;
9.23/3.88	
9.23/3.88	compareTup0 :: Tup0  ->  Tup0  ->  Ordering;
9.23/3.88	compareTup0 Tup0 Tup0 = EQ;
9.23/3.88	
9.23/3.88	}
9.23/3.88	
9.23/3.88	----------------------------------------
9.23/3.88	
9.23/3.88	(5) Narrow (EQUIVALENT)
9.23/3.88	Haskell To QDPs
9.23/3.88	
9.23/3.88	digraph dp_graph {
9.23/3.88	node [outthreshold=100, inthreshold=100];1[label="compareTup0",fontsize=16,color="grey",shape="box"];1 -> 3[label="",style="dashed", color="grey", weight=3];
9.23/3.88	3[label="compareTup0 vx3",fontsize=16,color="grey",shape="box"];3 -> 4[label="",style="dashed", color="grey", weight=3];
9.23/3.88	4[label="compareTup0 vx3 vx4",fontsize=16,color="burlywood",shape="triangle"];8[label="vx3/Tup0",fontsize=10,color="white",style="solid",shape="box"];4 -> 8[label="",style="solid", color="burlywood", weight=9];
9.23/3.88	8 -> 5[label="",style="solid", color="burlywood", weight=3];
9.23/3.88	5[label="compareTup0 Tup0 vx4",fontsize=16,color="burlywood",shape="box"];9[label="vx4/Tup0",fontsize=10,color="white",style="solid",shape="box"];5 -> 9[label="",style="solid", color="burlywood", weight=9];
9.23/3.88	9 -> 6[label="",style="solid", color="burlywood", weight=3];
9.23/3.88	6[label="compareTup0 Tup0 Tup0",fontsize=16,color="black",shape="box"];6 -> 7[label="",style="solid", color="black", weight=3];
9.23/3.88	7[label="EQ",fontsize=16,color="green",shape="box"];}
9.23/3.88	
9.23/3.88	----------------------------------------
9.23/3.88	
9.23/3.88	(6)
9.23/3.88	YES
9.34/3.93	EOF