11.15/4.93	YES
13.17/5.61	proof of /export/starexec/sandbox/benchmark/theBenchmark.hs
13.17/5.61	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
13.17/5.61	
13.17/5.61	
13.17/5.61	H-Termination with start terms of the given HASKELL could be proven:
13.17/5.61	
13.17/5.61	(0) HASKELL
13.17/5.61	(1) LR [EQUIVALENT, 0 ms]
13.17/5.61	(2) HASKELL
13.17/5.61	(3) BR [EQUIVALENT, 0 ms]
13.17/5.61	(4) HASKELL
13.17/5.61	(5) COR [EQUIVALENT, 0 ms]
13.17/5.61	(6) HASKELL
13.17/5.61	(7) Narrow [SOUND, 0 ms]
13.17/5.61	(8) AND
13.17/5.61	    (9) QDP
13.17/5.61	        (10) TransformationProof [EQUIVALENT, 0 ms]
13.17/5.61	        (11) QDP
13.17/5.61	        (12) TransformationProof [EQUIVALENT, 0 ms]
13.17/5.61	        (13) QDP
13.17/5.61	        (14) TransformationProof [EQUIVALENT, 0 ms]
13.17/5.61	        (15) QDP
13.17/5.61	        (16) QDPSizeChangeProof [EQUIVALENT, 0 ms]
13.17/5.61	        (17) YES
13.17/5.61	    (18) QDP
13.17/5.61	        (19) DependencyGraphProof [EQUIVALENT, 0 ms]
13.17/5.61	        (20) AND
13.17/5.61	            (21) QDP
13.17/5.61	                (22) QDPSizeChangeProof [EQUIVALENT, 0 ms]
13.17/5.61	                (23) YES
13.17/5.61	            (24) QDP
13.17/5.61	                (25) QDPSizeChangeProof [EQUIVALENT, 0 ms]
13.17/5.61	                (26) YES
13.17/5.61	    (27) QDP
13.17/5.61	        (28) TransformationProof [EQUIVALENT, 0 ms]
13.17/5.61	        (29) QDP
13.17/5.61	        (30) QDPSizeChangeProof [EQUIVALENT, 0 ms]
13.17/5.61	        (31) YES
13.17/5.61	
13.17/5.61	
13.17/5.61	----------------------------------------
13.17/5.61	
13.17/5.61	(0)
13.17/5.61	Obligation:
13.17/5.61	mainModule Main 
13.17/5.61	module FiniteMap where {
13.17/5.61	import qualified Main;
13.17/5.61	import qualified Maybe;
13.17/5.61	import qualified Prelude;
13.17/5.61	data FiniteMap b a = EmptyFM  | Branch b a Int (FiniteMap b a) (FiniteMap b a) ;
13.17/5.61	
13.17/5.61	instance (Eq a, Eq b) => Eq FiniteMap a b where { 
13.17/5.61	}
13.17/5.61	foldFM_LE :: Ord c => (c  ->  b  ->  a  ->  a)  ->  a  ->  c  ->  FiniteMap c b  ->  a;
13.17/5.61	foldFM_LE k z fr EmptyFM = z;
13.17/5.61	foldFM_LE k z fr (Branch key elt _ fm_l fm_r)  | key <= fr = foldFM_LE k (k key elt (foldFM_LE k z fr fm_l)) fr fm_r
13.17/5.61	 | otherwise = foldFM_LE k z fr fm_l;
13.17/5.61	
13.17/5.61	keysFM_LE :: Ord a => FiniteMap a b  ->  a  ->  [a];
13.17/5.61	keysFM_LE fm fr = foldFM_LE (\key elt rest ->key : rest) [] fr fm;
13.17/5.61	
13.17/5.61	}
13.17/5.61	module Maybe where {
13.17/5.61	import qualified FiniteMap;
13.17/5.61	import qualified Main;
13.17/5.61	import qualified Prelude;
13.17/5.61	}
13.17/5.61	module Main where {
13.17/5.61	import qualified FiniteMap;
13.17/5.61	import qualified Maybe;
13.17/5.61	import qualified Prelude;
13.17/5.61	}
13.17/5.61	
13.17/5.61	----------------------------------------
13.17/5.61	
13.17/5.61	(1) LR (EQUIVALENT)
13.17/5.61	Lambda Reductions:
13.17/5.61	The following Lambda expression
13.17/5.61	"\keyeltrest->key : rest"
13.17/5.61	is transformed to
13.17/5.61	"keysFM_LE0 key elt rest = key : rest;
13.17/5.61	"
13.17/5.61	
13.17/5.61	----------------------------------------
13.17/5.61	
13.17/5.61	(2)
13.17/5.61	Obligation:
13.17/5.61	mainModule Main 
13.17/5.61	module FiniteMap where {
13.17/5.61	import qualified Main;
13.17/5.61	import qualified Maybe;
13.17/5.61	import qualified Prelude;
13.17/5.61	data FiniteMap b a = EmptyFM  | Branch b a Int (FiniteMap b a) (FiniteMap b a) ;
13.17/5.61	
13.17/5.61	instance (Eq a, Eq b) => Eq FiniteMap a b where { 
13.17/5.61	}
13.17/5.61	foldFM_LE :: Ord c => (c  ->  b  ->  a  ->  a)  ->  a  ->  c  ->  FiniteMap c b  ->  a;
13.17/5.61	foldFM_LE k z fr EmptyFM = z;
13.17/5.61	foldFM_LE k z fr (Branch key elt _ fm_l fm_r)  | key <= fr = foldFM_LE k (k key elt (foldFM_LE k z fr fm_l)) fr fm_r
13.17/5.61	 | otherwise = foldFM_LE k z fr fm_l;
13.17/5.61	
13.17/5.61	keysFM_LE :: Ord b => FiniteMap b a  ->  b  ->  [b];
13.17/5.61	keysFM_LE fm fr = foldFM_LE keysFM_LE0 [] fr fm;
13.17/5.61	
13.17/5.61	keysFM_LE0 key elt rest = key : rest;
13.17/5.61	
13.17/5.61	}
13.17/5.61	module Maybe where {
13.17/5.61	import qualified FiniteMap;
13.17/5.61	import qualified Main;
13.17/5.61	import qualified Prelude;
13.17/5.61	}
13.17/5.61	module Main where {
13.17/5.61	import qualified FiniteMap;
13.17/5.61	import qualified Maybe;
13.17/5.61	import qualified Prelude;
13.17/5.61	}
13.17/5.61	
13.17/5.61	----------------------------------------
13.17/5.61	
13.17/5.61	(3) BR (EQUIVALENT)
13.17/5.61	Replaced joker patterns by fresh variables and removed binding patterns.
13.17/5.61	----------------------------------------
13.17/5.61	
13.17/5.61	(4)
13.17/5.61	Obligation:
13.17/5.61	mainModule Main 
13.17/5.61	module FiniteMap where {
13.17/5.61	import qualified Main;
13.17/5.61	import qualified Maybe;
13.17/5.61	import qualified Prelude;
13.17/5.61	data FiniteMap b a = EmptyFM  | Branch b a Int (FiniteMap b a) (FiniteMap b a) ;
13.17/5.61	
13.17/5.61	instance (Eq a, Eq b) => Eq FiniteMap b a where { 
13.17/5.61	}
13.17/5.61	foldFM_LE :: Ord c => (c  ->  b  ->  a  ->  a)  ->  a  ->  c  ->  FiniteMap c b  ->  a;
13.17/5.61	foldFM_LE k z fr EmptyFM = z;
13.17/5.61	foldFM_LE k z fr (Branch key elt vy fm_l fm_r)  | key <= fr = foldFM_LE k (k key elt (foldFM_LE k z fr fm_l)) fr fm_r
13.17/5.61	 | otherwise = foldFM_LE k z fr fm_l;
13.17/5.61	
13.17/5.61	keysFM_LE :: Ord a => FiniteMap a b  ->  a  ->  [a];
13.17/5.61	keysFM_LE fm fr = foldFM_LE keysFM_LE0 [] fr fm;
13.17/5.61	
13.17/5.61	keysFM_LE0 key elt rest = key : rest;
13.17/5.61	
13.17/5.61	}
13.17/5.61	module Maybe where {
13.17/5.61	import qualified FiniteMap;
13.17/5.61	import qualified Main;
13.17/5.61	import qualified Prelude;
13.17/5.61	}
13.17/5.61	module Main where {
13.17/5.61	import qualified FiniteMap;
13.17/5.61	import qualified Maybe;
13.17/5.61	import qualified Prelude;
13.17/5.61	}
13.17/5.61	
13.17/5.61	----------------------------------------
13.17/5.61	
13.17/5.61	(5) COR (EQUIVALENT)
13.17/5.61	Cond Reductions:
13.17/5.61	The following Function with conditions
13.17/5.61	"undefined |Falseundefined;
13.17/5.61	"
13.17/5.61	is transformed to
13.17/5.61	"undefined  = undefined1;
13.17/5.61	"
13.17/5.61	"undefined0 True = undefined;
13.17/5.61	"
13.17/5.61	"undefined1  = undefined0 False;
13.17/5.61	"
13.17/5.61	The following Function with conditions
13.17/5.61	"foldFM_LE k z fr EmptyFM = z;
13.17/5.61	foldFM_LE k z fr (Branch key elt vy fm_l fm_r)|key <= frfoldFM_LE k (k key elt (foldFM_LE k z fr fm_l)) fr fm_r|otherwisefoldFM_LE k z fr fm_l;
13.17/5.61	"
13.17/5.61	is transformed to
13.17/5.61	"foldFM_LE k z fr EmptyFM = foldFM_LE3 k z fr EmptyFM;
13.17/5.61	foldFM_LE k z fr (Branch key elt vy fm_l fm_r) = foldFM_LE2 k z fr (Branch key elt vy fm_l fm_r);
13.17/5.61	"
13.17/5.61	"foldFM_LE0 k z fr key elt vy fm_l fm_r True = foldFM_LE k z fr fm_l;
13.17/5.61	"
13.17/5.61	"foldFM_LE1 k z fr key elt vy fm_l fm_r True = foldFM_LE k (k key elt (foldFM_LE k z fr fm_l)) fr fm_r;
13.17/5.61	foldFM_LE1 k z fr key elt vy fm_l fm_r False = foldFM_LE0 k z fr key elt vy fm_l fm_r otherwise;
13.17/5.61	"
13.17/5.61	"foldFM_LE2 k z fr (Branch key elt vy fm_l fm_r) = foldFM_LE1 k z fr key elt vy fm_l fm_r (key <= fr);
13.17/5.61	"
13.17/5.61	"foldFM_LE3 k z fr EmptyFM = z;
13.17/5.61	foldFM_LE3 wv ww wx wy = foldFM_LE2 wv ww wx wy;
13.17/5.61	"
13.17/5.61	
13.17/5.61	----------------------------------------
13.17/5.61	
13.17/5.61	(6)
13.17/5.61	Obligation:
13.17/5.61	mainModule Main 
13.17/5.61	module FiniteMap where {
13.17/5.61	import qualified Main;
13.17/5.61	import qualified Maybe;
13.17/5.61	import qualified Prelude;
13.17/5.61	data FiniteMap b a = EmptyFM  | Branch b a Int (FiniteMap b a) (FiniteMap b a) ;
13.17/5.61	
13.17/5.61	instance (Eq a, Eq b) => Eq FiniteMap a b where { 
13.17/5.61	}
13.17/5.61	foldFM_LE :: Ord c => (c  ->  a  ->  b  ->  b)  ->  b  ->  c  ->  FiniteMap c a  ->  b;
13.17/5.61	foldFM_LE k z fr EmptyFM = foldFM_LE3 k z fr EmptyFM;
13.17/5.61	foldFM_LE k z fr (Branch key elt vy fm_l fm_r) = foldFM_LE2 k z fr (Branch key elt vy fm_l fm_r);
13.17/5.61	
13.17/5.61	foldFM_LE0 k z fr key elt vy fm_l fm_r True = foldFM_LE k z fr fm_l;
13.17/5.61	
13.17/5.61	foldFM_LE1 k z fr key elt vy fm_l fm_r True = foldFM_LE k (k key elt (foldFM_LE k z fr fm_l)) fr fm_r;
13.17/5.61	foldFM_LE1 k z fr key elt vy fm_l fm_r False = foldFM_LE0 k z fr key elt vy fm_l fm_r otherwise;
13.17/5.61	
13.17/5.61	foldFM_LE2 k z fr (Branch key elt vy fm_l fm_r) = foldFM_LE1 k z fr key elt vy fm_l fm_r (key <= fr);
13.17/5.61	
13.17/5.61	foldFM_LE3 k z fr EmptyFM = z;
13.17/5.61	foldFM_LE3 wv ww wx wy = foldFM_LE2 wv ww wx wy;
13.17/5.61	
13.17/5.61	keysFM_LE :: Ord a => FiniteMap a b  ->  a  ->  [a];
13.17/5.61	keysFM_LE fm fr = foldFM_LE keysFM_LE0 [] fr fm;
13.17/5.61	
13.17/5.61	keysFM_LE0 key elt rest = key : rest;
13.17/5.61	
13.17/5.61	}
13.17/5.61	module Maybe where {
13.17/5.61	import qualified FiniteMap;
13.17/5.61	import qualified Main;
13.17/5.61	import qualified Prelude;
13.17/5.61	}
13.17/5.61	module Main where {
13.17/5.61	import qualified FiniteMap;
13.17/5.61	import qualified Maybe;
13.17/5.61	import qualified Prelude;
13.17/5.61	}
13.17/5.61	
13.17/5.61	----------------------------------------
13.17/5.61	
13.17/5.61	(7) Narrow (SOUND)
13.17/5.61	Haskell To QDPs
13.17/5.61	
13.17/5.61	digraph dp_graph {
13.17/5.61	node [outthreshold=100, inthreshold=100];1[label="FiniteMap.keysFM_LE",fontsize=16,color="grey",shape="box"];1 -> 3[label="",style="dashed", color="grey", weight=3];
13.17/5.61	3[label="FiniteMap.keysFM_LE wz3",fontsize=16,color="grey",shape="box"];3 -> 4[label="",style="dashed", color="grey", weight=3];
13.17/5.61	4[label="FiniteMap.keysFM_LE wz3 wz4",fontsize=16,color="black",shape="triangle"];4 -> 5[label="",style="solid", color="black", weight=3];
13.17/5.61	5[label="FiniteMap.foldFM_LE FiniteMap.keysFM_LE0 [] wz4 wz3",fontsize=16,color="burlywood",shape="triangle"];861[label="wz3/FiniteMap.EmptyFM",fontsize=10,color="white",style="solid",shape="box"];5 -> 861[label="",style="solid", color="burlywood", weight=9];
13.17/5.61	861 -> 6[label="",style="solid", color="burlywood", weight=3];
13.17/5.61	862[label="wz3/FiniteMap.Branch wz30 wz31 wz32 wz33 wz34",fontsize=10,color="white",style="solid",shape="box"];5 -> 862[label="",style="solid", color="burlywood", weight=9];
13.17/5.61	862 -> 7[label="",style="solid", color="burlywood", weight=3];
13.17/5.61	6[label="FiniteMap.foldFM_LE FiniteMap.keysFM_LE0 [] wz4 FiniteMap.EmptyFM",fontsize=16,color="black",shape="box"];6 -> 8[label="",style="solid", color="black", weight=3];
13.17/5.61	7[label="FiniteMap.foldFM_LE FiniteMap.keysFM_LE0 [] wz4 (FiniteMap.Branch wz30 wz31 wz32 wz33 wz34)",fontsize=16,color="black",shape="box"];7 -> 9[label="",style="solid", color="black", weight=3];
13.17/5.61	8[label="FiniteMap.foldFM_LE3 FiniteMap.keysFM_LE0 [] wz4 FiniteMap.EmptyFM",fontsize=16,color="black",shape="box"];8 -> 10[label="",style="solid", color="black", weight=3];
13.17/5.61	9[label="FiniteMap.foldFM_LE2 FiniteMap.keysFM_LE0 [] wz4 (FiniteMap.Branch wz30 wz31 wz32 wz33 wz34)",fontsize=16,color="black",shape="box"];9 -> 11[label="",style="solid", color="black", weight=3];
13.17/5.61	10[label="[]",fontsize=16,color="green",shape="box"];11[label="FiniteMap.foldFM_LE1 FiniteMap.keysFM_LE0 [] wz4 wz30 wz31 wz32 wz33 wz34 (wz30 <= wz4)",fontsize=16,color="black",shape="box"];11 -> 12[label="",style="solid", color="black", weight=3];
13.17/5.61	12[label="FiniteMap.foldFM_LE1 FiniteMap.keysFM_LE0 [] wz4 wz30 wz31 wz32 wz33 wz34 (compare wz30 wz4 /= GT)",fontsize=16,color="black",shape="box"];12 -> 13[label="",style="solid", color="black", weight=3];
13.17/5.61	13[label="FiniteMap.foldFM_LE1 FiniteMap.keysFM_LE0 [] wz4 wz30 wz31 wz32 wz33 wz34 (not (compare wz30 wz4 == GT))",fontsize=16,color="black",shape="box"];13 -> 14[label="",style="solid", color="black", weight=3];
13.17/5.61	14[label="FiniteMap.foldFM_LE1 FiniteMap.keysFM_LE0 [] wz4 wz30 wz31 wz32 wz33 wz34 (not (primCmpChar wz30 wz4 == GT))",fontsize=16,color="burlywood",shape="box"];863[label="wz30/Char wz300",fontsize=10,color="white",style="solid",shape="box"];14 -> 863[label="",style="solid", color="burlywood", weight=9];
13.17/5.61	863 -> 15[label="",style="solid", color="burlywood", weight=3];
13.17/5.61	15[label="FiniteMap.foldFM_LE1 FiniteMap.keysFM_LE0 [] wz4 (Char wz300) wz31 wz32 wz33 wz34 (not (primCmpChar (Char wz300) wz4 == GT))",fontsize=16,color="burlywood",shape="box"];864[label="wz4/Char wz40",fontsize=10,color="white",style="solid",shape="box"];15 -> 864[label="",style="solid", color="burlywood", weight=9];
13.17/5.61	864 -> 16[label="",style="solid", color="burlywood", weight=3];
13.17/5.61	16[label="FiniteMap.foldFM_LE1 FiniteMap.keysFM_LE0 [] (Char wz40) (Char wz300) wz31 wz32 wz33 wz34 (not (primCmpChar (Char wz300) (Char wz40) == GT))",fontsize=16,color="black",shape="box"];16 -> 17[label="",style="solid", color="black", weight=3];
13.17/5.61	17[label="FiniteMap.foldFM_LE1 FiniteMap.keysFM_LE0 [] (Char wz40) (Char wz300) wz31 wz32 wz33 wz34 (not (primCmpNat wz300 wz40 == GT))",fontsize=16,color="burlywood",shape="box"];865[label="wz300/Succ wz3000",fontsize=10,color="white",style="solid",shape="box"];17 -> 865[label="",style="solid", color="burlywood", weight=9];
13.17/5.61	865 -> 18[label="",style="solid", color="burlywood", weight=3];
13.17/5.61	866[label="wz300/Zero",fontsize=10,color="white",style="solid",shape="box"];17 -> 866[label="",style="solid", color="burlywood", weight=9];
13.17/5.61	866 -> 19[label="",style="solid", color="burlywood", weight=3];
13.17/5.61	18[label="FiniteMap.foldFM_LE1 FiniteMap.keysFM_LE0 [] (Char wz40) (Char (Succ wz3000)) wz31 wz32 wz33 wz34 (not (primCmpNat (Succ wz3000) wz40 == GT))",fontsize=16,color="burlywood",shape="box"];867[label="wz40/Succ wz400",fontsize=10,color="white",style="solid",shape="box"];18 -> 867[label="",style="solid", color="burlywood", weight=9];
13.17/5.61	867 -> 20[label="",style="solid", color="burlywood", weight=3];
13.17/5.61	868[label="wz40/Zero",fontsize=10,color="white",style="solid",shape="box"];18 -> 868[label="",style="solid", color="burlywood", weight=9];
13.17/5.61	868 -> 21[label="",style="solid", color="burlywood", weight=3];
13.17/5.61	19[label="FiniteMap.foldFM_LE1 FiniteMap.keysFM_LE0 [] (Char wz40) (Char Zero) wz31 wz32 wz33 wz34 (not (primCmpNat Zero wz40 == GT))",fontsize=16,color="burlywood",shape="box"];869[label="wz40/Succ wz400",fontsize=10,color="white",style="solid",shape="box"];19 -> 869[label="",style="solid", color="burlywood", weight=9];
13.17/5.61	869 -> 22[label="",style="solid", color="burlywood", weight=3];
13.17/5.61	870[label="wz40/Zero",fontsize=10,color="white",style="solid",shape="box"];19 -> 870[label="",style="solid", color="burlywood", weight=9];
13.17/5.61	870 -> 23[label="",style="solid", color="burlywood", weight=3];
13.17/5.61	20[label="FiniteMap.foldFM_LE1 FiniteMap.keysFM_LE0 [] (Char (Succ wz400)) (Char (Succ wz3000)) wz31 wz32 wz33 wz34 (not (primCmpNat (Succ wz3000) (Succ wz400) == GT))",fontsize=16,color="black",shape="box"];20 -> 24[label="",style="solid", color="black", weight=3];
13.17/5.61	21[label="FiniteMap.foldFM_LE1 FiniteMap.keysFM_LE0 [] (Char Zero) (Char (Succ wz3000)) wz31 wz32 wz33 wz34 (not (primCmpNat (Succ wz3000) Zero == GT))",fontsize=16,color="black",shape="box"];21 -> 25[label="",style="solid", color="black", weight=3];
13.17/5.61	22[label="FiniteMap.foldFM_LE1 FiniteMap.keysFM_LE0 [] (Char (Succ wz400)) (Char Zero) wz31 wz32 wz33 wz34 (not (primCmpNat Zero (Succ wz400) == GT))",fontsize=16,color="black",shape="box"];22 -> 26[label="",style="solid", color="black", weight=3];
13.17/5.61	23[label="FiniteMap.foldFM_LE1 FiniteMap.keysFM_LE0 [] (Char Zero) (Char Zero) wz31 wz32 wz33 wz34 (not (primCmpNat Zero Zero == GT))",fontsize=16,color="black",shape="box"];23 -> 27[label="",style="solid", color="black", weight=3];
13.17/5.61	24 -> 737[label="",style="dashed", color="red", weight=0];
13.17/5.61	24[label="FiniteMap.foldFM_LE1 FiniteMap.keysFM_LE0 [] (Char (Succ wz400)) (Char (Succ wz3000)) wz31 wz32 wz33 wz34 (not (primCmpNat wz3000 wz400 == GT))",fontsize=16,color="magenta"];24 -> 738[label="",style="dashed", color="magenta", weight=3];
13.17/5.61	24 -> 739[label="",style="dashed", color="magenta", weight=3];
13.17/5.61	24 -> 740[label="",style="dashed", color="magenta", weight=3];
13.17/5.61	24 -> 741[label="",style="dashed", color="magenta", weight=3];
13.17/5.61	24 -> 742[label="",style="dashed", color="magenta", weight=3];
13.17/5.61	24 -> 743[label="",style="dashed", color="magenta", weight=3];
13.17/5.61	24 -> 744[label="",style="dashed", color="magenta", weight=3];
13.17/5.61	24 -> 745[label="",style="dashed", color="magenta", weight=3];
13.17/5.61	24 -> 746[label="",style="dashed", color="magenta", weight=3];
13.17/5.61	25[label="FiniteMap.foldFM_LE1 FiniteMap.keysFM_LE0 [] (Char Zero) (Char (Succ wz3000)) wz31 wz32 wz33 wz34 (not (GT == GT))",fontsize=16,color="black",shape="box"];25 -> 30[label="",style="solid", color="black", weight=3];
13.17/5.61	26[label="FiniteMap.foldFM_LE1 FiniteMap.keysFM_LE0 [] (Char (Succ wz400)) (Char Zero) wz31 wz32 wz33 wz34 (not (LT == GT))",fontsize=16,color="black",shape="box"];26 -> 31[label="",style="solid", color="black", weight=3];
13.17/5.61	27[label="FiniteMap.foldFM_LE1 FiniteMap.keysFM_LE0 [] (Char Zero) (Char Zero) wz31 wz32 wz33 wz34 (not (EQ == GT))",fontsize=16,color="black",shape="box"];27 -> 32[label="",style="solid", color="black", weight=3];
13.17/5.61	738[label="wz33",fontsize=16,color="green",shape="box"];739[label="wz34",fontsize=16,color="green",shape="box"];740[label="[]",fontsize=16,color="green",shape="box"];741[label="wz3000",fontsize=16,color="green",shape="box"];742[label="wz400",fontsize=16,color="green",shape="box"];743[label="wz31",fontsize=16,color="green",shape="box"];744[label="wz32",fontsize=16,color="green",shape="box"];745[label="wz400",fontsize=16,color="green",shape="box"];746[label="wz3000",fontsize=16,color="green",shape="box"];737[label="FiniteMap.foldFM_LE1 FiniteMap.keysFM_LE0 wz82 (Char (Succ wz83)) (Char (Succ wz84)) wz85 wz86 wz87 wz88 (not (primCmpNat wz89 wz90 == GT))",fontsize=16,color="burlywood",shape="triangle"];871[label="wz89/Succ wz890",fontsize=10,color="white",style="solid",shape="box"];737 -> 871[label="",style="solid", color="burlywood", weight=9];
13.17/5.61	871 -> 828[label="",style="solid", color="burlywood", weight=3];
13.17/5.61	872[label="wz89/Zero",fontsize=10,color="white",style="solid",shape="box"];737 -> 872[label="",style="solid", color="burlywood", weight=9];
13.17/5.61	872 -> 829[label="",style="solid", color="burlywood", weight=3];
13.17/5.61	30[label="FiniteMap.foldFM_LE1 FiniteMap.keysFM_LE0 [] (Char Zero) (Char (Succ wz3000)) wz31 wz32 wz33 wz34 (not True)",fontsize=16,color="black",shape="box"];30 -> 37[label="",style="solid", color="black", weight=3];
13.17/5.61	31[label="FiniteMap.foldFM_LE1 FiniteMap.keysFM_LE0 [] (Char (Succ wz400)) (Char Zero) wz31 wz32 wz33 wz34 (not False)",fontsize=16,color="black",shape="box"];31 -> 38[label="",style="solid", color="black", weight=3];
13.17/5.61	32[label="FiniteMap.foldFM_LE1 FiniteMap.keysFM_LE0 [] (Char Zero) (Char Zero) wz31 wz32 wz33 wz34 (not False)",fontsize=16,color="black",shape="box"];32 -> 39[label="",style="solid", color="black", weight=3];
13.17/5.61	828[label="FiniteMap.foldFM_LE1 FiniteMap.keysFM_LE0 wz82 (Char (Succ wz83)) (Char (Succ wz84)) wz85 wz86 wz87 wz88 (not (primCmpNat (Succ wz890) wz90 == GT))",fontsize=16,color="burlywood",shape="box"];873[label="wz90/Succ wz900",fontsize=10,color="white",style="solid",shape="box"];828 -> 873[label="",style="solid", color="burlywood", weight=9];
13.17/5.61	873 -> 830[label="",style="solid", color="burlywood", weight=3];
13.17/5.61	874[label="wz90/Zero",fontsize=10,color="white",style="solid",shape="box"];828 -> 874[label="",style="solid", color="burlywood", weight=9];
13.17/5.61	874 -> 831[label="",style="solid", color="burlywood", weight=3];
13.17/5.61	829[label="FiniteMap.foldFM_LE1 FiniteMap.keysFM_LE0 wz82 (Char (Succ wz83)) (Char (Succ wz84)) wz85 wz86 wz87 wz88 (not (primCmpNat Zero wz90 == GT))",fontsize=16,color="burlywood",shape="box"];875[label="wz90/Succ wz900",fontsize=10,color="white",style="solid",shape="box"];829 -> 875[label="",style="solid", color="burlywood", weight=9];
13.17/5.61	875 -> 832[label="",style="solid", color="burlywood", weight=3];
13.17/5.61	876[label="wz90/Zero",fontsize=10,color="white",style="solid",shape="box"];829 -> 876[label="",style="solid", color="burlywood", weight=9];
13.17/5.61	876 -> 833[label="",style="solid", color="burlywood", weight=3];
13.17/5.61	37[label="FiniteMap.foldFM_LE1 FiniteMap.keysFM_LE0 [] (Char Zero) (Char (Succ wz3000)) wz31 wz32 wz33 wz34 False",fontsize=16,color="black",shape="box"];37 -> 44[label="",style="solid", color="black", weight=3];
13.17/5.61	38[label="FiniteMap.foldFM_LE1 FiniteMap.keysFM_LE0 [] (Char (Succ wz400)) (Char Zero) wz31 wz32 wz33 wz34 True",fontsize=16,color="black",shape="box"];38 -> 45[label="",style="solid", color="black", weight=3];
13.17/5.61	39[label="FiniteMap.foldFM_LE1 FiniteMap.keysFM_LE0 [] (Char Zero) (Char Zero) wz31 wz32 wz33 wz34 True",fontsize=16,color="black",shape="box"];39 -> 46[label="",style="solid", color="black", weight=3];
13.17/5.61	830[label="FiniteMap.foldFM_LE1 FiniteMap.keysFM_LE0 wz82 (Char (Succ wz83)) (Char (Succ wz84)) wz85 wz86 wz87 wz88 (not (primCmpNat (Succ wz890) (Succ wz900) == GT))",fontsize=16,color="black",shape="box"];830 -> 834[label="",style="solid", color="black", weight=3];
13.17/5.61	831[label="FiniteMap.foldFM_LE1 FiniteMap.keysFM_LE0 wz82 (Char (Succ wz83)) (Char (Succ wz84)) wz85 wz86 wz87 wz88 (not (primCmpNat (Succ wz890) Zero == GT))",fontsize=16,color="black",shape="box"];831 -> 835[label="",style="solid", color="black", weight=3];
13.17/5.61	832[label="FiniteMap.foldFM_LE1 FiniteMap.keysFM_LE0 wz82 (Char (Succ wz83)) (Char (Succ wz84)) wz85 wz86 wz87 wz88 (not (primCmpNat Zero (Succ wz900) == GT))",fontsize=16,color="black",shape="box"];832 -> 836[label="",style="solid", color="black", weight=3];
13.17/5.61	833[label="FiniteMap.foldFM_LE1 FiniteMap.keysFM_LE0 wz82 (Char (Succ wz83)) (Char (Succ wz84)) wz85 wz86 wz87 wz88 (not (primCmpNat Zero Zero == GT))",fontsize=16,color="black",shape="box"];833 -> 837[label="",style="solid", color="black", weight=3];
13.17/5.61	44[label="FiniteMap.foldFM_LE0 FiniteMap.keysFM_LE0 [] (Char Zero) (Char (Succ wz3000)) wz31 wz32 wz33 wz34 otherwise",fontsize=16,color="black",shape="box"];44 -> 52[label="",style="solid", color="black", weight=3];
13.17/5.61	45 -> 53[label="",style="dashed", color="red", weight=0];
13.17/5.61	45[label="FiniteMap.foldFM_LE FiniteMap.keysFM_LE0 (FiniteMap.keysFM_LE0 (Char Zero) wz31 (FiniteMap.foldFM_LE FiniteMap.keysFM_LE0 [] (Char (Succ wz400)) wz33)) (Char (Succ wz400)) wz34",fontsize=16,color="magenta"];45 -> 54[label="",style="dashed", color="magenta", weight=3];
13.17/5.61	46 -> 55[label="",style="dashed", color="red", weight=0];
13.17/5.61	46[label="FiniteMap.foldFM_LE FiniteMap.keysFM_LE0 (FiniteMap.keysFM_LE0 (Char Zero) wz31 (FiniteMap.foldFM_LE FiniteMap.keysFM_LE0 [] (Char Zero) wz33)) (Char Zero) wz34",fontsize=16,color="magenta"];46 -> 56[label="",style="dashed", color="magenta", weight=3];
13.17/5.61	834 -> 737[label="",style="dashed", color="red", weight=0];
13.17/5.61	834[label="FiniteMap.foldFM_LE1 FiniteMap.keysFM_LE0 wz82 (Char (Succ wz83)) (Char (Succ wz84)) wz85 wz86 wz87 wz88 (not (primCmpNat wz890 wz900 == GT))",fontsize=16,color="magenta"];834 -> 838[label="",style="dashed", color="magenta", weight=3];
13.17/5.61	834 -> 839[label="",style="dashed", color="magenta", weight=3];
13.17/5.61	835[label="FiniteMap.foldFM_LE1 FiniteMap.keysFM_LE0 wz82 (Char (Succ wz83)) (Char (Succ wz84)) wz85 wz86 wz87 wz88 (not (GT == GT))",fontsize=16,color="black",shape="box"];835 -> 840[label="",style="solid", color="black", weight=3];
13.17/5.61	836[label="FiniteMap.foldFM_LE1 FiniteMap.keysFM_LE0 wz82 (Char (Succ wz83)) (Char (Succ wz84)) wz85 wz86 wz87 wz88 (not (LT == GT))",fontsize=16,color="black",shape="box"];836 -> 841[label="",style="solid", color="black", weight=3];
13.17/5.61	837[label="FiniteMap.foldFM_LE1 FiniteMap.keysFM_LE0 wz82 (Char (Succ wz83)) (Char (Succ wz84)) wz85 wz86 wz87 wz88 (not (EQ == GT))",fontsize=16,color="black",shape="box"];837 -> 842[label="",style="solid", color="black", weight=3];
13.17/5.61	52[label="FiniteMap.foldFM_LE0 FiniteMap.keysFM_LE0 [] (Char Zero) (Char (Succ wz3000)) wz31 wz32 wz33 wz34 True",fontsize=16,color="black",shape="box"];52 -> 64[label="",style="solid", color="black", weight=3];
13.17/5.61	54 -> 5[label="",style="dashed", color="red", weight=0];
13.17/5.61	54[label="FiniteMap.foldFM_LE FiniteMap.keysFM_LE0 [] (Char (Succ wz400)) wz33",fontsize=16,color="magenta"];54 -> 65[label="",style="dashed", color="magenta", weight=3];
13.17/5.61	54 -> 66[label="",style="dashed", color="magenta", weight=3];
13.17/5.61	53[label="FiniteMap.foldFM_LE FiniteMap.keysFM_LE0 (FiniteMap.keysFM_LE0 (Char Zero) wz31 wz5) (Char (Succ wz400)) wz34",fontsize=16,color="burlywood",shape="triangle"];877[label="wz34/FiniteMap.EmptyFM",fontsize=10,color="white",style="solid",shape="box"];53 -> 877[label="",style="solid", color="burlywood", weight=9];
13.17/5.61	877 -> 67[label="",style="solid", color="burlywood", weight=3];
13.17/5.61	878[label="wz34/FiniteMap.Branch wz340 wz341 wz342 wz343 wz344",fontsize=10,color="white",style="solid",shape="box"];53 -> 878[label="",style="solid", color="burlywood", weight=9];
13.17/5.61	878 -> 68[label="",style="solid", color="burlywood", weight=3];
13.17/5.61	56 -> 5[label="",style="dashed", color="red", weight=0];
13.17/5.61	56[label="FiniteMap.foldFM_LE FiniteMap.keysFM_LE0 [] (Char Zero) wz33",fontsize=16,color="magenta"];56 -> 69[label="",style="dashed", color="magenta", weight=3];
13.17/5.61	56 -> 70[label="",style="dashed", color="magenta", weight=3];
13.17/5.61	55[label="FiniteMap.foldFM_LE FiniteMap.keysFM_LE0 (FiniteMap.keysFM_LE0 (Char Zero) wz31 wz6) (Char Zero) wz34",fontsize=16,color="burlywood",shape="triangle"];879[label="wz34/FiniteMap.EmptyFM",fontsize=10,color="white",style="solid",shape="box"];55 -> 879[label="",style="solid", color="burlywood", weight=9];
13.17/5.61	879 -> 71[label="",style="solid", color="burlywood", weight=3];
13.17/5.61	880[label="wz34/FiniteMap.Branch wz340 wz341 wz342 wz343 wz344",fontsize=10,color="white",style="solid",shape="box"];55 -> 880[label="",style="solid", color="burlywood", weight=9];
13.17/5.61	880 -> 72[label="",style="solid", color="burlywood", weight=3];
13.17/5.61	838[label="wz890",fontsize=16,color="green",shape="box"];839[label="wz900",fontsize=16,color="green",shape="box"];840[label="FiniteMap.foldFM_LE1 FiniteMap.keysFM_LE0 wz82 (Char (Succ wz83)) (Char (Succ wz84)) wz85 wz86 wz87 wz88 (not True)",fontsize=16,color="black",shape="box"];840 -> 843[label="",style="solid", color="black", weight=3];
13.17/5.61	841[label="FiniteMap.foldFM_LE1 FiniteMap.keysFM_LE0 wz82 (Char (Succ wz83)) (Char (Succ wz84)) wz85 wz86 wz87 wz88 (not False)",fontsize=16,color="black",shape="triangle"];841 -> 844[label="",style="solid", color="black", weight=3];
13.17/5.61	842 -> 841[label="",style="dashed", color="red", weight=0];
13.17/5.61	842[label="FiniteMap.foldFM_LE1 FiniteMap.keysFM_LE0 wz82 (Char (Succ wz83)) (Char (Succ wz84)) wz85 wz86 wz87 wz88 (not False)",fontsize=16,color="magenta"];64 -> 5[label="",style="dashed", color="red", weight=0];
13.17/5.61	64[label="FiniteMap.foldFM_LE FiniteMap.keysFM_LE0 [] (Char Zero) wz33",fontsize=16,color="magenta"];64 -> 80[label="",style="dashed", color="magenta", weight=3];
13.17/5.61	64 -> 81[label="",style="dashed", color="magenta", weight=3];
13.17/5.61	65[label="wz33",fontsize=16,color="green",shape="box"];66[label="Char (Succ wz400)",fontsize=16,color="green",shape="box"];67[label="FiniteMap.foldFM_LE FiniteMap.keysFM_LE0 (FiniteMap.keysFM_LE0 (Char Zero) wz31 wz5) (Char (Succ wz400)) FiniteMap.EmptyFM",fontsize=16,color="black",shape="box"];67 -> 82[label="",style="solid", color="black", weight=3];
13.17/5.61	68[label="FiniteMap.foldFM_LE FiniteMap.keysFM_LE0 (FiniteMap.keysFM_LE0 (Char Zero) wz31 wz5) (Char (Succ wz400)) (FiniteMap.Branch wz340 wz341 wz342 wz343 wz344)",fontsize=16,color="black",shape="box"];68 -> 83[label="",style="solid", color="black", weight=3];
13.17/5.61	69[label="wz33",fontsize=16,color="green",shape="box"];70[label="Char Zero",fontsize=16,color="green",shape="box"];71[label="FiniteMap.foldFM_LE FiniteMap.keysFM_LE0 (FiniteMap.keysFM_LE0 (Char Zero) wz31 wz6) (Char Zero) FiniteMap.EmptyFM",fontsize=16,color="black",shape="box"];71 -> 84[label="",style="solid", color="black", weight=3];
13.17/5.61	72[label="FiniteMap.foldFM_LE FiniteMap.keysFM_LE0 (FiniteMap.keysFM_LE0 (Char Zero) wz31 wz6) (Char Zero) (FiniteMap.Branch wz340 wz341 wz342 wz343 wz344)",fontsize=16,color="black",shape="box"];72 -> 85[label="",style="solid", color="black", weight=3];
13.17/5.61	843[label="FiniteMap.foldFM_LE1 FiniteMap.keysFM_LE0 wz82 (Char (Succ wz83)) (Char (Succ wz84)) wz85 wz86 wz87 wz88 False",fontsize=16,color="black",shape="box"];843 -> 845[label="",style="solid", color="black", weight=3];
13.17/5.61	844[label="FiniteMap.foldFM_LE1 FiniteMap.keysFM_LE0 wz82 (Char (Succ wz83)) (Char (Succ wz84)) wz85 wz86 wz87 wz88 True",fontsize=16,color="black",shape="box"];844 -> 846[label="",style="solid", color="black", weight=3];
13.17/5.61	80[label="wz33",fontsize=16,color="green",shape="box"];81[label="Char Zero",fontsize=16,color="green",shape="box"];82[label="FiniteMap.foldFM_LE3 FiniteMap.keysFM_LE0 (FiniteMap.keysFM_LE0 (Char Zero) wz31 wz5) (Char (Succ wz400)) FiniteMap.EmptyFM",fontsize=16,color="black",shape="box"];82 -> 96[label="",style="solid", color="black", weight=3];
13.17/5.61	83[label="FiniteMap.foldFM_LE2 FiniteMap.keysFM_LE0 (FiniteMap.keysFM_LE0 (Char Zero) wz31 wz5) (Char (Succ wz400)) (FiniteMap.Branch wz340 wz341 wz342 wz343 wz344)",fontsize=16,color="black",shape="box"];83 -> 97[label="",style="solid", color="black", weight=3];
13.17/5.61	84[label="FiniteMap.foldFM_LE3 FiniteMap.keysFM_LE0 (FiniteMap.keysFM_LE0 (Char Zero) wz31 wz6) (Char Zero) FiniteMap.EmptyFM",fontsize=16,color="black",shape="box"];84 -> 98[label="",style="solid", color="black", weight=3];
13.17/5.61	85[label="FiniteMap.foldFM_LE2 FiniteMap.keysFM_LE0 (FiniteMap.keysFM_LE0 (Char Zero) wz31 wz6) (Char Zero) (FiniteMap.Branch wz340 wz341 wz342 wz343 wz344)",fontsize=16,color="black",shape="box"];85 -> 99[label="",style="solid", color="black", weight=3];
13.17/5.61	845[label="FiniteMap.foldFM_LE0 FiniteMap.keysFM_LE0 wz82 (Char (Succ wz83)) (Char (Succ wz84)) wz85 wz86 wz87 wz88 otherwise",fontsize=16,color="black",shape="box"];845 -> 847[label="",style="solid", color="black", weight=3];
13.17/5.61	846 -> 443[label="",style="dashed", color="red", weight=0];
13.17/5.61	846[label="FiniteMap.foldFM_LE FiniteMap.keysFM_LE0 (FiniteMap.keysFM_LE0 (Char (Succ wz84)) wz85 (FiniteMap.foldFM_LE FiniteMap.keysFM_LE0 wz82 (Char (Succ wz83)) wz87)) (Char (Succ wz83)) wz88",fontsize=16,color="magenta"];846 -> 848[label="",style="dashed", color="magenta", weight=3];
13.17/5.61	846 -> 849[label="",style="dashed", color="magenta", weight=3];
13.17/5.61	846 -> 850[label="",style="dashed", color="magenta", weight=3];
13.17/5.61	96[label="FiniteMap.keysFM_LE0 (Char Zero) wz31 wz5",fontsize=16,color="black",shape="triangle"];96 -> 116[label="",style="solid", color="black", weight=3];
13.17/5.61	97 -> 117[label="",style="dashed", color="red", weight=0];
13.17/5.61	97[label="FiniteMap.foldFM_LE1 FiniteMap.keysFM_LE0 (FiniteMap.keysFM_LE0 (Char Zero) wz31 wz5) (Char (Succ wz400)) wz340 wz341 wz342 wz343 wz344 (wz340 <= Char (Succ wz400))",fontsize=16,color="magenta"];97 -> 118[label="",style="dashed", color="magenta", weight=3];
13.17/5.61	98 -> 96[label="",style="dashed", color="red", weight=0];
13.17/5.61	98[label="FiniteMap.keysFM_LE0 (Char Zero) wz31 wz6",fontsize=16,color="magenta"];98 -> 119[label="",style="dashed", color="magenta", weight=3];
13.17/5.61	99 -> 120[label="",style="dashed", color="red", weight=0];
13.17/5.61	99[label="FiniteMap.foldFM_LE1 FiniteMap.keysFM_LE0 (FiniteMap.keysFM_LE0 (Char Zero) wz31 wz6) (Char Zero) wz340 wz341 wz342 wz343 wz344 (wz340 <= Char Zero)",fontsize=16,color="magenta"];99 -> 121[label="",style="dashed", color="magenta", weight=3];
13.17/5.61	847[label="FiniteMap.foldFM_LE0 FiniteMap.keysFM_LE0 wz82 (Char (Succ wz83)) (Char (Succ wz84)) wz85 wz86 wz87 wz88 True",fontsize=16,color="black",shape="box"];847 -> 851[label="",style="solid", color="black", weight=3];
13.17/5.61	848[label="wz88",fontsize=16,color="green",shape="box"];849[label="wz83",fontsize=16,color="green",shape="box"];850 -> 852[label="",style="dashed", color="red", weight=0];
13.17/5.61	850[label="FiniteMap.keysFM_LE0 (Char (Succ wz84)) wz85 (FiniteMap.foldFM_LE FiniteMap.keysFM_LE0 wz82 (Char (Succ wz83)) wz87)",fontsize=16,color="magenta"];850 -> 853[label="",style="dashed", color="magenta", weight=3];
13.17/5.61	443[label="FiniteMap.foldFM_LE FiniteMap.keysFM_LE0 wz9 (Char (Succ wz400)) wz343",fontsize=16,color="burlywood",shape="triangle"];881[label="wz343/FiniteMap.EmptyFM",fontsize=10,color="white",style="solid",shape="box"];443 -> 881[label="",style="solid", color="burlywood", weight=9];
13.17/5.61	881 -> 522[label="",style="solid", color="burlywood", weight=3];
13.17/5.61	882[label="wz343/FiniteMap.Branch wz3430 wz3431 wz3432 wz3433 wz3434",fontsize=10,color="white",style="solid",shape="box"];443 -> 882[label="",style="solid", color="burlywood", weight=9];
13.17/5.61	882 -> 523[label="",style="solid", color="burlywood", weight=3];
13.17/5.61	116[label="Char Zero : wz5",fontsize=16,color="green",shape="box"];118 -> 96[label="",style="dashed", color="red", weight=0];
13.17/5.61	118[label="FiniteMap.keysFM_LE0 (Char Zero) wz31 wz5",fontsize=16,color="magenta"];117[label="FiniteMap.foldFM_LE1 FiniteMap.keysFM_LE0 wz9 (Char (Succ wz400)) wz340 wz341 wz342 wz343 wz344 (wz340 <= Char (Succ wz400))",fontsize=16,color="black",shape="triangle"];117 -> 135[label="",style="solid", color="black", weight=3];
13.17/5.61	119[label="wz6",fontsize=16,color="green",shape="box"];121 -> 96[label="",style="dashed", color="red", weight=0];
13.17/5.61	121[label="FiniteMap.keysFM_LE0 (Char Zero) wz31 wz6",fontsize=16,color="magenta"];121 -> 136[label="",style="dashed", color="magenta", weight=3];
13.17/5.61	120[label="FiniteMap.foldFM_LE1 FiniteMap.keysFM_LE0 wz10 (Char Zero) wz340 wz341 wz342 wz343 wz344 (wz340 <= Char Zero)",fontsize=16,color="black",shape="triangle"];120 -> 137[label="",style="solid", color="black", weight=3];
13.17/5.61	851 -> 443[label="",style="dashed", color="red", weight=0];
13.17/5.61	851[label="FiniteMap.foldFM_LE FiniteMap.keysFM_LE0 wz82 (Char (Succ wz83)) wz87",fontsize=16,color="magenta"];851 -> 854[label="",style="dashed", color="magenta", weight=3];
13.17/5.61	851 -> 855[label="",style="dashed", color="magenta", weight=3];
13.17/5.61	851 -> 856[label="",style="dashed", color="magenta", weight=3];
13.17/5.61	853 -> 443[label="",style="dashed", color="red", weight=0];
13.17/5.61	853[label="FiniteMap.foldFM_LE FiniteMap.keysFM_LE0 wz82 (Char (Succ wz83)) wz87",fontsize=16,color="magenta"];853 -> 857[label="",style="dashed", color="magenta", weight=3];
13.17/5.61	853 -> 858[label="",style="dashed", color="magenta", weight=3];
13.17/5.61	853 -> 859[label="",style="dashed", color="magenta", weight=3];
13.17/5.61	852[label="FiniteMap.keysFM_LE0 (Char (Succ wz84)) wz85 wz91",fontsize=16,color="black",shape="triangle"];852 -> 860[label="",style="solid", color="black", weight=3];
13.17/5.61	522[label="FiniteMap.foldFM_LE FiniteMap.keysFM_LE0 wz9 (Char (Succ wz400)) FiniteMap.EmptyFM",fontsize=16,color="black",shape="box"];522 -> 538[label="",style="solid", color="black", weight=3];
13.17/5.61	523[label="FiniteMap.foldFM_LE FiniteMap.keysFM_LE0 wz9 (Char (Succ wz400)) (FiniteMap.Branch wz3430 wz3431 wz3432 wz3433 wz3434)",fontsize=16,color="black",shape="box"];523 -> 539[label="",style="solid", color="black", weight=3];
13.17/5.61	135[label="FiniteMap.foldFM_LE1 FiniteMap.keysFM_LE0 wz9 (Char (Succ wz400)) wz340 wz341 wz342 wz343 wz344 (compare wz340 (Char (Succ wz400)) /= GT)",fontsize=16,color="black",shape="box"];135 -> 152[label="",style="solid", color="black", weight=3];
13.17/5.61	136[label="wz6",fontsize=16,color="green",shape="box"];137[label="FiniteMap.foldFM_LE1 FiniteMap.keysFM_LE0 wz10 (Char Zero) wz340 wz341 wz342 wz343 wz344 (compare wz340 (Char Zero) /= GT)",fontsize=16,color="black",shape="box"];137 -> 153[label="",style="solid", color="black", weight=3];
13.17/5.61	854[label="wz87",fontsize=16,color="green",shape="box"];855[label="wz83",fontsize=16,color="green",shape="box"];856[label="wz82",fontsize=16,color="green",shape="box"];857[label="wz87",fontsize=16,color="green",shape="box"];858[label="wz83",fontsize=16,color="green",shape="box"];859[label="wz82",fontsize=16,color="green",shape="box"];860[label="Char (Succ wz84) : wz91",fontsize=16,color="green",shape="box"];538[label="FiniteMap.foldFM_LE3 FiniteMap.keysFM_LE0 wz9 (Char (Succ wz400)) FiniteMap.EmptyFM",fontsize=16,color="black",shape="box"];538 -> 558[label="",style="solid", color="black", weight=3];
13.17/5.61	539[label="FiniteMap.foldFM_LE2 FiniteMap.keysFM_LE0 wz9 (Char (Succ wz400)) (FiniteMap.Branch wz3430 wz3431 wz3432 wz3433 wz3434)",fontsize=16,color="black",shape="box"];539 -> 559[label="",style="solid", color="black", weight=3];
13.17/5.61	152[label="FiniteMap.foldFM_LE1 FiniteMap.keysFM_LE0 wz9 (Char (Succ wz400)) wz340 wz341 wz342 wz343 wz344 (not (compare wz340 (Char (Succ wz400)) == GT))",fontsize=16,color="black",shape="box"];152 -> 176[label="",style="solid", color="black", weight=3];
13.17/5.61	153[label="FiniteMap.foldFM_LE1 FiniteMap.keysFM_LE0 wz10 (Char Zero) wz340 wz341 wz342 wz343 wz344 (not (compare wz340 (Char Zero) == GT))",fontsize=16,color="black",shape="box"];153 -> 177[label="",style="solid", color="black", weight=3];
13.17/5.61	558[label="wz9",fontsize=16,color="green",shape="box"];559 -> 117[label="",style="dashed", color="red", weight=0];
13.17/5.61	559[label="FiniteMap.foldFM_LE1 FiniteMap.keysFM_LE0 wz9 (Char (Succ wz400)) wz3430 wz3431 wz3432 wz3433 wz3434 (wz3430 <= Char (Succ wz400))",fontsize=16,color="magenta"];559 -> 580[label="",style="dashed", color="magenta", weight=3];
13.17/5.61	559 -> 581[label="",style="dashed", color="magenta", weight=3];
13.17/5.61	559 -> 582[label="",style="dashed", color="magenta", weight=3];
13.17/5.61	559 -> 583[label="",style="dashed", color="magenta", weight=3];
13.17/5.61	559 -> 584[label="",style="dashed", color="magenta", weight=3];
13.17/5.61	176[label="FiniteMap.foldFM_LE1 FiniteMap.keysFM_LE0 wz9 (Char (Succ wz400)) wz340 wz341 wz342 wz343 wz344 (not (primCmpChar wz340 (Char (Succ wz400)) == GT))",fontsize=16,color="burlywood",shape="box"];883[label="wz340/Char wz3400",fontsize=10,color="white",style="solid",shape="box"];176 -> 883[label="",style="solid", color="burlywood", weight=9];
13.17/5.61	883 -> 192[label="",style="solid", color="burlywood", weight=3];
13.17/5.61	177[label="FiniteMap.foldFM_LE1 FiniteMap.keysFM_LE0 wz10 (Char Zero) wz340 wz341 wz342 wz343 wz344 (not (primCmpChar wz340 (Char Zero) == GT))",fontsize=16,color="burlywood",shape="box"];884[label="wz340/Char wz3400",fontsize=10,color="white",style="solid",shape="box"];177 -> 884[label="",style="solid", color="burlywood", weight=9];
13.17/5.61	884 -> 193[label="",style="solid", color="burlywood", weight=3];
13.17/5.61	580[label="wz3433",fontsize=16,color="green",shape="box"];581[label="wz3431",fontsize=16,color="green",shape="box"];582[label="wz3432",fontsize=16,color="green",shape="box"];583[label="wz3434",fontsize=16,color="green",shape="box"];584[label="wz3430",fontsize=16,color="green",shape="box"];192[label="FiniteMap.foldFM_LE1 FiniteMap.keysFM_LE0 wz9 (Char (Succ wz400)) (Char wz3400) wz341 wz342 wz343 wz344 (not (primCmpChar (Char wz3400) (Char (Succ wz400)) == GT))",fontsize=16,color="black",shape="box"];192 -> 208[label="",style="solid", color="black", weight=3];
13.17/5.61	193[label="FiniteMap.foldFM_LE1 FiniteMap.keysFM_LE0 wz10 (Char Zero) (Char wz3400) wz341 wz342 wz343 wz344 (not (primCmpChar (Char wz3400) (Char Zero) == GT))",fontsize=16,color="black",shape="box"];193 -> 209[label="",style="solid", color="black", weight=3];
13.17/5.61	208[label="FiniteMap.foldFM_LE1 FiniteMap.keysFM_LE0 wz9 (Char (Succ wz400)) (Char wz3400) wz341 wz342 wz343 wz344 (not (primCmpNat wz3400 (Succ wz400) == GT))",fontsize=16,color="burlywood",shape="box"];885[label="wz3400/Succ wz34000",fontsize=10,color="white",style="solid",shape="box"];208 -> 885[label="",style="solid", color="burlywood", weight=9];
13.17/5.61	885 -> 232[label="",style="solid", color="burlywood", weight=3];
13.17/5.61	886[label="wz3400/Zero",fontsize=10,color="white",style="solid",shape="box"];208 -> 886[label="",style="solid", color="burlywood", weight=9];
13.17/5.61	886 -> 233[label="",style="solid", color="burlywood", weight=3];
13.17/5.61	209[label="FiniteMap.foldFM_LE1 FiniteMap.keysFM_LE0 wz10 (Char Zero) (Char wz3400) wz341 wz342 wz343 wz344 (not (primCmpNat wz3400 Zero == GT))",fontsize=16,color="burlywood",shape="box"];887[label="wz3400/Succ wz34000",fontsize=10,color="white",style="solid",shape="box"];209 -> 887[label="",style="solid", color="burlywood", weight=9];
13.17/5.61	887 -> 234[label="",style="solid", color="burlywood", weight=3];
13.17/5.61	888[label="wz3400/Zero",fontsize=10,color="white",style="solid",shape="box"];209 -> 888[label="",style="solid", color="burlywood", weight=9];
13.17/5.61	888 -> 235[label="",style="solid", color="burlywood", weight=3];
13.17/5.61	232[label="FiniteMap.foldFM_LE1 FiniteMap.keysFM_LE0 wz9 (Char (Succ wz400)) (Char (Succ wz34000)) wz341 wz342 wz343 wz344 (not (primCmpNat (Succ wz34000) (Succ wz400) == GT))",fontsize=16,color="black",shape="box"];232 -> 250[label="",style="solid", color="black", weight=3];
13.17/5.61	233[label="FiniteMap.foldFM_LE1 FiniteMap.keysFM_LE0 wz9 (Char (Succ wz400)) (Char Zero) wz341 wz342 wz343 wz344 (not (primCmpNat Zero (Succ wz400) == GT))",fontsize=16,color="black",shape="box"];233 -> 251[label="",style="solid", color="black", weight=3];
13.17/5.61	234[label="FiniteMap.foldFM_LE1 FiniteMap.keysFM_LE0 wz10 (Char Zero) (Char (Succ wz34000)) wz341 wz342 wz343 wz344 (not (primCmpNat (Succ wz34000) Zero == GT))",fontsize=16,color="black",shape="box"];234 -> 252[label="",style="solid", color="black", weight=3];
13.17/5.61	235[label="FiniteMap.foldFM_LE1 FiniteMap.keysFM_LE0 wz10 (Char Zero) (Char Zero) wz341 wz342 wz343 wz344 (not (primCmpNat Zero Zero == GT))",fontsize=16,color="black",shape="box"];235 -> 253[label="",style="solid", color="black", weight=3];
13.17/5.61	250 -> 737[label="",style="dashed", color="red", weight=0];
13.17/5.61	250[label="FiniteMap.foldFM_LE1 FiniteMap.keysFM_LE0 wz9 (Char (Succ wz400)) (Char (Succ wz34000)) wz341 wz342 wz343 wz344 (not (primCmpNat wz34000 wz400 == GT))",fontsize=16,color="magenta"];250 -> 765[label="",style="dashed", color="magenta", weight=3];
13.17/5.61	250 -> 766[label="",style="dashed", color="magenta", weight=3];
13.17/5.61	250 -> 767[label="",style="dashed", color="magenta", weight=3];
13.17/5.61	250 -> 768[label="",style="dashed", color="magenta", weight=3];
13.17/5.61	250 -> 769[label="",style="dashed", color="magenta", weight=3];
13.17/5.61	250 -> 770[label="",style="dashed", color="magenta", weight=3];
13.17/5.61	250 -> 771[label="",style="dashed", color="magenta", weight=3];
13.17/5.61	250 -> 772[label="",style="dashed", color="magenta", weight=3];
13.17/5.61	250 -> 773[label="",style="dashed", color="magenta", weight=3];
13.17/5.61	251[label="FiniteMap.foldFM_LE1 FiniteMap.keysFM_LE0 wz9 (Char (Succ wz400)) (Char Zero) wz341 wz342 wz343 wz344 (not (LT == GT))",fontsize=16,color="black",shape="box"];251 -> 286[label="",style="solid", color="black", weight=3];
13.17/5.61	252[label="FiniteMap.foldFM_LE1 FiniteMap.keysFM_LE0 wz10 (Char Zero) (Char (Succ wz34000)) wz341 wz342 wz343 wz344 (not (GT == GT))",fontsize=16,color="black",shape="box"];252 -> 287[label="",style="solid", color="black", weight=3];
13.17/5.61	253[label="FiniteMap.foldFM_LE1 FiniteMap.keysFM_LE0 wz10 (Char Zero) (Char Zero) wz341 wz342 wz343 wz344 (not (EQ == GT))",fontsize=16,color="black",shape="box"];253 -> 288[label="",style="solid", color="black", weight=3];
13.17/5.61	765[label="wz343",fontsize=16,color="green",shape="box"];766[label="wz344",fontsize=16,color="green",shape="box"];767[label="wz9",fontsize=16,color="green",shape="box"];768[label="wz34000",fontsize=16,color="green",shape="box"];769[label="wz400",fontsize=16,color="green",shape="box"];770[label="wz341",fontsize=16,color="green",shape="box"];771[label="wz342",fontsize=16,color="green",shape="box"];772[label="wz400",fontsize=16,color="green",shape="box"];773[label="wz34000",fontsize=16,color="green",shape="box"];286[label="FiniteMap.foldFM_LE1 FiniteMap.keysFM_LE0 wz9 (Char (Succ wz400)) (Char Zero) wz341 wz342 wz343 wz344 (not False)",fontsize=16,color="black",shape="box"];286 -> 343[label="",style="solid", color="black", weight=3];
13.17/5.61	287[label="FiniteMap.foldFM_LE1 FiniteMap.keysFM_LE0 wz10 (Char Zero) (Char (Succ wz34000)) wz341 wz342 wz343 wz344 (not True)",fontsize=16,color="black",shape="box"];287 -> 344[label="",style="solid", color="black", weight=3];
13.17/5.61	288[label="FiniteMap.foldFM_LE1 FiniteMap.keysFM_LE0 wz10 (Char Zero) (Char Zero) wz341 wz342 wz343 wz344 (not False)",fontsize=16,color="black",shape="box"];288 -> 345[label="",style="solid", color="black", weight=3];
13.17/5.61	343[label="FiniteMap.foldFM_LE1 FiniteMap.keysFM_LE0 wz9 (Char (Succ wz400)) (Char Zero) wz341 wz342 wz343 wz344 True",fontsize=16,color="black",shape="box"];343 -> 361[label="",style="solid", color="black", weight=3];
13.17/5.61	344[label="FiniteMap.foldFM_LE1 FiniteMap.keysFM_LE0 wz10 (Char Zero) (Char (Succ wz34000)) wz341 wz342 wz343 wz344 False",fontsize=16,color="black",shape="box"];344 -> 362[label="",style="solid", color="black", weight=3];
13.17/5.61	345[label="FiniteMap.foldFM_LE1 FiniteMap.keysFM_LE0 wz10 (Char Zero) (Char Zero) wz341 wz342 wz343 wz344 True",fontsize=16,color="black",shape="box"];345 -> 363[label="",style="solid", color="black", weight=3];
13.17/5.61	361 -> 53[label="",style="dashed", color="red", weight=0];
13.17/5.61	361[label="FiniteMap.foldFM_LE FiniteMap.keysFM_LE0 (FiniteMap.keysFM_LE0 (Char Zero) wz341 (FiniteMap.foldFM_LE FiniteMap.keysFM_LE0 wz9 (Char (Succ wz400)) wz343)) (Char (Succ wz400)) wz344",fontsize=16,color="magenta"];361 -> 441[label="",style="dashed", color="magenta", weight=3];
13.17/5.61	361 -> 442[label="",style="dashed", color="magenta", weight=3];
13.17/5.61	361 -> 443[label="",style="dashed", color="magenta", weight=3];
13.17/5.61	362[label="FiniteMap.foldFM_LE0 FiniteMap.keysFM_LE0 wz10 (Char Zero) (Char (Succ wz34000)) wz341 wz342 wz343 wz344 otherwise",fontsize=16,color="black",shape="box"];362 -> 444[label="",style="solid", color="black", weight=3];
13.17/5.61	363 -> 55[label="",style="dashed", color="red", weight=0];
13.17/5.61	363[label="FiniteMap.foldFM_LE FiniteMap.keysFM_LE0 (FiniteMap.keysFM_LE0 (Char Zero) wz341 (FiniteMap.foldFM_LE FiniteMap.keysFM_LE0 wz10 (Char Zero) wz343)) (Char Zero) wz344",fontsize=16,color="magenta"];363 -> 445[label="",style="dashed", color="magenta", weight=3];
13.17/5.61	363 -> 446[label="",style="dashed", color="magenta", weight=3];
13.17/5.61	363 -> 447[label="",style="dashed", color="magenta", weight=3];
13.17/5.61	441[label="wz344",fontsize=16,color="green",shape="box"];442[label="wz341",fontsize=16,color="green",shape="box"];444[label="FiniteMap.foldFM_LE0 FiniteMap.keysFM_LE0 wz10 (Char Zero) (Char (Succ wz34000)) wz341 wz342 wz343 wz344 True",fontsize=16,color="black",shape="box"];444 -> 524[label="",style="solid", color="black", weight=3];
13.17/5.61	445[label="wz344",fontsize=16,color="green",shape="box"];446[label="FiniteMap.foldFM_LE FiniteMap.keysFM_LE0 wz10 (Char Zero) wz343",fontsize=16,color="burlywood",shape="triangle"];889[label="wz343/FiniteMap.EmptyFM",fontsize=10,color="white",style="solid",shape="box"];446 -> 889[label="",style="solid", color="burlywood", weight=9];
13.17/5.61	889 -> 525[label="",style="solid", color="burlywood", weight=3];
13.17/5.61	890[label="wz343/FiniteMap.Branch wz3430 wz3431 wz3432 wz3433 wz3434",fontsize=10,color="white",style="solid",shape="box"];446 -> 890[label="",style="solid", color="burlywood", weight=9];
13.17/5.61	890 -> 526[label="",style="solid", color="burlywood", weight=3];
13.17/5.61	447[label="wz341",fontsize=16,color="green",shape="box"];524 -> 446[label="",style="dashed", color="red", weight=0];
13.17/5.61	524[label="FiniteMap.foldFM_LE FiniteMap.keysFM_LE0 wz10 (Char Zero) wz343",fontsize=16,color="magenta"];525[label="FiniteMap.foldFM_LE FiniteMap.keysFM_LE0 wz10 (Char Zero) FiniteMap.EmptyFM",fontsize=16,color="black",shape="box"];525 -> 540[label="",style="solid", color="black", weight=3];
13.17/5.61	526[label="FiniteMap.foldFM_LE FiniteMap.keysFM_LE0 wz10 (Char Zero) (FiniteMap.Branch wz3430 wz3431 wz3432 wz3433 wz3434)",fontsize=16,color="black",shape="box"];526 -> 541[label="",style="solid", color="black", weight=3];
13.17/5.61	540[label="FiniteMap.foldFM_LE3 FiniteMap.keysFM_LE0 wz10 (Char Zero) FiniteMap.EmptyFM",fontsize=16,color="black",shape="box"];540 -> 560[label="",style="solid", color="black", weight=3];
13.17/5.61	541[label="FiniteMap.foldFM_LE2 FiniteMap.keysFM_LE0 wz10 (Char Zero) (FiniteMap.Branch wz3430 wz3431 wz3432 wz3433 wz3434)",fontsize=16,color="black",shape="box"];541 -> 561[label="",style="solid", color="black", weight=3];
13.17/5.61	560[label="wz10",fontsize=16,color="green",shape="box"];561 -> 120[label="",style="dashed", color="red", weight=0];
13.17/5.61	561[label="FiniteMap.foldFM_LE1 FiniteMap.keysFM_LE0 wz10 (Char Zero) wz3430 wz3431 wz3432 wz3433 wz3434 (wz3430 <= Char Zero)",fontsize=16,color="magenta"];561 -> 585[label="",style="dashed", color="magenta", weight=3];
13.17/5.61	561 -> 586[label="",style="dashed", color="magenta", weight=3];
13.17/5.61	561 -> 587[label="",style="dashed", color="magenta", weight=3];
13.17/5.61	561 -> 588[label="",style="dashed", color="magenta", weight=3];
13.17/5.61	561 -> 589[label="",style="dashed", color="magenta", weight=3];
13.17/5.61	585[label="wz3433",fontsize=16,color="green",shape="box"];586[label="wz3431",fontsize=16,color="green",shape="box"];587[label="wz3432",fontsize=16,color="green",shape="box"];588[label="wz3434",fontsize=16,color="green",shape="box"];589[label="wz3430",fontsize=16,color="green",shape="box"];}
13.17/5.61	
13.17/5.61	----------------------------------------
13.17/5.61	
13.17/5.61	(8)
13.17/5.61	Complex Obligation (AND)
13.17/5.61	
13.17/5.61	----------------------------------------
13.17/5.61	
13.17/5.61	(9)
13.17/5.61	Obligation:
13.17/5.61	Q DP problem:
13.17/5.61	The TRS P consists of the following rules:
13.17/5.61	
13.17/5.61	   new_foldFM_LE13(wz9, wz400, Char(Succ(wz34000)), wz341, wz342, wz343, wz344, ba) -> new_foldFM_LE11(wz9, wz400, wz34000, wz341, wz342, wz343, wz344, wz34000, wz400, ba)
13.17/5.61	   new_foldFM_LE13(wz9, wz400, Char(Zero), wz341, wz342, wz343, wz344, ba) -> new_foldFM_LE6(wz341, new_foldFM_LE5(wz9, wz400, wz343, ba), wz400, wz344, ba)
13.17/5.61	   new_foldFM_LE11(wz82, wz83, wz84, wz85, wz86, wz87, wz88, Zero, Succ(wz900), h) -> new_foldFM_LE4(new_keysFM_LE00(wz84, wz85, new_foldFM_LE5(wz82, wz83, wz87, h), h), wz83, wz88, h)
13.17/5.61	   new_foldFM_LE12(wz82, wz83, wz84, wz85, wz86, wz87, wz88, h) -> new_foldFM_LE4(wz82, wz83, wz87, h)
13.17/5.61	   new_foldFM_LE11(wz82, wz83, wz84, wz85, wz86, wz87, wz88, Succ(wz890), Zero, h) -> new_foldFM_LE4(wz82, wz83, wz87, h)
13.17/5.61	   new_foldFM_LE11(wz82, wz83, wz84, wz85, wz86, wz87, wz88, Zero, Succ(wz900), h) -> new_foldFM_LE4(wz82, wz83, wz87, h)
13.17/5.61	   new_foldFM_LE11(wz82, wz83, wz84, wz85, wz86, wz87, wz88, Zero, Zero, h) -> new_foldFM_LE12(wz82, wz83, wz84, wz85, wz86, wz87, wz88, h)
13.17/5.61	   new_foldFM_LE13(wz9, wz400, Char(Zero), wz341, wz342, Branch(wz3430, wz3431, wz3432, wz3433, wz3434), wz344, ba) -> new_foldFM_LE13(wz9, wz400, wz3430, wz3431, wz3432, wz3433, wz3434, ba)
13.17/5.61	   new_foldFM_LE4(wz9, wz400, Branch(wz3430, wz3431, wz3432, wz3433, wz3434), ba) -> new_foldFM_LE13(wz9, wz400, wz3430, wz3431, wz3432, wz3433, wz3434, ba)
13.17/5.61	   new_foldFM_LE11(wz82, wz83, wz84, wz85, wz86, wz87, wz88, Succ(wz890), Succ(wz900), h) -> new_foldFM_LE11(wz82, wz83, wz84, wz85, wz86, wz87, wz88, wz890, wz900, h)
13.17/5.61	   new_foldFM_LE12(wz82, wz83, wz84, wz85, wz86, wz87, wz88, h) -> new_foldFM_LE4(new_keysFM_LE00(wz84, wz85, new_foldFM_LE5(wz82, wz83, wz87, h), h), wz83, wz88, h)
13.17/5.61	   new_foldFM_LE6(wz31, wz5, wz400, Branch(wz340, wz341, wz342, wz343, wz344), ba) -> new_foldFM_LE13(new_keysFM_LE0(wz31, wz5, ba), wz400, wz340, wz341, wz342, wz343, wz344, ba)
13.17/5.61	
13.17/5.61	The TRS R consists of the following rules:
13.17/5.61	
13.17/5.61	   new_foldFM_LE7(wz31, wz5, wz400, EmptyFM, ba) -> new_keysFM_LE0(wz31, wz5, ba)
13.17/5.61	   new_foldFM_LE14(wz9, wz400, Char(Zero), wz341, wz342, wz343, wz344, ba) -> new_foldFM_LE7(wz341, new_foldFM_LE5(wz9, wz400, wz343, ba), wz400, wz344, ba)
13.17/5.61	   new_foldFM_LE15(wz82, wz83, wz84, wz85, wz86, wz87, wz88, Succ(wz890), Succ(wz900), h) -> new_foldFM_LE15(wz82, wz83, wz84, wz85, wz86, wz87, wz88, wz890, wz900, h)
13.17/5.61	   new_foldFM_LE5(wz9, wz400, Branch(wz3430, wz3431, wz3432, wz3433, wz3434), ba) -> new_foldFM_LE14(wz9, wz400, wz3430, wz3431, wz3432, wz3433, wz3434, ba)
13.17/5.61	   new_foldFM_LE5(wz9, wz400, EmptyFM, ba) -> wz9
13.17/5.61	   new_foldFM_LE14(wz9, wz400, Char(Succ(wz34000)), wz341, wz342, wz343, wz344, ba) -> new_foldFM_LE15(wz9, wz400, wz34000, wz341, wz342, wz343, wz344, wz34000, wz400, ba)
13.17/5.61	   new_foldFM_LE15(wz82, wz83, wz84, wz85, wz86, wz87, wz88, Zero, Zero, h) -> new_foldFM_LE16(wz82, wz83, wz84, wz85, wz86, wz87, wz88, h)
13.17/5.61	   new_foldFM_LE15(wz82, wz83, wz84, wz85, wz86, wz87, wz88, Succ(wz890), Zero, h) -> new_foldFM_LE5(wz82, wz83, wz87, h)
13.17/5.61	   new_foldFM_LE15(wz82, wz83, wz84, wz85, wz86, wz87, wz88, Zero, Succ(wz900), h) -> new_foldFM_LE16(wz82, wz83, wz84, wz85, wz86, wz87, wz88, h)
13.17/5.61	   new_keysFM_LE0(wz31, wz5, ba) -> :(Char(Zero), wz5)
13.17/5.61	   new_keysFM_LE00(wz84, wz85, wz91, h) -> :(Char(Succ(wz84)), wz91)
13.17/5.61	   new_foldFM_LE7(wz31, wz5, wz400, Branch(wz340, wz341, wz342, wz343, wz344), ba) -> new_foldFM_LE14(new_keysFM_LE0(wz31, wz5, ba), wz400, wz340, wz341, wz342, wz343, wz344, ba)
13.17/5.61	   new_foldFM_LE16(wz82, wz83, wz84, wz85, wz86, wz87, wz88, h) -> new_foldFM_LE5(new_keysFM_LE00(wz84, wz85, new_foldFM_LE5(wz82, wz83, wz87, h), h), wz83, wz88, h)
13.17/5.61	
13.17/5.61	The set Q consists of the following terms:
13.17/5.61	
13.17/5.61	   new_foldFM_LE15(x0, x1, x2, x3, x4, x5, x6, Zero, Zero, x7)
13.17/5.61	   new_foldFM_LE16(x0, x1, x2, x3, x4, x5, x6, x7)
13.17/5.61	   new_foldFM_LE5(x0, x1, Branch(x2, x3, x4, x5, x6), x7)
13.17/5.61	   new_foldFM_LE15(x0, x1, x2, x3, x4, x5, x6, Succ(x7), Zero, x8)
13.17/5.61	   new_keysFM_LE0(x0, x1, x2)
13.17/5.61	   new_foldFM_LE15(x0, x1, x2, x3, x4, x5, x6, Succ(x7), Succ(x8), x9)
13.17/5.61	   new_foldFM_LE14(x0, x1, Char(Succ(x2)), x3, x4, x5, x6, x7)
13.17/5.61	   new_foldFM_LE15(x0, x1, x2, x3, x4, x5, x6, Zero, Succ(x7), x8)
13.17/5.61	   new_foldFM_LE5(x0, x1, EmptyFM, x2)
13.17/5.61	   new_foldFM_LE14(x0, x1, Char(Zero), x2, x3, x4, x5, x6)
13.17/5.61	   new_foldFM_LE7(x0, x1, x2, EmptyFM, x3)
13.17/5.61	   new_keysFM_LE00(x0, x1, x2, x3)
13.17/5.61	   new_foldFM_LE7(x0, x1, x2, Branch(x3, x4, x5, x6, x7), x8)
13.17/5.61	
13.17/5.61	We have to consider all minimal (P,Q,R)-chains.
13.17/5.61	----------------------------------------
13.17/5.61	
13.17/5.61	(10) TransformationProof (EQUIVALENT)
13.17/5.61	By rewriting [LPAR04] the rule new_foldFM_LE11(wz82, wz83, wz84, wz85, wz86, wz87, wz88, Zero, Succ(wz900), h) -> new_foldFM_LE4(new_keysFM_LE00(wz84, wz85, new_foldFM_LE5(wz82, wz83, wz87, h), h), wz83, wz88, h) at position [0] we obtained the following new rules [LPAR04]:
13.17/5.61	
13.17/5.61	   (new_foldFM_LE11(wz82, wz83, wz84, wz85, wz86, wz87, wz88, Zero, Succ(wz900), h) -> new_foldFM_LE4(:(Char(Succ(wz84)), new_foldFM_LE5(wz82, wz83, wz87, h)), wz83, wz88, h),new_foldFM_LE11(wz82, wz83, wz84, wz85, wz86, wz87, wz88, Zero, Succ(wz900), h) -> new_foldFM_LE4(:(Char(Succ(wz84)), new_foldFM_LE5(wz82, wz83, wz87, h)), wz83, wz88, h))
13.17/5.61	
13.17/5.61	
13.17/5.61	----------------------------------------
13.17/5.61	
13.17/5.61	(11)
13.17/5.61	Obligation:
13.17/5.61	Q DP problem:
13.17/5.61	The TRS P consists of the following rules:
13.17/5.61	
13.17/5.61	   new_foldFM_LE13(wz9, wz400, Char(Succ(wz34000)), wz341, wz342, wz343, wz344, ba) -> new_foldFM_LE11(wz9, wz400, wz34000, wz341, wz342, wz343, wz344, wz34000, wz400, ba)
13.17/5.61	   new_foldFM_LE13(wz9, wz400, Char(Zero), wz341, wz342, wz343, wz344, ba) -> new_foldFM_LE6(wz341, new_foldFM_LE5(wz9, wz400, wz343, ba), wz400, wz344, ba)
13.17/5.61	   new_foldFM_LE12(wz82, wz83, wz84, wz85, wz86, wz87, wz88, h) -> new_foldFM_LE4(wz82, wz83, wz87, h)
13.17/5.61	   new_foldFM_LE11(wz82, wz83, wz84, wz85, wz86, wz87, wz88, Succ(wz890), Zero, h) -> new_foldFM_LE4(wz82, wz83, wz87, h)
13.17/5.61	   new_foldFM_LE11(wz82, wz83, wz84, wz85, wz86, wz87, wz88, Zero, Succ(wz900), h) -> new_foldFM_LE4(wz82, wz83, wz87, h)
13.17/5.61	   new_foldFM_LE11(wz82, wz83, wz84, wz85, wz86, wz87, wz88, Zero, Zero, h) -> new_foldFM_LE12(wz82, wz83, wz84, wz85, wz86, wz87, wz88, h)
13.17/5.61	   new_foldFM_LE13(wz9, wz400, Char(Zero), wz341, wz342, Branch(wz3430, wz3431, wz3432, wz3433, wz3434), wz344, ba) -> new_foldFM_LE13(wz9, wz400, wz3430, wz3431, wz3432, wz3433, wz3434, ba)
13.17/5.61	   new_foldFM_LE4(wz9, wz400, Branch(wz3430, wz3431, wz3432, wz3433, wz3434), ba) -> new_foldFM_LE13(wz9, wz400, wz3430, wz3431, wz3432, wz3433, wz3434, ba)
13.17/5.61	   new_foldFM_LE11(wz82, wz83, wz84, wz85, wz86, wz87, wz88, Succ(wz890), Succ(wz900), h) -> new_foldFM_LE11(wz82, wz83, wz84, wz85, wz86, wz87, wz88, wz890, wz900, h)
13.17/5.61	   new_foldFM_LE12(wz82, wz83, wz84, wz85, wz86, wz87, wz88, h) -> new_foldFM_LE4(new_keysFM_LE00(wz84, wz85, new_foldFM_LE5(wz82, wz83, wz87, h), h), wz83, wz88, h)
13.17/5.61	   new_foldFM_LE6(wz31, wz5, wz400, Branch(wz340, wz341, wz342, wz343, wz344), ba) -> new_foldFM_LE13(new_keysFM_LE0(wz31, wz5, ba), wz400, wz340, wz341, wz342, wz343, wz344, ba)
13.17/5.61	   new_foldFM_LE11(wz82, wz83, wz84, wz85, wz86, wz87, wz88, Zero, Succ(wz900), h) -> new_foldFM_LE4(:(Char(Succ(wz84)), new_foldFM_LE5(wz82, wz83, wz87, h)), wz83, wz88, h)
13.17/5.61	
13.17/5.61	The TRS R consists of the following rules:
13.17/5.61	
13.17/5.61	   new_foldFM_LE7(wz31, wz5, wz400, EmptyFM, ba) -> new_keysFM_LE0(wz31, wz5, ba)
13.17/5.61	   new_foldFM_LE14(wz9, wz400, Char(Zero), wz341, wz342, wz343, wz344, ba) -> new_foldFM_LE7(wz341, new_foldFM_LE5(wz9, wz400, wz343, ba), wz400, wz344, ba)
13.17/5.61	   new_foldFM_LE15(wz82, wz83, wz84, wz85, wz86, wz87, wz88, Succ(wz890), Succ(wz900), h) -> new_foldFM_LE15(wz82, wz83, wz84, wz85, wz86, wz87, wz88, wz890, wz900, h)
13.17/5.61	   new_foldFM_LE5(wz9, wz400, Branch(wz3430, wz3431, wz3432, wz3433, wz3434), ba) -> new_foldFM_LE14(wz9, wz400, wz3430, wz3431, wz3432, wz3433, wz3434, ba)
13.17/5.61	   new_foldFM_LE5(wz9, wz400, EmptyFM, ba) -> wz9
13.17/5.61	   new_foldFM_LE14(wz9, wz400, Char(Succ(wz34000)), wz341, wz342, wz343, wz344, ba) -> new_foldFM_LE15(wz9, wz400, wz34000, wz341, wz342, wz343, wz344, wz34000, wz400, ba)
13.17/5.61	   new_foldFM_LE15(wz82, wz83, wz84, wz85, wz86, wz87, wz88, Zero, Zero, h) -> new_foldFM_LE16(wz82, wz83, wz84, wz85, wz86, wz87, wz88, h)
13.17/5.61	   new_foldFM_LE15(wz82, wz83, wz84, wz85, wz86, wz87, wz88, Succ(wz890), Zero, h) -> new_foldFM_LE5(wz82, wz83, wz87, h)
13.17/5.61	   new_foldFM_LE15(wz82, wz83, wz84, wz85, wz86, wz87, wz88, Zero, Succ(wz900), h) -> new_foldFM_LE16(wz82, wz83, wz84, wz85, wz86, wz87, wz88, h)
13.17/5.61	   new_keysFM_LE0(wz31, wz5, ba) -> :(Char(Zero), wz5)
13.17/5.61	   new_keysFM_LE00(wz84, wz85, wz91, h) -> :(Char(Succ(wz84)), wz91)
13.17/5.61	   new_foldFM_LE7(wz31, wz5, wz400, Branch(wz340, wz341, wz342, wz343, wz344), ba) -> new_foldFM_LE14(new_keysFM_LE0(wz31, wz5, ba), wz400, wz340, wz341, wz342, wz343, wz344, ba)
13.17/5.61	   new_foldFM_LE16(wz82, wz83, wz84, wz85, wz86, wz87, wz88, h) -> new_foldFM_LE5(new_keysFM_LE00(wz84, wz85, new_foldFM_LE5(wz82, wz83, wz87, h), h), wz83, wz88, h)
13.17/5.61	
13.17/5.61	The set Q consists of the following terms:
13.17/5.61	
13.17/5.61	   new_foldFM_LE15(x0, x1, x2, x3, x4, x5, x6, Zero, Zero, x7)
13.17/5.61	   new_foldFM_LE16(x0, x1, x2, x3, x4, x5, x6, x7)
13.17/5.61	   new_foldFM_LE5(x0, x1, Branch(x2, x3, x4, x5, x6), x7)
13.17/5.61	   new_foldFM_LE15(x0, x1, x2, x3, x4, x5, x6, Succ(x7), Zero, x8)
13.17/5.61	   new_keysFM_LE0(x0, x1, x2)
13.17/5.61	   new_foldFM_LE15(x0, x1, x2, x3, x4, x5, x6, Succ(x7), Succ(x8), x9)
13.17/5.61	   new_foldFM_LE14(x0, x1, Char(Succ(x2)), x3, x4, x5, x6, x7)
13.17/5.61	   new_foldFM_LE15(x0, x1, x2, x3, x4, x5, x6, Zero, Succ(x7), x8)
13.17/5.61	   new_foldFM_LE5(x0, x1, EmptyFM, x2)
13.17/5.61	   new_foldFM_LE14(x0, x1, Char(Zero), x2, x3, x4, x5, x6)
13.17/5.61	   new_foldFM_LE7(x0, x1, x2, EmptyFM, x3)
13.17/5.61	   new_keysFM_LE00(x0, x1, x2, x3)
13.17/5.61	   new_foldFM_LE7(x0, x1, x2, Branch(x3, x4, x5, x6, x7), x8)
13.17/5.61	
13.17/5.61	We have to consider all minimal (P,Q,R)-chains.
13.17/5.61	----------------------------------------
13.17/5.61	
13.17/5.61	(12) TransformationProof (EQUIVALENT)
13.17/5.61	By rewriting [LPAR04] the rule new_foldFM_LE12(wz82, wz83, wz84, wz85, wz86, wz87, wz88, h) -> new_foldFM_LE4(new_keysFM_LE00(wz84, wz85, new_foldFM_LE5(wz82, wz83, wz87, h), h), wz83, wz88, h) at position [0] we obtained the following new rules [LPAR04]:
13.17/5.61	
13.17/5.61	   (new_foldFM_LE12(wz82, wz83, wz84, wz85, wz86, wz87, wz88, h) -> new_foldFM_LE4(:(Char(Succ(wz84)), new_foldFM_LE5(wz82, wz83, wz87, h)), wz83, wz88, h),new_foldFM_LE12(wz82, wz83, wz84, wz85, wz86, wz87, wz88, h) -> new_foldFM_LE4(:(Char(Succ(wz84)), new_foldFM_LE5(wz82, wz83, wz87, h)), wz83, wz88, h))
13.17/5.61	
13.17/5.61	
13.17/5.61	----------------------------------------
13.17/5.61	
13.17/5.61	(13)
13.17/5.61	Obligation:
13.17/5.61	Q DP problem:
13.17/5.61	The TRS P consists of the following rules:
13.17/5.61	
13.17/5.61	   new_foldFM_LE13(wz9, wz400, Char(Succ(wz34000)), wz341, wz342, wz343, wz344, ba) -> new_foldFM_LE11(wz9, wz400, wz34000, wz341, wz342, wz343, wz344, wz34000, wz400, ba)
13.17/5.61	   new_foldFM_LE13(wz9, wz400, Char(Zero), wz341, wz342, wz343, wz344, ba) -> new_foldFM_LE6(wz341, new_foldFM_LE5(wz9, wz400, wz343, ba), wz400, wz344, ba)
13.17/5.61	   new_foldFM_LE12(wz82, wz83, wz84, wz85, wz86, wz87, wz88, h) -> new_foldFM_LE4(wz82, wz83, wz87, h)
13.17/5.61	   new_foldFM_LE11(wz82, wz83, wz84, wz85, wz86, wz87, wz88, Succ(wz890), Zero, h) -> new_foldFM_LE4(wz82, wz83, wz87, h)
13.17/5.61	   new_foldFM_LE11(wz82, wz83, wz84, wz85, wz86, wz87, wz88, Zero, Succ(wz900), h) -> new_foldFM_LE4(wz82, wz83, wz87, h)
13.17/5.61	   new_foldFM_LE11(wz82, wz83, wz84, wz85, wz86, wz87, wz88, Zero, Zero, h) -> new_foldFM_LE12(wz82, wz83, wz84, wz85, wz86, wz87, wz88, h)
13.17/5.61	   new_foldFM_LE13(wz9, wz400, Char(Zero), wz341, wz342, Branch(wz3430, wz3431, wz3432, wz3433, wz3434), wz344, ba) -> new_foldFM_LE13(wz9, wz400, wz3430, wz3431, wz3432, wz3433, wz3434, ba)
13.17/5.61	   new_foldFM_LE4(wz9, wz400, Branch(wz3430, wz3431, wz3432, wz3433, wz3434), ba) -> new_foldFM_LE13(wz9, wz400, wz3430, wz3431, wz3432, wz3433, wz3434, ba)
13.17/5.61	   new_foldFM_LE11(wz82, wz83, wz84, wz85, wz86, wz87, wz88, Succ(wz890), Succ(wz900), h) -> new_foldFM_LE11(wz82, wz83, wz84, wz85, wz86, wz87, wz88, wz890, wz900, h)
13.17/5.61	   new_foldFM_LE6(wz31, wz5, wz400, Branch(wz340, wz341, wz342, wz343, wz344), ba) -> new_foldFM_LE13(new_keysFM_LE0(wz31, wz5, ba), wz400, wz340, wz341, wz342, wz343, wz344, ba)
13.17/5.61	   new_foldFM_LE11(wz82, wz83, wz84, wz85, wz86, wz87, wz88, Zero, Succ(wz900), h) -> new_foldFM_LE4(:(Char(Succ(wz84)), new_foldFM_LE5(wz82, wz83, wz87, h)), wz83, wz88, h)
13.17/5.61	   new_foldFM_LE12(wz82, wz83, wz84, wz85, wz86, wz87, wz88, h) -> new_foldFM_LE4(:(Char(Succ(wz84)), new_foldFM_LE5(wz82, wz83, wz87, h)), wz83, wz88, h)
13.17/5.61	
13.17/5.61	The TRS R consists of the following rules:
13.17/5.61	
13.17/5.61	   new_foldFM_LE7(wz31, wz5, wz400, EmptyFM, ba) -> new_keysFM_LE0(wz31, wz5, ba)
13.17/5.61	   new_foldFM_LE14(wz9, wz400, Char(Zero), wz341, wz342, wz343, wz344, ba) -> new_foldFM_LE7(wz341, new_foldFM_LE5(wz9, wz400, wz343, ba), wz400, wz344, ba)
13.17/5.61	   new_foldFM_LE15(wz82, wz83, wz84, wz85, wz86, wz87, wz88, Succ(wz890), Succ(wz900), h) -> new_foldFM_LE15(wz82, wz83, wz84, wz85, wz86, wz87, wz88, wz890, wz900, h)
13.17/5.61	   new_foldFM_LE5(wz9, wz400, Branch(wz3430, wz3431, wz3432, wz3433, wz3434), ba) -> new_foldFM_LE14(wz9, wz400, wz3430, wz3431, wz3432, wz3433, wz3434, ba)
13.17/5.61	   new_foldFM_LE5(wz9, wz400, EmptyFM, ba) -> wz9
13.17/5.61	   new_foldFM_LE14(wz9, wz400, Char(Succ(wz34000)), wz341, wz342, wz343, wz344, ba) -> new_foldFM_LE15(wz9, wz400, wz34000, wz341, wz342, wz343, wz344, wz34000, wz400, ba)
13.17/5.61	   new_foldFM_LE15(wz82, wz83, wz84, wz85, wz86, wz87, wz88, Zero, Zero, h) -> new_foldFM_LE16(wz82, wz83, wz84, wz85, wz86, wz87, wz88, h)
13.17/5.61	   new_foldFM_LE15(wz82, wz83, wz84, wz85, wz86, wz87, wz88, Succ(wz890), Zero, h) -> new_foldFM_LE5(wz82, wz83, wz87, h)
13.17/5.62	   new_foldFM_LE15(wz82, wz83, wz84, wz85, wz86, wz87, wz88, Zero, Succ(wz900), h) -> new_foldFM_LE16(wz82, wz83, wz84, wz85, wz86, wz87, wz88, h)
13.17/5.62	   new_keysFM_LE0(wz31, wz5, ba) -> :(Char(Zero), wz5)
13.17/5.62	   new_keysFM_LE00(wz84, wz85, wz91, h) -> :(Char(Succ(wz84)), wz91)
13.17/5.62	   new_foldFM_LE7(wz31, wz5, wz400, Branch(wz340, wz341, wz342, wz343, wz344), ba) -> new_foldFM_LE14(new_keysFM_LE0(wz31, wz5, ba), wz400, wz340, wz341, wz342, wz343, wz344, ba)
13.17/5.62	   new_foldFM_LE16(wz82, wz83, wz84, wz85, wz86, wz87, wz88, h) -> new_foldFM_LE5(new_keysFM_LE00(wz84, wz85, new_foldFM_LE5(wz82, wz83, wz87, h), h), wz83, wz88, h)
13.17/5.62	
13.17/5.62	The set Q consists of the following terms:
13.17/5.62	
13.17/5.62	   new_foldFM_LE15(x0, x1, x2, x3, x4, x5, x6, Zero, Zero, x7)
13.17/5.62	   new_foldFM_LE16(x0, x1, x2, x3, x4, x5, x6, x7)
13.17/5.62	   new_foldFM_LE5(x0, x1, Branch(x2, x3, x4, x5, x6), x7)
13.17/5.62	   new_foldFM_LE15(x0, x1, x2, x3, x4, x5, x6, Succ(x7), Zero, x8)
13.17/5.62	   new_keysFM_LE0(x0, x1, x2)
13.17/5.62	   new_foldFM_LE15(x0, x1, x2, x3, x4, x5, x6, Succ(x7), Succ(x8), x9)
13.17/5.62	   new_foldFM_LE14(x0, x1, Char(Succ(x2)), x3, x4, x5, x6, x7)
13.17/5.62	   new_foldFM_LE15(x0, x1, x2, x3, x4, x5, x6, Zero, Succ(x7), x8)
13.17/5.62	   new_foldFM_LE5(x0, x1, EmptyFM, x2)
13.17/5.62	   new_foldFM_LE14(x0, x1, Char(Zero), x2, x3, x4, x5, x6)
13.17/5.62	   new_foldFM_LE7(x0, x1, x2, EmptyFM, x3)
13.17/5.62	   new_keysFM_LE00(x0, x1, x2, x3)
13.17/5.62	   new_foldFM_LE7(x0, x1, x2, Branch(x3, x4, x5, x6, x7), x8)
13.17/5.62	
13.17/5.62	We have to consider all minimal (P,Q,R)-chains.
13.17/5.62	----------------------------------------
13.17/5.62	
13.17/5.62	(14) TransformationProof (EQUIVALENT)
13.17/5.62	By rewriting [LPAR04] the rule new_foldFM_LE6(wz31, wz5, wz400, Branch(wz340, wz341, wz342, wz343, wz344), ba) -> new_foldFM_LE13(new_keysFM_LE0(wz31, wz5, ba), wz400, wz340, wz341, wz342, wz343, wz344, ba) at position [0] we obtained the following new rules [LPAR04]:
13.17/5.62	
13.17/5.62	   (new_foldFM_LE6(wz31, wz5, wz400, Branch(wz340, wz341, wz342, wz343, wz344), ba) -> new_foldFM_LE13(:(Char(Zero), wz5), wz400, wz340, wz341, wz342, wz343, wz344, ba),new_foldFM_LE6(wz31, wz5, wz400, Branch(wz340, wz341, wz342, wz343, wz344), ba) -> new_foldFM_LE13(:(Char(Zero), wz5), wz400, wz340, wz341, wz342, wz343, wz344, ba))
13.17/5.62	
13.17/5.62	
13.17/5.62	----------------------------------------
13.17/5.62	
13.17/5.62	(15)
13.17/5.62	Obligation:
13.17/5.62	Q DP problem:
13.17/5.62	The TRS P consists of the following rules:
13.17/5.62	
13.17/5.62	   new_foldFM_LE13(wz9, wz400, Char(Succ(wz34000)), wz341, wz342, wz343, wz344, ba) -> new_foldFM_LE11(wz9, wz400, wz34000, wz341, wz342, wz343, wz344, wz34000, wz400, ba)
13.17/5.62	   new_foldFM_LE13(wz9, wz400, Char(Zero), wz341, wz342, wz343, wz344, ba) -> new_foldFM_LE6(wz341, new_foldFM_LE5(wz9, wz400, wz343, ba), wz400, wz344, ba)
13.17/5.62	   new_foldFM_LE12(wz82, wz83, wz84, wz85, wz86, wz87, wz88, h) -> new_foldFM_LE4(wz82, wz83, wz87, h)
13.17/5.62	   new_foldFM_LE11(wz82, wz83, wz84, wz85, wz86, wz87, wz88, Succ(wz890), Zero, h) -> new_foldFM_LE4(wz82, wz83, wz87, h)
13.17/5.62	   new_foldFM_LE11(wz82, wz83, wz84, wz85, wz86, wz87, wz88, Zero, Succ(wz900), h) -> new_foldFM_LE4(wz82, wz83, wz87, h)
13.17/5.62	   new_foldFM_LE11(wz82, wz83, wz84, wz85, wz86, wz87, wz88, Zero, Zero, h) -> new_foldFM_LE12(wz82, wz83, wz84, wz85, wz86, wz87, wz88, h)
13.17/5.62	   new_foldFM_LE13(wz9, wz400, Char(Zero), wz341, wz342, Branch(wz3430, wz3431, wz3432, wz3433, wz3434), wz344, ba) -> new_foldFM_LE13(wz9, wz400, wz3430, wz3431, wz3432, wz3433, wz3434, ba)
13.17/5.62	   new_foldFM_LE4(wz9, wz400, Branch(wz3430, wz3431, wz3432, wz3433, wz3434), ba) -> new_foldFM_LE13(wz9, wz400, wz3430, wz3431, wz3432, wz3433, wz3434, ba)
13.17/5.62	   new_foldFM_LE11(wz82, wz83, wz84, wz85, wz86, wz87, wz88, Succ(wz890), Succ(wz900), h) -> new_foldFM_LE11(wz82, wz83, wz84, wz85, wz86, wz87, wz88, wz890, wz900, h)
13.17/5.62	   new_foldFM_LE11(wz82, wz83, wz84, wz85, wz86, wz87, wz88, Zero, Succ(wz900), h) -> new_foldFM_LE4(:(Char(Succ(wz84)), new_foldFM_LE5(wz82, wz83, wz87, h)), wz83, wz88, h)
13.17/5.62	   new_foldFM_LE12(wz82, wz83, wz84, wz85, wz86, wz87, wz88, h) -> new_foldFM_LE4(:(Char(Succ(wz84)), new_foldFM_LE5(wz82, wz83, wz87, h)), wz83, wz88, h)
13.17/5.62	   new_foldFM_LE6(wz31, wz5, wz400, Branch(wz340, wz341, wz342, wz343, wz344), ba) -> new_foldFM_LE13(:(Char(Zero), wz5), wz400, wz340, wz341, wz342, wz343, wz344, ba)
13.17/5.62	
13.17/5.62	The TRS R consists of the following rules:
13.17/5.62	
13.17/5.62	   new_foldFM_LE7(wz31, wz5, wz400, EmptyFM, ba) -> new_keysFM_LE0(wz31, wz5, ba)
13.17/5.62	   new_foldFM_LE14(wz9, wz400, Char(Zero), wz341, wz342, wz343, wz344, ba) -> new_foldFM_LE7(wz341, new_foldFM_LE5(wz9, wz400, wz343, ba), wz400, wz344, ba)
13.17/5.62	   new_foldFM_LE15(wz82, wz83, wz84, wz85, wz86, wz87, wz88, Succ(wz890), Succ(wz900), h) -> new_foldFM_LE15(wz82, wz83, wz84, wz85, wz86, wz87, wz88, wz890, wz900, h)
13.17/5.62	   new_foldFM_LE5(wz9, wz400, Branch(wz3430, wz3431, wz3432, wz3433, wz3434), ba) -> new_foldFM_LE14(wz9, wz400, wz3430, wz3431, wz3432, wz3433, wz3434, ba)
13.17/5.62	   new_foldFM_LE5(wz9, wz400, EmptyFM, ba) -> wz9
13.17/5.62	   new_foldFM_LE14(wz9, wz400, Char(Succ(wz34000)), wz341, wz342, wz343, wz344, ba) -> new_foldFM_LE15(wz9, wz400, wz34000, wz341, wz342, wz343, wz344, wz34000, wz400, ba)
13.17/5.62	   new_foldFM_LE15(wz82, wz83, wz84, wz85, wz86, wz87, wz88, Zero, Zero, h) -> new_foldFM_LE16(wz82, wz83, wz84, wz85, wz86, wz87, wz88, h)
13.17/5.62	   new_foldFM_LE15(wz82, wz83, wz84, wz85, wz86, wz87, wz88, Succ(wz890), Zero, h) -> new_foldFM_LE5(wz82, wz83, wz87, h)
13.17/5.62	   new_foldFM_LE15(wz82, wz83, wz84, wz85, wz86, wz87, wz88, Zero, Succ(wz900), h) -> new_foldFM_LE16(wz82, wz83, wz84, wz85, wz86, wz87, wz88, h)
13.17/5.62	   new_keysFM_LE0(wz31, wz5, ba) -> :(Char(Zero), wz5)
13.17/5.62	   new_keysFM_LE00(wz84, wz85, wz91, h) -> :(Char(Succ(wz84)), wz91)
13.17/5.62	   new_foldFM_LE7(wz31, wz5, wz400, Branch(wz340, wz341, wz342, wz343, wz344), ba) -> new_foldFM_LE14(new_keysFM_LE0(wz31, wz5, ba), wz400, wz340, wz341, wz342, wz343, wz344, ba)
13.17/5.62	   new_foldFM_LE16(wz82, wz83, wz84, wz85, wz86, wz87, wz88, h) -> new_foldFM_LE5(new_keysFM_LE00(wz84, wz85, new_foldFM_LE5(wz82, wz83, wz87, h), h), wz83, wz88, h)
13.17/5.62	
13.17/5.62	The set Q consists of the following terms:
13.17/5.62	
13.17/5.62	   new_foldFM_LE15(x0, x1, x2, x3, x4, x5, x6, Zero, Zero, x7)
13.17/5.62	   new_foldFM_LE16(x0, x1, x2, x3, x4, x5, x6, x7)
13.17/5.62	   new_foldFM_LE5(x0, x1, Branch(x2, x3, x4, x5, x6), x7)
13.17/5.62	   new_foldFM_LE15(x0, x1, x2, x3, x4, x5, x6, Succ(x7), Zero, x8)
13.17/5.62	   new_keysFM_LE0(x0, x1, x2)
13.17/5.62	   new_foldFM_LE15(x0, x1, x2, x3, x4, x5, x6, Succ(x7), Succ(x8), x9)
13.17/5.62	   new_foldFM_LE14(x0, x1, Char(Succ(x2)), x3, x4, x5, x6, x7)
13.17/5.62	   new_foldFM_LE15(x0, x1, x2, x3, x4, x5, x6, Zero, Succ(x7), x8)
13.17/5.62	   new_foldFM_LE5(x0, x1, EmptyFM, x2)
13.17/5.62	   new_foldFM_LE14(x0, x1, Char(Zero), x2, x3, x4, x5, x6)
13.17/5.62	   new_foldFM_LE7(x0, x1, x2, EmptyFM, x3)
13.17/5.62	   new_keysFM_LE00(x0, x1, x2, x3)
13.17/5.62	   new_foldFM_LE7(x0, x1, x2, Branch(x3, x4, x5, x6, x7), x8)
13.17/5.62	
13.17/5.62	We have to consider all minimal (P,Q,R)-chains.
13.17/5.62	----------------------------------------
13.17/5.62	
13.17/5.62	(16) QDPSizeChangeProof (EQUIVALENT)
13.17/5.62	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. 
13.17/5.62	
13.17/5.62	From the DPs we obtained the following set of size-change graphs:
13.17/5.62	*new_foldFM_LE6(wz31, wz5, wz400, Branch(wz340, wz341, wz342, wz343, wz344), ba) -> new_foldFM_LE13(:(Char(Zero), wz5), wz400, wz340, wz341, wz342, wz343, wz344, ba)
13.17/5.62	The graph contains the following edges 3 >= 2, 4 > 3, 4 > 4, 4 > 5, 4 > 6, 4 > 7, 5 >= 8
13.17/5.62	
13.17/5.62	
13.17/5.62	*new_foldFM_LE11(wz82, wz83, wz84, wz85, wz86, wz87, wz88, Zero, Zero, h) -> new_foldFM_LE12(wz82, wz83, wz84, wz85, wz86, wz87, wz88, h)
13.17/5.62	The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 7 >= 7, 10 >= 8
13.17/5.62	
13.17/5.62	
13.17/5.62	*new_foldFM_LE4(wz9, wz400, Branch(wz3430, wz3431, wz3432, wz3433, wz3434), ba) -> new_foldFM_LE13(wz9, wz400, wz3430, wz3431, wz3432, wz3433, wz3434, ba)
13.17/5.62	The graph contains the following edges 1 >= 1, 2 >= 2, 3 > 3, 3 > 4, 3 > 5, 3 > 6, 3 > 7, 4 >= 8
13.17/5.62	
13.17/5.62	
13.17/5.62	*new_foldFM_LE13(wz9, wz400, Char(Zero), wz341, wz342, Branch(wz3430, wz3431, wz3432, wz3433, wz3434), wz344, ba) -> new_foldFM_LE13(wz9, wz400, wz3430, wz3431, wz3432, wz3433, wz3434, ba)
13.17/5.62	The graph contains the following edges 1 >= 1, 2 >= 2, 6 > 3, 6 > 4, 6 > 5, 6 > 6, 6 > 7, 8 >= 8
13.17/5.62	
13.17/5.62	
13.17/5.62	*new_foldFM_LE11(wz82, wz83, wz84, wz85, wz86, wz87, wz88, Succ(wz890), Succ(wz900), h) -> new_foldFM_LE11(wz82, wz83, wz84, wz85, wz86, wz87, wz88, wz890, wz900, h)
13.17/5.62	The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 7 >= 7, 8 > 8, 9 > 9, 10 >= 10
13.17/5.62	
13.17/5.62	
13.17/5.62	*new_foldFM_LE13(wz9, wz400, Char(Succ(wz34000)), wz341, wz342, wz343, wz344, ba) -> new_foldFM_LE11(wz9, wz400, wz34000, wz341, wz342, wz343, wz344, wz34000, wz400, ba)
13.17/5.62	The graph contains the following edges 1 >= 1, 2 >= 2, 3 > 3, 4 >= 4, 5 >= 5, 6 >= 6, 7 >= 7, 3 > 8, 2 >= 9, 8 >= 10
13.17/5.62	
13.17/5.62	
13.17/5.62	*new_foldFM_LE13(wz9, wz400, Char(Zero), wz341, wz342, wz343, wz344, ba) -> new_foldFM_LE6(wz341, new_foldFM_LE5(wz9, wz400, wz343, ba), wz400, wz344, ba)
13.17/5.62	The graph contains the following edges 4 >= 1, 2 >= 3, 7 >= 4, 8 >= 5
13.17/5.62	
13.17/5.62	
13.17/5.62	*new_foldFM_LE11(wz82, wz83, wz84, wz85, wz86, wz87, wz88, Succ(wz890), Zero, h) -> new_foldFM_LE4(wz82, wz83, wz87, h)
13.17/5.62	The graph contains the following edges 1 >= 1, 2 >= 2, 6 >= 3, 10 >= 4
13.17/5.62	
13.17/5.62	
13.17/5.62	*new_foldFM_LE11(wz82, wz83, wz84, wz85, wz86, wz87, wz88, Zero, Succ(wz900), h) -> new_foldFM_LE4(wz82, wz83, wz87, h)
13.17/5.62	The graph contains the following edges 1 >= 1, 2 >= 2, 6 >= 3, 10 >= 4
13.17/5.62	
13.17/5.62	
13.17/5.62	*new_foldFM_LE11(wz82, wz83, wz84, wz85, wz86, wz87, wz88, Zero, Succ(wz900), h) -> new_foldFM_LE4(:(Char(Succ(wz84)), new_foldFM_LE5(wz82, wz83, wz87, h)), wz83, wz88, h)
13.17/5.62	The graph contains the following edges 2 >= 2, 7 >= 3, 10 >= 4
13.17/5.62	
13.17/5.62	
13.17/5.62	*new_foldFM_LE12(wz82, wz83, wz84, wz85, wz86, wz87, wz88, h) -> new_foldFM_LE4(wz82, wz83, wz87, h)
13.17/5.62	The graph contains the following edges 1 >= 1, 2 >= 2, 6 >= 3, 8 >= 4
13.17/5.62	
13.17/5.62	
13.17/5.62	*new_foldFM_LE12(wz82, wz83, wz84, wz85, wz86, wz87, wz88, h) -> new_foldFM_LE4(:(Char(Succ(wz84)), new_foldFM_LE5(wz82, wz83, wz87, h)), wz83, wz88, h)
13.17/5.62	The graph contains the following edges 2 >= 2, 7 >= 3, 8 >= 4
13.17/5.62	
13.17/5.62	
13.17/5.62	----------------------------------------
13.17/5.62	
13.17/5.62	(17)
13.17/5.62	YES
13.17/5.62	
13.17/5.62	----------------------------------------
13.17/5.62	
13.17/5.62	(18)
13.17/5.62	Obligation:
13.17/5.62	Q DP problem:
13.17/5.62	The TRS P consists of the following rules:
13.17/5.62	
13.17/5.62	   new_foldFM_LE8(Char(Zero), Branch(Char(Succ(wz3000)), wz31, wz32, wz33, wz34), h) -> new_foldFM_LE8(Char(Zero), wz33, h)
13.17/5.62	   new_foldFM_LE8(Char(Succ(wz400)), Branch(Char(Zero), wz31, wz32, wz33, wz34), h) -> new_foldFM_LE8(Char(Succ(wz400)), wz33, h)
13.17/5.62	   new_foldFM_LE8(Char(Zero), Branch(Char(Zero), wz31, wz32, wz33, wz34), h) -> new_foldFM_LE8(Char(Zero), wz33, h)
13.17/5.62	
13.17/5.62	R is empty.
13.17/5.62	Q is empty.
13.17/5.62	We have to consider all minimal (P,Q,R)-chains.
13.17/5.62	----------------------------------------
13.17/5.62	
13.17/5.62	(19) DependencyGraphProof (EQUIVALENT)
13.17/5.62	The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 2 SCCs.
13.17/5.62	----------------------------------------
13.17/5.62	
13.17/5.62	(20)
13.17/5.62	Complex Obligation (AND)
13.17/5.62	
13.17/5.62	----------------------------------------
13.17/5.62	
13.17/5.62	(21)
13.17/5.62	Obligation:
13.17/5.62	Q DP problem:
13.17/5.62	The TRS P consists of the following rules:
13.17/5.62	
13.17/5.62	   new_foldFM_LE8(Char(Succ(wz400)), Branch(Char(Zero), wz31, wz32, wz33, wz34), h) -> new_foldFM_LE8(Char(Succ(wz400)), wz33, h)
13.17/5.62	
13.17/5.62	R is empty.
13.17/5.62	Q is empty.
13.17/5.62	We have to consider all minimal (P,Q,R)-chains.
13.17/5.62	----------------------------------------
13.17/5.62	
13.17/5.62	(22) QDPSizeChangeProof (EQUIVALENT)
13.17/5.62	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. 
13.17/5.62	
13.17/5.62	From the DPs we obtained the following set of size-change graphs:
13.17/5.62	*new_foldFM_LE8(Char(Succ(wz400)), Branch(Char(Zero), wz31, wz32, wz33, wz34), h) -> new_foldFM_LE8(Char(Succ(wz400)), wz33, h)
13.17/5.62	The graph contains the following edges 1 >= 1, 2 > 2, 3 >= 3
13.17/5.62	
13.17/5.62	
13.17/5.62	----------------------------------------
13.17/5.62	
13.17/5.62	(23)
13.17/5.62	YES
13.17/5.62	
13.17/5.62	----------------------------------------
13.17/5.62	
13.17/5.62	(24)
13.17/5.62	Obligation:
13.17/5.62	Q DP problem:
13.17/5.62	The TRS P consists of the following rules:
13.17/5.62	
13.17/5.62	   new_foldFM_LE8(Char(Zero), Branch(Char(Zero), wz31, wz32, wz33, wz34), h) -> new_foldFM_LE8(Char(Zero), wz33, h)
13.17/5.62	   new_foldFM_LE8(Char(Zero), Branch(Char(Succ(wz3000)), wz31, wz32, wz33, wz34), h) -> new_foldFM_LE8(Char(Zero), wz33, h)
13.17/5.62	
13.17/5.62	R is empty.
13.17/5.62	Q is empty.
13.17/5.62	We have to consider all minimal (P,Q,R)-chains.
13.17/5.62	----------------------------------------
13.17/5.62	
13.17/5.62	(25) QDPSizeChangeProof (EQUIVALENT)
13.17/5.62	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. 
13.17/5.62	
13.17/5.62	From the DPs we obtained the following set of size-change graphs:
13.17/5.62	*new_foldFM_LE8(Char(Zero), Branch(Char(Zero), wz31, wz32, wz33, wz34), h) -> new_foldFM_LE8(Char(Zero), wz33, h)
13.17/5.62	The graph contains the following edges 1 >= 1, 2 > 1, 2 > 2, 3 >= 3
13.17/5.62	
13.17/5.62	
13.17/5.62	*new_foldFM_LE8(Char(Zero), Branch(Char(Succ(wz3000)), wz31, wz32, wz33, wz34), h) -> new_foldFM_LE8(Char(Zero), wz33, h)
13.17/5.62	The graph contains the following edges 1 >= 1, 2 > 2, 3 >= 3
13.17/5.62	
13.17/5.62	
13.17/5.62	----------------------------------------
13.17/5.62	
13.17/5.62	(26)
13.17/5.62	YES
13.17/5.62	
13.17/5.62	----------------------------------------
13.17/5.62	
13.17/5.62	(27)
13.17/5.62	Obligation:
13.17/5.62	Q DP problem:
13.17/5.62	The TRS P consists of the following rules:
13.17/5.62	
13.17/5.62	   new_foldFM_LE1(wz10, Char(Succ(wz34000)), wz341, wz342, wz343, wz344, h) -> new_foldFM_LE(wz10, wz343, h)
13.17/5.62	   new_foldFM_LE(wz10, Branch(wz3430, wz3431, wz3432, wz3433, wz3434), h) -> new_foldFM_LE1(wz10, wz3430, wz3431, wz3432, wz3433, wz3434, h)
13.17/5.62	   new_foldFM_LE0(wz31, wz6, Branch(wz340, wz341, wz342, wz343, wz344), h) -> new_foldFM_LE1(new_keysFM_LE0(wz31, wz6, h), wz340, wz341, wz342, wz343, wz344, h)
13.17/5.62	   new_foldFM_LE1(wz10, Char(Zero), wz341, wz342, Branch(wz3430, wz3431, wz3432, wz3433, wz3434), wz344, h) -> new_foldFM_LE1(wz10, wz3430, wz3431, wz3432, wz3433, wz3434, h)
13.17/5.62	   new_foldFM_LE1(wz10, Char(Zero), wz341, wz342, wz343, wz344, h) -> new_foldFM_LE0(wz341, new_foldFM_LE2(wz10, wz343, h), wz344, h)
13.17/5.62	
13.17/5.62	The TRS R consists of the following rules:
13.17/5.62	
13.17/5.62	   new_foldFM_LE3(wz31, wz6, EmptyFM, h) -> new_keysFM_LE0(wz31, wz6, h)
13.17/5.62	   new_foldFM_LE2(wz10, EmptyFM, h) -> wz10
13.17/5.62	   new_foldFM_LE3(wz31, wz6, Branch(wz340, wz341, wz342, wz343, wz344), h) -> new_foldFM_LE10(new_keysFM_LE0(wz31, wz6, h), wz340, wz341, wz342, wz343, wz344, h)
13.17/5.62	   new_foldFM_LE10(wz10, Char(Succ(wz34000)), wz341, wz342, wz343, wz344, h) -> new_foldFM_LE2(wz10, wz343, h)
13.17/5.62	   new_foldFM_LE10(wz10, Char(Zero), wz341, wz342, wz343, wz344, h) -> new_foldFM_LE3(wz341, new_foldFM_LE2(wz10, wz343, h), wz344, h)
13.17/5.62	   new_foldFM_LE2(wz10, Branch(wz3430, wz3431, wz3432, wz3433, wz3434), h) -> new_foldFM_LE10(wz10, wz3430, wz3431, wz3432, wz3433, wz3434, h)
13.17/5.62	   new_keysFM_LE0(wz31, wz5, h) -> :(Char(Zero), wz5)
13.17/5.62	
13.17/5.62	The set Q consists of the following terms:
13.17/5.62	
13.17/5.62	   new_foldFM_LE2(x0, EmptyFM, x1)
13.17/5.62	   new_foldFM_LE10(x0, Char(Zero), x1, x2, x3, x4, x5)
13.17/5.62	   new_keysFM_LE0(x0, x1, x2)
13.17/5.62	   new_foldFM_LE3(x0, x1, EmptyFM, x2)
13.17/5.62	   new_foldFM_LE3(x0, x1, Branch(x2, x3, x4, x5, x6), x7)
13.17/5.62	   new_foldFM_LE10(x0, Char(Succ(x1)), x2, x3, x4, x5, x6)
13.17/5.62	   new_foldFM_LE2(x0, Branch(x1, x2, x3, x4, x5), x6)
13.17/5.62	
13.17/5.62	We have to consider all minimal (P,Q,R)-chains.
13.17/5.62	----------------------------------------
13.17/5.62	
13.17/5.62	(28) TransformationProof (EQUIVALENT)
13.17/5.62	By rewriting [LPAR04] the rule new_foldFM_LE0(wz31, wz6, Branch(wz340, wz341, wz342, wz343, wz344), h) -> new_foldFM_LE1(new_keysFM_LE0(wz31, wz6, h), wz340, wz341, wz342, wz343, wz344, h) at position [0] we obtained the following new rules [LPAR04]:
13.17/5.62	
13.17/5.62	   (new_foldFM_LE0(wz31, wz6, Branch(wz340, wz341, wz342, wz343, wz344), h) -> new_foldFM_LE1(:(Char(Zero), wz6), wz340, wz341, wz342, wz343, wz344, h),new_foldFM_LE0(wz31, wz6, Branch(wz340, wz341, wz342, wz343, wz344), h) -> new_foldFM_LE1(:(Char(Zero), wz6), wz340, wz341, wz342, wz343, wz344, h))
13.17/5.62	
13.17/5.62	
13.17/5.62	----------------------------------------
13.17/5.62	
13.17/5.62	(29)
13.17/5.62	Obligation:
13.17/5.62	Q DP problem:
13.17/5.62	The TRS P consists of the following rules:
13.17/5.62	
13.17/5.62	   new_foldFM_LE1(wz10, Char(Succ(wz34000)), wz341, wz342, wz343, wz344, h) -> new_foldFM_LE(wz10, wz343, h)
13.17/5.62	   new_foldFM_LE(wz10, Branch(wz3430, wz3431, wz3432, wz3433, wz3434), h) -> new_foldFM_LE1(wz10, wz3430, wz3431, wz3432, wz3433, wz3434, h)
13.17/5.62	   new_foldFM_LE1(wz10, Char(Zero), wz341, wz342, Branch(wz3430, wz3431, wz3432, wz3433, wz3434), wz344, h) -> new_foldFM_LE1(wz10, wz3430, wz3431, wz3432, wz3433, wz3434, h)
13.17/5.62	   new_foldFM_LE1(wz10, Char(Zero), wz341, wz342, wz343, wz344, h) -> new_foldFM_LE0(wz341, new_foldFM_LE2(wz10, wz343, h), wz344, h)
13.17/5.62	   new_foldFM_LE0(wz31, wz6, Branch(wz340, wz341, wz342, wz343, wz344), h) -> new_foldFM_LE1(:(Char(Zero), wz6), wz340, wz341, wz342, wz343, wz344, h)
13.17/5.62	
13.17/5.62	The TRS R consists of the following rules:
13.17/5.62	
13.17/5.62	   new_foldFM_LE3(wz31, wz6, EmptyFM, h) -> new_keysFM_LE0(wz31, wz6, h)
13.17/5.62	   new_foldFM_LE2(wz10, EmptyFM, h) -> wz10
13.17/5.62	   new_foldFM_LE3(wz31, wz6, Branch(wz340, wz341, wz342, wz343, wz344), h) -> new_foldFM_LE10(new_keysFM_LE0(wz31, wz6, h), wz340, wz341, wz342, wz343, wz344, h)
13.17/5.62	   new_foldFM_LE10(wz10, Char(Succ(wz34000)), wz341, wz342, wz343, wz344, h) -> new_foldFM_LE2(wz10, wz343, h)
13.17/5.62	   new_foldFM_LE10(wz10, Char(Zero), wz341, wz342, wz343, wz344, h) -> new_foldFM_LE3(wz341, new_foldFM_LE2(wz10, wz343, h), wz344, h)
13.17/5.62	   new_foldFM_LE2(wz10, Branch(wz3430, wz3431, wz3432, wz3433, wz3434), h) -> new_foldFM_LE10(wz10, wz3430, wz3431, wz3432, wz3433, wz3434, h)
13.17/5.62	   new_keysFM_LE0(wz31, wz5, h) -> :(Char(Zero), wz5)
13.17/5.62	
13.17/5.62	The set Q consists of the following terms:
13.17/5.62	
13.17/5.62	   new_foldFM_LE2(x0, EmptyFM, x1)
13.17/5.62	   new_foldFM_LE10(x0, Char(Zero), x1, x2, x3, x4, x5)
13.17/5.62	   new_keysFM_LE0(x0, x1, x2)
13.17/5.62	   new_foldFM_LE3(x0, x1, EmptyFM, x2)
13.17/5.62	   new_foldFM_LE3(x0, x1, Branch(x2, x3, x4, x5, x6), x7)
13.17/5.62	   new_foldFM_LE10(x0, Char(Succ(x1)), x2, x3, x4, x5, x6)
13.17/5.62	   new_foldFM_LE2(x0, Branch(x1, x2, x3, x4, x5), x6)
13.17/5.62	
13.17/5.62	We have to consider all minimal (P,Q,R)-chains.
13.17/5.62	----------------------------------------
13.17/5.62	
13.17/5.62	(30) QDPSizeChangeProof (EQUIVALENT)
13.17/5.62	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. 
13.17/5.62	
13.17/5.62	From the DPs we obtained the following set of size-change graphs:
13.17/5.62	*new_foldFM_LE(wz10, Branch(wz3430, wz3431, wz3432, wz3433, wz3434), h) -> new_foldFM_LE1(wz10, wz3430, wz3431, wz3432, wz3433, wz3434, h)
13.17/5.62	The graph contains the following edges 1 >= 1, 2 > 2, 2 > 3, 2 > 4, 2 > 5, 2 > 6, 3 >= 7
13.17/5.62	
13.17/5.62	
13.17/5.62	*new_foldFM_LE1(wz10, Char(Zero), wz341, wz342, Branch(wz3430, wz3431, wz3432, wz3433, wz3434), wz344, h) -> new_foldFM_LE1(wz10, wz3430, wz3431, wz3432, wz3433, wz3434, h)
13.17/5.62	The graph contains the following edges 1 >= 1, 5 > 2, 5 > 3, 5 > 4, 5 > 5, 5 > 6, 7 >= 7
13.17/5.62	
13.17/5.62	
13.17/5.62	*new_foldFM_LE0(wz31, wz6, Branch(wz340, wz341, wz342, wz343, wz344), h) -> new_foldFM_LE1(:(Char(Zero), wz6), wz340, wz341, wz342, wz343, wz344, h)
13.17/5.62	The graph contains the following edges 3 > 2, 3 > 3, 3 > 4, 3 > 5, 3 > 6, 4 >= 7
13.17/5.62	
13.17/5.62	
13.17/5.62	*new_foldFM_LE1(wz10, Char(Succ(wz34000)), wz341, wz342, wz343, wz344, h) -> new_foldFM_LE(wz10, wz343, h)
13.17/5.62	The graph contains the following edges 1 >= 1, 5 >= 2, 7 >= 3
13.17/5.62	
13.17/5.62	
13.17/5.62	*new_foldFM_LE1(wz10, Char(Zero), wz341, wz342, wz343, wz344, h) -> new_foldFM_LE0(wz341, new_foldFM_LE2(wz10, wz343, h), wz344, h)
13.17/5.62	The graph contains the following edges 3 >= 1, 6 >= 3, 7 >= 4
13.17/5.62	
13.17/5.62	
13.17/5.62	----------------------------------------
13.17/5.62	
13.17/5.62	(31)
13.17/5.62	YES
13.51/6.54	EOF