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