10.19/4.36	MAYBE
12.43/5.03	proof of /export/starexec/sandbox/benchmark/theBenchmark.hs
12.43/5.03	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
12.43/5.03	
12.43/5.03	
12.43/5.03	H-Termination with start terms of the given HASKELL could not be shown:
12.43/5.03	
12.43/5.03	(0) HASKELL
12.43/5.03	(1) LR [EQUIVALENT, 0 ms]
12.43/5.03	(2) HASKELL
12.43/5.03	(3) IFR [EQUIVALENT, 0 ms]
12.43/5.03	(4) HASKELL
12.43/5.03	(5) BR [EQUIVALENT, 0 ms]
12.43/5.03	(6) HASKELL
12.43/5.03	(7) COR [EQUIVALENT, 0 ms]
12.43/5.03	(8) HASKELL
12.43/5.03	(9) Narrow [SOUND, 0 ms]
12.43/5.03	(10) AND
12.43/5.03	    (11) QDP
12.43/5.03	        (12) QDPSizeChangeProof [EQUIVALENT, 0 ms]
12.43/5.03	        (13) YES
12.43/5.03	    (14) QDP
12.43/5.03	        (15) DependencyGraphProof [EQUIVALENT, 0 ms]
12.43/5.03	        (16) AND
12.43/5.03	            (17) QDP
12.43/5.03	                (18) QDPSizeChangeProof [EQUIVALENT, 0 ms]
12.43/5.03	                (19) YES
12.43/5.03	            (20) QDP
12.43/5.03	                (21) QDPSizeChangeProof [EQUIVALENT, 0 ms]
12.43/5.03	                (22) YES
12.43/5.03	            (23) QDP
12.43/5.03	                (24) QDPOrderProof [EQUIVALENT, 36 ms]
12.43/5.03	                (25) QDP
12.43/5.03	                (26) DependencyGraphProof [EQUIVALENT, 0 ms]
12.43/5.03	                (27) QDP
12.43/5.03	                (28) MNOCProof [EQUIVALENT, 0 ms]
12.43/5.03	                (29) QDP
12.43/5.03	                (30) NonTerminationLoopProof [COMPLETE, 0 ms]
12.43/5.03	                (31) NO
12.43/5.03	    (32) QDP
12.43/5.03	        (33) QDPSizeChangeProof [EQUIVALENT, 0 ms]
12.43/5.03	        (34) YES
12.43/5.03	(35) Narrow [COMPLETE, 0 ms]
12.43/5.03	(36) TRUE
12.43/5.03	
12.43/5.03	
12.43/5.03	----------------------------------------
12.43/5.03	
12.43/5.03	(0)
12.43/5.03	Obligation:
12.43/5.03	mainModule Main 
12.43/5.03	module Maybe where {
12.43/5.03	import qualified Main;
12.43/5.03	import qualified Monad;
12.43/5.03	import qualified Prelude;
12.43/5.03	}
12.43/5.03	module Main where {
12.43/5.03	import qualified Maybe;
12.43/5.03	import qualified Monad;
12.43/5.03	import qualified Prelude;
12.43/5.03	}
12.43/5.03	module Monad where {
12.43/5.03	import qualified Main;
12.43/5.03	import qualified Maybe;
12.43/5.03	import qualified Prelude;
12.43/5.03	filterM :: Monad b => (a  ->  b Bool)  ->  [a]  ->  b [a];
12.43/5.03	filterM _ [] = return [];
12.43/5.03	filterM p (x : xs) = p x >>= (\flg ->filterM p xs >>= (\ys ->return ( if flg then x : ys else ys)));
12.43/5.03	
12.43/5.03	}
12.43/5.03	
12.43/5.03	----------------------------------------
12.43/5.03	
12.43/5.03	(1) LR (EQUIVALENT)
12.43/5.03	Lambda Reductions:
12.43/5.03	The following Lambda expression
12.43/5.03	"\ys->return (if flg then x : ys else ys)"
12.43/5.03	is transformed to
12.43/5.03	"filterM0 flg x ys = return (if flg then x : ys else ys);
12.43/5.03	"
12.43/5.03	The following Lambda expression
12.43/5.03	"\flg->filterM p xs >>= filterM0 flg x"
12.43/5.03	is transformed to
12.43/5.03	"filterM1 p xs x flg = filterM p xs >>= filterM0 flg x;
12.43/5.03	"
12.43/5.03	
12.43/5.03	----------------------------------------
12.43/5.03	
12.43/5.03	(2)
12.43/5.03	Obligation:
12.43/5.03	mainModule Main 
12.43/5.03	module Maybe where {
12.43/5.03	import qualified Main;
12.43/5.03	import qualified Monad;
12.43/5.03	import qualified Prelude;
12.43/5.03	}
12.43/5.03	module Main where {
12.43/5.03	import qualified Maybe;
12.43/5.03	import qualified Monad;
12.43/5.03	import qualified Prelude;
12.43/5.03	}
12.43/5.03	module Monad where {
12.43/5.03	import qualified Main;
12.43/5.03	import qualified Maybe;
12.43/5.03	import qualified Prelude;
12.43/5.03	filterM :: Monad b => (a  ->  b Bool)  ->  [a]  ->  b [a];
12.43/5.03	filterM _ [] = return [];
12.43/5.03	filterM p (x : xs) = p x >>= filterM1 p xs x;
12.43/5.03	
12.43/5.03	filterM0 flg x ys = return ( if flg then x : ys else ys);
12.43/5.03	
12.43/5.03	filterM1 p xs x flg = filterM p xs >>= filterM0 flg x;
12.43/5.03	
12.43/5.03	}
12.43/5.03	
12.43/5.03	----------------------------------------
12.43/5.03	
12.43/5.03	(3) IFR (EQUIVALENT)
12.43/5.03	If Reductions:
12.43/5.03	The following If expression
12.43/5.03	"if flg then x : ys else ys"
12.43/5.03	is transformed to
12.43/5.03	"filterM00 x ys True = x : ys;
12.43/5.03	filterM00 x ys False = ys;
12.43/5.03	"
12.43/5.03	
12.43/5.03	----------------------------------------
12.74/5.04	
12.74/5.04	(4)
12.74/5.04	Obligation:
12.74/5.04	mainModule Main 
12.74/5.04	module Maybe where {
12.74/5.04	import qualified Main;
12.74/5.04	import qualified Monad;
12.74/5.04	import qualified Prelude;
12.74/5.04	}
12.74/5.04	module Main where {
12.74/5.04	import qualified Maybe;
12.74/5.04	import qualified Monad;
12.74/5.04	import qualified Prelude;
12.74/5.04	}
12.74/5.04	module Monad where {
12.74/5.04	import qualified Main;
12.74/5.04	import qualified Maybe;
12.74/5.04	import qualified Prelude;
12.74/5.04	filterM :: Monad b => (a  ->  b Bool)  ->  [a]  ->  b [a];
12.74/5.04	filterM _ [] = return [];
12.74/5.04	filterM p (x : xs) = p x >>= filterM1 p xs x;
12.74/5.04	
12.74/5.04	filterM0 flg x ys = return (filterM00 x ys flg);
12.74/5.04	
12.74/5.04	filterM00 x ys True = x : ys;
12.74/5.04	filterM00 x ys False = ys;
12.74/5.04	
12.74/5.04	filterM1 p xs x flg = filterM p xs >>= filterM0 flg x;
12.74/5.04	
12.74/5.04	}
12.74/5.04	
12.74/5.04	----------------------------------------
12.74/5.04	
12.74/5.04	(5) BR (EQUIVALENT)
12.74/5.04	Replaced joker patterns by fresh variables and removed binding patterns.
12.74/5.04	----------------------------------------
12.74/5.04	
12.74/5.04	(6)
12.74/5.04	Obligation:
12.74/5.04	mainModule Main 
12.74/5.04	module Maybe where {
12.74/5.04	import qualified Main;
12.74/5.04	import qualified Monad;
12.74/5.04	import qualified Prelude;
12.74/5.04	}
12.74/5.04	module Main where {
12.74/5.04	import qualified Maybe;
12.74/5.04	import qualified Monad;
12.74/5.04	import qualified Prelude;
12.74/5.04	}
12.74/5.04	module Monad where {
12.74/5.04	import qualified Main;
12.74/5.04	import qualified Maybe;
12.74/5.04	import qualified Prelude;
12.74/5.04	filterM :: Monad b => (a  ->  b Bool)  ->  [a]  ->  b [a];
12.74/5.04	filterM vy [] = return [];
12.74/5.04	filterM p (x : xs) = p x >>= filterM1 p xs x;
12.74/5.04	
12.74/5.04	filterM0 flg x ys = return (filterM00 x ys flg);
12.74/5.04	
12.74/5.04	filterM00 x ys True = x : ys;
12.74/5.04	filterM00 x ys False = ys;
12.74/5.04	
12.74/5.04	filterM1 p xs x flg = filterM p xs >>= filterM0 flg x;
12.74/5.04	
12.74/5.04	}
12.74/5.04	
12.74/5.04	----------------------------------------
12.74/5.04	
12.74/5.04	(7) COR (EQUIVALENT)
12.74/5.04	Cond Reductions:
12.74/5.04	The following Function with conditions
12.74/5.04	"undefined |Falseundefined;
12.74/5.04	"
12.74/5.04	is transformed to
12.74/5.04	"undefined  = undefined1;
12.74/5.04	"
12.74/5.04	"undefined0 True = undefined;
12.74/5.04	"
12.74/5.04	"undefined1  = undefined0 False;
12.74/5.04	"
12.74/5.04	
12.74/5.04	----------------------------------------
12.74/5.04	
12.74/5.04	(8)
12.74/5.04	Obligation:
12.74/5.04	mainModule Main 
12.74/5.04	module Maybe where {
12.74/5.04	import qualified Main;
12.74/5.04	import qualified Monad;
12.74/5.04	import qualified Prelude;
12.74/5.04	}
12.74/5.04	module Main where {
12.74/5.04	import qualified Maybe;
12.74/5.04	import qualified Monad;
12.74/5.04	import qualified Prelude;
12.74/5.04	}
12.74/5.04	module Monad where {
12.74/5.04	import qualified Main;
12.74/5.04	import qualified Maybe;
12.74/5.04	import qualified Prelude;
12.74/5.04	filterM :: Monad b => (a  ->  b Bool)  ->  [a]  ->  b [a];
12.74/5.04	filterM vy [] = return [];
12.74/5.04	filterM p (x : xs) = p x >>= filterM1 p xs x;
12.74/5.04	
12.74/5.04	filterM0 flg x ys = return (filterM00 x ys flg);
12.74/5.04	
12.74/5.04	filterM00 x ys True = x : ys;
12.74/5.04	filterM00 x ys False = ys;
12.74/5.04	
12.74/5.04	filterM1 p xs x flg = filterM p xs >>= filterM0 flg x;
12.74/5.04	
12.74/5.04	}
12.74/5.04	
12.74/5.04	----------------------------------------
12.74/5.04	
12.74/5.04	(9) Narrow (SOUND)
12.74/5.04	Haskell To QDPs
12.74/5.04	
12.74/5.04	digraph dp_graph {
12.74/5.04	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.74/5.04	3[label="Monad.filterM vz3",fontsize=16,color="grey",shape="box"];3 -> 4[label="",style="dashed", color="grey", weight=3];
12.74/5.04	4[label="Monad.filterM vz3 vz4",fontsize=16,color="burlywood",shape="triangle"];125[label="vz4/vz40 : vz41",fontsize=10,color="white",style="solid",shape="box"];4 -> 125[label="",style="solid", color="burlywood", weight=9];
12.74/5.04	125 -> 5[label="",style="solid", color="burlywood", weight=3];
12.74/5.04	126[label="vz4/[]",fontsize=10,color="white",style="solid",shape="box"];4 -> 126[label="",style="solid", color="burlywood", weight=9];
12.74/5.04	126 -> 6[label="",style="solid", color="burlywood", weight=3];
12.74/5.04	5[label="Monad.filterM vz3 (vz40 : vz41)",fontsize=16,color="black",shape="box"];5 -> 7[label="",style="solid", color="black", weight=3];
12.74/5.04	6[label="Monad.filterM vz3 []",fontsize=16,color="black",shape="box"];6 -> 8[label="",style="solid", color="black", weight=3];
12.74/5.04	7[label="vz3 vz40 >>= Monad.filterM1 vz3 vz41 vz40",fontsize=16,color="blue",shape="box"];127[label=">>= :: (IO Bool) -> (Bool -> IO ([] a)) -> IO ([] a)",fontsize=10,color="white",style="solid",shape="box"];7 -> 127[label="",style="solid", color="blue", weight=9];
12.74/5.04	127 -> 9[label="",style="solid", color="blue", weight=3];
12.74/5.04	128[label=">>= :: ([] Bool) -> (Bool -> [] ([] a)) -> [] ([] a)",fontsize=10,color="white",style="solid",shape="box"];7 -> 128[label="",style="solid", color="blue", weight=9];
12.74/5.04	128 -> 10[label="",style="solid", color="blue", weight=3];
12.74/5.04	129[label=">>= :: (Maybe Bool) -> (Bool -> Maybe ([] a)) -> Maybe ([] a)",fontsize=10,color="white",style="solid",shape="box"];7 -> 129[label="",style="solid", color="blue", weight=9];
12.74/5.04	129 -> 11[label="",style="solid", color="blue", weight=3];
12.74/5.04	8[label="return []",fontsize=16,color="blue",shape="box"];130[label="return :: ([] a) -> IO ([] a)",fontsize=10,color="white",style="solid",shape="box"];8 -> 130[label="",style="solid", color="blue", weight=9];
12.74/5.04	130 -> 12[label="",style="solid", color="blue", weight=3];
12.74/5.04	131[label="return :: ([] a) -> [] ([] a)",fontsize=10,color="white",style="solid",shape="box"];8 -> 131[label="",style="solid", color="blue", weight=9];
12.74/5.04	131 -> 13[label="",style="solid", color="blue", weight=3];
12.74/5.04	132[label="return :: ([] a) -> Maybe ([] a)",fontsize=10,color="white",style="solid",shape="box"];8 -> 132[label="",style="solid", color="blue", weight=9];
12.74/5.04	132 -> 14[label="",style="solid", color="blue", weight=3];
12.74/5.04	9[label="vz3 vz40 >>= Monad.filterM1 vz3 vz41 vz40",fontsize=16,color="black",shape="box"];9 -> 15[label="",style="solid", color="black", weight=3];
12.74/5.04	10 -> 16[label="",style="dashed", color="red", weight=0];
12.74/5.04	10[label="vz3 vz40 >>= Monad.filterM1 vz3 vz41 vz40",fontsize=16,color="magenta"];10 -> 17[label="",style="dashed", color="magenta", weight=3];
12.74/5.04	11 -> 18[label="",style="dashed", color="red", weight=0];
12.74/5.04	11[label="vz3 vz40 >>= Monad.filterM1 vz3 vz41 vz40",fontsize=16,color="magenta"];11 -> 19[label="",style="dashed", color="magenta", weight=3];
12.74/5.04	12[label="return []",fontsize=16,color="black",shape="box"];12 -> 20[label="",style="solid", color="black", weight=3];
12.74/5.04	13 -> 118[label="",style="dashed", color="red", weight=0];
12.74/5.04	13[label="return []",fontsize=16,color="magenta"];13 -> 119[label="",style="dashed", color="magenta", weight=3];
12.74/5.04	14[label="return []",fontsize=16,color="black",shape="box"];14 -> 22[label="",style="solid", color="black", weight=3];
12.74/5.04	15 -> 23[label="",style="dashed", color="red", weight=0];
12.74/5.04	15[label="primbindIO (vz3 vz40) (Monad.filterM1 vz3 vz41 vz40)",fontsize=16,color="magenta"];15 -> 24[label="",style="dashed", color="magenta", weight=3];
12.74/5.05	17[label="vz3 vz40",fontsize=16,color="green",shape="box"];17 -> 25[label="",style="dashed", color="green", weight=3];
12.74/5.05	16[label="vz5 >>= Monad.filterM1 vz3 vz41 vz40",fontsize=16,color="burlywood",shape="triangle"];133[label="vz5/vz50 : vz51",fontsize=10,color="white",style="solid",shape="box"];16 -> 133[label="",style="solid", color="burlywood", weight=9];
12.74/5.05	133 -> 26[label="",style="solid", color="burlywood", weight=3];
12.74/5.05	134[label="vz5/[]",fontsize=10,color="white",style="solid",shape="box"];16 -> 134[label="",style="solid", color="burlywood", weight=9];
12.74/5.05	134 -> 27[label="",style="solid", color="burlywood", weight=3];
12.74/5.05	19[label="vz3 vz40",fontsize=16,color="green",shape="box"];19 -> 28[label="",style="dashed", color="green", weight=3];
12.74/5.05	18[label="vz6 >>= Monad.filterM1 vz3 vz41 vz40",fontsize=16,color="burlywood",shape="triangle"];135[label="vz6/Nothing",fontsize=10,color="white",style="solid",shape="box"];18 -> 135[label="",style="solid", color="burlywood", weight=9];
12.74/5.05	135 -> 29[label="",style="solid", color="burlywood", weight=3];
12.74/5.05	136[label="vz6/Just vz60",fontsize=10,color="white",style="solid",shape="box"];18 -> 136[label="",style="solid", color="burlywood", weight=9];
12.74/5.05	136 -> 30[label="",style="solid", color="burlywood", weight=3];
12.74/5.05	20 -> 89[label="",style="dashed", color="red", weight=0];
12.74/5.05	20[label="primretIO []",fontsize=16,color="magenta"];20 -> 90[label="",style="dashed", color="magenta", weight=3];
12.74/5.05	119[label="[]",fontsize=16,color="green",shape="box"];118[label="return vz15",fontsize=16,color="black",shape="triangle"];118 -> 121[label="",style="solid", color="black", weight=3];
12.74/5.05	22[label="Just []",fontsize=16,color="green",shape="box"];24[label="vz3 vz40",fontsize=16,color="green",shape="box"];24 -> 37[label="",style="dashed", color="green", weight=3];
12.74/5.05	23[label="primbindIO vz7 (Monad.filterM1 vz3 vz41 vz40)",fontsize=16,color="burlywood",shape="triangle"];137[label="vz7/IO vz70",fontsize=10,color="white",style="solid",shape="box"];23 -> 137[label="",style="solid", color="burlywood", weight=9];
12.74/5.05	137 -> 33[label="",style="solid", color="burlywood", weight=3];
12.74/5.05	138[label="vz7/AProVE_IO vz70",fontsize=10,color="white",style="solid",shape="box"];23 -> 138[label="",style="solid", color="burlywood", weight=9];
12.74/5.05	138 -> 34[label="",style="solid", color="burlywood", weight=3];
12.74/5.05	139[label="vz7/AProVE_Exception vz70",fontsize=10,color="white",style="solid",shape="box"];23 -> 139[label="",style="solid", color="burlywood", weight=9];
12.74/5.05	139 -> 35[label="",style="solid", color="burlywood", weight=3];
12.74/5.05	140[label="vz7/AProVE_Error vz70",fontsize=10,color="white",style="solid",shape="box"];23 -> 140[label="",style="solid", color="burlywood", weight=9];
12.74/5.05	140 -> 36[label="",style="solid", color="burlywood", weight=3];
12.74/5.05	25[label="vz40",fontsize=16,color="green",shape="box"];26[label="vz50 : vz51 >>= Monad.filterM1 vz3 vz41 vz40",fontsize=16,color="black",shape="box"];26 -> 38[label="",style="solid", color="black", weight=3];
12.74/5.05	27[label="[] >>= Monad.filterM1 vz3 vz41 vz40",fontsize=16,color="black",shape="box"];27 -> 39[label="",style="solid", color="black", weight=3];
12.74/5.05	28[label="vz40",fontsize=16,color="green",shape="box"];29[label="Nothing >>= Monad.filterM1 vz3 vz41 vz40",fontsize=16,color="black",shape="box"];29 -> 40[label="",style="solid", color="black", weight=3];
12.74/5.05	30[label="Just vz60 >>= Monad.filterM1 vz3 vz41 vz40",fontsize=16,color="black",shape="box"];30 -> 41[label="",style="solid", color="black", weight=3];
12.74/5.05	90[label="[]",fontsize=16,color="green",shape="box"];89[label="primretIO vz12",fontsize=16,color="black",shape="triangle"];89 -> 92[label="",style="solid", color="black", weight=3];
12.74/5.05	121[label="vz15 : []",fontsize=16,color="green",shape="box"];37[label="vz40",fontsize=16,color="green",shape="box"];33[label="primbindIO (IO vz70) (Monad.filterM1 vz3 vz41 vz40)",fontsize=16,color="black",shape="box"];33 -> 42[label="",style="solid", color="black", weight=3];
12.74/5.05	34[label="primbindIO (AProVE_IO vz70) (Monad.filterM1 vz3 vz41 vz40)",fontsize=16,color="black",shape="box"];34 -> 43[label="",style="solid", color="black", weight=3];
12.74/5.05	35[label="primbindIO (AProVE_Exception vz70) (Monad.filterM1 vz3 vz41 vz40)",fontsize=16,color="black",shape="box"];35 -> 44[label="",style="solid", color="black", weight=3];
12.74/5.05	36[label="primbindIO (AProVE_Error vz70) (Monad.filterM1 vz3 vz41 vz40)",fontsize=16,color="black",shape="box"];36 -> 45[label="",style="solid", color="black", weight=3];
12.74/5.05	38 -> 46[label="",style="dashed", color="red", weight=0];
12.74/5.05	38[label="Monad.filterM1 vz3 vz41 vz40 vz50 ++ (vz51 >>= Monad.filterM1 vz3 vz41 vz40)",fontsize=16,color="magenta"];38 -> 47[label="",style="dashed", color="magenta", weight=3];
12.74/5.05	39[label="[]",fontsize=16,color="green",shape="box"];40[label="Nothing",fontsize=16,color="green",shape="box"];41[label="Monad.filterM1 vz3 vz41 vz40 vz60",fontsize=16,color="black",shape="box"];41 -> 48[label="",style="solid", color="black", weight=3];
12.74/5.05	92[label="AProVE_IO vz12",fontsize=16,color="green",shape="box"];42[label="error []",fontsize=16,color="red",shape="box"];43[label="Monad.filterM1 vz3 vz41 vz40 vz70",fontsize=16,color="black",shape="box"];43 -> 49[label="",style="solid", color="black", weight=3];
12.74/5.05	44[label="AProVE_Exception vz70",fontsize=16,color="green",shape="box"];45[label="AProVE_Error vz70",fontsize=16,color="green",shape="box"];47 -> 16[label="",style="dashed", color="red", weight=0];
12.74/5.05	47[label="vz51 >>= Monad.filterM1 vz3 vz41 vz40",fontsize=16,color="magenta"];47 -> 50[label="",style="dashed", color="magenta", weight=3];
12.74/5.05	46[label="Monad.filterM1 vz3 vz41 vz40 vz50 ++ vz8",fontsize=16,color="black",shape="triangle"];46 -> 51[label="",style="solid", color="black", weight=3];
12.74/5.05	48 -> 52[label="",style="dashed", color="red", weight=0];
12.74/5.05	48[label="Monad.filterM vz3 vz41 >>= Monad.filterM0 vz60 vz40",fontsize=16,color="magenta"];48 -> 53[label="",style="dashed", color="magenta", weight=3];
12.74/5.05	49 -> 54[label="",style="dashed", color="red", weight=0];
12.74/5.05	49[label="Monad.filterM vz3 vz41 >>= Monad.filterM0 vz70 vz40",fontsize=16,color="magenta"];49 -> 55[label="",style="dashed", color="magenta", weight=3];
12.74/5.05	50[label="vz51",fontsize=16,color="green",shape="box"];51 -> 56[label="",style="dashed", color="red", weight=0];
12.74/5.05	51[label="(Monad.filterM vz3 vz41 >>= Monad.filterM0 vz50 vz40) ++ vz8",fontsize=16,color="magenta"];51 -> 57[label="",style="dashed", color="magenta", weight=3];
12.74/5.05	53 -> 4[label="",style="dashed", color="red", weight=0];
12.74/5.05	53[label="Monad.filterM vz3 vz41",fontsize=16,color="magenta"];53 -> 58[label="",style="dashed", color="magenta", weight=3];
12.74/5.05	52[label="vz9 >>= Monad.filterM0 vz60 vz40",fontsize=16,color="burlywood",shape="triangle"];141[label="vz9/Nothing",fontsize=10,color="white",style="solid",shape="box"];52 -> 141[label="",style="solid", color="burlywood", weight=9];
12.74/5.05	141 -> 59[label="",style="solid", color="burlywood", weight=3];
12.74/5.05	142[label="vz9/Just vz90",fontsize=10,color="white",style="solid",shape="box"];52 -> 142[label="",style="solid", color="burlywood", weight=9];
12.74/5.05	142 -> 60[label="",style="solid", color="burlywood", weight=3];
12.74/5.05	55 -> 4[label="",style="dashed", color="red", weight=0];
12.74/5.05	55[label="Monad.filterM vz3 vz41",fontsize=16,color="magenta"];55 -> 61[label="",style="dashed", color="magenta", weight=3];
12.74/5.05	54[label="vz10 >>= Monad.filterM0 vz70 vz40",fontsize=16,color="black",shape="triangle"];54 -> 62[label="",style="solid", color="black", weight=3];
12.74/5.05	57 -> 4[label="",style="dashed", color="red", weight=0];
12.74/5.05	57[label="Monad.filterM vz3 vz41",fontsize=16,color="magenta"];57 -> 63[label="",style="dashed", color="magenta", weight=3];
12.74/5.05	56[label="(vz11 >>= Monad.filterM0 vz50 vz40) ++ vz8",fontsize=16,color="burlywood",shape="triangle"];143[label="vz11/vz110 : vz111",fontsize=10,color="white",style="solid",shape="box"];56 -> 143[label="",style="solid", color="burlywood", weight=9];
12.74/5.05	143 -> 64[label="",style="solid", color="burlywood", weight=3];
12.74/5.05	144[label="vz11/[]",fontsize=10,color="white",style="solid",shape="box"];56 -> 144[label="",style="solid", color="burlywood", weight=9];
12.74/5.05	144 -> 65[label="",style="solid", color="burlywood", weight=3];
12.74/5.05	58[label="vz41",fontsize=16,color="green",shape="box"];59[label="Nothing >>= Monad.filterM0 vz60 vz40",fontsize=16,color="black",shape="box"];59 -> 66[label="",style="solid", color="black", weight=3];
12.74/5.05	60[label="Just vz90 >>= Monad.filterM0 vz60 vz40",fontsize=16,color="black",shape="box"];60 -> 67[label="",style="solid", color="black", weight=3];
12.74/5.05	61[label="vz41",fontsize=16,color="green",shape="box"];62[label="primbindIO vz10 (Monad.filterM0 vz70 vz40)",fontsize=16,color="burlywood",shape="box"];145[label="vz10/IO vz100",fontsize=10,color="white",style="solid",shape="box"];62 -> 145[label="",style="solid", color="burlywood", weight=9];
12.74/5.05	145 -> 68[label="",style="solid", color="burlywood", weight=3];
12.74/5.05	146[label="vz10/AProVE_IO vz100",fontsize=10,color="white",style="solid",shape="box"];62 -> 146[label="",style="solid", color="burlywood", weight=9];
12.74/5.05	146 -> 69[label="",style="solid", color="burlywood", weight=3];
12.74/5.05	147[label="vz10/AProVE_Exception vz100",fontsize=10,color="white",style="solid",shape="box"];62 -> 147[label="",style="solid", color="burlywood", weight=9];
12.74/5.05	147 -> 70[label="",style="solid", color="burlywood", weight=3];
12.74/5.05	148[label="vz10/AProVE_Error vz100",fontsize=10,color="white",style="solid",shape="box"];62 -> 148[label="",style="solid", color="burlywood", weight=9];
12.74/5.05	148 -> 71[label="",style="solid", color="burlywood", weight=3];
12.74/5.05	63[label="vz41",fontsize=16,color="green",shape="box"];64[label="(vz110 : vz111 >>= Monad.filterM0 vz50 vz40) ++ vz8",fontsize=16,color="black",shape="box"];64 -> 72[label="",style="solid", color="black", weight=3];
12.74/5.05	65[label="([] >>= Monad.filterM0 vz50 vz40) ++ vz8",fontsize=16,color="black",shape="box"];65 -> 73[label="",style="solid", color="black", weight=3];
12.74/5.05	66[label="Nothing",fontsize=16,color="green",shape="box"];67[label="Monad.filterM0 vz60 vz40 vz90",fontsize=16,color="black",shape="box"];67 -> 74[label="",style="solid", color="black", weight=3];
12.74/5.05	68[label="primbindIO (IO vz100) (Monad.filterM0 vz70 vz40)",fontsize=16,color="black",shape="box"];68 -> 75[label="",style="solid", color="black", weight=3];
12.74/5.05	69[label="primbindIO (AProVE_IO vz100) (Monad.filterM0 vz70 vz40)",fontsize=16,color="black",shape="box"];69 -> 76[label="",style="solid", color="black", weight=3];
12.74/5.05	70[label="primbindIO (AProVE_Exception vz100) (Monad.filterM0 vz70 vz40)",fontsize=16,color="black",shape="box"];70 -> 77[label="",style="solid", color="black", weight=3];
12.74/5.05	71[label="primbindIO (AProVE_Error vz100) (Monad.filterM0 vz70 vz40)",fontsize=16,color="black",shape="box"];71 -> 78[label="",style="solid", color="black", weight=3];
12.74/5.05	72[label="(Monad.filterM0 vz50 vz40 vz110 ++ (vz111 >>= Monad.filterM0 vz50 vz40)) ++ vz8",fontsize=16,color="black",shape="box"];72 -> 79[label="",style="solid", color="black", weight=3];
12.74/5.05	73[label="[] ++ vz8",fontsize=16,color="black",shape="triangle"];73 -> 80[label="",style="solid", color="black", weight=3];
12.74/5.05	74[label="return (Monad.filterM00 vz40 vz90 vz60)",fontsize=16,color="black",shape="box"];74 -> 81[label="",style="solid", color="black", weight=3];
12.74/5.05	75[label="error []",fontsize=16,color="red",shape="box"];76[label="Monad.filterM0 vz70 vz40 vz100",fontsize=16,color="black",shape="box"];76 -> 82[label="",style="solid", color="black", weight=3];
12.74/5.05	77[label="AProVE_Exception vz100",fontsize=16,color="green",shape="box"];78[label="AProVE_Error vz100",fontsize=16,color="green",shape="box"];79[label="(return (Monad.filterM00 vz40 vz110 vz50) ++ (vz111 >>= Monad.filterM0 vz50 vz40)) ++ vz8",fontsize=16,color="black",shape="box"];79 -> 83[label="",style="solid", color="black", weight=3];
12.74/5.05	80[label="vz8",fontsize=16,color="green",shape="box"];81[label="Just (Monad.filterM00 vz40 vz90 vz60)",fontsize=16,color="green",shape="box"];81 -> 84[label="",style="dashed", color="green", weight=3];
12.74/5.05	82[label="return (Monad.filterM00 vz40 vz100 vz70)",fontsize=16,color="black",shape="box"];82 -> 85[label="",style="solid", color="black", weight=3];
12.74/5.05	83[label="((Monad.filterM00 vz40 vz110 vz50 : []) ++ (vz111 >>= Monad.filterM0 vz50 vz40)) ++ vz8",fontsize=16,color="black",shape="box"];83 -> 86[label="",style="solid", color="black", weight=3];
12.74/5.05	84[label="Monad.filterM00 vz40 vz90 vz60",fontsize=16,color="burlywood",shape="triangle"];149[label="vz60/False",fontsize=10,color="white",style="solid",shape="box"];84 -> 149[label="",style="solid", color="burlywood", weight=9];
12.74/5.05	149 -> 87[label="",style="solid", color="burlywood", weight=3];
12.74/5.05	150[label="vz60/True",fontsize=10,color="white",style="solid",shape="box"];84 -> 150[label="",style="solid", color="burlywood", weight=9];
12.74/5.05	150 -> 88[label="",style="solid", color="burlywood", weight=3];
12.74/5.05	85 -> 89[label="",style="dashed", color="red", weight=0];
12.74/5.05	85[label="primretIO (Monad.filterM00 vz40 vz100 vz70)",fontsize=16,color="magenta"];85 -> 91[label="",style="dashed", color="magenta", weight=3];
12.74/5.05	86 -> 93[label="",style="dashed", color="red", weight=0];
12.74/5.05	86[label="(Monad.filterM00 vz40 vz110 vz50 : [] ++ (vz111 >>= Monad.filterM0 vz50 vz40)) ++ vz8",fontsize=16,color="magenta"];86 -> 94[label="",style="dashed", color="magenta", weight=3];
12.74/5.05	86 -> 95[label="",style="dashed", color="magenta", weight=3];
12.74/5.05	87[label="Monad.filterM00 vz40 vz90 False",fontsize=16,color="black",shape="box"];87 -> 96[label="",style="solid", color="black", weight=3];
12.74/5.05	88[label="Monad.filterM00 vz40 vz90 True",fontsize=16,color="black",shape="box"];88 -> 97[label="",style="solid", color="black", weight=3];
12.74/5.05	91 -> 84[label="",style="dashed", color="red", weight=0];
12.74/5.05	91[label="Monad.filterM00 vz40 vz100 vz70",fontsize=16,color="magenta"];91 -> 98[label="",style="dashed", color="magenta", weight=3];
12.74/5.05	91 -> 99[label="",style="dashed", color="magenta", weight=3];
12.74/5.05	94 -> 84[label="",style="dashed", color="red", weight=0];
12.74/5.05	94[label="Monad.filterM00 vz40 vz110 vz50",fontsize=16,color="magenta"];94 -> 100[label="",style="dashed", color="magenta", weight=3];
12.74/5.05	94 -> 101[label="",style="dashed", color="magenta", weight=3];
12.74/5.05	95 -> 73[label="",style="dashed", color="red", weight=0];
12.74/5.05	95[label="[] ++ (vz111 >>= Monad.filterM0 vz50 vz40)",fontsize=16,color="magenta"];95 -> 102[label="",style="dashed", color="magenta", weight=3];
12.74/5.05	93[label="(vz14 : vz13) ++ vz8",fontsize=16,color="black",shape="triangle"];93 -> 103[label="",style="solid", color="black", weight=3];
12.74/5.05	96[label="vz90",fontsize=16,color="green",shape="box"];97[label="vz40 : vz90",fontsize=16,color="green",shape="box"];98[label="vz70",fontsize=16,color="green",shape="box"];99[label="vz100",fontsize=16,color="green",shape="box"];100[label="vz50",fontsize=16,color="green",shape="box"];101[label="vz110",fontsize=16,color="green",shape="box"];102[label="vz111 >>= Monad.filterM0 vz50 vz40",fontsize=16,color="burlywood",shape="triangle"];151[label="vz111/vz1110 : vz1111",fontsize=10,color="white",style="solid",shape="box"];102 -> 151[label="",style="solid", color="burlywood", weight=9];
12.74/5.05	151 -> 104[label="",style="solid", color="burlywood", weight=3];
12.74/5.05	152[label="vz111/[]",fontsize=10,color="white",style="solid",shape="box"];102 -> 152[label="",style="solid", color="burlywood", weight=9];
12.74/5.05	152 -> 105[label="",style="solid", color="burlywood", weight=3];
12.74/5.05	103[label="vz14 : vz13 ++ vz8",fontsize=16,color="green",shape="box"];103 -> 106[label="",style="dashed", color="green", weight=3];
12.74/5.05	104[label="vz1110 : vz1111 >>= Monad.filterM0 vz50 vz40",fontsize=16,color="black",shape="box"];104 -> 107[label="",style="solid", color="black", weight=3];
12.74/5.05	105[label="[] >>= Monad.filterM0 vz50 vz40",fontsize=16,color="black",shape="box"];105 -> 108[label="",style="solid", color="black", weight=3];
12.74/5.05	106[label="vz13 ++ vz8",fontsize=16,color="burlywood",shape="triangle"];153[label="vz13/vz130 : vz131",fontsize=10,color="white",style="solid",shape="box"];106 -> 153[label="",style="solid", color="burlywood", weight=9];
12.74/5.05	153 -> 109[label="",style="solid", color="burlywood", weight=3];
12.74/5.05	154[label="vz13/[]",fontsize=10,color="white",style="solid",shape="box"];106 -> 154[label="",style="solid", color="burlywood", weight=9];
12.74/5.05	154 -> 110[label="",style="solid", color="burlywood", weight=3];
12.74/5.05	107 -> 106[label="",style="dashed", color="red", weight=0];
12.74/5.05	107[label="Monad.filterM0 vz50 vz40 vz1110 ++ (vz1111 >>= Monad.filterM0 vz50 vz40)",fontsize=16,color="magenta"];107 -> 111[label="",style="dashed", color="magenta", weight=3];
12.74/5.05	107 -> 112[label="",style="dashed", color="magenta", weight=3];
12.74/5.05	108[label="[]",fontsize=16,color="green",shape="box"];109[label="(vz130 : vz131) ++ vz8",fontsize=16,color="black",shape="box"];109 -> 113[label="",style="solid", color="black", weight=3];
12.74/5.05	110[label="[] ++ vz8",fontsize=16,color="black",shape="box"];110 -> 114[label="",style="solid", color="black", weight=3];
12.74/5.05	111 -> 102[label="",style="dashed", color="red", weight=0];
12.74/5.05	111[label="vz1111 >>= Monad.filterM0 vz50 vz40",fontsize=16,color="magenta"];111 -> 115[label="",style="dashed", color="magenta", weight=3];
12.74/5.05	112[label="Monad.filterM0 vz50 vz40 vz1110",fontsize=16,color="black",shape="box"];112 -> 116[label="",style="solid", color="black", weight=3];
12.74/5.05	113[label="vz130 : vz131 ++ vz8",fontsize=16,color="green",shape="box"];113 -> 117[label="",style="dashed", color="green", weight=3];
12.74/5.05	114[label="vz8",fontsize=16,color="green",shape="box"];115[label="vz1111",fontsize=16,color="green",shape="box"];116 -> 118[label="",style="dashed", color="red", weight=0];
12.74/5.05	116[label="return (Monad.filterM00 vz40 vz1110 vz50)",fontsize=16,color="magenta"];116 -> 120[label="",style="dashed", color="magenta", weight=3];
12.74/5.05	117 -> 106[label="",style="dashed", color="red", weight=0];
12.74/5.05	117[label="vz131 ++ vz8",fontsize=16,color="magenta"];117 -> 122[label="",style="dashed", color="magenta", weight=3];
12.74/5.05	120 -> 84[label="",style="dashed", color="red", weight=0];
12.74/5.05	120[label="Monad.filterM00 vz40 vz1110 vz50",fontsize=16,color="magenta"];120 -> 123[label="",style="dashed", color="magenta", weight=3];
12.74/5.05	120 -> 124[label="",style="dashed", color="magenta", weight=3];
12.74/5.05	122[label="vz131",fontsize=16,color="green",shape="box"];123[label="vz50",fontsize=16,color="green",shape="box"];124[label="vz1110",fontsize=16,color="green",shape="box"];}
12.74/5.05	
12.74/5.05	----------------------------------------
12.74/5.05	
12.74/5.05	(10)
12.74/5.05	Complex Obligation (AND)
12.74/5.05	
12.74/5.05	----------------------------------------
12.74/5.05	
12.74/5.05	(11)
12.74/5.05	Obligation:
12.74/5.05	Q DP problem:
12.74/5.05	The TRS P consists of the following rules:
12.74/5.05	
12.74/5.05	   new_gtGtEs(:(vz1110, vz1111), vz50, vz40, h) -> new_gtGtEs(vz1111, vz50, vz40, h)
12.74/5.05	
12.74/5.05	R is empty.
12.74/5.05	Q is empty.
12.74/5.05	We have to consider all minimal (P,Q,R)-chains.
12.74/5.05	----------------------------------------
12.74/5.05	
12.74/5.05	(12) QDPSizeChangeProof (EQUIVALENT)
12.74/5.05	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.74/5.05	
12.74/5.05	From the DPs we obtained the following set of size-change graphs:
12.74/5.05	*new_gtGtEs(:(vz1110, vz1111), vz50, vz40, h) -> new_gtGtEs(vz1111, vz50, vz40, h)
12.74/5.05	The graph contains the following edges 1 > 1, 2 >= 2, 3 >= 3, 4 >= 4
12.74/5.05	
12.74/5.05	
12.74/5.05	----------------------------------------
12.74/5.05	
12.74/5.05	(13)
12.74/5.05	YES
12.74/5.05	
12.74/5.05	----------------------------------------
12.74/5.05	
12.74/5.05	(14)
12.74/5.05	Obligation:
12.74/5.05	Q DP problem:
12.74/5.05	The TRS P consists of the following rules:
12.74/5.05	
12.74/5.05	   new_filterM(vz3, :(vz40, vz41), ty_[], h) -> new_gtGtEs0(vz3, vz41, vz40, h)
12.74/5.05	   new_filterM(vz3, :(vz40, vz41), ty_Maybe, h) -> new_gtGtEs1(vz3, vz41, vz40, h)
12.74/5.05	   new_psPs0(vz3, vz41, vz40, h) -> new_filterM(vz3, vz41, ty_[], h)
12.74/5.05	   new_primbindIO(vz3, vz41, vz40, h) -> new_filterM(vz3, vz41, ty_IO, h)
12.74/5.05	   new_gtGtEs0(vz3, vz41, vz40, h) -> new_psPs0(vz3, vz41, vz40, h)
12.74/5.05	   new_filterM(vz3, :(vz40, vz41), ty_IO, h) -> new_primbindIO(vz3, vz41, vz40, h)
12.74/5.05	   new_gtGtEs0(vz3, vz41, vz40, h) -> new_gtGtEs0(vz3, vz41, vz40, h)
12.74/5.05	   new_gtGtEs1(vz3, vz41, vz40, h) -> new_filterM(vz3, vz41, ty_Maybe, h)
12.74/5.05	
12.74/5.05	The TRS R consists of the following rules:
12.74/5.05	
12.74/5.05	   new_gtGtEs2(:(vz50, vz51), vz3, vz41, vz40, h) -> new_psPs3(vz3, vz41, vz40, vz50, new_gtGtEs2(vz51, vz3, vz41, vz40, h), h)
12.74/5.05	   new_psPs2(vz14, vz13, vz8, h) -> :(vz14, new_psPs1(vz13, vz8, h))
12.74/5.05	   new_gtGtEs3([], vz50, vz40, h) -> []
12.74/5.05	   new_gtGtEs3(:(vz1110, vz1111), vz50, vz40, h) -> new_psPs1(new_return(new_filterM00(vz40, vz1110, vz50, h), h), new_gtGtEs3(vz1111, vz50, vz40, h), h)
12.74/5.05	   new_psPs4(:(vz110, vz111), vz50, vz40, vz8, h) -> new_psPs2(new_filterM00(vz40, vz110, vz50, h), new_psPs5(new_gtGtEs3(vz111, vz50, vz40, h), h), vz8, h)
12.74/5.05	   new_filterM00(vz40, vz90, False, h) -> vz90
12.74/5.05	   new_psPs4([], vz50, vz40, vz8, h) -> new_psPs5(vz8, h)
12.74/5.05	   new_psPs1(:(vz130, vz131), vz8, h) -> :(vz130, new_psPs1(vz131, vz8, h))
12.74/5.05	   new_gtGtEs2([], vz3, vz41, vz40, h) -> []
12.74/5.05	   new_return(vz15, h) -> :(vz15, [])
12.74/5.05	   new_psPs3(vz3, vz41, vz40, vz50, vz8, h) -> new_psPs4(new_filterM0(vz3, vz41, ty_[], h), vz50, vz40, vz8, h)
12.74/5.05	   new_psPs1([], vz8, h) -> vz8
12.74/5.05	   new_psPs5(vz8, h) -> vz8
12.74/5.05	   new_filterM00(vz40, vz90, True, h) -> :(vz40, vz90)
12.74/5.05	
12.74/5.05	The set Q consists of the following terms:
12.74/5.05	
12.74/5.05	   new_psPs1(:(x0, x1), x2, x3)
12.74/5.05	   new_psPs1([], x0, x1)
12.74/5.05	   new_filterM00(x0, x1, True, x2)
12.74/5.05	   new_psPs2(x0, x1, x2, x3)
12.74/5.05	   new_psPs4(:(x0, x1), x2, x3, x4, x5)
12.74/5.05	   new_psPs4([], x0, x1, x2, x3)
12.74/5.05	   new_gtGtEs3(:(x0, x1), x2, x3, x4)
12.74/5.05	   new_filterM00(x0, x1, False, x2)
12.74/5.05	   new_gtGtEs2(:(x0, x1), x2, x3, x4, x5)
12.74/5.05	   new_return(x0, x1)
12.74/5.05	   new_psPs3(x0, x1, x2, x3, x4, x5)
12.74/5.05	   new_gtGtEs2([], x0, x1, x2, x3)
12.74/5.05	   new_gtGtEs3([], x0, x1, x2)
12.74/5.05	   new_psPs5(x0, x1)
12.74/5.05	
12.74/5.05	We have to consider all minimal (P,Q,R)-chains.
12.74/5.05	----------------------------------------
12.74/5.05	
12.74/5.05	(15) DependencyGraphProof (EQUIVALENT)
12.74/5.05	The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 3 SCCs.
12.74/5.05	----------------------------------------
12.74/5.05	
12.74/5.05	(16)
12.74/5.05	Complex Obligation (AND)
12.74/5.05	
12.74/5.05	----------------------------------------
12.74/5.05	
12.74/5.05	(17)
12.74/5.05	Obligation:
12.74/5.05	Q DP problem:
12.74/5.05	The TRS P consists of the following rules:
12.74/5.05	
12.74/5.05	   new_filterM(vz3, :(vz40, vz41), ty_IO, h) -> new_primbindIO(vz3, vz41, vz40, h)
12.74/5.05	   new_primbindIO(vz3, vz41, vz40, h) -> new_filterM(vz3, vz41, ty_IO, h)
12.74/5.05	
12.74/5.05	The TRS R consists of the following rules:
12.74/5.05	
12.74/5.05	   new_gtGtEs2(:(vz50, vz51), vz3, vz41, vz40, h) -> new_psPs3(vz3, vz41, vz40, vz50, new_gtGtEs2(vz51, vz3, vz41, vz40, h), h)
12.74/5.05	   new_psPs2(vz14, vz13, vz8, h) -> :(vz14, new_psPs1(vz13, vz8, h))
12.74/5.05	   new_gtGtEs3([], vz50, vz40, h) -> []
12.74/5.05	   new_gtGtEs3(:(vz1110, vz1111), vz50, vz40, h) -> new_psPs1(new_return(new_filterM00(vz40, vz1110, vz50, h), h), new_gtGtEs3(vz1111, vz50, vz40, h), h)
12.74/5.05	   new_psPs4(:(vz110, vz111), vz50, vz40, vz8, h) -> new_psPs2(new_filterM00(vz40, vz110, vz50, h), new_psPs5(new_gtGtEs3(vz111, vz50, vz40, h), h), vz8, h)
12.74/5.05	   new_filterM00(vz40, vz90, False, h) -> vz90
12.74/5.05	   new_psPs4([], vz50, vz40, vz8, h) -> new_psPs5(vz8, h)
12.74/5.05	   new_psPs1(:(vz130, vz131), vz8, h) -> :(vz130, new_psPs1(vz131, vz8, h))
12.74/5.05	   new_gtGtEs2([], vz3, vz41, vz40, h) -> []
12.74/5.05	   new_return(vz15, h) -> :(vz15, [])
12.74/5.05	   new_psPs3(vz3, vz41, vz40, vz50, vz8, h) -> new_psPs4(new_filterM0(vz3, vz41, ty_[], h), vz50, vz40, vz8, h)
12.74/5.05	   new_psPs1([], vz8, h) -> vz8
12.74/5.05	   new_psPs5(vz8, h) -> vz8
12.74/5.05	   new_filterM00(vz40, vz90, True, h) -> :(vz40, vz90)
12.74/5.05	
12.74/5.05	The set Q consists of the following terms:
12.74/5.05	
12.74/5.05	   new_psPs1(:(x0, x1), x2, x3)
12.74/5.05	   new_psPs1([], x0, x1)
12.74/5.05	   new_filterM00(x0, x1, True, x2)
12.74/5.05	   new_psPs2(x0, x1, x2, x3)
12.74/5.05	   new_psPs4(:(x0, x1), x2, x3, x4, x5)
12.74/5.05	   new_psPs4([], x0, x1, x2, x3)
12.74/5.05	   new_gtGtEs3(:(x0, x1), x2, x3, x4)
12.74/5.05	   new_filterM00(x0, x1, False, x2)
12.74/5.05	   new_gtGtEs2(:(x0, x1), x2, x3, x4, x5)
12.74/5.05	   new_return(x0, x1)
12.74/5.05	   new_psPs3(x0, x1, x2, x3, x4, x5)
12.74/5.05	   new_gtGtEs2([], x0, x1, x2, x3)
12.74/5.05	   new_gtGtEs3([], x0, x1, x2)
12.74/5.05	   new_psPs5(x0, x1)
12.74/5.05	
12.74/5.05	We have to consider all minimal (P,Q,R)-chains.
12.74/5.05	----------------------------------------
12.74/5.05	
12.74/5.05	(18) QDPSizeChangeProof (EQUIVALENT)
12.74/5.05	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.74/5.05	
12.74/5.05	From the DPs we obtained the following set of size-change graphs:
12.74/5.05	*new_primbindIO(vz3, vz41, vz40, h) -> new_filterM(vz3, vz41, ty_IO, h)
12.74/5.05	The graph contains the following edges 1 >= 1, 2 >= 2, 4 >= 4
12.74/5.05	
12.74/5.05	
12.74/5.05	*new_filterM(vz3, :(vz40, vz41), ty_IO, h) -> new_primbindIO(vz3, vz41, vz40, h)
12.74/5.05	The graph contains the following edges 1 >= 1, 2 > 2, 2 > 3, 4 >= 4
12.74/5.05	
12.74/5.05	
12.74/5.05	----------------------------------------
12.74/5.05	
12.74/5.05	(19)
12.74/5.05	YES
12.74/5.05	
12.74/5.05	----------------------------------------
12.74/5.05	
12.74/5.05	(20)
12.74/5.05	Obligation:
12.74/5.05	Q DP problem:
12.74/5.05	The TRS P consists of the following rules:
12.74/5.05	
12.74/5.05	   new_gtGtEs1(vz3, vz41, vz40, h) -> new_filterM(vz3, vz41, ty_Maybe, h)
12.74/5.05	   new_filterM(vz3, :(vz40, vz41), ty_Maybe, h) -> new_gtGtEs1(vz3, vz41, vz40, h)
12.74/5.05	
12.74/5.05	The TRS R consists of the following rules:
12.74/5.05	
12.74/5.05	   new_gtGtEs2(:(vz50, vz51), vz3, vz41, vz40, h) -> new_psPs3(vz3, vz41, vz40, vz50, new_gtGtEs2(vz51, vz3, vz41, vz40, h), h)
12.74/5.05	   new_psPs2(vz14, vz13, vz8, h) -> :(vz14, new_psPs1(vz13, vz8, h))
12.74/5.05	   new_gtGtEs3([], vz50, vz40, h) -> []
12.74/5.05	   new_gtGtEs3(:(vz1110, vz1111), vz50, vz40, h) -> new_psPs1(new_return(new_filterM00(vz40, vz1110, vz50, h), h), new_gtGtEs3(vz1111, vz50, vz40, h), h)
12.74/5.05	   new_psPs4(:(vz110, vz111), vz50, vz40, vz8, h) -> new_psPs2(new_filterM00(vz40, vz110, vz50, h), new_psPs5(new_gtGtEs3(vz111, vz50, vz40, h), h), vz8, h)
12.74/5.05	   new_filterM00(vz40, vz90, False, h) -> vz90
12.74/5.05	   new_psPs4([], vz50, vz40, vz8, h) -> new_psPs5(vz8, h)
12.74/5.05	   new_psPs1(:(vz130, vz131), vz8, h) -> :(vz130, new_psPs1(vz131, vz8, h))
12.74/5.05	   new_gtGtEs2([], vz3, vz41, vz40, h) -> []
12.74/5.05	   new_return(vz15, h) -> :(vz15, [])
12.74/5.05	   new_psPs3(vz3, vz41, vz40, vz50, vz8, h) -> new_psPs4(new_filterM0(vz3, vz41, ty_[], h), vz50, vz40, vz8, h)
12.74/5.05	   new_psPs1([], vz8, h) -> vz8
12.74/5.05	   new_psPs5(vz8, h) -> vz8
12.74/5.05	   new_filterM00(vz40, vz90, True, h) -> :(vz40, vz90)
12.74/5.05	
12.74/5.05	The set Q consists of the following terms:
12.74/5.05	
12.74/5.05	   new_psPs1(:(x0, x1), x2, x3)
12.74/5.05	   new_psPs1([], x0, x1)
12.74/5.05	   new_filterM00(x0, x1, True, x2)
12.74/5.05	   new_psPs2(x0, x1, x2, x3)
12.74/5.05	   new_psPs4(:(x0, x1), x2, x3, x4, x5)
12.74/5.05	   new_psPs4([], x0, x1, x2, x3)
12.74/5.05	   new_gtGtEs3(:(x0, x1), x2, x3, x4)
12.74/5.05	   new_filterM00(x0, x1, False, x2)
12.74/5.05	   new_gtGtEs2(:(x0, x1), x2, x3, x4, x5)
12.74/5.05	   new_return(x0, x1)
12.74/5.05	   new_psPs3(x0, x1, x2, x3, x4, x5)
12.74/5.05	   new_gtGtEs2([], x0, x1, x2, x3)
12.74/5.05	   new_gtGtEs3([], x0, x1, x2)
12.74/5.05	   new_psPs5(x0, x1)
12.74/5.05	
12.74/5.05	We have to consider all minimal (P,Q,R)-chains.
12.74/5.05	----------------------------------------
12.74/5.05	
12.74/5.05	(21) QDPSizeChangeProof (EQUIVALENT)
12.74/5.05	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.74/5.05	
12.74/5.05	From the DPs we obtained the following set of size-change graphs:
12.74/5.05	*new_filterM(vz3, :(vz40, vz41), ty_Maybe, h) -> new_gtGtEs1(vz3, vz41, vz40, h)
12.74/5.05	The graph contains the following edges 1 >= 1, 2 > 2, 2 > 3, 4 >= 4
12.74/5.05	
12.74/5.05	
12.74/5.05	*new_gtGtEs1(vz3, vz41, vz40, h) -> new_filterM(vz3, vz41, ty_Maybe, h)
12.74/5.05	The graph contains the following edges 1 >= 1, 2 >= 2, 4 >= 4
12.74/5.05	
12.74/5.05	
12.74/5.05	----------------------------------------
12.74/5.05	
12.74/5.05	(22)
12.74/5.05	YES
12.74/5.05	
12.74/5.05	----------------------------------------
12.74/5.05	
12.74/5.05	(23)
12.74/5.05	Obligation:
12.74/5.05	Q DP problem:
12.74/5.05	The TRS P consists of the following rules:
12.74/5.05	
12.74/5.05	   new_gtGtEs0(vz3, vz41, vz40, h) -> new_psPs0(vz3, vz41, vz40, h)
12.74/5.05	   new_psPs0(vz3, vz41, vz40, h) -> new_filterM(vz3, vz41, ty_[], h)
12.74/5.05	   new_filterM(vz3, :(vz40, vz41), ty_[], h) -> new_gtGtEs0(vz3, vz41, vz40, h)
12.74/5.05	   new_gtGtEs0(vz3, vz41, vz40, h) -> new_gtGtEs0(vz3, vz41, vz40, h)
12.74/5.05	
12.74/5.05	The TRS R consists of the following rules:
12.74/5.05	
12.74/5.05	   new_gtGtEs2(:(vz50, vz51), vz3, vz41, vz40, h) -> new_psPs3(vz3, vz41, vz40, vz50, new_gtGtEs2(vz51, vz3, vz41, vz40, h), h)
12.74/5.05	   new_psPs2(vz14, vz13, vz8, h) -> :(vz14, new_psPs1(vz13, vz8, h))
12.74/5.05	   new_gtGtEs3([], vz50, vz40, h) -> []
12.74/5.05	   new_gtGtEs3(:(vz1110, vz1111), vz50, vz40, h) -> new_psPs1(new_return(new_filterM00(vz40, vz1110, vz50, h), h), new_gtGtEs3(vz1111, vz50, vz40, h), h)
12.74/5.05	   new_psPs4(:(vz110, vz111), vz50, vz40, vz8, h) -> new_psPs2(new_filterM00(vz40, vz110, vz50, h), new_psPs5(new_gtGtEs3(vz111, vz50, vz40, h), h), vz8, h)
12.74/5.05	   new_filterM00(vz40, vz90, False, h) -> vz90
12.74/5.05	   new_psPs4([], vz50, vz40, vz8, h) -> new_psPs5(vz8, h)
12.74/5.05	   new_psPs1(:(vz130, vz131), vz8, h) -> :(vz130, new_psPs1(vz131, vz8, h))
12.74/5.05	   new_gtGtEs2([], vz3, vz41, vz40, h) -> []
12.74/5.05	   new_return(vz15, h) -> :(vz15, [])
12.74/5.05	   new_psPs3(vz3, vz41, vz40, vz50, vz8, h) -> new_psPs4(new_filterM0(vz3, vz41, ty_[], h), vz50, vz40, vz8, h)
12.74/5.05	   new_psPs1([], vz8, h) -> vz8
12.74/5.05	   new_psPs5(vz8, h) -> vz8
12.74/5.05	   new_filterM00(vz40, vz90, True, h) -> :(vz40, vz90)
12.74/5.05	
12.74/5.05	The set Q consists of the following terms:
12.74/5.05	
12.74/5.05	   new_psPs1(:(x0, x1), x2, x3)
12.74/5.05	   new_psPs1([], x0, x1)
12.74/5.05	   new_filterM00(x0, x1, True, x2)
12.74/5.05	   new_psPs2(x0, x1, x2, x3)
12.74/5.05	   new_psPs4(:(x0, x1), x2, x3, x4, x5)
12.74/5.05	   new_psPs4([], x0, x1, x2, x3)
12.74/5.05	   new_gtGtEs3(:(x0, x1), x2, x3, x4)
12.74/5.05	   new_filterM00(x0, x1, False, x2)
12.74/5.05	   new_gtGtEs2(:(x0, x1), x2, x3, x4, x5)
12.74/5.05	   new_return(x0, x1)
12.74/5.05	   new_psPs3(x0, x1, x2, x3, x4, x5)
12.74/5.05	   new_gtGtEs2([], x0, x1, x2, x3)
12.74/5.05	   new_gtGtEs3([], x0, x1, x2)
12.74/5.05	   new_psPs5(x0, x1)
12.74/5.05	
12.74/5.05	We have to consider all minimal (P,Q,R)-chains.
12.74/5.05	----------------------------------------
12.74/5.05	
12.74/5.05	(24) QDPOrderProof (EQUIVALENT)
12.74/5.05	We use the reduction pair processor [LPAR04,JAR06].
12.74/5.05	
12.74/5.05	
12.74/5.05	The following pairs can be oriented strictly and are deleted.
12.74/5.05	
12.74/5.05	   new_psPs0(vz3, vz41, vz40, h) -> new_filterM(vz3, vz41, ty_[], h)
12.74/5.05	The remaining pairs can at least be oriented weakly.
12.74/5.05	Used ordering:  Polynomial interpretation [POLO]:
12.74/5.05	
12.74/5.05	   POL(:(x_1, x_2)) = 1 + x_1 + x_2
12.74/5.05	   POL(new_filterM(x_1, x_2, x_3, x_4)) = x_2
12.74/5.05	   POL(new_gtGtEs0(x_1, x_2, x_3, x_4)) = 1 + x_2 + x_3
12.74/5.05	   POL(new_psPs0(x_1, x_2, x_3, x_4)) = 1 + x_2 + x_3
12.74/5.05	   POL(ty_[]) = 1
12.74/5.05	
12.74/5.05	The following usable rules [FROCOS05] with respect to the argument filtering of the ordering [JAR06] were oriented:
12.74/5.05	none
12.74/5.05	
12.74/5.05	
12.74/5.05	----------------------------------------
12.74/5.05	
12.74/5.05	(25)
12.74/5.05	Obligation:
12.74/5.05	Q DP problem:
12.74/5.05	The TRS P consists of the following rules:
12.74/5.05	
12.74/5.05	   new_gtGtEs0(vz3, vz41, vz40, h) -> new_psPs0(vz3, vz41, vz40, h)
12.74/5.05	   new_filterM(vz3, :(vz40, vz41), ty_[], h) -> new_gtGtEs0(vz3, vz41, vz40, h)
12.74/5.05	   new_gtGtEs0(vz3, vz41, vz40, h) -> new_gtGtEs0(vz3, vz41, vz40, h)
12.74/5.05	
12.74/5.05	The TRS R consists of the following rules:
12.74/5.05	
12.74/5.05	   new_gtGtEs2(:(vz50, vz51), vz3, vz41, vz40, h) -> new_psPs3(vz3, vz41, vz40, vz50, new_gtGtEs2(vz51, vz3, vz41, vz40, h), h)
12.74/5.05	   new_psPs2(vz14, vz13, vz8, h) -> :(vz14, new_psPs1(vz13, vz8, h))
12.74/5.05	   new_gtGtEs3([], vz50, vz40, h) -> []
12.74/5.05	   new_gtGtEs3(:(vz1110, vz1111), vz50, vz40, h) -> new_psPs1(new_return(new_filterM00(vz40, vz1110, vz50, h), h), new_gtGtEs3(vz1111, vz50, vz40, h), h)
12.74/5.05	   new_psPs4(:(vz110, vz111), vz50, vz40, vz8, h) -> new_psPs2(new_filterM00(vz40, vz110, vz50, h), new_psPs5(new_gtGtEs3(vz111, vz50, vz40, h), h), vz8, h)
12.74/5.05	   new_filterM00(vz40, vz90, False, h) -> vz90
12.74/5.05	   new_psPs4([], vz50, vz40, vz8, h) -> new_psPs5(vz8, h)
12.74/5.05	   new_psPs1(:(vz130, vz131), vz8, h) -> :(vz130, new_psPs1(vz131, vz8, h))
12.74/5.05	   new_gtGtEs2([], vz3, vz41, vz40, h) -> []
12.74/5.05	   new_return(vz15, h) -> :(vz15, [])
12.74/5.05	   new_psPs3(vz3, vz41, vz40, vz50, vz8, h) -> new_psPs4(new_filterM0(vz3, vz41, ty_[], h), vz50, vz40, vz8, h)
12.74/5.05	   new_psPs1([], vz8, h) -> vz8
12.74/5.05	   new_psPs5(vz8, h) -> vz8
12.74/5.05	   new_filterM00(vz40, vz90, True, h) -> :(vz40, vz90)
12.74/5.05	
12.74/5.05	The set Q consists of the following terms:
12.74/5.05	
12.74/5.05	   new_psPs1(:(x0, x1), x2, x3)
12.74/5.05	   new_psPs1([], x0, x1)
12.74/5.05	   new_filterM00(x0, x1, True, x2)
12.74/5.05	   new_psPs2(x0, x1, x2, x3)
12.74/5.05	   new_psPs4(:(x0, x1), x2, x3, x4, x5)
12.74/5.05	   new_psPs4([], x0, x1, x2, x3)
12.74/5.05	   new_gtGtEs3(:(x0, x1), x2, x3, x4)
12.74/5.05	   new_filterM00(x0, x1, False, x2)
12.74/5.05	   new_gtGtEs2(:(x0, x1), x2, x3, x4, x5)
12.74/5.05	   new_return(x0, x1)
12.74/5.05	   new_psPs3(x0, x1, x2, x3, x4, x5)
12.74/5.05	   new_gtGtEs2([], x0, x1, x2, x3)
12.74/5.05	   new_gtGtEs3([], x0, x1, x2)
12.74/5.05	   new_psPs5(x0, x1)
12.74/5.05	
12.74/5.05	We have to consider all minimal (P,Q,R)-chains.
12.74/5.05	----------------------------------------
12.74/5.05	
12.74/5.05	(26) DependencyGraphProof (EQUIVALENT)
12.74/5.05	The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 1 SCC with 2 less nodes.
12.74/5.05	----------------------------------------
12.74/5.05	
12.74/5.05	(27)
12.74/5.05	Obligation:
12.74/5.05	Q DP problem:
12.74/5.05	The TRS P consists of the following rules:
12.74/5.05	
12.74/5.05	   new_gtGtEs0(vz3, vz41, vz40, h) -> new_gtGtEs0(vz3, vz41, vz40, h)
12.74/5.05	
12.74/5.05	The TRS R consists of the following rules:
12.74/5.05	
12.74/5.05	   new_gtGtEs2(:(vz50, vz51), vz3, vz41, vz40, h) -> new_psPs3(vz3, vz41, vz40, vz50, new_gtGtEs2(vz51, vz3, vz41, vz40, h), h)
12.74/5.05	   new_psPs2(vz14, vz13, vz8, h) -> :(vz14, new_psPs1(vz13, vz8, h))
12.74/5.05	   new_gtGtEs3([], vz50, vz40, h) -> []
12.74/5.05	   new_gtGtEs3(:(vz1110, vz1111), vz50, vz40, h) -> new_psPs1(new_return(new_filterM00(vz40, vz1110, vz50, h), h), new_gtGtEs3(vz1111, vz50, vz40, h), h)
12.74/5.05	   new_psPs4(:(vz110, vz111), vz50, vz40, vz8, h) -> new_psPs2(new_filterM00(vz40, vz110, vz50, h), new_psPs5(new_gtGtEs3(vz111, vz50, vz40, h), h), vz8, h)
12.74/5.05	   new_filterM00(vz40, vz90, False, h) -> vz90
12.74/5.05	   new_psPs4([], vz50, vz40, vz8, h) -> new_psPs5(vz8, h)
12.74/5.05	   new_psPs1(:(vz130, vz131), vz8, h) -> :(vz130, new_psPs1(vz131, vz8, h))
12.74/5.05	   new_gtGtEs2([], vz3, vz41, vz40, h) -> []
12.74/5.05	   new_return(vz15, h) -> :(vz15, [])
12.74/5.05	   new_psPs3(vz3, vz41, vz40, vz50, vz8, h) -> new_psPs4(new_filterM0(vz3, vz41, ty_[], h), vz50, vz40, vz8, h)
12.74/5.05	   new_psPs1([], vz8, h) -> vz8
12.74/5.05	   new_psPs5(vz8, h) -> vz8
12.74/5.05	   new_filterM00(vz40, vz90, True, h) -> :(vz40, vz90)
12.74/5.05	
12.74/5.05	The set Q consists of the following terms:
12.74/5.05	
12.74/5.05	   new_psPs1(:(x0, x1), x2, x3)
12.74/5.05	   new_psPs1([], x0, x1)
12.74/5.05	   new_filterM00(x0, x1, True, x2)
12.74/5.05	   new_psPs2(x0, x1, x2, x3)
12.74/5.05	   new_psPs4(:(x0, x1), x2, x3, x4, x5)
12.74/5.05	   new_psPs4([], x0, x1, x2, x3)
12.74/5.05	   new_gtGtEs3(:(x0, x1), x2, x3, x4)
12.74/5.05	   new_filterM00(x0, x1, False, x2)
12.74/5.05	   new_gtGtEs2(:(x0, x1), x2, x3, x4, x5)
12.74/5.05	   new_return(x0, x1)
12.74/5.05	   new_psPs3(x0, x1, x2, x3, x4, x5)
12.74/5.05	   new_gtGtEs2([], x0, x1, x2, x3)
12.74/5.05	   new_gtGtEs3([], x0, x1, x2)
12.74/5.05	   new_psPs5(x0, x1)
12.74/5.05	
12.74/5.05	We have to consider all minimal (P,Q,R)-chains.
12.74/5.05	----------------------------------------
12.74/5.05	
12.74/5.05	(28) MNOCProof (EQUIVALENT)
12.74/5.05	We use the modular non-overlap check [FROCOS05] to decrease Q to the empty set.
12.74/5.05	----------------------------------------
12.74/5.05	
12.74/5.05	(29)
12.74/5.05	Obligation:
12.74/5.05	Q DP problem:
12.74/5.05	The TRS P consists of the following rules:
12.74/5.05	
12.74/5.05	   new_gtGtEs0(vz3, vz41, vz40, h) -> new_gtGtEs0(vz3, vz41, vz40, h)
12.74/5.05	
12.74/5.05	The TRS R consists of the following rules:
12.74/5.05	
12.74/5.05	   new_gtGtEs2(:(vz50, vz51), vz3, vz41, vz40, h) -> new_psPs3(vz3, vz41, vz40, vz50, new_gtGtEs2(vz51, vz3, vz41, vz40, h), h)
12.74/5.05	   new_psPs2(vz14, vz13, vz8, h) -> :(vz14, new_psPs1(vz13, vz8, h))
12.74/5.05	   new_gtGtEs3([], vz50, vz40, h) -> []
12.74/5.05	   new_gtGtEs3(:(vz1110, vz1111), vz50, vz40, h) -> new_psPs1(new_return(new_filterM00(vz40, vz1110, vz50, h), h), new_gtGtEs3(vz1111, vz50, vz40, h), h)
12.74/5.05	   new_psPs4(:(vz110, vz111), vz50, vz40, vz8, h) -> new_psPs2(new_filterM00(vz40, vz110, vz50, h), new_psPs5(new_gtGtEs3(vz111, vz50, vz40, h), h), vz8, h)
12.74/5.05	   new_filterM00(vz40, vz90, False, h) -> vz90
12.74/5.05	   new_psPs4([], vz50, vz40, vz8, h) -> new_psPs5(vz8, h)
12.74/5.05	   new_psPs1(:(vz130, vz131), vz8, h) -> :(vz130, new_psPs1(vz131, vz8, h))
12.74/5.05	   new_gtGtEs2([], vz3, vz41, vz40, h) -> []
12.74/5.05	   new_return(vz15, h) -> :(vz15, [])
12.74/5.05	   new_psPs3(vz3, vz41, vz40, vz50, vz8, h) -> new_psPs4(new_filterM0(vz3, vz41, ty_[], h), vz50, vz40, vz8, h)
12.74/5.05	   new_psPs1([], vz8, h) -> vz8
12.74/5.05	   new_psPs5(vz8, h) -> vz8
12.74/5.05	   new_filterM00(vz40, vz90, True, h) -> :(vz40, vz90)
12.74/5.05	
12.74/5.05	Q is empty.
12.74/5.05	We have to consider all (P,Q,R)-chains.
12.74/5.05	----------------------------------------
12.74/5.05	
12.74/5.05	(30) NonTerminationLoopProof (COMPLETE)
12.74/5.05	We used the non-termination processor [FROCOS05] to show that the DP problem is infinite.
12.74/5.05	Found a loop by semiunifying a rule from P directly.
12.74/5.05	
12.74/5.05	s = new_gtGtEs0(vz3, vz41, vz40, h) evaluates to  t =new_gtGtEs0(vz3, vz41, vz40, h)
12.74/5.05	
12.74/5.05	Thus s starts an infinite chain as s semiunifies with t with the following substitutions:
12.74/5.05	* Matcher: [ ]
12.74/5.05	* Semiunifier: [ ]
12.74/5.05	
12.74/5.05	--------------------------------------------------------------------------------
12.74/5.05	Rewriting sequence
12.74/5.05	
12.74/5.05	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.74/5.05	
12.74/5.05	
12.74/5.05	
12.74/5.05	
12.74/5.05	----------------------------------------
12.74/5.05	
12.74/5.05	(31)
12.74/5.05	NO
12.74/5.05	
12.74/5.05	----------------------------------------
12.74/5.05	
12.74/5.05	(32)
12.74/5.05	Obligation:
12.74/5.05	Q DP problem:
12.74/5.05	The TRS P consists of the following rules:
12.74/5.05	
12.74/5.05	   new_psPs(:(vz130, vz131), vz8, h) -> new_psPs(vz131, vz8, h)
12.74/5.05	
12.74/5.05	R is empty.
12.74/5.05	Q is empty.
12.74/5.05	We have to consider all minimal (P,Q,R)-chains.
12.74/5.05	----------------------------------------
12.74/5.05	
12.74/5.05	(33) QDPSizeChangeProof (EQUIVALENT)
12.74/5.05	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.74/5.05	
12.74/5.05	From the DPs we obtained the following set of size-change graphs:
12.74/5.05	*new_psPs(:(vz130, vz131), vz8, h) -> new_psPs(vz131, vz8, h)
12.74/5.05	The graph contains the following edges 1 > 1, 2 >= 2, 3 >= 3
12.74/5.05	
12.74/5.05	
12.74/5.05	----------------------------------------
12.74/5.05	
12.74/5.05	(34)
12.74/5.05	YES
12.74/5.05	
12.74/5.05	----------------------------------------
12.74/5.05	
12.74/5.05	(35) Narrow (COMPLETE)
12.74/5.05	Haskell To QDPs
12.74/5.05	
12.74/5.05	digraph dp_graph {
12.74/5.05	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.74/5.05	3[label="Monad.filterM vz3",fontsize=16,color="grey",shape="box"];3 -> 4[label="",style="dashed", color="grey", weight=3];
12.74/5.05	4[label="Monad.filterM vz3 vz4",fontsize=16,color="burlywood",shape="triangle"];125[label="vz4/vz40 : vz41",fontsize=10,color="white",style="solid",shape="box"];4 -> 125[label="",style="solid", color="burlywood", weight=9];
12.74/5.05	125 -> 5[label="",style="solid", color="burlywood", weight=3];
12.74/5.05	126[label="vz4/[]",fontsize=10,color="white",style="solid",shape="box"];4 -> 126[label="",style="solid", color="burlywood", weight=9];
12.74/5.05	126 -> 6[label="",style="solid", color="burlywood", weight=3];
12.74/5.05	5[label="Monad.filterM vz3 (vz40 : vz41)",fontsize=16,color="black",shape="box"];5 -> 7[label="",style="solid", color="black", weight=3];
12.74/5.05	6[label="Monad.filterM vz3 []",fontsize=16,color="black",shape="box"];6 -> 8[label="",style="solid", color="black", weight=3];
12.74/5.05	7[label="vz3 vz40 >>= Monad.filterM1 vz3 vz41 vz40",fontsize=16,color="blue",shape="box"];127[label=">>= :: (IO Bool) -> (Bool -> IO ([] a)) -> IO ([] a)",fontsize=10,color="white",style="solid",shape="box"];7 -> 127[label="",style="solid", color="blue", weight=9];
12.74/5.05	127 -> 9[label="",style="solid", color="blue", weight=3];
12.74/5.05	128[label=">>= :: ([] Bool) -> (Bool -> [] ([] a)) -> [] ([] a)",fontsize=10,color="white",style="solid",shape="box"];7 -> 128[label="",style="solid", color="blue", weight=9];
12.74/5.05	128 -> 10[label="",style="solid", color="blue", weight=3];
12.74/5.05	129[label=">>= :: (Maybe Bool) -> (Bool -> Maybe ([] a)) -> Maybe ([] a)",fontsize=10,color="white",style="solid",shape="box"];7 -> 129[label="",style="solid", color="blue", weight=9];
12.74/5.05	129 -> 11[label="",style="solid", color="blue", weight=3];
12.74/5.05	8[label="return []",fontsize=16,color="blue",shape="box"];130[label="return :: ([] a) -> IO ([] a)",fontsize=10,color="white",style="solid",shape="box"];8 -> 130[label="",style="solid", color="blue", weight=9];
12.74/5.05	130 -> 12[label="",style="solid", color="blue", weight=3];
12.74/5.05	131[label="return :: ([] a) -> [] ([] a)",fontsize=10,color="white",style="solid",shape="box"];8 -> 131[label="",style="solid", color="blue", weight=9];
12.74/5.05	131 -> 13[label="",style="solid", color="blue", weight=3];
12.74/5.05	132[label="return :: ([] a) -> Maybe ([] a)",fontsize=10,color="white",style="solid",shape="box"];8 -> 132[label="",style="solid", color="blue", weight=9];
12.74/5.05	132 -> 14[label="",style="solid", color="blue", weight=3];
12.74/5.05	9[label="vz3 vz40 >>= Monad.filterM1 vz3 vz41 vz40",fontsize=16,color="black",shape="box"];9 -> 15[label="",style="solid", color="black", weight=3];
12.74/5.05	10 -> 16[label="",style="dashed", color="red", weight=0];
12.74/5.05	10[label="vz3 vz40 >>= Monad.filterM1 vz3 vz41 vz40",fontsize=16,color="magenta"];10 -> 17[label="",style="dashed", color="magenta", weight=3];
12.74/5.05	11 -> 18[label="",style="dashed", color="red", weight=0];
12.74/5.05	11[label="vz3 vz40 >>= Monad.filterM1 vz3 vz41 vz40",fontsize=16,color="magenta"];11 -> 19[label="",style="dashed", color="magenta", weight=3];
12.74/5.05	12[label="return []",fontsize=16,color="black",shape="box"];12 -> 20[label="",style="solid", color="black", weight=3];
12.74/5.05	13 -> 118[label="",style="dashed", color="red", weight=0];
12.74/5.05	13[label="return []",fontsize=16,color="magenta"];13 -> 119[label="",style="dashed", color="magenta", weight=3];
12.74/5.05	14[label="return []",fontsize=16,color="black",shape="box"];14 -> 22[label="",style="solid", color="black", weight=3];
12.74/5.05	15 -> 23[label="",style="dashed", color="red", weight=0];
12.74/5.05	15[label="primbindIO (vz3 vz40) (Monad.filterM1 vz3 vz41 vz40)",fontsize=16,color="magenta"];15 -> 24[label="",style="dashed", color="magenta", weight=3];
12.74/5.05	17[label="vz3 vz40",fontsize=16,color="green",shape="box"];17 -> 25[label="",style="dashed", color="green", weight=3];
12.74/5.05	16[label="vz5 >>= Monad.filterM1 vz3 vz41 vz40",fontsize=16,color="burlywood",shape="triangle"];133[label="vz5/vz50 : vz51",fontsize=10,color="white",style="solid",shape="box"];16 -> 133[label="",style="solid", color="burlywood", weight=9];
12.74/5.05	133 -> 26[label="",style="solid", color="burlywood", weight=3];
12.74/5.05	134[label="vz5/[]",fontsize=10,color="white",style="solid",shape="box"];16 -> 134[label="",style="solid", color="burlywood", weight=9];
12.74/5.05	134 -> 27[label="",style="solid", color="burlywood", weight=3];
12.74/5.05	19[label="vz3 vz40",fontsize=16,color="green",shape="box"];19 -> 28[label="",style="dashed", color="green", weight=3];
12.74/5.05	18[label="vz6 >>= Monad.filterM1 vz3 vz41 vz40",fontsize=16,color="burlywood",shape="triangle"];135[label="vz6/Nothing",fontsize=10,color="white",style="solid",shape="box"];18 -> 135[label="",style="solid", color="burlywood", weight=9];
12.74/5.05	135 -> 29[label="",style="solid", color="burlywood", weight=3];
12.74/5.05	136[label="vz6/Just vz60",fontsize=10,color="white",style="solid",shape="box"];18 -> 136[label="",style="solid", color="burlywood", weight=9];
12.74/5.05	136 -> 30[label="",style="solid", color="burlywood", weight=3];
12.74/5.05	20 -> 89[label="",style="dashed", color="red", weight=0];
12.74/5.05	20[label="primretIO []",fontsize=16,color="magenta"];20 -> 90[label="",style="dashed", color="magenta", weight=3];
12.74/5.05	119[label="[]",fontsize=16,color="green",shape="box"];118[label="return vz15",fontsize=16,color="black",shape="triangle"];118 -> 121[label="",style="solid", color="black", weight=3];
12.74/5.05	22[label="Just []",fontsize=16,color="green",shape="box"];24[label="vz3 vz40",fontsize=16,color="green",shape="box"];24 -> 37[label="",style="dashed", color="green", weight=3];
12.74/5.05	23[label="primbindIO vz7 (Monad.filterM1 vz3 vz41 vz40)",fontsize=16,color="burlywood",shape="triangle"];137[label="vz7/IO vz70",fontsize=10,color="white",style="solid",shape="box"];23 -> 137[label="",style="solid", color="burlywood", weight=9];
12.74/5.05	137 -> 33[label="",style="solid", color="burlywood", weight=3];
12.74/5.05	138[label="vz7/AProVE_IO vz70",fontsize=10,color="white",style="solid",shape="box"];23 -> 138[label="",style="solid", color="burlywood", weight=9];
12.74/5.05	138 -> 34[label="",style="solid", color="burlywood", weight=3];
12.74/5.05	139[label="vz7/AProVE_Exception vz70",fontsize=10,color="white",style="solid",shape="box"];23 -> 139[label="",style="solid", color="burlywood", weight=9];
12.74/5.05	139 -> 35[label="",style="solid", color="burlywood", weight=3];
12.74/5.05	140[label="vz7/AProVE_Error vz70",fontsize=10,color="white",style="solid",shape="box"];23 -> 140[label="",style="solid", color="burlywood", weight=9];
12.74/5.05	140 -> 36[label="",style="solid", color="burlywood", weight=3];
12.74/5.05	25[label="vz40",fontsize=16,color="green",shape="box"];26[label="vz50 : vz51 >>= Monad.filterM1 vz3 vz41 vz40",fontsize=16,color="black",shape="box"];26 -> 38[label="",style="solid", color="black", weight=3];
12.74/5.05	27[label="[] >>= Monad.filterM1 vz3 vz41 vz40",fontsize=16,color="black",shape="box"];27 -> 39[label="",style="solid", color="black", weight=3];
12.74/5.05	28[label="vz40",fontsize=16,color="green",shape="box"];29[label="Nothing >>= Monad.filterM1 vz3 vz41 vz40",fontsize=16,color="black",shape="box"];29 -> 40[label="",style="solid", color="black", weight=3];
12.74/5.05	30[label="Just vz60 >>= Monad.filterM1 vz3 vz41 vz40",fontsize=16,color="black",shape="box"];30 -> 41[label="",style="solid", color="black", weight=3];
12.74/5.05	90[label="[]",fontsize=16,color="green",shape="box"];89[label="primretIO vz12",fontsize=16,color="black",shape="triangle"];89 -> 92[label="",style="solid", color="black", weight=3];
12.74/5.05	121[label="vz15 : []",fontsize=16,color="green",shape="box"];37[label="vz40",fontsize=16,color="green",shape="box"];33[label="primbindIO (IO vz70) (Monad.filterM1 vz3 vz41 vz40)",fontsize=16,color="black",shape="box"];33 -> 42[label="",style="solid", color="black", weight=3];
12.74/5.05	34[label="primbindIO (AProVE_IO vz70) (Monad.filterM1 vz3 vz41 vz40)",fontsize=16,color="black",shape="box"];34 -> 43[label="",style="solid", color="black", weight=3];
12.74/5.05	35[label="primbindIO (AProVE_Exception vz70) (Monad.filterM1 vz3 vz41 vz40)",fontsize=16,color="black",shape="box"];35 -> 44[label="",style="solid", color="black", weight=3];
12.74/5.05	36[label="primbindIO (AProVE_Error vz70) (Monad.filterM1 vz3 vz41 vz40)",fontsize=16,color="black",shape="box"];36 -> 45[label="",style="solid", color="black", weight=3];
12.74/5.05	38 -> 46[label="",style="dashed", color="red", weight=0];
12.74/5.05	38[label="Monad.filterM1 vz3 vz41 vz40 vz50 ++ (vz51 >>= Monad.filterM1 vz3 vz41 vz40)",fontsize=16,color="magenta"];38 -> 47[label="",style="dashed", color="magenta", weight=3];
12.74/5.05	39[label="[]",fontsize=16,color="green",shape="box"];40[label="Nothing",fontsize=16,color="green",shape="box"];41[label="Monad.filterM1 vz3 vz41 vz40 vz60",fontsize=16,color="black",shape="box"];41 -> 48[label="",style="solid", color="black", weight=3];
12.74/5.05	92[label="AProVE_IO vz12",fontsize=16,color="green",shape="box"];42[label="error []",fontsize=16,color="red",shape="box"];43[label="Monad.filterM1 vz3 vz41 vz40 vz70",fontsize=16,color="black",shape="box"];43 -> 49[label="",style="solid", color="black", weight=3];
12.74/5.05	44[label="AProVE_Exception vz70",fontsize=16,color="green",shape="box"];45[label="AProVE_Error vz70",fontsize=16,color="green",shape="box"];47 -> 16[label="",style="dashed", color="red", weight=0];
12.74/5.05	47[label="vz51 >>= Monad.filterM1 vz3 vz41 vz40",fontsize=16,color="magenta"];47 -> 50[label="",style="dashed", color="magenta", weight=3];
12.74/5.05	46[label="Monad.filterM1 vz3 vz41 vz40 vz50 ++ vz8",fontsize=16,color="black",shape="triangle"];46 -> 51[label="",style="solid", color="black", weight=3];
12.74/5.05	48 -> 52[label="",style="dashed", color="red", weight=0];
12.74/5.05	48[label="Monad.filterM vz3 vz41 >>= Monad.filterM0 vz60 vz40",fontsize=16,color="magenta"];48 -> 53[label="",style="dashed", color="magenta", weight=3];
12.74/5.05	49 -> 54[label="",style="dashed", color="red", weight=0];
12.74/5.05	49[label="Monad.filterM vz3 vz41 >>= Monad.filterM0 vz70 vz40",fontsize=16,color="magenta"];49 -> 55[label="",style="dashed", color="magenta", weight=3];
12.74/5.05	50[label="vz51",fontsize=16,color="green",shape="box"];51 -> 56[label="",style="dashed", color="red", weight=0];
12.74/5.05	51[label="(Monad.filterM vz3 vz41 >>= Monad.filterM0 vz50 vz40) ++ vz8",fontsize=16,color="magenta"];51 -> 57[label="",style="dashed", color="magenta", weight=3];
12.74/5.05	53 -> 4[label="",style="dashed", color="red", weight=0];
12.74/5.05	53[label="Monad.filterM vz3 vz41",fontsize=16,color="magenta"];53 -> 58[label="",style="dashed", color="magenta", weight=3];
12.74/5.05	52[label="vz9 >>= Monad.filterM0 vz60 vz40",fontsize=16,color="burlywood",shape="triangle"];141[label="vz9/Nothing",fontsize=10,color="white",style="solid",shape="box"];52 -> 141[label="",style="solid", color="burlywood", weight=9];
12.74/5.05	141 -> 59[label="",style="solid", color="burlywood", weight=3];
12.74/5.05	142[label="vz9/Just vz90",fontsize=10,color="white",style="solid",shape="box"];52 -> 142[label="",style="solid", color="burlywood", weight=9];
12.74/5.05	142 -> 60[label="",style="solid", color="burlywood", weight=3];
12.74/5.05	55 -> 4[label="",style="dashed", color="red", weight=0];
12.74/5.05	55[label="Monad.filterM vz3 vz41",fontsize=16,color="magenta"];55 -> 61[label="",style="dashed", color="magenta", weight=3];
12.74/5.05	54[label="vz10 >>= Monad.filterM0 vz70 vz40",fontsize=16,color="black",shape="triangle"];54 -> 62[label="",style="solid", color="black", weight=3];
12.74/5.05	57 -> 4[label="",style="dashed", color="red", weight=0];
12.74/5.05	57[label="Monad.filterM vz3 vz41",fontsize=16,color="magenta"];57 -> 63[label="",style="dashed", color="magenta", weight=3];
12.74/5.05	56[label="(vz11 >>= Monad.filterM0 vz50 vz40) ++ vz8",fontsize=16,color="burlywood",shape="triangle"];143[label="vz11/vz110 : vz111",fontsize=10,color="white",style="solid",shape="box"];56 -> 143[label="",style="solid", color="burlywood", weight=9];
12.74/5.05	143 -> 64[label="",style="solid", color="burlywood", weight=3];
12.74/5.05	144[label="vz11/[]",fontsize=10,color="white",style="solid",shape="box"];56 -> 144[label="",style="solid", color="burlywood", weight=9];
12.74/5.05	144 -> 65[label="",style="solid", color="burlywood", weight=3];
12.74/5.05	58[label="vz41",fontsize=16,color="green",shape="box"];59[label="Nothing >>= Monad.filterM0 vz60 vz40",fontsize=16,color="black",shape="box"];59 -> 66[label="",style="solid", color="black", weight=3];
12.74/5.05	60[label="Just vz90 >>= Monad.filterM0 vz60 vz40",fontsize=16,color="black",shape="box"];60 -> 67[label="",style="solid", color="black", weight=3];
12.74/5.05	61[label="vz41",fontsize=16,color="green",shape="box"];62[label="primbindIO vz10 (Monad.filterM0 vz70 vz40)",fontsize=16,color="burlywood",shape="box"];145[label="vz10/IO vz100",fontsize=10,color="white",style="solid",shape="box"];62 -> 145[label="",style="solid", color="burlywood", weight=9];
12.74/5.05	145 -> 68[label="",style="solid", color="burlywood", weight=3];
12.74/5.05	146[label="vz10/AProVE_IO vz100",fontsize=10,color="white",style="solid",shape="box"];62 -> 146[label="",style="solid", color="burlywood", weight=9];
12.74/5.05	146 -> 69[label="",style="solid", color="burlywood", weight=3];
12.74/5.05	147[label="vz10/AProVE_Exception vz100",fontsize=10,color="white",style="solid",shape="box"];62 -> 147[label="",style="solid", color="burlywood", weight=9];
12.74/5.05	147 -> 70[label="",style="solid", color="burlywood", weight=3];
12.74/5.05	148[label="vz10/AProVE_Error vz100",fontsize=10,color="white",style="solid",shape="box"];62 -> 148[label="",style="solid", color="burlywood", weight=9];
12.74/5.05	148 -> 71[label="",style="solid", color="burlywood", weight=3];
12.74/5.05	63[label="vz41",fontsize=16,color="green",shape="box"];64[label="(vz110 : vz111 >>= Monad.filterM0 vz50 vz40) ++ vz8",fontsize=16,color="black",shape="box"];64 -> 72[label="",style="solid", color="black", weight=3];
12.74/5.05	65[label="([] >>= Monad.filterM0 vz50 vz40) ++ vz8",fontsize=16,color="black",shape="box"];65 -> 73[label="",style="solid", color="black", weight=3];
12.74/5.05	66[label="Nothing",fontsize=16,color="green",shape="box"];67[label="Monad.filterM0 vz60 vz40 vz90",fontsize=16,color="black",shape="box"];67 -> 74[label="",style="solid", color="black", weight=3];
12.74/5.05	68[label="primbindIO (IO vz100) (Monad.filterM0 vz70 vz40)",fontsize=16,color="black",shape="box"];68 -> 75[label="",style="solid", color="black", weight=3];
12.74/5.05	69[label="primbindIO (AProVE_IO vz100) (Monad.filterM0 vz70 vz40)",fontsize=16,color="black",shape="box"];69 -> 76[label="",style="solid", color="black", weight=3];
12.74/5.05	70[label="primbindIO (AProVE_Exception vz100) (Monad.filterM0 vz70 vz40)",fontsize=16,color="black",shape="box"];70 -> 77[label="",style="solid", color="black", weight=3];
12.74/5.05	71[label="primbindIO (AProVE_Error vz100) (Monad.filterM0 vz70 vz40)",fontsize=16,color="black",shape="box"];71 -> 78[label="",style="solid", color="black", weight=3];
12.74/5.05	72[label="(Monad.filterM0 vz50 vz40 vz110 ++ (vz111 >>= Monad.filterM0 vz50 vz40)) ++ vz8",fontsize=16,color="black",shape="box"];72 -> 79[label="",style="solid", color="black", weight=3];
12.74/5.05	73[label="[] ++ vz8",fontsize=16,color="black",shape="triangle"];73 -> 80[label="",style="solid", color="black", weight=3];
12.74/5.05	74[label="return (Monad.filterM00 vz40 vz90 vz60)",fontsize=16,color="black",shape="box"];74 -> 81[label="",style="solid", color="black", weight=3];
12.74/5.05	75[label="error []",fontsize=16,color="red",shape="box"];76[label="Monad.filterM0 vz70 vz40 vz100",fontsize=16,color="black",shape="box"];76 -> 82[label="",style="solid", color="black", weight=3];
12.74/5.05	77[label="AProVE_Exception vz100",fontsize=16,color="green",shape="box"];78[label="AProVE_Error vz100",fontsize=16,color="green",shape="box"];79[label="(return (Monad.filterM00 vz40 vz110 vz50) ++ (vz111 >>= Monad.filterM0 vz50 vz40)) ++ vz8",fontsize=16,color="black",shape="box"];79 -> 83[label="",style="solid", color="black", weight=3];
12.74/5.05	80[label="vz8",fontsize=16,color="green",shape="box"];81[label="Just (Monad.filterM00 vz40 vz90 vz60)",fontsize=16,color="green",shape="box"];81 -> 84[label="",style="dashed", color="green", weight=3];
12.74/5.05	82[label="return (Monad.filterM00 vz40 vz100 vz70)",fontsize=16,color="black",shape="box"];82 -> 85[label="",style="solid", color="black", weight=3];
12.74/5.05	83[label="((Monad.filterM00 vz40 vz110 vz50 : []) ++ (vz111 >>= Monad.filterM0 vz50 vz40)) ++ vz8",fontsize=16,color="black",shape="box"];83 -> 86[label="",style="solid", color="black", weight=3];
12.74/5.05	84[label="Monad.filterM00 vz40 vz90 vz60",fontsize=16,color="burlywood",shape="triangle"];149[label="vz60/False",fontsize=10,color="white",style="solid",shape="box"];84 -> 149[label="",style="solid", color="burlywood", weight=9];
12.74/5.05	149 -> 87[label="",style="solid", color="burlywood", weight=3];
12.74/5.05	150[label="vz60/True",fontsize=10,color="white",style="solid",shape="box"];84 -> 150[label="",style="solid", color="burlywood", weight=9];
12.74/5.05	150 -> 88[label="",style="solid", color="burlywood", weight=3];
12.74/5.05	85 -> 89[label="",style="dashed", color="red", weight=0];
12.74/5.05	85[label="primretIO (Monad.filterM00 vz40 vz100 vz70)",fontsize=16,color="magenta"];85 -> 91[label="",style="dashed", color="magenta", weight=3];
12.74/5.05	86 -> 93[label="",style="dashed", color="red", weight=0];
12.74/5.05	86[label="(Monad.filterM00 vz40 vz110 vz50 : [] ++ (vz111 >>= Monad.filterM0 vz50 vz40)) ++ vz8",fontsize=16,color="magenta"];86 -> 94[label="",style="dashed", color="magenta", weight=3];
12.74/5.05	86 -> 95[label="",style="dashed", color="magenta", weight=3];
12.74/5.05	87[label="Monad.filterM00 vz40 vz90 False",fontsize=16,color="black",shape="box"];87 -> 96[label="",style="solid", color="black", weight=3];
12.74/5.05	88[label="Monad.filterM00 vz40 vz90 True",fontsize=16,color="black",shape="box"];88 -> 97[label="",style="solid", color="black", weight=3];
12.74/5.05	91 -> 84[label="",style="dashed", color="red", weight=0];
12.74/5.05	91[label="Monad.filterM00 vz40 vz100 vz70",fontsize=16,color="magenta"];91 -> 98[label="",style="dashed", color="magenta", weight=3];
12.74/5.05	91 -> 99[label="",style="dashed", color="magenta", weight=3];
12.74/5.05	94 -> 84[label="",style="dashed", color="red", weight=0];
12.74/5.05	94[label="Monad.filterM00 vz40 vz110 vz50",fontsize=16,color="magenta"];94 -> 100[label="",style="dashed", color="magenta", weight=3];
12.74/5.05	94 -> 101[label="",style="dashed", color="magenta", weight=3];
12.74/5.05	95 -> 73[label="",style="dashed", color="red", weight=0];
12.74/5.05	95[label="[] ++ (vz111 >>= Monad.filterM0 vz50 vz40)",fontsize=16,color="magenta"];95 -> 102[label="",style="dashed", color="magenta", weight=3];
12.74/5.05	93[label="(vz14 : vz13) ++ vz8",fontsize=16,color="black",shape="triangle"];93 -> 103[label="",style="solid", color="black", weight=3];
12.74/5.05	96[label="vz90",fontsize=16,color="green",shape="box"];97[label="vz40 : vz90",fontsize=16,color="green",shape="box"];98[label="vz70",fontsize=16,color="green",shape="box"];99[label="vz100",fontsize=16,color="green",shape="box"];100[label="vz50",fontsize=16,color="green",shape="box"];101[label="vz110",fontsize=16,color="green",shape="box"];102[label="vz111 >>= Monad.filterM0 vz50 vz40",fontsize=16,color="burlywood",shape="triangle"];151[label="vz111/vz1110 : vz1111",fontsize=10,color="white",style="solid",shape="box"];102 -> 151[label="",style="solid", color="burlywood", weight=9];
12.74/5.05	151 -> 104[label="",style="solid", color="burlywood", weight=3];
12.74/5.05	152[label="vz111/[]",fontsize=10,color="white",style="solid",shape="box"];102 -> 152[label="",style="solid", color="burlywood", weight=9];
12.74/5.05	152 -> 105[label="",style="solid", color="burlywood", weight=3];
12.74/5.05	103[label="vz14 : vz13 ++ vz8",fontsize=16,color="green",shape="box"];103 -> 106[label="",style="dashed", color="green", weight=3];
12.74/5.05	104[label="vz1110 : vz1111 >>= Monad.filterM0 vz50 vz40",fontsize=16,color="black",shape="box"];104 -> 107[label="",style="solid", color="black", weight=3];
12.74/5.05	105[label="[] >>= Monad.filterM0 vz50 vz40",fontsize=16,color="black",shape="box"];105 -> 108[label="",style="solid", color="black", weight=3];
12.74/5.05	106[label="vz13 ++ vz8",fontsize=16,color="burlywood",shape="triangle"];153[label="vz13/vz130 : vz131",fontsize=10,color="white",style="solid",shape="box"];106 -> 153[label="",style="solid", color="burlywood", weight=9];
12.74/5.05	153 -> 109[label="",style="solid", color="burlywood", weight=3];
12.74/5.05	154[label="vz13/[]",fontsize=10,color="white",style="solid",shape="box"];106 -> 154[label="",style="solid", color="burlywood", weight=9];
12.74/5.05	154 -> 110[label="",style="solid", color="burlywood", weight=3];
12.74/5.05	107 -> 106[label="",style="dashed", color="red", weight=0];
12.74/5.05	107[label="Monad.filterM0 vz50 vz40 vz1110 ++ (vz1111 >>= Monad.filterM0 vz50 vz40)",fontsize=16,color="magenta"];107 -> 111[label="",style="dashed", color="magenta", weight=3];
12.74/5.05	107 -> 112[label="",style="dashed", color="magenta", weight=3];
12.74/5.05	108[label="[]",fontsize=16,color="green",shape="box"];109[label="(vz130 : vz131) ++ vz8",fontsize=16,color="black",shape="box"];109 -> 113[label="",style="solid", color="black", weight=3];
12.74/5.05	110[label="[] ++ vz8",fontsize=16,color="black",shape="box"];110 -> 114[label="",style="solid", color="black", weight=3];
12.74/5.05	111 -> 102[label="",style="dashed", color="red", weight=0];
12.74/5.05	111[label="vz1111 >>= Monad.filterM0 vz50 vz40",fontsize=16,color="magenta"];111 -> 115[label="",style="dashed", color="magenta", weight=3];
12.74/5.05	112[label="Monad.filterM0 vz50 vz40 vz1110",fontsize=16,color="black",shape="box"];112 -> 116[label="",style="solid", color="black", weight=3];
12.74/5.05	113[label="vz130 : vz131 ++ vz8",fontsize=16,color="green",shape="box"];113 -> 117[label="",style="dashed", color="green", weight=3];
12.74/5.05	114[label="vz8",fontsize=16,color="green",shape="box"];115[label="vz1111",fontsize=16,color="green",shape="box"];116 -> 118[label="",style="dashed", color="red", weight=0];
12.74/5.05	116[label="return (Monad.filterM00 vz40 vz1110 vz50)",fontsize=16,color="magenta"];116 -> 120[label="",style="dashed", color="magenta", weight=3];
12.74/5.05	117 -> 106[label="",style="dashed", color="red", weight=0];
12.74/5.05	117[label="vz131 ++ vz8",fontsize=16,color="magenta"];117 -> 122[label="",style="dashed", color="magenta", weight=3];
12.74/5.05	120 -> 84[label="",style="dashed", color="red", weight=0];
12.74/5.05	120[label="Monad.filterM00 vz40 vz1110 vz50",fontsize=16,color="magenta"];120 -> 123[label="",style="dashed", color="magenta", weight=3];
12.74/5.05	120 -> 124[label="",style="dashed", color="magenta", weight=3];
12.74/5.05	122[label="vz131",fontsize=16,color="green",shape="box"];123[label="vz50",fontsize=16,color="green",shape="box"];124[label="vz1110",fontsize=16,color="green",shape="box"];}
12.74/5.05	
12.74/5.05	----------------------------------------
12.74/5.05	
12.74/5.05	(36)
12.74/5.05	TRUE
12.74/5.08	EOF