7.46/3.53	YES
8.66/3.96	proof of /export/starexec/sandbox/benchmark/theBenchmark.hs
8.66/3.96	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
8.66/3.96	
8.66/3.96	
8.66/3.96	H-Termination with start terms of the given HASKELL could be proven:
8.66/3.96	
8.66/3.96	(0) HASKELL
8.66/3.96	(1) BR [EQUIVALENT, 0 ms]
8.66/3.96	(2) HASKELL
8.66/3.96	(3) COR [EQUIVALENT, 0 ms]
8.66/3.96	(4) HASKELL
8.66/3.96	(5) Narrow [EQUIVALENT, 0 ms]
8.66/3.96	(6) YES
8.66/3.96	
8.66/3.96	
8.66/3.96	----------------------------------------
8.66/3.96	
8.66/3.96	(0)
8.66/3.96	Obligation:
8.66/3.96	mainModule Main 
8.66/3.96	module Main where {
8.66/3.96	import qualified Prelude;
8.66/3.96	data Main.Char = Char MyInt ;
8.66/3.96	
8.66/3.96	data List a = Cons a (List a)  | Nil ;
8.66/3.96	
8.66/3.96	data MyBool = MyTrue  | MyFalse ;
8.66/3.96	
8.66/3.96	data MyInt = Pos Main.Nat  | Neg Main.Nat ;
8.66/3.96	
8.66/3.96	data Main.Nat = Succ Main.Nat  | Zero ;
8.66/3.96	
8.66/3.96	error :: a;
8.66/3.96	error = stop MyTrue;
8.66/3.96	
8.66/3.96	stop :: MyBool  ->  a;
8.66/3.96	stop MyFalse = stop MyFalse;
8.66/3.96	
8.66/3.96	}
8.66/3.96	
8.66/3.96	----------------------------------------
8.66/3.96	
8.66/3.96	(1) BR (EQUIVALENT)
8.66/3.96	Replaced joker patterns by fresh variables and removed binding patterns.
8.66/3.96	----------------------------------------
8.66/3.96	
8.66/3.96	(2)
8.66/3.96	Obligation:
8.66/3.96	mainModule Main 
8.66/3.96	module Main where {
8.66/3.96	import qualified Prelude;
8.66/3.96	data Main.Char = Char MyInt ;
8.66/3.96	
8.66/3.96	data List a = Cons a (List a)  | Nil ;
8.66/3.96	
8.66/3.96	data MyBool = MyTrue  | MyFalse ;
8.66/3.96	
8.66/3.96	data MyInt = Pos Main.Nat  | Neg Main.Nat ;
8.66/3.96	
8.66/3.96	data Main.Nat = Succ Main.Nat  | Zero ;
8.66/3.96	
8.66/3.96	error :: a;
8.66/3.96	error = stop MyTrue;
8.66/3.96	
8.66/3.96	stop :: MyBool  ->  a;
8.66/3.96	stop MyFalse = stop MyFalse;
8.66/3.96	
8.66/3.96	}
8.66/3.96	
8.66/3.96	----------------------------------------
8.66/3.96	
8.66/3.96	(3) COR (EQUIVALENT)
8.66/3.96	Cond Reductions:
8.66/3.96	The following Function with conditions
8.66/3.96	"undefined |Falseundefined;
8.66/3.96	"
8.66/3.96	is transformed to
8.66/3.96	"undefined  = undefined1;
8.66/3.96	"
8.66/3.96	"undefined0 True = undefined;
8.66/3.96	"
8.66/3.96	"undefined1  = undefined0 False;
8.66/3.96	"
8.66/3.96	
8.66/3.96	----------------------------------------
8.66/3.96	
8.66/3.96	(4)
8.66/3.96	Obligation:
8.66/3.96	mainModule Main 
8.66/3.96	module Main where {
8.66/3.96	import qualified Prelude;
8.66/3.96	data Main.Char = Char MyInt ;
8.66/3.96	
8.66/3.96	data List a = Cons a (List a)  | Nil ;
8.66/3.96	
8.66/3.96	data MyBool = MyTrue  | MyFalse ;
8.66/3.96	
8.66/3.96	data MyInt = Pos Main.Nat  | Neg Main.Nat ;
8.66/3.96	
8.66/3.96	data Main.Nat = Succ Main.Nat  | Zero ;
8.66/3.96	
8.66/3.96	error :: a;
8.66/3.96	error = stop MyTrue;
8.66/3.96	
8.66/3.96	stop :: MyBool  ->  a;
8.66/3.96	stop MyFalse = stop MyFalse;
8.66/3.96	
8.66/3.96	}
8.66/3.96	
8.66/3.96	----------------------------------------
8.66/3.96	
8.66/3.96	(5) Narrow (EQUIVALENT)
8.66/3.96	Haskell To QDPs
8.66/3.96	
8.66/3.96	digraph dp_graph {
8.66/3.96	node [outthreshold=100, inthreshold=100];1[label="error",fontsize=16,color="grey",shape="box"];1 -> 3[label="",style="dashed", color="grey", weight=3];
8.66/3.96	3[label="error vx3",fontsize=16,color="black",shape="triangle"];3 -> 4[label="",style="solid", color="black", weight=3];
8.66/3.96	4[label="stop MyTrue vx3",fontsize=16,color="black",shape="box"];4 -> 5[label="",style="solid", color="black", weight=3];
8.66/3.96	5[label="error []",fontsize=16,color="red",shape="box"];}
8.66/3.96	
8.66/3.96	----------------------------------------
8.66/3.96	
8.66/3.96	(6)
8.66/3.96	YES
9.02/4.03	EOF