7.50/3.57	YES
8.84/4.01	proof of /export/starexec/sandbox/benchmark/theBenchmark.hs
8.84/4.01	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
8.84/4.01	
8.84/4.01	
8.84/4.01	H-Termination with start terms of the given HASKELL could be proven:
8.84/4.01	
8.84/4.01	(0) HASKELL
8.84/4.01	(1) BR [EQUIVALENT, 0 ms]
8.84/4.01	(2) HASKELL
8.84/4.01	(3) COR [EQUIVALENT, 0 ms]
8.84/4.01	(4) HASKELL
8.84/4.01	(5) Narrow [EQUIVALENT, 0 ms]
8.84/4.01	(6) YES
8.84/4.01	
8.84/4.01	
8.84/4.01	----------------------------------------
8.84/4.01	
8.84/4.01	(0)
8.84/4.01	Obligation:
8.84/4.01	mainModule Main 
8.84/4.01	module Main where {
8.84/4.01	import qualified Prelude;
8.84/4.01	data MyInt = Pos Main.Nat  | Neg Main.Nat ;
8.84/4.01	
8.84/4.01	data Main.Nat = Succ Main.Nat  | Zero ;
8.84/4.01	
8.84/4.01	data Ratio a = CnPc a a ;
8.84/4.01	
8.84/4.01	recip :: Ratio MyInt  ->  Ratio MyInt;
8.84/4.01	recip (CnPc x y) = CnPc y x;
8.84/4.01	
8.84/4.01	}
8.84/4.01	
8.84/4.01	----------------------------------------
8.84/4.01	
8.84/4.01	(1) BR (EQUIVALENT)
8.84/4.01	Replaced joker patterns by fresh variables and removed binding patterns.
8.84/4.01	----------------------------------------
8.84/4.01	
8.84/4.01	(2)
8.84/4.01	Obligation:
8.84/4.01	mainModule Main 
8.84/4.01	module Main where {
8.84/4.01	import qualified Prelude;
8.84/4.01	data MyInt = Pos Main.Nat  | Neg Main.Nat ;
8.84/4.01	
8.84/4.01	data Main.Nat = Succ Main.Nat  | Zero ;
8.84/4.01	
8.84/4.01	data Ratio a = CnPc a a ;
8.84/4.01	
8.84/4.01	recip :: Ratio MyInt  ->  Ratio MyInt;
8.84/4.01	recip (CnPc x y) = CnPc y x;
8.84/4.01	
8.84/4.01	}
8.84/4.01	
8.84/4.01	----------------------------------------
8.84/4.01	
8.84/4.01	(3) COR (EQUIVALENT)
8.84/4.01	Cond Reductions:
8.84/4.01	The following Function with conditions
8.84/4.01	"undefined |Falseundefined;
8.84/4.01	"
8.84/4.01	is transformed to
8.84/4.01	"undefined  = undefined1;
8.84/4.01	"
8.84/4.01	"undefined0 True = undefined;
8.84/4.01	"
8.84/4.01	"undefined1  = undefined0 False;
8.84/4.01	"
8.84/4.01	
8.84/4.01	----------------------------------------
8.84/4.01	
8.84/4.01	(4)
8.84/4.01	Obligation:
8.84/4.01	mainModule Main 
8.84/4.01	module Main where {
8.84/4.01	import qualified Prelude;
8.84/4.01	data MyInt = Pos Main.Nat  | Neg Main.Nat ;
8.84/4.01	
8.84/4.01	data Main.Nat = Succ Main.Nat  | Zero ;
8.84/4.01	
8.84/4.01	data Ratio a = CnPc a a ;
8.84/4.01	
8.84/4.01	recip :: Ratio MyInt  ->  Ratio MyInt;
8.84/4.01	recip (CnPc x y) = CnPc y x;
8.84/4.01	
8.84/4.01	}
8.84/4.01	
8.84/4.01	----------------------------------------
8.84/4.01	
8.84/4.01	(5) Narrow (EQUIVALENT)
8.84/4.01	Haskell To QDPs
8.84/4.01	
8.84/4.01	digraph dp_graph {
8.84/4.01	node [outthreshold=100, inthreshold=100];1[label="recip",fontsize=16,color="grey",shape="box"];1 -> 3[label="",style="dashed", color="grey", weight=3];
8.84/4.01	3[label="recip vx3",fontsize=16,color="burlywood",shape="triangle"];6[label="vx3/CnPc vx30 vx31",fontsize=10,color="white",style="solid",shape="box"];3 -> 6[label="",style="solid", color="burlywood", weight=9];
8.84/4.01	6 -> 4[label="",style="solid", color="burlywood", weight=3];
8.84/4.01	4[label="recip (CnPc vx30 vx31)",fontsize=16,color="black",shape="box"];4 -> 5[label="",style="solid", color="black", weight=3];
8.84/4.01	5[label="CnPc vx31 vx30",fontsize=16,color="green",shape="box"];}
8.84/4.01	
8.84/4.01	----------------------------------------
8.84/4.01	
8.84/4.01	(6)
8.84/4.01	YES
9.09/4.07	EOF