7.80/3.51	YES
9.22/3.96	proof of /export/starexec/sandbox/benchmark/theBenchmark.hs
9.22/3.96	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
9.22/3.96	
9.22/3.96	
9.22/3.96	H-Termination with start terms of the given HASKELL could be proven:
9.22/3.96	
9.22/3.96	(0) HASKELL
9.22/3.96	(1) BR [EQUIVALENT, 0 ms]
9.22/3.96	(2) HASKELL
9.22/3.96	(3) COR [EQUIVALENT, 0 ms]
9.22/3.96	(4) HASKELL
9.22/3.96	(5) Narrow [EQUIVALENT, 31 ms]
9.22/3.96	(6) YES
9.22/3.96	
9.22/3.96	
9.22/3.96	----------------------------------------
9.22/3.96	
9.22/3.96	(0)
9.22/3.96	Obligation:
9.22/3.96	mainModule Main 
9.22/3.96	module Maybe where {
9.22/3.96	import qualified Main;
9.22/3.96	import qualified Prelude;
9.22/3.96	fromJust :: Maybe a  ->  a;
9.22/3.96	fromJust Nothing = error [];
9.22/3.96	fromJust (Just x) = x;
9.22/3.96	
9.22/3.96	}
9.22/3.96	module Main where {
9.22/3.96	import qualified Maybe;
9.22/3.96	import qualified Prelude;
9.22/3.96	}
9.22/3.96	
9.22/3.96	----------------------------------------
9.22/3.96	
9.22/3.96	(1) BR (EQUIVALENT)
9.22/3.96	Replaced joker patterns by fresh variables and removed binding patterns.
9.22/3.96	----------------------------------------
9.22/3.96	
9.22/3.96	(2)
9.22/3.96	Obligation:
9.22/3.96	mainModule Main 
9.22/3.96	module Maybe where {
9.22/3.96	import qualified Main;
9.22/3.96	import qualified Prelude;
9.22/3.96	fromJust :: Maybe a  ->  a;
9.22/3.96	fromJust Nothing = error [];
9.22/3.96	fromJust (Just x) = x;
9.22/3.96	
9.22/3.96	}
9.22/3.96	module Main where {
9.22/3.96	import qualified Maybe;
9.22/3.96	import qualified Prelude;
9.22/3.96	}
9.22/3.96	
9.22/3.96	----------------------------------------
9.22/3.96	
9.22/3.96	(3) COR (EQUIVALENT)
9.22/3.96	Cond Reductions:
9.22/3.96	The following Function with conditions
9.22/3.96	"undefined |Falseundefined;
9.22/3.96	"
9.22/3.96	is transformed to
9.22/3.96	"undefined  = undefined1;
9.22/3.96	"
9.22/3.96	"undefined0 True = undefined;
9.22/3.96	"
9.22/3.96	"undefined1  = undefined0 False;
9.22/3.96	"
9.22/3.96	
9.22/3.96	----------------------------------------
9.22/3.96	
9.22/3.96	(4)
9.22/3.96	Obligation:
9.22/3.96	mainModule Main 
9.22/3.96	module Maybe where {
9.22/3.96	import qualified Main;
9.22/3.96	import qualified Prelude;
9.22/3.96	fromJust :: Maybe a  ->  a;
9.22/3.96	fromJust Nothing = error [];
9.22/3.96	fromJust (Just x) = x;
9.22/3.96	
9.22/3.96	}
9.22/3.96	module Main where {
9.22/3.96	import qualified Maybe;
9.22/3.96	import qualified Prelude;
9.22/3.96	}
9.22/3.96	
9.22/3.96	----------------------------------------
9.22/3.96	
9.22/3.96	(5) Narrow (EQUIVALENT)
9.22/3.96	Haskell To QDPs
9.22/3.96	
9.22/3.96	digraph dp_graph {
9.22/3.96	node [outthreshold=100, inthreshold=100];1[label="Maybe.fromJust",fontsize=16,color="grey",shape="box"];1 -> 3[label="",style="dashed", color="grey", weight=3];
9.22/3.96	3[label="Maybe.fromJust vy3",fontsize=16,color="burlywood",shape="triangle"];9[label="vy3/Nothing",fontsize=10,color="white",style="solid",shape="box"];3 -> 9[label="",style="solid", color="burlywood", weight=9];
9.22/3.96	9 -> 4[label="",style="solid", color="burlywood", weight=3];
9.22/3.96	10[label="vy3/Just vy30",fontsize=10,color="white",style="solid",shape="box"];3 -> 10[label="",style="solid", color="burlywood", weight=9];
9.22/3.96	10 -> 5[label="",style="solid", color="burlywood", weight=3];
9.22/3.96	4[label="Maybe.fromJust Nothing",fontsize=16,color="black",shape="box"];4 -> 6[label="",style="solid", color="black", weight=3];
9.22/3.96	5[label="Maybe.fromJust (Just vy30)",fontsize=16,color="black",shape="box"];5 -> 7[label="",style="solid", color="black", weight=3];
9.22/3.96	6[label="error []",fontsize=16,color="black",shape="box"];6 -> 8[label="",style="solid", color="black", weight=3];
9.22/3.96	7[label="vy30",fontsize=16,color="green",shape="box"];8[label="error []",fontsize=16,color="red",shape="box"];}
9.22/3.96	
9.22/3.96	----------------------------------------
9.22/3.96	
9.22/3.96	(6)
9.22/3.96	YES
9.22/4.00	EOF