7.97/3.53	YES
9.63/4.00	proof of /export/starexec/sandbox2/benchmark/theBenchmark.hs
9.63/4.00	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
9.63/4.00	
9.63/4.00	
9.63/4.00	H-Termination with start terms of the given HASKELL could be proven:
9.63/4.00	
9.63/4.00	(0) HASKELL
9.63/4.00	(1) BR [EQUIVALENT, 0 ms]
9.63/4.00	(2) HASKELL
9.63/4.00	(3) COR [EQUIVALENT, 0 ms]
9.63/4.00	(4) HASKELL
9.63/4.00	(5) Narrow [SOUND, 0 ms]
9.63/4.00	(6) QDP
9.63/4.00	(7) QDPSizeChangeProof [EQUIVALENT, 0 ms]
9.63/4.00	(8) YES
9.63/4.00	
9.63/4.00	
9.63/4.00	----------------------------------------
9.63/4.00	
9.63/4.00	(0)
9.63/4.00	Obligation:
9.63/4.00	mainModule Main 
9.63/4.00	module Main where {
9.63/4.00	import qualified Prelude;
9.63/4.00	}
9.63/4.00	
9.63/4.00	----------------------------------------
9.63/4.00	
9.63/4.00	(1) BR (EQUIVALENT)
9.63/4.00	Replaced joker patterns by fresh variables and removed binding patterns.
9.63/4.00	----------------------------------------
9.63/4.00	
9.63/4.00	(2)
9.63/4.00	Obligation:
9.63/4.00	mainModule Main 
9.63/4.00	module Main where {
9.63/4.00	import qualified Prelude;
9.63/4.00	}
9.63/4.00	
9.63/4.00	----------------------------------------
9.63/4.00	
9.63/4.00	(3) COR (EQUIVALENT)
9.63/4.00	Cond Reductions:
9.63/4.00	The following Function with conditions
9.63/4.00	"undefined |Falseundefined;
9.63/4.00	"
9.63/4.00	is transformed to
9.63/4.00	"undefined  = undefined1;
9.63/4.00	"
9.63/4.00	"undefined0 True = undefined;
9.63/4.00	"
9.63/4.00	"undefined1  = undefined0 False;
9.63/4.00	"
9.63/4.00	
9.63/4.00	----------------------------------------
9.63/4.00	
9.63/4.00	(4)
9.63/4.00	Obligation:
9.63/4.00	mainModule Main 
9.63/4.00	module Main where {
9.63/4.00	import qualified Prelude;
9.63/4.00	}
9.63/4.00	
9.63/4.00	----------------------------------------
9.63/4.00	
9.63/4.00	(5) Narrow (SOUND)
9.63/4.00	Haskell To QDPs
9.63/4.00	
9.63/4.00	digraph dp_graph {
9.63/4.00	node [outthreshold=100, inthreshold=100];1[label="(>)",fontsize=16,color="grey",shape="box"];1 -> 3[label="",style="dashed", color="grey", weight=3];
9.63/4.00	3[label="(>) vx3",fontsize=16,color="grey",shape="box"];3 -> 4[label="",style="dashed", color="grey", weight=3];
9.63/4.00	4[label="(>) vx3 vx4",fontsize=16,color="black",shape="triangle"];4 -> 5[label="",style="solid", color="black", weight=3];
9.63/4.00	5[label="compare vx3 vx4 == GT",fontsize=16,color="black",shape="box"];5 -> 6[label="",style="solid", color="black", weight=3];
9.63/4.00	6[label="primCmpChar vx3 vx4 == GT",fontsize=16,color="burlywood",shape="box"];25[label="vx3/Char vx30",fontsize=10,color="white",style="solid",shape="box"];6 -> 25[label="",style="solid", color="burlywood", weight=9];
9.63/4.00	25 -> 7[label="",style="solid", color="burlywood", weight=3];
9.63/4.00	7[label="primCmpChar (Char vx30) vx4 == GT",fontsize=16,color="burlywood",shape="box"];26[label="vx4/Char vx40",fontsize=10,color="white",style="solid",shape="box"];7 -> 26[label="",style="solid", color="burlywood", weight=9];
9.63/4.00	26 -> 8[label="",style="solid", color="burlywood", weight=3];
9.63/4.00	8[label="primCmpChar (Char vx30) (Char vx40) == GT",fontsize=16,color="black",shape="box"];8 -> 9[label="",style="solid", color="black", weight=3];
9.63/4.00	9[label="primCmpNat vx30 vx40 == GT",fontsize=16,color="burlywood",shape="triangle"];27[label="vx30/Succ vx300",fontsize=10,color="white",style="solid",shape="box"];9 -> 27[label="",style="solid", color="burlywood", weight=9];
9.63/4.00	27 -> 10[label="",style="solid", color="burlywood", weight=3];
9.63/4.00	28[label="vx30/Zero",fontsize=10,color="white",style="solid",shape="box"];9 -> 28[label="",style="solid", color="burlywood", weight=9];
9.63/4.00	28 -> 11[label="",style="solid", color="burlywood", weight=3];
9.63/4.00	10[label="primCmpNat (Succ vx300) vx40 == GT",fontsize=16,color="burlywood",shape="box"];29[label="vx40/Succ vx400",fontsize=10,color="white",style="solid",shape="box"];10 -> 29[label="",style="solid", color="burlywood", weight=9];
9.63/4.00	29 -> 12[label="",style="solid", color="burlywood", weight=3];
9.63/4.00	30[label="vx40/Zero",fontsize=10,color="white",style="solid",shape="box"];10 -> 30[label="",style="solid", color="burlywood", weight=9];
9.63/4.00	30 -> 13[label="",style="solid", color="burlywood", weight=3];
9.63/4.00	11[label="primCmpNat Zero vx40 == GT",fontsize=16,color="burlywood",shape="box"];31[label="vx40/Succ vx400",fontsize=10,color="white",style="solid",shape="box"];11 -> 31[label="",style="solid", color="burlywood", weight=9];
9.63/4.00	31 -> 14[label="",style="solid", color="burlywood", weight=3];
9.63/4.00	32[label="vx40/Zero",fontsize=10,color="white",style="solid",shape="box"];11 -> 32[label="",style="solid", color="burlywood", weight=9];
9.63/4.00	32 -> 15[label="",style="solid", color="burlywood", weight=3];
9.63/4.00	12[label="primCmpNat (Succ vx300) (Succ vx400) == GT",fontsize=16,color="black",shape="box"];12 -> 16[label="",style="solid", color="black", weight=3];
9.63/4.00	13[label="primCmpNat (Succ vx300) Zero == GT",fontsize=16,color="black",shape="box"];13 -> 17[label="",style="solid", color="black", weight=3];
9.63/4.00	14[label="primCmpNat Zero (Succ vx400) == GT",fontsize=16,color="black",shape="box"];14 -> 18[label="",style="solid", color="black", weight=3];
9.63/4.00	15[label="primCmpNat Zero Zero == GT",fontsize=16,color="black",shape="box"];15 -> 19[label="",style="solid", color="black", weight=3];
9.63/4.00	16 -> 9[label="",style="dashed", color="red", weight=0];
9.63/4.00	16[label="primCmpNat vx300 vx400 == GT",fontsize=16,color="magenta"];16 -> 20[label="",style="dashed", color="magenta", weight=3];
9.63/4.00	16 -> 21[label="",style="dashed", color="magenta", weight=3];
9.63/4.00	17[label="GT == GT",fontsize=16,color="black",shape="box"];17 -> 22[label="",style="solid", color="black", weight=3];
9.63/4.00	18[label="LT == GT",fontsize=16,color="black",shape="box"];18 -> 23[label="",style="solid", color="black", weight=3];
9.63/4.00	19[label="EQ == GT",fontsize=16,color="black",shape="box"];19 -> 24[label="",style="solid", color="black", weight=3];
9.63/4.00	20[label="vx400",fontsize=16,color="green",shape="box"];21[label="vx300",fontsize=16,color="green",shape="box"];22[label="True",fontsize=16,color="green",shape="box"];23[label="False",fontsize=16,color="green",shape="box"];24[label="False",fontsize=16,color="green",shape="box"];}
9.63/4.00	
9.63/4.00	----------------------------------------
9.63/4.00	
9.63/4.00	(6)
9.63/4.00	Obligation:
9.63/4.00	Q DP problem:
9.63/4.00	The TRS P consists of the following rules:
9.63/4.00	
9.63/4.00	   new_esEs(Succ(vx300), Succ(vx400)) -> new_esEs(vx300, vx400)
9.63/4.00	
9.63/4.00	R is empty.
9.63/4.00	Q is empty.
9.63/4.00	We have to consider all minimal (P,Q,R)-chains.
9.63/4.00	----------------------------------------
9.63/4.00	
9.63/4.00	(7) QDPSizeChangeProof (EQUIVALENT)
9.63/4.00	By using the subterm criterion [SUBTERM_CRITERION] together with the size-change analysis [AAECC05] we have proven that there are no infinite chains for this DP problem. 
9.63/4.00	
9.63/4.00	From the DPs we obtained the following set of size-change graphs:
9.63/4.00	*new_esEs(Succ(vx300), Succ(vx400)) -> new_esEs(vx300, vx400)
9.63/4.00	The graph contains the following edges 1 > 1, 2 > 2
9.63/4.00	
9.63/4.00	
9.63/4.00	----------------------------------------
9.63/4.00	
9.63/4.00	(8)
9.63/4.00	YES
9.83/4.04	EOF