9.88/4.55	YES
11.97/5.13	proof of /export/starexec/sandbox/benchmark/theBenchmark.hs
11.97/5.13	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
11.97/5.13	
11.97/5.13	
11.97/5.13	H-Termination with start terms of the given HASKELL could be proven:
11.97/5.13	
11.97/5.13	(0) HASKELL
11.97/5.13	(1) LR [EQUIVALENT, 0 ms]
11.97/5.13	(2) HASKELL
11.97/5.13	(3) BR [EQUIVALENT, 0 ms]
11.97/5.13	(4) HASKELL
11.97/5.13	(5) COR [EQUIVALENT, 0 ms]
11.97/5.13	(6) HASKELL
11.97/5.13	(7) Narrow [SOUND, 0 ms]
11.97/5.13	(8) AND
11.97/5.13	    (9) QDP
11.97/5.13	        (10) QDPSizeChangeProof [EQUIVALENT, 0 ms]
11.97/5.13	        (11) YES
11.97/5.13	    (12) QDP
11.97/5.13	        (13) QDPSizeChangeProof [EQUIVALENT, 0 ms]
11.97/5.13	        (14) YES
11.97/5.13	
11.97/5.13	
11.97/5.13	----------------------------------------
11.97/5.13	
11.97/5.13	(0)
11.97/5.13	Obligation:
11.97/5.13	mainModule Main 
11.97/5.13	module FiniteMap where {
11.97/5.13	import qualified Main;
11.97/5.13	import qualified Maybe;
11.97/5.13	import qualified Prelude;
11.97/5.13	data FiniteMap b a = EmptyFM  | Branch b a Int (FiniteMap b a) (FiniteMap b a) ;
11.97/5.13	
11.97/5.13	foldFM :: (c  ->  a  ->  b  ->  b)  ->  b  ->  FiniteMap c a  ->  b;
11.97/5.13	foldFM k z EmptyFM = z;
11.97/5.13	foldFM k z (Branch key elt _ fm_l fm_r) = foldFM k (k key elt (foldFM k z fm_r)) fm_l;
11.97/5.13	
11.97/5.13	keysFM :: FiniteMap b a  ->  [b];
11.97/5.13	keysFM fm = foldFM (\key elt rest ->key : rest) [] fm;
11.97/5.13	
11.97/5.13	}
11.97/5.13	module Maybe where {
11.97/5.13	import qualified FiniteMap;
11.97/5.13	import qualified Main;
11.97/5.13	import qualified Prelude;
11.97/5.13	}
11.97/5.13	module Main where {
11.97/5.13	import qualified FiniteMap;
11.97/5.13	import qualified Maybe;
11.97/5.13	import qualified Prelude;
11.97/5.13	}
11.97/5.13	
11.97/5.13	----------------------------------------
11.97/5.13	
11.97/5.13	(1) LR (EQUIVALENT)
11.97/5.13	Lambda Reductions:
11.97/5.13	The following Lambda expression
11.97/5.13	"\keyeltrest->key : rest"
11.97/5.13	is transformed to
11.97/5.13	"keysFM0 key elt rest = key : rest;
11.97/5.13	"
11.97/5.13	
11.97/5.13	----------------------------------------
11.97/5.13	
11.97/5.13	(2)
11.97/5.13	Obligation:
11.97/5.13	mainModule Main 
11.97/5.13	module FiniteMap where {
11.97/5.13	import qualified Main;
11.97/5.13	import qualified Maybe;
11.97/5.13	import qualified Prelude;
11.97/5.13	data FiniteMap a b = EmptyFM  | Branch a b Int (FiniteMap a b) (FiniteMap a b) ;
11.97/5.13	
11.97/5.13	foldFM :: (a  ->  b  ->  c  ->  c)  ->  c  ->  FiniteMap a b  ->  c;
11.97/5.13	foldFM k z EmptyFM = z;
11.97/5.13	foldFM k z (Branch key elt _ fm_l fm_r) = foldFM k (k key elt (foldFM k z fm_r)) fm_l;
11.97/5.13	
11.97/5.13	keysFM :: FiniteMap b a  ->  [b];
11.97/5.13	keysFM fm = foldFM keysFM0 [] fm;
11.97/5.13	
11.97/5.13	keysFM0 key elt rest = key : rest;
11.97/5.13	
11.97/5.13	}
11.97/5.13	module Maybe where {
11.97/5.13	import qualified FiniteMap;
11.97/5.13	import qualified Main;
11.97/5.13	import qualified Prelude;
11.97/5.13	}
11.97/5.13	module Main where {
11.97/5.13	import qualified FiniteMap;
11.97/5.13	import qualified Maybe;
11.97/5.13	import qualified Prelude;
11.97/5.13	}
11.97/5.13	
11.97/5.13	----------------------------------------
11.97/5.13	
11.97/5.13	(3) BR (EQUIVALENT)
11.97/5.13	Replaced joker patterns by fresh variables and removed binding patterns.
11.97/5.13	----------------------------------------
11.97/5.13	
11.97/5.13	(4)
11.97/5.13	Obligation:
11.97/5.13	mainModule Main 
11.97/5.13	module FiniteMap where {
11.97/5.13	import qualified Main;
11.97/5.13	import qualified Maybe;
11.97/5.13	import qualified Prelude;
11.97/5.13	data FiniteMap a b = EmptyFM  | Branch a b Int (FiniteMap a b) (FiniteMap a b) ;
11.97/5.13	
11.97/5.13	foldFM :: (c  ->  b  ->  a  ->  a)  ->  a  ->  FiniteMap c b  ->  a;
11.97/5.13	foldFM k z EmptyFM = z;
11.97/5.13	foldFM k z (Branch key elt vy fm_l fm_r) = foldFM k (k key elt (foldFM k z fm_r)) fm_l;
11.97/5.13	
11.97/5.13	keysFM :: FiniteMap b a  ->  [b];
11.97/5.13	keysFM fm = foldFM keysFM0 [] fm;
11.97/5.13	
11.97/5.13	keysFM0 key elt rest = key : rest;
11.97/5.13	
11.97/5.13	}
11.97/5.13	module Maybe where {
11.97/5.13	import qualified FiniteMap;
11.97/5.13	import qualified Main;
11.97/5.13	import qualified Prelude;
11.97/5.13	}
11.97/5.13	module Main where {
11.97/5.13	import qualified FiniteMap;
11.97/5.13	import qualified Maybe;
11.97/5.13	import qualified Prelude;
11.97/5.13	}
11.97/5.13	
11.97/5.13	----------------------------------------
11.97/5.13	
11.97/5.13	(5) COR (EQUIVALENT)
11.97/5.13	Cond Reductions:
11.97/5.13	The following Function with conditions
11.97/5.13	"undefined |Falseundefined;
11.97/5.13	"
11.97/5.13	is transformed to
11.97/5.13	"undefined  = undefined1;
11.97/5.13	"
11.97/5.13	"undefined0 True = undefined;
11.97/5.13	"
11.97/5.13	"undefined1  = undefined0 False;
11.97/5.13	"
11.97/5.13	
11.97/5.13	----------------------------------------
11.97/5.13	
11.97/5.13	(6)
11.97/5.13	Obligation:
11.97/5.13	mainModule Main 
11.97/5.13	module FiniteMap where {
11.97/5.13	import qualified Main;
11.97/5.13	import qualified Maybe;
11.97/5.13	import qualified Prelude;
11.97/5.13	data FiniteMap b a = EmptyFM  | Branch b a Int (FiniteMap b a) (FiniteMap b a) ;
11.97/5.13	
11.97/5.13	foldFM :: (c  ->  b  ->  a  ->  a)  ->  a  ->  FiniteMap c b  ->  a;
11.97/5.13	foldFM k z EmptyFM = z;
11.97/5.13	foldFM k z (Branch key elt vy fm_l fm_r) = foldFM k (k key elt (foldFM k z fm_r)) fm_l;
11.97/5.13	
11.97/5.13	keysFM :: FiniteMap b a  ->  [b];
11.97/5.13	keysFM fm = foldFM keysFM0 [] fm;
11.97/5.13	
11.97/5.13	keysFM0 key elt rest = key : rest;
11.97/5.13	
11.97/5.13	}
11.97/5.13	module Maybe where {
11.97/5.13	import qualified FiniteMap;
11.97/5.13	import qualified Main;
11.97/5.13	import qualified Prelude;
11.97/5.13	}
11.97/5.13	module Main where {
11.97/5.13	import qualified FiniteMap;
11.97/5.13	import qualified Maybe;
11.97/5.13	import qualified Prelude;
11.97/5.14	}
11.97/5.14	
11.97/5.14	----------------------------------------
11.97/5.14	
11.97/5.14	(7) Narrow (SOUND)
11.97/5.14	Haskell To QDPs
11.97/5.14	
11.97/5.14	digraph dp_graph {
11.97/5.14	node [outthreshold=100, inthreshold=100];1[label="FiniteMap.keysFM",fontsize=16,color="grey",shape="box"];1 -> 3[label="",style="dashed", color="grey", weight=3];
11.97/5.14	3[label="FiniteMap.keysFM vz3",fontsize=16,color="black",shape="triangle"];3 -> 4[label="",style="solid", color="black", weight=3];
11.97/5.14	4[label="FiniteMap.foldFM FiniteMap.keysFM0 [] vz3",fontsize=16,color="burlywood",shape="triangle"];22[label="vz3/FiniteMap.EmptyFM",fontsize=10,color="white",style="solid",shape="box"];4 -> 22[label="",style="solid", color="burlywood", weight=9];
11.97/5.14	22 -> 5[label="",style="solid", color="burlywood", weight=3];
11.97/5.14	23[label="vz3/FiniteMap.Branch vz30 vz31 vz32 vz33 vz34",fontsize=10,color="white",style="solid",shape="box"];4 -> 23[label="",style="solid", color="burlywood", weight=9];
11.97/5.14	23 -> 6[label="",style="solid", color="burlywood", weight=3];
11.97/5.14	5[label="FiniteMap.foldFM FiniteMap.keysFM0 [] FiniteMap.EmptyFM",fontsize=16,color="black",shape="box"];5 -> 7[label="",style="solid", color="black", weight=3];
11.97/5.14	6[label="FiniteMap.foldFM FiniteMap.keysFM0 [] (FiniteMap.Branch vz30 vz31 vz32 vz33 vz34)",fontsize=16,color="black",shape="box"];6 -> 8[label="",style="solid", color="black", weight=3];
11.97/5.14	7[label="[]",fontsize=16,color="green",shape="box"];8 -> 9[label="",style="dashed", color="red", weight=0];
11.97/5.14	8[label="FiniteMap.foldFM FiniteMap.keysFM0 (FiniteMap.keysFM0 vz30 vz31 (FiniteMap.foldFM FiniteMap.keysFM0 [] vz34)) vz33",fontsize=16,color="magenta"];8 -> 10[label="",style="dashed", color="magenta", weight=3];
11.97/5.14	10 -> 4[label="",style="dashed", color="red", weight=0];
11.97/5.14	10[label="FiniteMap.foldFM FiniteMap.keysFM0 [] vz34",fontsize=16,color="magenta"];10 -> 11[label="",style="dashed", color="magenta", weight=3];
11.97/5.14	9[label="FiniteMap.foldFM FiniteMap.keysFM0 (FiniteMap.keysFM0 vz30 vz31 vz4) vz33",fontsize=16,color="burlywood",shape="triangle"];24[label="vz33/FiniteMap.EmptyFM",fontsize=10,color="white",style="solid",shape="box"];9 -> 24[label="",style="solid", color="burlywood", weight=9];
11.97/5.14	24 -> 12[label="",style="solid", color="burlywood", weight=3];
11.97/5.14	25[label="vz33/FiniteMap.Branch vz330 vz331 vz332 vz333 vz334",fontsize=10,color="white",style="solid",shape="box"];9 -> 25[label="",style="solid", color="burlywood", weight=9];
11.97/5.14	25 -> 13[label="",style="solid", color="burlywood", weight=3];
11.97/5.14	11[label="vz34",fontsize=16,color="green",shape="box"];12[label="FiniteMap.foldFM FiniteMap.keysFM0 (FiniteMap.keysFM0 vz30 vz31 vz4) FiniteMap.EmptyFM",fontsize=16,color="black",shape="box"];12 -> 14[label="",style="solid", color="black", weight=3];
11.97/5.14	13[label="FiniteMap.foldFM FiniteMap.keysFM0 (FiniteMap.keysFM0 vz30 vz31 vz4) (FiniteMap.Branch vz330 vz331 vz332 vz333 vz334)",fontsize=16,color="black",shape="box"];13 -> 15[label="",style="solid", color="black", weight=3];
11.97/5.14	14[label="FiniteMap.keysFM0 vz30 vz31 vz4",fontsize=16,color="black",shape="box"];14 -> 16[label="",style="solid", color="black", weight=3];
11.97/5.14	15 -> 9[label="",style="dashed", color="red", weight=0];
11.97/5.14	15[label="FiniteMap.foldFM FiniteMap.keysFM0 (FiniteMap.keysFM0 vz330 vz331 (FiniteMap.foldFM FiniteMap.keysFM0 (FiniteMap.keysFM0 vz30 vz31 vz4) vz334)) vz333",fontsize=16,color="magenta"];15 -> 17[label="",style="dashed", color="magenta", weight=3];
11.97/5.14	15 -> 18[label="",style="dashed", color="magenta", weight=3];
11.97/5.14	15 -> 19[label="",style="dashed", color="magenta", weight=3];
11.97/5.14	15 -> 20[label="",style="dashed", color="magenta", weight=3];
11.97/5.14	16[label="vz30 : vz4",fontsize=16,color="green",shape="box"];17[label="vz330",fontsize=16,color="green",shape="box"];18 -> 9[label="",style="dashed", color="red", weight=0];
11.97/5.14	18[label="FiniteMap.foldFM FiniteMap.keysFM0 (FiniteMap.keysFM0 vz30 vz31 vz4) vz334",fontsize=16,color="magenta"];18 -> 21[label="",style="dashed", color="magenta", weight=3];
11.97/5.14	19[label="vz331",fontsize=16,color="green",shape="box"];20[label="vz333",fontsize=16,color="green",shape="box"];21[label="vz334",fontsize=16,color="green",shape="box"];}
11.97/5.14	
11.97/5.14	----------------------------------------
11.97/5.14	
11.97/5.14	(8)
11.97/5.14	Complex Obligation (AND)
11.97/5.14	
11.97/5.14	----------------------------------------
11.97/5.14	
11.97/5.14	(9)
11.97/5.14	Obligation:
11.97/5.14	Q DP problem:
11.97/5.14	The TRS P consists of the following rules:
11.97/5.14	
11.97/5.14	   new_foldFM1(Branch(vz30, vz31, vz32, vz33, vz34), h, ba) -> new_foldFM1(vz34, h, ba)
11.97/5.14	
11.97/5.14	R is empty.
11.97/5.14	Q is empty.
11.97/5.14	We have to consider all minimal (P,Q,R)-chains.
11.97/5.14	----------------------------------------
11.97/5.14	
11.97/5.14	(10) QDPSizeChangeProof (EQUIVALENT)
11.97/5.14	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. 
11.97/5.14	
11.97/5.14	From the DPs we obtained the following set of size-change graphs:
11.97/5.14	*new_foldFM1(Branch(vz30, vz31, vz32, vz33, vz34), h, ba) -> new_foldFM1(vz34, h, ba)
11.97/5.14	The graph contains the following edges 1 > 1, 2 >= 2, 3 >= 3
11.97/5.14	
11.97/5.14	
11.97/5.14	----------------------------------------
11.97/5.14	
11.97/5.14	(11)
11.97/5.14	YES
11.97/5.14	
11.97/5.14	----------------------------------------
11.97/5.14	
11.97/5.14	(12)
11.97/5.14	Obligation:
11.97/5.14	Q DP problem:
11.97/5.14	The TRS P consists of the following rules:
11.97/5.14	
11.97/5.14	   new_foldFM(vz30, vz31, vz4, Branch(vz330, vz331, vz332, vz333, vz334), h, ba) -> new_foldFM(vz30, vz31, vz4, vz334, h, ba)
11.97/5.14	   new_foldFM(vz30, vz31, vz4, Branch(vz330, vz331, vz332, vz333, vz334), h, ba) -> new_foldFM(vz330, vz331, new_foldFM0(vz30, vz31, vz4, vz334, h, ba), vz333, h, ba)
11.97/5.14	
11.97/5.14	The TRS R consists of the following rules:
11.97/5.14	
11.97/5.14	   new_foldFM0(vz30, vz31, vz4, Branch(vz330, vz331, vz332, vz333, vz334), h, ba) -> new_foldFM0(vz330, vz331, new_foldFM0(vz30, vz31, vz4, vz334, h, ba), vz333, h, ba)
11.97/5.14	   new_foldFM0(vz30, vz31, vz4, EmptyFM, h, ba) -> :(vz30, vz4)
11.97/5.14	
11.97/5.14	The set Q consists of the following terms:
11.97/5.14	
11.97/5.14	   new_foldFM0(x0, x1, x2, Branch(x3, x4, x5, x6, x7), x8, x9)
11.97/5.14	   new_foldFM0(x0, x1, x2, EmptyFM, x3, x4)
11.97/5.14	
11.97/5.14	We have to consider all minimal (P,Q,R)-chains.
11.97/5.14	----------------------------------------
11.97/5.14	
11.97/5.14	(13) QDPSizeChangeProof (EQUIVALENT)
11.97/5.14	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. 
11.97/5.14	
11.97/5.14	From the DPs we obtained the following set of size-change graphs:
11.97/5.14	*new_foldFM(vz30, vz31, vz4, Branch(vz330, vz331, vz332, vz333, vz334), h, ba) -> new_foldFM(vz30, vz31, vz4, vz334, h, ba)
11.97/5.14	The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 > 4, 5 >= 5, 6 >= 6
11.97/5.14	
11.97/5.14	
11.97/5.14	*new_foldFM(vz30, vz31, vz4, Branch(vz330, vz331, vz332, vz333, vz334), h, ba) -> new_foldFM(vz330, vz331, new_foldFM0(vz30, vz31, vz4, vz334, h, ba), vz333, h, ba)
11.97/5.14	The graph contains the following edges 4 > 1, 4 > 2, 4 > 4, 5 >= 5, 6 >= 6
11.97/5.14	
11.97/5.14	
11.97/5.14	----------------------------------------
11.97/5.14	
11.97/5.14	(14)
11.97/5.14	YES
12.09/5.23	EOF