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