9.95/4.19	MAYBE
12.50/4.85	proof of /export/starexec/sandbox/benchmark/theBenchmark.hs
12.50/4.85	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
12.50/4.85	
12.50/4.85	
12.50/4.85	H-Termination with start terms of the given HASKELL could not be shown:
12.50/4.85	
12.50/4.85	(0) HASKELL
12.50/4.85	(1) LR [EQUIVALENT, 0 ms]
12.50/4.85	(2) HASKELL
12.50/4.85	(3) IFR [EQUIVALENT, 0 ms]
12.50/4.85	(4) HASKELL
12.50/4.85	(5) BR [EQUIVALENT, 0 ms]
12.50/4.85	(6) HASKELL
12.50/4.85	(7) COR [EQUIVALENT, 0 ms]
12.50/4.85	(8) HASKELL
12.50/4.85	(9) Narrow [SOUND, 0 ms]
12.50/4.85	(10) AND
12.50/4.85	    (11) QDP
12.50/4.85	        (12) QDPOrderProof [EQUIVALENT, 0 ms]
12.50/4.85	        (13) QDP
12.50/4.85	        (14) DependencyGraphProof [EQUIVALENT, 0 ms]
12.50/4.85	        (15) QDP
12.50/4.85	        (16) MNOCProof [EQUIVALENT, 0 ms]
12.50/4.85	        (17) QDP
12.50/4.85	        (18) NonTerminationLoopProof [COMPLETE, 0 ms]
12.50/4.85	        (19) NO
12.50/4.85	    (20) QDP
12.50/4.85	        (21) QDPSizeChangeProof [EQUIVALENT, 0 ms]
12.50/4.85	        (22) YES
12.50/4.85	    (23) QDP
12.50/4.85	        (24) QDPSizeChangeProof [EQUIVALENT, 0 ms]
12.50/4.85	        (25) YES
12.50/4.85	(26) Narrow [COMPLETE, 0 ms]
12.50/4.85	(27) TRUE
12.50/4.85	
12.50/4.85	
12.50/4.85	----------------------------------------
12.50/4.85	
12.50/4.85	(0)
12.50/4.85	Obligation:
12.50/4.85	mainModule Main 
12.50/4.85	module Maybe where {
12.50/4.85	import qualified Main;
12.50/4.85	import qualified Monad;
12.50/4.85	import qualified Prelude;
12.50/4.85	}
12.50/4.85	module Main where {
12.50/4.85	import qualified Maybe;
12.50/4.85	import qualified Monad;
12.50/4.85	import qualified Prelude;
12.50/4.85	}
12.50/4.85	module Monad where {
12.50/4.85	import qualified Main;
12.50/4.85	import qualified Maybe;
12.50/4.85	import qualified Prelude;
12.50/4.85	filterM :: Monad a => (b  ->  a Bool)  ->  [b]  ->  a [b];
12.50/4.85	filterM _ [] = return [];
12.50/4.85	filterM p (x : xs) = p x >>= (\flg ->filterM p xs >>= (\ys ->return ( if flg then x : ys else ys)));
12.50/4.85	
12.50/4.85	}
12.50/4.85	
12.50/4.85	----------------------------------------
12.50/4.85	
12.50/4.85	(1) LR (EQUIVALENT)
12.50/4.85	Lambda Reductions:
12.50/4.85	The following Lambda expression
12.50/4.85	"\ys->return (if flg then x : ys else ys)"
12.50/4.85	is transformed to
12.50/4.85	"filterM0 flg x ys = return (if flg then x : ys else ys);
12.50/4.85	"
12.50/4.85	The following Lambda expression
12.50/4.85	"\flg->filterM p xs >>= filterM0 flg x"
12.50/4.85	is transformed to
12.50/4.85	"filterM1 p xs x flg = filterM p xs >>= filterM0 flg x;
12.50/4.85	"
12.50/4.85	
12.50/4.85	----------------------------------------
12.50/4.85	
12.50/4.85	(2)
12.50/4.85	Obligation:
12.50/4.85	mainModule Main 
12.50/4.85	module Maybe where {
12.50/4.85	import qualified Main;
12.50/4.85	import qualified Monad;
12.50/4.85	import qualified Prelude;
12.50/4.85	}
12.50/4.85	module Main where {
12.50/4.85	import qualified Maybe;
12.50/4.85	import qualified Monad;
12.50/4.85	import qualified Prelude;
12.50/4.85	}
12.50/4.85	module Monad where {
12.50/4.85	import qualified Main;
12.50/4.85	import qualified Maybe;
12.50/4.85	import qualified Prelude;
12.50/4.85	filterM :: Monad a => (b  ->  a Bool)  ->  [b]  ->  a [b];
12.50/4.85	filterM _ [] = return [];
12.50/4.85	filterM p (x : xs) = p x >>= filterM1 p xs x;
12.50/4.85	
12.50/4.85	filterM0 flg x ys = return ( if flg then x : ys else ys);
12.50/4.85	
12.50/4.85	filterM1 p xs x flg = filterM p xs >>= filterM0 flg x;
12.50/4.85	
12.50/4.85	}
12.50/4.85	
12.50/4.85	----------------------------------------
12.50/4.85	
12.50/4.85	(3) IFR (EQUIVALENT)
12.50/4.85	If Reductions:
12.50/4.85	The following If expression
12.50/4.85	"if flg then x : ys else ys"
12.50/4.85	is transformed to
12.50/4.85	"filterM00 x ys True = x : ys;
12.50/4.85	filterM00 x ys False = ys;
12.50/4.85	"
12.50/4.85	
12.50/4.85	----------------------------------------
12.50/4.85	
12.50/4.85	(4)
12.50/4.85	Obligation:
12.50/4.85	mainModule Main 
12.50/4.85	module Maybe where {
12.50/4.85	import qualified Main;
12.50/4.85	import qualified Monad;
12.50/4.85	import qualified Prelude;
12.50/4.85	}
12.50/4.85	module Main where {
12.50/4.85	import qualified Maybe;
12.50/4.85	import qualified Monad;
12.50/4.85	import qualified Prelude;
12.50/4.85	}
12.50/4.85	module Monad where {
12.50/4.85	import qualified Main;
12.50/4.85	import qualified Maybe;
12.50/4.85	import qualified Prelude;
12.50/4.85	filterM :: Monad a => (b  ->  a Bool)  ->  [b]  ->  a [b];
12.50/4.85	filterM _ [] = return [];
12.50/4.85	filterM p (x : xs) = p x >>= filterM1 p xs x;
12.50/4.85	
12.50/4.85	filterM0 flg x ys = return (filterM00 x ys flg);
12.50/4.85	
12.50/4.85	filterM00 x ys True = x : ys;
12.50/4.85	filterM00 x ys False = ys;
12.50/4.85	
12.50/4.85	filterM1 p xs x flg = filterM p xs >>= filterM0 flg x;
12.50/4.85	
12.50/4.85	}
12.50/4.85	
12.50/4.85	----------------------------------------
12.50/4.85	
12.50/4.85	(5) BR (EQUIVALENT)
12.50/4.85	Replaced joker patterns by fresh variables and removed binding patterns.
12.50/4.85	----------------------------------------
12.50/4.85	
12.50/4.85	(6)
12.50/4.85	Obligation:
12.50/4.85	mainModule Main 
12.50/4.85	module Maybe where {
12.50/4.85	import qualified Main;
12.50/4.85	import qualified Monad;
12.50/4.85	import qualified Prelude;
12.50/4.85	}
12.50/4.85	module Main where {
12.50/4.85	import qualified Maybe;
12.50/4.85	import qualified Monad;
12.50/4.85	import qualified Prelude;
12.50/4.85	}
12.50/4.85	module Monad where {
12.50/4.85	import qualified Main;
12.50/4.85	import qualified Maybe;
12.50/4.85	import qualified Prelude;
12.50/4.85	filterM :: Monad b => (a  ->  b Bool)  ->  [a]  ->  b [a];
12.50/4.85	filterM vy [] = return [];
12.50/4.85	filterM p (x : xs) = p x >>= filterM1 p xs x;
12.50/4.85	
12.50/4.85	filterM0 flg x ys = return (filterM00 x ys flg);
12.50/4.85	
12.50/4.85	filterM00 x ys True = x : ys;
12.50/4.85	filterM00 x ys False = ys;
12.50/4.85	
12.50/4.85	filterM1 p xs x flg = filterM p xs >>= filterM0 flg x;
12.50/4.85	
12.50/4.85	}
12.50/4.85	
12.50/4.85	----------------------------------------
12.50/4.85	
12.50/4.85	(7) COR (EQUIVALENT)
12.50/4.85	Cond Reductions:
12.50/4.85	The following Function with conditions
12.50/4.85	"undefined |Falseundefined;
12.50/4.85	"
12.50/4.85	is transformed to
12.50/4.85	"undefined  = undefined1;
12.50/4.85	"
12.50/4.85	"undefined0 True = undefined;
12.50/4.85	"
12.50/4.85	"undefined1  = undefined0 False;
12.50/4.85	"
12.50/4.85	
12.50/4.85	----------------------------------------
12.50/4.85	
12.50/4.85	(8)
12.50/4.85	Obligation:
12.50/4.85	mainModule Main 
12.50/4.85	module Maybe where {
12.50/4.85	import qualified Main;
12.50/4.85	import qualified Monad;
12.50/4.85	import qualified Prelude;
12.50/4.85	}
12.50/4.85	module Main where {
12.50/4.85	import qualified Maybe;
12.50/4.85	import qualified Monad;
12.50/4.85	import qualified Prelude;
12.50/4.85	}
12.50/4.85	module Monad where {
12.50/4.85	import qualified Main;
12.50/4.85	import qualified Maybe;
12.50/4.85	import qualified Prelude;
12.50/4.85	filterM :: Monad b => (a  ->  b Bool)  ->  [a]  ->  b [a];
12.50/4.85	filterM vy [] = return [];
12.50/4.85	filterM p (x : xs) = p x >>= filterM1 p xs x;
12.50/4.85	
12.50/4.85	filterM0 flg x ys = return (filterM00 x ys flg);
12.50/4.85	
12.50/4.85	filterM00 x ys True = x : ys;
12.50/4.85	filterM00 x ys False = ys;
12.50/4.85	
12.50/4.85	filterM1 p xs x flg = filterM p xs >>= filterM0 flg x;
12.50/4.85	
12.50/4.85	}
12.50/4.85	
12.50/4.85	----------------------------------------
12.50/4.85	
12.50/4.85	(9) Narrow (SOUND)
12.50/4.85	Haskell To QDPs
12.50/4.85	
12.50/4.85	digraph dp_graph {
12.50/4.85	node [outthreshold=100, inthreshold=100];1[label="Monad.filterM",fontsize=16,color="grey",shape="box"];1 -> 3[label="",style="dashed", color="grey", weight=3];
12.50/4.85	3[label="Monad.filterM vz3",fontsize=16,color="grey",shape="box"];3 -> 4[label="",style="dashed", color="grey", weight=3];
12.50/4.85	4[label="Monad.filterM vz3 vz4",fontsize=16,color="burlywood",shape="triangle"];62[label="vz4/vz40 : vz41",fontsize=10,color="white",style="solid",shape="box"];4 -> 62[label="",style="solid", color="burlywood", weight=9];
12.50/4.85	62 -> 5[label="",style="solid", color="burlywood", weight=3];
12.50/4.85	63[label="vz4/[]",fontsize=10,color="white",style="solid",shape="box"];4 -> 63[label="",style="solid", color="burlywood", weight=9];
12.50/4.85	63 -> 6[label="",style="solid", color="burlywood", weight=3];
12.50/4.85	5[label="Monad.filterM vz3 (vz40 : vz41)",fontsize=16,color="black",shape="box"];5 -> 7[label="",style="solid", color="black", weight=3];
12.50/4.85	6[label="Monad.filterM vz3 []",fontsize=16,color="black",shape="box"];6 -> 8[label="",style="solid", color="black", weight=3];
12.50/4.85	7 -> 9[label="",style="dashed", color="red", weight=0];
12.50/4.85	7[label="vz3 vz40 >>= Monad.filterM1 vz3 vz41 vz40",fontsize=16,color="magenta"];7 -> 10[label="",style="dashed", color="magenta", weight=3];
12.50/4.85	8 -> 56[label="",style="dashed", color="red", weight=0];
12.50/4.85	8[label="return []",fontsize=16,color="magenta"];8 -> 57[label="",style="dashed", color="magenta", weight=3];
12.50/4.85	10[label="vz3 vz40",fontsize=16,color="green",shape="box"];10 -> 15[label="",style="dashed", color="green", weight=3];
12.50/4.85	9[label="vz5 >>= Monad.filterM1 vz3 vz41 vz40",fontsize=16,color="burlywood",shape="triangle"];64[label="vz5/vz50 : vz51",fontsize=10,color="white",style="solid",shape="box"];9 -> 64[label="",style="solid", color="burlywood", weight=9];
12.50/4.85	64 -> 13[label="",style="solid", color="burlywood", weight=3];
12.50/4.85	65[label="vz5/[]",fontsize=10,color="white",style="solid",shape="box"];9 -> 65[label="",style="solid", color="burlywood", weight=9];
12.50/4.85	65 -> 14[label="",style="solid", color="burlywood", weight=3];
12.50/4.85	57[label="[]",fontsize=16,color="green",shape="box"];56[label="return vz9",fontsize=16,color="black",shape="triangle"];56 -> 59[label="",style="solid", color="black", weight=3];
12.50/4.85	15[label="vz40",fontsize=16,color="green",shape="box"];13[label="vz50 : vz51 >>= Monad.filterM1 vz3 vz41 vz40",fontsize=16,color="black",shape="box"];13 -> 16[label="",style="solid", color="black", weight=3];
12.50/4.85	14[label="[] >>= Monad.filterM1 vz3 vz41 vz40",fontsize=16,color="black",shape="box"];14 -> 17[label="",style="solid", color="black", weight=3];
12.50/4.85	59[label="vz9 : []",fontsize=16,color="green",shape="box"];16 -> 18[label="",style="dashed", color="red", weight=0];
12.50/4.85	16[label="Monad.filterM1 vz3 vz41 vz40 vz50 ++ (vz51 >>= Monad.filterM1 vz3 vz41 vz40)",fontsize=16,color="magenta"];16 -> 19[label="",style="dashed", color="magenta", weight=3];
12.50/4.85	17[label="[]",fontsize=16,color="green",shape="box"];19 -> 9[label="",style="dashed", color="red", weight=0];
12.50/4.85	19[label="vz51 >>= Monad.filterM1 vz3 vz41 vz40",fontsize=16,color="magenta"];19 -> 20[label="",style="dashed", color="magenta", weight=3];
12.50/4.85	18[label="Monad.filterM1 vz3 vz41 vz40 vz50 ++ vz6",fontsize=16,color="black",shape="triangle"];18 -> 21[label="",style="solid", color="black", weight=3];
12.50/4.85	20[label="vz51",fontsize=16,color="green",shape="box"];21 -> 22[label="",style="dashed", color="red", weight=0];
12.50/4.85	21[label="(Monad.filterM vz3 vz41 >>= Monad.filterM0 vz50 vz40) ++ vz6",fontsize=16,color="magenta"];21 -> 23[label="",style="dashed", color="magenta", weight=3];
12.50/4.85	23 -> 4[label="",style="dashed", color="red", weight=0];
12.50/4.85	23[label="Monad.filterM vz3 vz41",fontsize=16,color="magenta"];23 -> 24[label="",style="dashed", color="magenta", weight=3];
12.50/4.85	22[label="(vz7 >>= Monad.filterM0 vz50 vz40) ++ vz6",fontsize=16,color="burlywood",shape="triangle"];66[label="vz7/vz70 : vz71",fontsize=10,color="white",style="solid",shape="box"];22 -> 66[label="",style="solid", color="burlywood", weight=9];
12.50/4.85	66 -> 25[label="",style="solid", color="burlywood", weight=3];
12.50/4.85	67[label="vz7/[]",fontsize=10,color="white",style="solid",shape="box"];22 -> 67[label="",style="solid", color="burlywood", weight=9];
12.50/4.85	67 -> 26[label="",style="solid", color="burlywood", weight=3];
12.50/4.85	24[label="vz41",fontsize=16,color="green",shape="box"];25[label="(vz70 : vz71 >>= Monad.filterM0 vz50 vz40) ++ vz6",fontsize=16,color="black",shape="box"];25 -> 27[label="",style="solid", color="black", weight=3];
12.50/4.85	26[label="([] >>= Monad.filterM0 vz50 vz40) ++ vz6",fontsize=16,color="black",shape="box"];26 -> 28[label="",style="solid", color="black", weight=3];
12.50/4.85	27[label="(Monad.filterM0 vz50 vz40 vz70 ++ (vz71 >>= Monad.filterM0 vz50 vz40)) ++ vz6",fontsize=16,color="black",shape="box"];27 -> 29[label="",style="solid", color="black", weight=3];
12.50/4.85	28[label="[] ++ vz6",fontsize=16,color="black",shape="triangle"];28 -> 30[label="",style="solid", color="black", weight=3];
12.50/4.85	29[label="(return (Monad.filterM00 vz40 vz70 vz50) ++ (vz71 >>= Monad.filterM0 vz50 vz40)) ++ vz6",fontsize=16,color="black",shape="box"];29 -> 31[label="",style="solid", color="black", weight=3];
12.50/4.85	30[label="vz6",fontsize=16,color="green",shape="box"];31[label="((Monad.filterM00 vz40 vz70 vz50 : []) ++ (vz71 >>= Monad.filterM0 vz50 vz40)) ++ vz6",fontsize=16,color="black",shape="box"];31 -> 32[label="",style="solid", color="black", weight=3];
12.50/4.85	32 -> 33[label="",style="dashed", color="red", weight=0];
12.50/4.85	32[label="(Monad.filterM00 vz40 vz70 vz50 : [] ++ (vz71 >>= Monad.filterM0 vz50 vz40)) ++ vz6",fontsize=16,color="magenta"];32 -> 34[label="",style="dashed", color="magenta", weight=3];
12.50/4.85	34 -> 28[label="",style="dashed", color="red", weight=0];
12.50/4.85	34[label="[] ++ (vz71 >>= Monad.filterM0 vz50 vz40)",fontsize=16,color="magenta"];34 -> 35[label="",style="dashed", color="magenta", weight=3];
12.50/4.85	33[label="(Monad.filterM00 vz40 vz70 vz50 : vz8) ++ vz6",fontsize=16,color="black",shape="triangle"];33 -> 36[label="",style="solid", color="black", weight=3];
12.50/4.85	35[label="vz71 >>= Monad.filterM0 vz50 vz40",fontsize=16,color="burlywood",shape="triangle"];68[label="vz71/vz710 : vz711",fontsize=10,color="white",style="solid",shape="box"];35 -> 68[label="",style="solid", color="burlywood", weight=9];
12.50/4.85	68 -> 37[label="",style="solid", color="burlywood", weight=3];
12.50/4.85	69[label="vz71/[]",fontsize=10,color="white",style="solid",shape="box"];35 -> 69[label="",style="solid", color="burlywood", weight=9];
12.50/4.85	69 -> 38[label="",style="solid", color="burlywood", weight=3];
12.50/4.85	36[label="Monad.filterM00 vz40 vz70 vz50 : vz8 ++ vz6",fontsize=16,color="green",shape="box"];36 -> 39[label="",style="dashed", color="green", weight=3];
12.50/4.85	36 -> 40[label="",style="dashed", color="green", weight=3];
12.50/4.85	37[label="vz710 : vz711 >>= Monad.filterM0 vz50 vz40",fontsize=16,color="black",shape="box"];37 -> 41[label="",style="solid", color="black", weight=3];
12.50/4.85	38[label="[] >>= Monad.filterM0 vz50 vz40",fontsize=16,color="black",shape="box"];38 -> 42[label="",style="solid", color="black", weight=3];
12.50/4.85	39[label="Monad.filterM00 vz40 vz70 vz50",fontsize=16,color="burlywood",shape="triangle"];70[label="vz50/False",fontsize=10,color="white",style="solid",shape="box"];39 -> 70[label="",style="solid", color="burlywood", weight=9];
12.50/4.85	70 -> 43[label="",style="solid", color="burlywood", weight=3];
12.50/4.85	71[label="vz50/True",fontsize=10,color="white",style="solid",shape="box"];39 -> 71[label="",style="solid", color="burlywood", weight=9];
12.50/4.85	71 -> 44[label="",style="solid", color="burlywood", weight=3];
12.50/4.85	40[label="vz8 ++ vz6",fontsize=16,color="burlywood",shape="triangle"];72[label="vz8/vz80 : vz81",fontsize=10,color="white",style="solid",shape="box"];40 -> 72[label="",style="solid", color="burlywood", weight=9];
12.50/4.85	72 -> 45[label="",style="solid", color="burlywood", weight=3];
12.50/4.85	73[label="vz8/[]",fontsize=10,color="white",style="solid",shape="box"];40 -> 73[label="",style="solid", color="burlywood", weight=9];
12.50/4.85	73 -> 46[label="",style="solid", color="burlywood", weight=3];
12.50/4.85	41 -> 40[label="",style="dashed", color="red", weight=0];
12.50/4.85	41[label="Monad.filterM0 vz50 vz40 vz710 ++ (vz711 >>= Monad.filterM0 vz50 vz40)",fontsize=16,color="magenta"];41 -> 47[label="",style="dashed", color="magenta", weight=3];
12.50/4.85	41 -> 48[label="",style="dashed", color="magenta", weight=3];
12.50/4.85	42[label="[]",fontsize=16,color="green",shape="box"];43[label="Monad.filterM00 vz40 vz70 False",fontsize=16,color="black",shape="box"];43 -> 49[label="",style="solid", color="black", weight=3];
12.50/4.85	44[label="Monad.filterM00 vz40 vz70 True",fontsize=16,color="black",shape="box"];44 -> 50[label="",style="solid", color="black", weight=3];
12.50/4.85	45[label="(vz80 : vz81) ++ vz6",fontsize=16,color="black",shape="box"];45 -> 51[label="",style="solid", color="black", weight=3];
12.50/4.85	46[label="[] ++ vz6",fontsize=16,color="black",shape="box"];46 -> 52[label="",style="solid", color="black", weight=3];
12.50/4.85	47 -> 35[label="",style="dashed", color="red", weight=0];
12.50/4.85	47[label="vz711 >>= Monad.filterM0 vz50 vz40",fontsize=16,color="magenta"];47 -> 53[label="",style="dashed", color="magenta", weight=3];
12.50/4.85	48[label="Monad.filterM0 vz50 vz40 vz710",fontsize=16,color="black",shape="box"];48 -> 54[label="",style="solid", color="black", weight=3];
12.50/4.85	49[label="vz70",fontsize=16,color="green",shape="box"];50[label="vz40 : vz70",fontsize=16,color="green",shape="box"];51[label="vz80 : vz81 ++ vz6",fontsize=16,color="green",shape="box"];51 -> 55[label="",style="dashed", color="green", weight=3];
12.50/4.85	52[label="vz6",fontsize=16,color="green",shape="box"];53[label="vz711",fontsize=16,color="green",shape="box"];54 -> 56[label="",style="dashed", color="red", weight=0];
12.50/4.85	54[label="return (Monad.filterM00 vz40 vz710 vz50)",fontsize=16,color="magenta"];54 -> 58[label="",style="dashed", color="magenta", weight=3];
12.50/4.85	55 -> 40[label="",style="dashed", color="red", weight=0];
12.50/4.85	55[label="vz81 ++ vz6",fontsize=16,color="magenta"];55 -> 60[label="",style="dashed", color="magenta", weight=3];
12.50/4.85	58 -> 39[label="",style="dashed", color="red", weight=0];
12.50/4.85	58[label="Monad.filterM00 vz40 vz710 vz50",fontsize=16,color="magenta"];58 -> 61[label="",style="dashed", color="magenta", weight=3];
12.50/4.85	60[label="vz81",fontsize=16,color="green",shape="box"];61[label="vz710",fontsize=16,color="green",shape="box"];}
12.50/4.85	
12.50/4.85	----------------------------------------
12.50/4.85	
12.50/4.85	(10)
12.50/4.85	Complex Obligation (AND)
12.50/4.85	
12.50/4.85	----------------------------------------
12.50/4.85	
12.50/4.85	(11)
12.50/4.85	Obligation:
12.50/4.85	Q DP problem:
12.50/4.85	The TRS P consists of the following rules:
12.50/4.85	
12.50/4.85	   new_psPs0(vz3, vz41, vz40, h) -> new_filterM(vz3, vz41, h)
12.50/4.85	   new_gtGtEs0(vz3, vz41, vz40, h) -> new_psPs0(vz3, vz41, vz40, h)
12.50/4.85	   new_filterM(vz3, :(vz40, vz41), h) -> new_gtGtEs0(vz3, vz41, vz40, h)
12.50/4.85	   new_gtGtEs0(vz3, vz41, vz40, h) -> new_gtGtEs0(vz3, vz41, vz40, h)
12.50/4.85	
12.50/4.85	The TRS R consists of the following rules:
12.50/4.85	
12.50/4.85	   new_psPs3(vz3, vz41, vz40, vz50, vz6, h) -> new_psPs4(new_filterM0(vz3, vz41, h), vz50, vz40, vz6, h)
12.50/4.85	   new_gtGtEs2([], vz50, vz40, h) -> []
12.50/4.85	   new_gtGtEs1(:(vz50, vz51), vz3, vz41, vz40, h) -> new_psPs3(vz3, vz41, vz40, vz50, new_gtGtEs1(vz51, vz3, vz41, vz40, h), h)
12.50/4.85	   new_filterM00(vz40, vz70, False, h) -> vz70
12.50/4.85	   new_psPs4([], vz50, vz40, vz6, h) -> new_psPs5(vz6, h)
12.50/4.85	   new_gtGtEs1([], vz3, vz41, vz40, h) -> []
12.50/4.85	   new_return(vz9, h) -> :(vz9, [])
12.50/4.85	   new_psPs2([], vz6, h) -> vz6
12.50/4.85	   new_gtGtEs2(:(vz710, vz711), vz50, vz40, h) -> new_psPs2(new_return(new_filterM00(vz40, vz710, vz50, h), h), new_gtGtEs2(vz711, vz50, vz40, h), h)
12.50/4.85	   new_psPs2(:(vz80, vz81), vz6, h) -> :(vz80, new_psPs2(vz81, vz6, h))
12.50/4.85	   new_psPs1(vz40, vz70, vz50, vz8, vz6, h) -> :(new_filterM00(vz40, vz70, vz50, h), new_psPs2(vz8, vz6, h))
12.50/4.85	   new_psPs5(vz6, h) -> vz6
12.50/4.85	   new_psPs4(:(vz70, vz71), vz50, vz40, vz6, h) -> new_psPs1(vz40, vz70, vz50, new_psPs5(new_gtGtEs2(vz71, vz50, vz40, h), h), vz6, h)
12.50/4.85	   new_filterM00(vz40, vz70, True, h) -> :(vz40, vz70)
12.50/4.85	
12.50/4.85	The set Q consists of the following terms:
12.50/4.85	
12.50/4.85	   new_filterM00(x0, x1, False, x2)
12.50/4.85	   new_filterM00(x0, x1, True, x2)
12.50/4.85	   new_return(x0, x1)
12.50/4.85	   new_gtGtEs1([], x0, x1, x2, x3)
12.50/4.85	   new_psPs2([], x0, x1)
12.50/4.85	   new_psPs4(:(x0, x1), x2, x3, x4, x5)
12.50/4.85	   new_psPs4([], x0, x1, x2, x3)
12.50/4.85	   new_psPs1(x0, x1, x2, x3, x4, x5)
12.50/4.85	   new_gtGtEs2(:(x0, x1), x2, x3, x4)
12.50/4.85	   new_psPs3(x0, x1, x2, x3, x4, x5)
12.50/4.85	   new_gtGtEs2([], x0, x1, x2)
12.50/4.85	   new_psPs2(:(x0, x1), x2, x3)
12.50/4.85	   new_psPs5(x0, x1)
12.50/4.85	   new_gtGtEs1(:(x0, x1), x2, x3, x4, x5)
12.50/4.85	
12.50/4.85	We have to consider all minimal (P,Q,R)-chains.
12.50/4.85	----------------------------------------
12.50/4.85	
12.50/4.85	(12) QDPOrderProof (EQUIVALENT)
12.50/4.85	We use the reduction pair processor [LPAR04,JAR06].
12.50/4.85	
12.50/4.85	
12.50/4.85	The following pairs can be oriented strictly and are deleted.
12.50/4.85	
12.50/4.85	   new_gtGtEs0(vz3, vz41, vz40, h) -> new_psPs0(vz3, vz41, vz40, h)
12.50/4.85	The remaining pairs can at least be oriented weakly.
12.50/4.85	Used ordering:  Polynomial interpretation [POLO]:
12.50/4.85	
12.50/4.85	   POL(:(x_1, x_2)) = 1 + x_1 + x_2
12.50/4.85	   POL(new_filterM(x_1, x_2, x_3)) = x_2
12.50/4.85	   POL(new_gtGtEs0(x_1, x_2, x_3, x_4)) = 1 + x_2
12.50/4.85	   POL(new_psPs0(x_1, x_2, x_3, x_4)) = x_2
12.50/4.85	
12.50/4.85	The following usable rules [FROCOS05] with respect to the argument filtering of the ordering [JAR06] were oriented:
12.50/4.85	none
12.50/4.85	
12.50/4.85	
12.50/4.85	----------------------------------------
12.50/4.85	
12.50/4.85	(13)
12.50/4.85	Obligation:
12.50/4.85	Q DP problem:
12.50/4.85	The TRS P consists of the following rules:
12.50/4.85	
12.50/4.85	   new_psPs0(vz3, vz41, vz40, h) -> new_filterM(vz3, vz41, h)
12.50/4.85	   new_filterM(vz3, :(vz40, vz41), h) -> new_gtGtEs0(vz3, vz41, vz40, h)
12.50/4.85	   new_gtGtEs0(vz3, vz41, vz40, h) -> new_gtGtEs0(vz3, vz41, vz40, h)
12.50/4.85	
12.50/4.85	The TRS R consists of the following rules:
12.50/4.85	
12.50/4.85	   new_psPs3(vz3, vz41, vz40, vz50, vz6, h) -> new_psPs4(new_filterM0(vz3, vz41, h), vz50, vz40, vz6, h)
12.50/4.85	   new_gtGtEs2([], vz50, vz40, h) -> []
12.50/4.85	   new_gtGtEs1(:(vz50, vz51), vz3, vz41, vz40, h) -> new_psPs3(vz3, vz41, vz40, vz50, new_gtGtEs1(vz51, vz3, vz41, vz40, h), h)
12.50/4.85	   new_filterM00(vz40, vz70, False, h) -> vz70
12.50/4.85	   new_psPs4([], vz50, vz40, vz6, h) -> new_psPs5(vz6, h)
12.50/4.85	   new_gtGtEs1([], vz3, vz41, vz40, h) -> []
12.50/4.85	   new_return(vz9, h) -> :(vz9, [])
12.50/4.85	   new_psPs2([], vz6, h) -> vz6
12.50/4.85	   new_gtGtEs2(:(vz710, vz711), vz50, vz40, h) -> new_psPs2(new_return(new_filterM00(vz40, vz710, vz50, h), h), new_gtGtEs2(vz711, vz50, vz40, h), h)
12.50/4.85	   new_psPs2(:(vz80, vz81), vz6, h) -> :(vz80, new_psPs2(vz81, vz6, h))
12.50/4.85	   new_psPs1(vz40, vz70, vz50, vz8, vz6, h) -> :(new_filterM00(vz40, vz70, vz50, h), new_psPs2(vz8, vz6, h))
12.50/4.85	   new_psPs5(vz6, h) -> vz6
12.50/4.85	   new_psPs4(:(vz70, vz71), vz50, vz40, vz6, h) -> new_psPs1(vz40, vz70, vz50, new_psPs5(new_gtGtEs2(vz71, vz50, vz40, h), h), vz6, h)
12.50/4.85	   new_filterM00(vz40, vz70, True, h) -> :(vz40, vz70)
12.50/4.85	
12.50/4.85	The set Q consists of the following terms:
12.50/4.85	
12.50/4.85	   new_filterM00(x0, x1, False, x2)
12.50/4.85	   new_filterM00(x0, x1, True, x2)
12.50/4.85	   new_return(x0, x1)
12.50/4.85	   new_gtGtEs1([], x0, x1, x2, x3)
12.50/4.85	   new_psPs2([], x0, x1)
12.50/4.85	   new_psPs4(:(x0, x1), x2, x3, x4, x5)
12.50/4.85	   new_psPs4([], x0, x1, x2, x3)
12.50/4.85	   new_psPs1(x0, x1, x2, x3, x4, x5)
12.50/4.85	   new_gtGtEs2(:(x0, x1), x2, x3, x4)
12.50/4.85	   new_psPs3(x0, x1, x2, x3, x4, x5)
12.50/4.85	   new_gtGtEs2([], x0, x1, x2)
12.50/4.85	   new_psPs2(:(x0, x1), x2, x3)
12.50/4.85	   new_psPs5(x0, x1)
12.50/4.85	   new_gtGtEs1(:(x0, x1), x2, x3, x4, x5)
12.50/4.85	
12.50/4.85	We have to consider all minimal (P,Q,R)-chains.
12.50/4.85	----------------------------------------
12.50/4.85	
12.50/4.85	(14) DependencyGraphProof (EQUIVALENT)
12.50/4.85	The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 1 SCC with 2 less nodes.
12.50/4.85	----------------------------------------
12.50/4.85	
12.50/4.85	(15)
12.50/4.85	Obligation:
12.50/4.85	Q DP problem:
12.50/4.85	The TRS P consists of the following rules:
12.50/4.85	
12.50/4.85	   new_gtGtEs0(vz3, vz41, vz40, h) -> new_gtGtEs0(vz3, vz41, vz40, h)
12.50/4.85	
12.50/4.85	The TRS R consists of the following rules:
12.50/4.85	
12.50/4.85	   new_psPs3(vz3, vz41, vz40, vz50, vz6, h) -> new_psPs4(new_filterM0(vz3, vz41, h), vz50, vz40, vz6, h)
12.50/4.85	   new_gtGtEs2([], vz50, vz40, h) -> []
12.50/4.85	   new_gtGtEs1(:(vz50, vz51), vz3, vz41, vz40, h) -> new_psPs3(vz3, vz41, vz40, vz50, new_gtGtEs1(vz51, vz3, vz41, vz40, h), h)
12.50/4.85	   new_filterM00(vz40, vz70, False, h) -> vz70
12.50/4.85	   new_psPs4([], vz50, vz40, vz6, h) -> new_psPs5(vz6, h)
12.50/4.85	   new_gtGtEs1([], vz3, vz41, vz40, h) -> []
12.50/4.85	   new_return(vz9, h) -> :(vz9, [])
12.50/4.85	   new_psPs2([], vz6, h) -> vz6
12.50/4.85	   new_gtGtEs2(:(vz710, vz711), vz50, vz40, h) -> new_psPs2(new_return(new_filterM00(vz40, vz710, vz50, h), h), new_gtGtEs2(vz711, vz50, vz40, h), h)
12.50/4.85	   new_psPs2(:(vz80, vz81), vz6, h) -> :(vz80, new_psPs2(vz81, vz6, h))
12.50/4.85	   new_psPs1(vz40, vz70, vz50, vz8, vz6, h) -> :(new_filterM00(vz40, vz70, vz50, h), new_psPs2(vz8, vz6, h))
12.50/4.85	   new_psPs5(vz6, h) -> vz6
12.50/4.85	   new_psPs4(:(vz70, vz71), vz50, vz40, vz6, h) -> new_psPs1(vz40, vz70, vz50, new_psPs5(new_gtGtEs2(vz71, vz50, vz40, h), h), vz6, h)
12.50/4.85	   new_filterM00(vz40, vz70, True, h) -> :(vz40, vz70)
12.50/4.85	
12.50/4.85	The set Q consists of the following terms:
12.50/4.85	
12.50/4.85	   new_filterM00(x0, x1, False, x2)
12.50/4.85	   new_filterM00(x0, x1, True, x2)
12.50/4.85	   new_return(x0, x1)
12.50/4.85	   new_gtGtEs1([], x0, x1, x2, x3)
12.50/4.85	   new_psPs2([], x0, x1)
12.50/4.85	   new_psPs4(:(x0, x1), x2, x3, x4, x5)
12.50/4.85	   new_psPs4([], x0, x1, x2, x3)
12.50/4.85	   new_psPs1(x0, x1, x2, x3, x4, x5)
12.50/4.85	   new_gtGtEs2(:(x0, x1), x2, x3, x4)
12.50/4.85	   new_psPs3(x0, x1, x2, x3, x4, x5)
12.50/4.85	   new_gtGtEs2([], x0, x1, x2)
12.50/4.85	   new_psPs2(:(x0, x1), x2, x3)
12.50/4.85	   new_psPs5(x0, x1)
12.50/4.85	   new_gtGtEs1(:(x0, x1), x2, x3, x4, x5)
12.50/4.85	
12.50/4.85	We have to consider all minimal (P,Q,R)-chains.
12.50/4.85	----------------------------------------
12.50/4.85	
12.50/4.85	(16) MNOCProof (EQUIVALENT)
12.50/4.85	We use the modular non-overlap check [FROCOS05] to decrease Q to the empty set.
12.50/4.85	----------------------------------------
12.50/4.85	
12.50/4.85	(17)
12.50/4.85	Obligation:
12.50/4.85	Q DP problem:
12.50/4.85	The TRS P consists of the following rules:
12.50/4.85	
12.50/4.85	   new_gtGtEs0(vz3, vz41, vz40, h) -> new_gtGtEs0(vz3, vz41, vz40, h)
12.50/4.85	
12.50/4.85	The TRS R consists of the following rules:
12.50/4.85	
12.50/4.85	   new_psPs3(vz3, vz41, vz40, vz50, vz6, h) -> new_psPs4(new_filterM0(vz3, vz41, h), vz50, vz40, vz6, h)
12.50/4.85	   new_gtGtEs2([], vz50, vz40, h) -> []
12.50/4.85	   new_gtGtEs1(:(vz50, vz51), vz3, vz41, vz40, h) -> new_psPs3(vz3, vz41, vz40, vz50, new_gtGtEs1(vz51, vz3, vz41, vz40, h), h)
12.50/4.85	   new_filterM00(vz40, vz70, False, h) -> vz70
12.50/4.85	   new_psPs4([], vz50, vz40, vz6, h) -> new_psPs5(vz6, h)
12.50/4.85	   new_gtGtEs1([], vz3, vz41, vz40, h) -> []
12.50/4.85	   new_return(vz9, h) -> :(vz9, [])
12.50/4.85	   new_psPs2([], vz6, h) -> vz6
12.50/4.85	   new_gtGtEs2(:(vz710, vz711), vz50, vz40, h) -> new_psPs2(new_return(new_filterM00(vz40, vz710, vz50, h), h), new_gtGtEs2(vz711, vz50, vz40, h), h)
12.50/4.85	   new_psPs2(:(vz80, vz81), vz6, h) -> :(vz80, new_psPs2(vz81, vz6, h))
12.50/4.85	   new_psPs1(vz40, vz70, vz50, vz8, vz6, h) -> :(new_filterM00(vz40, vz70, vz50, h), new_psPs2(vz8, vz6, h))
12.50/4.85	   new_psPs5(vz6, h) -> vz6
12.50/4.85	   new_psPs4(:(vz70, vz71), vz50, vz40, vz6, h) -> new_psPs1(vz40, vz70, vz50, new_psPs5(new_gtGtEs2(vz71, vz50, vz40, h), h), vz6, h)
12.50/4.85	   new_filterM00(vz40, vz70, True, h) -> :(vz40, vz70)
12.50/4.85	
12.50/4.85	Q is empty.
12.50/4.85	We have to consider all (P,Q,R)-chains.
12.50/4.85	----------------------------------------
12.50/4.85	
12.50/4.85	(18) NonTerminationLoopProof (COMPLETE)
12.50/4.85	We used the non-termination processor [FROCOS05] to show that the DP problem is infinite.
12.50/4.85	Found a loop by semiunifying a rule from P directly.
12.50/4.85	
12.50/4.85	s = new_gtGtEs0(vz3, vz41, vz40, h) evaluates to  t =new_gtGtEs0(vz3, vz41, vz40, h)
12.50/4.85	
12.50/4.85	Thus s starts an infinite chain as s semiunifies with t with the following substitutions:
12.50/4.85	* Matcher: [ ]
12.50/4.85	* Semiunifier: [ ]
12.50/4.85	
12.50/4.85	--------------------------------------------------------------------------------
12.50/4.85	Rewriting sequence
12.50/4.85	
12.50/4.85	The DP semiunifies directly so there is only one rewrite step from new_gtGtEs0(vz3, vz41, vz40, h) to new_gtGtEs0(vz3, vz41, vz40, h).
12.50/4.85	
12.50/4.85	
12.50/4.85	
12.50/4.85	
12.50/4.85	----------------------------------------
12.50/4.85	
12.50/4.85	(19)
12.50/4.85	NO
12.50/4.85	
12.50/4.85	----------------------------------------
12.50/4.85	
12.50/4.85	(20)
12.50/4.85	Obligation:
12.50/4.85	Q DP problem:
12.50/4.85	The TRS P consists of the following rules:
12.50/4.85	
12.50/4.85	   new_gtGtEs(:(vz710, vz711), vz50, vz40, h) -> new_gtGtEs(vz711, vz50, vz40, h)
12.50/4.85	
12.50/4.85	R is empty.
12.50/4.85	Q is empty.
12.50/4.85	We have to consider all minimal (P,Q,R)-chains.
12.50/4.85	----------------------------------------
12.50/4.85	
12.50/4.85	(21) QDPSizeChangeProof (EQUIVALENT)
12.50/4.85	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. 
12.50/4.85	
12.50/4.85	From the DPs we obtained the following set of size-change graphs:
12.50/4.85	*new_gtGtEs(:(vz710, vz711), vz50, vz40, h) -> new_gtGtEs(vz711, vz50, vz40, h)
12.50/4.85	The graph contains the following edges 1 > 1, 2 >= 2, 3 >= 3, 4 >= 4
12.50/4.85	
12.50/4.85	
12.50/4.85	----------------------------------------
12.50/4.85	
12.50/4.85	(22)
12.50/4.85	YES
12.50/4.85	
12.50/4.85	----------------------------------------
12.50/4.85	
12.50/4.85	(23)
12.50/4.85	Obligation:
12.50/4.85	Q DP problem:
12.50/4.85	The TRS P consists of the following rules:
12.50/4.85	
12.50/4.85	   new_psPs(:(vz80, vz81), vz6, h) -> new_psPs(vz81, vz6, h)
12.50/4.85	
12.50/4.85	R is empty.
12.50/4.85	Q is empty.
12.50/4.85	We have to consider all minimal (P,Q,R)-chains.
12.50/4.85	----------------------------------------
12.50/4.85	
12.50/4.85	(24) QDPSizeChangeProof (EQUIVALENT)
12.50/4.85	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. 
12.50/4.85	
12.50/4.85	From the DPs we obtained the following set of size-change graphs:
12.50/4.85	*new_psPs(:(vz80, vz81), vz6, h) -> new_psPs(vz81, vz6, h)
12.50/4.85	The graph contains the following edges 1 > 1, 2 >= 2, 3 >= 3
12.50/4.85	
12.50/4.85	
12.50/4.85	----------------------------------------
12.50/4.85	
12.50/4.85	(25)
12.50/4.85	YES
12.50/4.85	
12.50/4.85	----------------------------------------
12.50/4.85	
12.50/4.85	(26) Narrow (COMPLETE)
12.50/4.85	Haskell To QDPs
12.50/4.85	
12.50/4.85	digraph dp_graph {
12.50/4.85	node [outthreshold=100, inthreshold=100];1[label="Monad.filterM",fontsize=16,color="grey",shape="box"];1 -> 3[label="",style="dashed", color="grey", weight=3];
12.50/4.85	3[label="Monad.filterM vz3",fontsize=16,color="grey",shape="box"];3 -> 4[label="",style="dashed", color="grey", weight=3];
12.50/4.85	4[label="Monad.filterM vz3 vz4",fontsize=16,color="burlywood",shape="triangle"];62[label="vz4/vz40 : vz41",fontsize=10,color="white",style="solid",shape="box"];4 -> 62[label="",style="solid", color="burlywood", weight=9];
12.50/4.85	62 -> 5[label="",style="solid", color="burlywood", weight=3];
12.50/4.85	63[label="vz4/[]",fontsize=10,color="white",style="solid",shape="box"];4 -> 63[label="",style="solid", color="burlywood", weight=9];
12.50/4.85	63 -> 6[label="",style="solid", color="burlywood", weight=3];
12.50/4.85	5[label="Monad.filterM vz3 (vz40 : vz41)",fontsize=16,color="black",shape="box"];5 -> 7[label="",style="solid", color="black", weight=3];
12.50/4.85	6[label="Monad.filterM vz3 []",fontsize=16,color="black",shape="box"];6 -> 8[label="",style="solid", color="black", weight=3];
12.50/4.85	7 -> 9[label="",style="dashed", color="red", weight=0];
12.50/4.85	7[label="vz3 vz40 >>= Monad.filterM1 vz3 vz41 vz40",fontsize=16,color="magenta"];7 -> 10[label="",style="dashed", color="magenta", weight=3];
12.50/4.85	8 -> 56[label="",style="dashed", color="red", weight=0];
12.50/4.85	8[label="return []",fontsize=16,color="magenta"];8 -> 57[label="",style="dashed", color="magenta", weight=3];
12.50/4.85	10[label="vz3 vz40",fontsize=16,color="green",shape="box"];10 -> 15[label="",style="dashed", color="green", weight=3];
12.50/4.85	9[label="vz5 >>= Monad.filterM1 vz3 vz41 vz40",fontsize=16,color="burlywood",shape="triangle"];64[label="vz5/vz50 : vz51",fontsize=10,color="white",style="solid",shape="box"];9 -> 64[label="",style="solid", color="burlywood", weight=9];
12.50/4.85	64 -> 13[label="",style="solid", color="burlywood", weight=3];
12.50/4.85	65[label="vz5/[]",fontsize=10,color="white",style="solid",shape="box"];9 -> 65[label="",style="solid", color="burlywood", weight=9];
12.50/4.85	65 -> 14[label="",style="solid", color="burlywood", weight=3];
12.50/4.85	57[label="[]",fontsize=16,color="green",shape="box"];56[label="return vz9",fontsize=16,color="black",shape="triangle"];56 -> 59[label="",style="solid", color="black", weight=3];
12.50/4.85	15[label="vz40",fontsize=16,color="green",shape="box"];13[label="vz50 : vz51 >>= Monad.filterM1 vz3 vz41 vz40",fontsize=16,color="black",shape="box"];13 -> 16[label="",style="solid", color="black", weight=3];
12.50/4.85	14[label="[] >>= Monad.filterM1 vz3 vz41 vz40",fontsize=16,color="black",shape="box"];14 -> 17[label="",style="solid", color="black", weight=3];
12.50/4.85	59[label="vz9 : []",fontsize=16,color="green",shape="box"];16 -> 18[label="",style="dashed", color="red", weight=0];
12.50/4.85	16[label="Monad.filterM1 vz3 vz41 vz40 vz50 ++ (vz51 >>= Monad.filterM1 vz3 vz41 vz40)",fontsize=16,color="magenta"];16 -> 19[label="",style="dashed", color="magenta", weight=3];
12.50/4.85	17[label="[]",fontsize=16,color="green",shape="box"];19 -> 9[label="",style="dashed", color="red", weight=0];
12.50/4.85	19[label="vz51 >>= Monad.filterM1 vz3 vz41 vz40",fontsize=16,color="magenta"];19 -> 20[label="",style="dashed", color="magenta", weight=3];
12.50/4.85	18[label="Monad.filterM1 vz3 vz41 vz40 vz50 ++ vz6",fontsize=16,color="black",shape="triangle"];18 -> 21[label="",style="solid", color="black", weight=3];
12.50/4.85	20[label="vz51",fontsize=16,color="green",shape="box"];21 -> 22[label="",style="dashed", color="red", weight=0];
12.50/4.85	21[label="(Monad.filterM vz3 vz41 >>= Monad.filterM0 vz50 vz40) ++ vz6",fontsize=16,color="magenta"];21 -> 23[label="",style="dashed", color="magenta", weight=3];
12.50/4.85	23 -> 4[label="",style="dashed", color="red", weight=0];
12.50/4.85	23[label="Monad.filterM vz3 vz41",fontsize=16,color="magenta"];23 -> 24[label="",style="dashed", color="magenta", weight=3];
12.50/4.85	22[label="(vz7 >>= Monad.filterM0 vz50 vz40) ++ vz6",fontsize=16,color="burlywood",shape="triangle"];66[label="vz7/vz70 : vz71",fontsize=10,color="white",style="solid",shape="box"];22 -> 66[label="",style="solid", color="burlywood", weight=9];
12.50/4.85	66 -> 25[label="",style="solid", color="burlywood", weight=3];
12.50/4.85	67[label="vz7/[]",fontsize=10,color="white",style="solid",shape="box"];22 -> 67[label="",style="solid", color="burlywood", weight=9];
12.50/4.85	67 -> 26[label="",style="solid", color="burlywood", weight=3];
12.50/4.85	24[label="vz41",fontsize=16,color="green",shape="box"];25[label="(vz70 : vz71 >>= Monad.filterM0 vz50 vz40) ++ vz6",fontsize=16,color="black",shape="box"];25 -> 27[label="",style="solid", color="black", weight=3];
12.50/4.85	26[label="([] >>= Monad.filterM0 vz50 vz40) ++ vz6",fontsize=16,color="black",shape="box"];26 -> 28[label="",style="solid", color="black", weight=3];
12.50/4.85	27[label="(Monad.filterM0 vz50 vz40 vz70 ++ (vz71 >>= Monad.filterM0 vz50 vz40)) ++ vz6",fontsize=16,color="black",shape="box"];27 -> 29[label="",style="solid", color="black", weight=3];
12.50/4.85	28[label="[] ++ vz6",fontsize=16,color="black",shape="triangle"];28 -> 30[label="",style="solid", color="black", weight=3];
12.50/4.86	29[label="(return (Monad.filterM00 vz40 vz70 vz50) ++ (vz71 >>= Monad.filterM0 vz50 vz40)) ++ vz6",fontsize=16,color="black",shape="box"];29 -> 31[label="",style="solid", color="black", weight=3];
12.50/4.86	30[label="vz6",fontsize=16,color="green",shape="box"];31[label="((Monad.filterM00 vz40 vz70 vz50 : []) ++ (vz71 >>= Monad.filterM0 vz50 vz40)) ++ vz6",fontsize=16,color="black",shape="box"];31 -> 32[label="",style="solid", color="black", weight=3];
12.50/4.86	32 -> 33[label="",style="dashed", color="red", weight=0];
12.50/4.86	32[label="(Monad.filterM00 vz40 vz70 vz50 : [] ++ (vz71 >>= Monad.filterM0 vz50 vz40)) ++ vz6",fontsize=16,color="magenta"];32 -> 34[label="",style="dashed", color="magenta", weight=3];
12.50/4.86	34 -> 28[label="",style="dashed", color="red", weight=0];
12.50/4.86	34[label="[] ++ (vz71 >>= Monad.filterM0 vz50 vz40)",fontsize=16,color="magenta"];34 -> 35[label="",style="dashed", color="magenta", weight=3];
12.50/4.86	33[label="(Monad.filterM00 vz40 vz70 vz50 : vz8) ++ vz6",fontsize=16,color="black",shape="triangle"];33 -> 36[label="",style="solid", color="black", weight=3];
12.50/4.86	35[label="vz71 >>= Monad.filterM0 vz50 vz40",fontsize=16,color="burlywood",shape="triangle"];68[label="vz71/vz710 : vz711",fontsize=10,color="white",style="solid",shape="box"];35 -> 68[label="",style="solid", color="burlywood", weight=9];
12.50/4.86	68 -> 37[label="",style="solid", color="burlywood", weight=3];
12.50/4.86	69[label="vz71/[]",fontsize=10,color="white",style="solid",shape="box"];35 -> 69[label="",style="solid", color="burlywood", weight=9];
12.50/4.86	69 -> 38[label="",style="solid", color="burlywood", weight=3];
12.50/4.86	36[label="Monad.filterM00 vz40 vz70 vz50 : vz8 ++ vz6",fontsize=16,color="green",shape="box"];36 -> 39[label="",style="dashed", color="green", weight=3];
12.50/4.86	36 -> 40[label="",style="dashed", color="green", weight=3];
12.50/4.86	37[label="vz710 : vz711 >>= Monad.filterM0 vz50 vz40",fontsize=16,color="black",shape="box"];37 -> 41[label="",style="solid", color="black", weight=3];
12.50/4.86	38[label="[] >>= Monad.filterM0 vz50 vz40",fontsize=16,color="black",shape="box"];38 -> 42[label="",style="solid", color="black", weight=3];
12.50/4.86	39[label="Monad.filterM00 vz40 vz70 vz50",fontsize=16,color="burlywood",shape="triangle"];70[label="vz50/False",fontsize=10,color="white",style="solid",shape="box"];39 -> 70[label="",style="solid", color="burlywood", weight=9];
12.50/4.86	70 -> 43[label="",style="solid", color="burlywood", weight=3];
12.50/4.86	71[label="vz50/True",fontsize=10,color="white",style="solid",shape="box"];39 -> 71[label="",style="solid", color="burlywood", weight=9];
12.50/4.86	71 -> 44[label="",style="solid", color="burlywood", weight=3];
12.50/4.86	40[label="vz8 ++ vz6",fontsize=16,color="burlywood",shape="triangle"];72[label="vz8/vz80 : vz81",fontsize=10,color="white",style="solid",shape="box"];40 -> 72[label="",style="solid", color="burlywood", weight=9];
12.50/4.86	72 -> 45[label="",style="solid", color="burlywood", weight=3];
12.50/4.86	73[label="vz8/[]",fontsize=10,color="white",style="solid",shape="box"];40 -> 73[label="",style="solid", color="burlywood", weight=9];
12.50/4.86	73 -> 46[label="",style="solid", color="burlywood", weight=3];
12.50/4.86	41 -> 40[label="",style="dashed", color="red", weight=0];
12.50/4.86	41[label="Monad.filterM0 vz50 vz40 vz710 ++ (vz711 >>= Monad.filterM0 vz50 vz40)",fontsize=16,color="magenta"];41 -> 47[label="",style="dashed", color="magenta", weight=3];
12.50/4.86	41 -> 48[label="",style="dashed", color="magenta", weight=3];
12.50/4.86	42[label="[]",fontsize=16,color="green",shape="box"];43[label="Monad.filterM00 vz40 vz70 False",fontsize=16,color="black",shape="box"];43 -> 49[label="",style="solid", color="black", weight=3];
12.50/4.86	44[label="Monad.filterM00 vz40 vz70 True",fontsize=16,color="black",shape="box"];44 -> 50[label="",style="solid", color="black", weight=3];
12.50/4.86	45[label="(vz80 : vz81) ++ vz6",fontsize=16,color="black",shape="box"];45 -> 51[label="",style="solid", color="black", weight=3];
12.50/4.86	46[label="[] ++ vz6",fontsize=16,color="black",shape="box"];46 -> 52[label="",style="solid", color="black", weight=3];
12.50/4.86	47 -> 35[label="",style="dashed", color="red", weight=0];
12.50/4.86	47[label="vz711 >>= Monad.filterM0 vz50 vz40",fontsize=16,color="magenta"];47 -> 53[label="",style="dashed", color="magenta", weight=3];
12.50/4.86	48[label="Monad.filterM0 vz50 vz40 vz710",fontsize=16,color="black",shape="box"];48 -> 54[label="",style="solid", color="black", weight=3];
12.50/4.86	49[label="vz70",fontsize=16,color="green",shape="box"];50[label="vz40 : vz70",fontsize=16,color="green",shape="box"];51[label="vz80 : vz81 ++ vz6",fontsize=16,color="green",shape="box"];51 -> 55[label="",style="dashed", color="green", weight=3];
12.50/4.86	52[label="vz6",fontsize=16,color="green",shape="box"];53[label="vz711",fontsize=16,color="green",shape="box"];54 -> 56[label="",style="dashed", color="red", weight=0];
12.50/4.86	54[label="return (Monad.filterM00 vz40 vz710 vz50)",fontsize=16,color="magenta"];54 -> 58[label="",style="dashed", color="magenta", weight=3];
12.50/4.86	55 -> 40[label="",style="dashed", color="red", weight=0];
12.50/4.86	55[label="vz81 ++ vz6",fontsize=16,color="magenta"];55 -> 60[label="",style="dashed", color="magenta", weight=3];
12.50/4.86	58 -> 39[label="",style="dashed", color="red", weight=0];
12.50/4.86	58[label="Monad.filterM00 vz40 vz710 vz50",fontsize=16,color="magenta"];58 -> 61[label="",style="dashed", color="magenta", weight=3];
12.50/4.86	60[label="vz81",fontsize=16,color="green",shape="box"];61[label="vz710",fontsize=16,color="green",shape="box"];}
12.50/4.86	
12.50/4.86	----------------------------------------
12.50/4.86	
12.50/4.86	(27)
12.50/4.86	TRUE
12.62/4.94	EOF