10.25/4.90	MAYBE
12.36/5.49	proof of /export/starexec/sandbox/benchmark/theBenchmark.hs
12.36/5.49	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
12.36/5.49	
12.36/5.49	
12.36/5.49	H-Termination with start terms of the given HASKELL could not be shown:
12.36/5.49	
12.36/5.49	(0) HASKELL
12.36/5.49	(1) LR [EQUIVALENT, 0 ms]
12.36/5.49	(2) HASKELL
12.36/5.49	(3) BR [EQUIVALENT, 0 ms]
12.36/5.49	(4) HASKELL
12.36/5.49	(5) COR [EQUIVALENT, 0 ms]
12.36/5.49	(6) HASKELL
12.36/5.49	(7) Narrow [SOUND, 0 ms]
12.36/5.49	(8) AND
12.36/5.49	    (9) QDP
12.36/5.49	        (10) QDPSizeChangeProof [EQUIVALENT, 0 ms]
12.36/5.49	        (11) YES
12.36/5.49	    (12) QDP
12.36/5.49	        (13) QDPOrderProof [EQUIVALENT, 27 ms]
12.36/5.49	        (14) QDP
12.36/5.49	        (15) DependencyGraphProof [EQUIVALENT, 0 ms]
12.36/5.49	        (16) QDP
12.36/5.49	        (17) MNOCProof [EQUIVALENT, 0 ms]
12.36/5.49	        (18) QDP
12.36/5.49	        (19) NonTerminationLoopProof [COMPLETE, 0 ms]
12.36/5.49	        (20) NO
12.36/5.49	    (21) QDP
12.36/5.49	        (22) QDPSizeChangeProof [EQUIVALENT, 0 ms]
12.36/5.49	        (23) YES
12.36/5.49	(24) Narrow [COMPLETE, 0 ms]
12.36/5.49	(25) TRUE
12.36/5.49	
12.36/5.49	
12.36/5.49	----------------------------------------
12.36/5.49	
12.36/5.49	(0)
12.36/5.49	Obligation:
12.36/5.49	mainModule Main 
12.36/5.49	module Maybe where {
12.36/5.49	import qualified Main;
12.36/5.49	import qualified Monad;
12.36/5.49	import qualified Prelude;
12.36/5.49	}
12.36/5.49	module Main where {
12.36/5.49	import qualified Maybe;
12.36/5.49	import qualified Monad;
12.36/5.49	import qualified Prelude;
12.36/5.49	}
12.36/5.49	module Monad where {
12.36/5.49	import qualified Main;
12.36/5.49	import qualified Maybe;
12.36/5.49	import qualified Prelude;
12.36/5.49	zipWithM :: Monad a => (d  ->  c  ->  a b)  ->  [d]  ->  [c]  ->  a [b];
12.36/5.49	zipWithM f xs ys = sequence (zipWith f xs ys);
12.36/5.49	
12.36/5.49	}
12.36/5.49	
12.36/5.49	----------------------------------------
12.36/5.49	
12.36/5.49	(1) LR (EQUIVALENT)
12.36/5.49	Lambda Reductions:
12.36/5.49	The following Lambda expression
12.36/5.49	"\xs->return (x : xs)"
12.36/5.49	is transformed to
12.36/5.49	"sequence0 x xs = return (x : xs);
12.36/5.49	"
12.36/5.49	The following Lambda expression
12.36/5.49	"\x->sequence cs >>= sequence0 x"
12.36/5.49	is transformed to
12.36/5.49	"sequence1 cs x = sequence cs >>= sequence0 x;
12.36/5.49	"
12.36/5.49	
12.36/5.49	----------------------------------------
12.36/5.49	
12.36/5.49	(2)
12.36/5.49	Obligation:
12.36/5.49	mainModule Main 
12.36/5.49	module Maybe where {
12.36/5.49	import qualified Main;
12.36/5.49	import qualified Monad;
12.36/5.49	import qualified Prelude;
12.36/5.49	}
12.36/5.49	module Main where {
12.36/5.49	import qualified Maybe;
12.36/5.49	import qualified Monad;
12.36/5.49	import qualified Prelude;
12.36/5.49	}
12.36/5.49	module Monad where {
12.36/5.49	import qualified Main;
12.36/5.49	import qualified Maybe;
12.36/5.49	import qualified Prelude;
12.36/5.49	zipWithM :: Monad c => (d  ->  b  ->  c a)  ->  [d]  ->  [b]  ->  c [a];
12.36/5.49	zipWithM f xs ys = sequence (zipWith f xs ys);
12.36/5.49	
12.36/5.49	}
12.36/5.49	
12.36/5.49	----------------------------------------
12.36/5.49	
12.36/5.49	(3) BR (EQUIVALENT)
12.36/5.49	Replaced joker patterns by fresh variables and removed binding patterns.
12.36/5.49	----------------------------------------
12.36/5.49	
12.36/5.49	(4)
12.36/5.49	Obligation:
12.36/5.49	mainModule Main 
12.36/5.49	module Maybe where {
12.36/5.49	import qualified Main;
12.36/5.49	import qualified Monad;
12.36/5.49	import qualified Prelude;
12.36/5.49	}
12.36/5.49	module Main where {
12.36/5.49	import qualified Maybe;
12.36/5.49	import qualified Monad;
12.36/5.49	import qualified Prelude;
12.36/5.49	}
12.36/5.49	module Monad where {
12.36/5.49	import qualified Main;
12.36/5.49	import qualified Maybe;
12.36/5.49	import qualified Prelude;
12.36/5.49	zipWithM :: Monad d => (b  ->  a  ->  d c)  ->  [b]  ->  [a]  ->  d [c];
12.36/5.49	zipWithM f xs ys = sequence (zipWith f xs ys);
12.36/5.49	
12.36/5.49	}
12.36/5.49	
12.36/5.49	----------------------------------------
12.36/5.49	
12.36/5.49	(5) COR (EQUIVALENT)
12.36/5.49	Cond Reductions:
12.36/5.49	The following Function with conditions
12.36/5.49	"undefined |Falseundefined;
12.36/5.49	"
12.36/5.49	is transformed to
12.36/5.49	"undefined  = undefined1;
12.36/5.49	"
12.36/5.49	"undefined0 True = undefined;
12.36/5.49	"
12.36/5.49	"undefined1  = undefined0 False;
12.36/5.49	"
12.36/5.49	
12.36/5.49	----------------------------------------
12.36/5.49	
12.36/5.49	(6)
12.36/5.49	Obligation:
12.36/5.49	mainModule Main 
12.36/5.49	module Maybe where {
12.36/5.49	import qualified Main;
12.36/5.49	import qualified Monad;
12.36/5.49	import qualified Prelude;
12.36/5.49	}
12.36/5.49	module Main where {
12.36/5.49	import qualified Maybe;
12.36/5.49	import qualified Monad;
12.36/5.49	import qualified Prelude;
12.36/5.49	}
12.36/5.49	module Monad where {
12.36/5.49	import qualified Main;
12.36/5.49	import qualified Maybe;
12.36/5.49	import qualified Prelude;
12.36/5.49	zipWithM :: Monad b => (c  ->  a  ->  b d)  ->  [c]  ->  [a]  ->  b [d];
12.36/5.49	zipWithM f xs ys = sequence (zipWith f xs ys);
12.36/5.49	
12.36/5.49	}
12.36/5.49	
12.36/5.49	----------------------------------------
12.36/5.49	
12.36/5.49	(7) Narrow (SOUND)
12.36/5.49	Haskell To QDPs
12.36/5.49	
12.36/5.49	digraph dp_graph {
12.36/5.49	node [outthreshold=100, inthreshold=100];1[label="Monad.zipWithM",fontsize=16,color="grey",shape="box"];1 -> 3[label="",style="dashed", color="grey", weight=3];
12.36/5.49	3[label="Monad.zipWithM wv3",fontsize=16,color="grey",shape="box"];3 -> 4[label="",style="dashed", color="grey", weight=3];
12.36/5.49	4[label="Monad.zipWithM wv3 wv4",fontsize=16,color="grey",shape="box"];4 -> 5[label="",style="dashed", color="grey", weight=3];
12.36/5.49	5[label="Monad.zipWithM wv3 wv4 wv5",fontsize=16,color="black",shape="triangle"];5 -> 6[label="",style="solid", color="black", weight=3];
12.36/5.49	6[label="sequence (zipWith wv3 wv4 wv5)",fontsize=16,color="burlywood",shape="triangle"];63[label="wv4/wv40 : wv41",fontsize=10,color="white",style="solid",shape="box"];6 -> 63[label="",style="solid", color="burlywood", weight=9];
12.36/5.49	63 -> 7[label="",style="solid", color="burlywood", weight=3];
12.36/5.49	64[label="wv4/[]",fontsize=10,color="white",style="solid",shape="box"];6 -> 64[label="",style="solid", color="burlywood", weight=9];
12.36/5.49	64 -> 8[label="",style="solid", color="burlywood", weight=3];
12.36/5.49	7[label="sequence (zipWith wv3 (wv40 : wv41) wv5)",fontsize=16,color="burlywood",shape="box"];65[label="wv5/wv50 : wv51",fontsize=10,color="white",style="solid",shape="box"];7 -> 65[label="",style="solid", color="burlywood", weight=9];
12.36/5.49	65 -> 9[label="",style="solid", color="burlywood", weight=3];
12.36/5.49	66[label="wv5/[]",fontsize=10,color="white",style="solid",shape="box"];7 -> 66[label="",style="solid", color="burlywood", weight=9];
12.36/5.49	66 -> 10[label="",style="solid", color="burlywood", weight=3];
12.36/5.49	8[label="sequence (zipWith wv3 [] wv5)",fontsize=16,color="black",shape="box"];8 -> 11[label="",style="solid", color="black", weight=3];
12.36/5.49	9[label="sequence (zipWith wv3 (wv40 : wv41) (wv50 : wv51))",fontsize=16,color="black",shape="box"];9 -> 12[label="",style="solid", color="black", weight=3];
12.36/5.49	10[label="sequence (zipWith wv3 (wv40 : wv41) [])",fontsize=16,color="black",shape="box"];10 -> 13[label="",style="solid", color="black", weight=3];
12.36/5.49	11[label="sequence []",fontsize=16,color="black",shape="triangle"];11 -> 14[label="",style="solid", color="black", weight=3];
12.36/5.49	12[label="sequence (wv3 wv40 wv50 : zipWith wv3 wv41 wv51)",fontsize=16,color="black",shape="box"];12 -> 15[label="",style="solid", color="black", weight=3];
12.36/5.49	13 -> 11[label="",style="dashed", color="red", weight=0];
12.36/5.49	13[label="sequence []",fontsize=16,color="magenta"];14[label="return []",fontsize=16,color="black",shape="box"];14 -> 16[label="",style="solid", color="black", weight=3];
12.36/5.49	15 -> 17[label="",style="dashed", color="red", weight=0];
12.36/5.49	15[label="wv3 wv40 wv50 >>= sequence1 (zipWith wv3 wv41 wv51)",fontsize=16,color="magenta"];15 -> 18[label="",style="dashed", color="magenta", weight=3];
12.36/5.49	16[label="[] : []",fontsize=16,color="green",shape="box"];18[label="wv3 wv40 wv50",fontsize=16,color="green",shape="box"];18 -> 23[label="",style="dashed", color="green", weight=3];
12.36/5.49	18 -> 24[label="",style="dashed", color="green", weight=3];
12.36/5.49	17[label="wv6 >>= sequence1 (zipWith wv3 wv41 wv51)",fontsize=16,color="burlywood",shape="triangle"];67[label="wv6/wv60 : wv61",fontsize=10,color="white",style="solid",shape="box"];17 -> 67[label="",style="solid", color="burlywood", weight=9];
12.36/5.49	67 -> 21[label="",style="solid", color="burlywood", weight=3];
12.36/5.49	68[label="wv6/[]",fontsize=10,color="white",style="solid",shape="box"];17 -> 68[label="",style="solid", color="burlywood", weight=9];
12.36/5.49	68 -> 22[label="",style="solid", color="burlywood", weight=3];
12.36/5.49	23[label="wv40",fontsize=16,color="green",shape="box"];24[label="wv50",fontsize=16,color="green",shape="box"];21[label="wv60 : wv61 >>= sequence1 (zipWith wv3 wv41 wv51)",fontsize=16,color="black",shape="box"];21 -> 25[label="",style="solid", color="black", weight=3];
12.36/5.49	22[label="[] >>= sequence1 (zipWith wv3 wv41 wv51)",fontsize=16,color="black",shape="box"];22 -> 26[label="",style="solid", color="black", weight=3];
12.36/5.49	25 -> 27[label="",style="dashed", color="red", weight=0];
12.36/5.49	25[label="sequence1 (zipWith wv3 wv41 wv51) wv60 ++ (wv61 >>= sequence1 (zipWith wv3 wv41 wv51))",fontsize=16,color="magenta"];25 -> 28[label="",style="dashed", color="magenta", weight=3];
12.36/5.49	26[label="[]",fontsize=16,color="green",shape="box"];28 -> 17[label="",style="dashed", color="red", weight=0];
12.36/5.49	28[label="wv61 >>= sequence1 (zipWith wv3 wv41 wv51)",fontsize=16,color="magenta"];28 -> 29[label="",style="dashed", color="magenta", weight=3];
12.36/5.49	27[label="sequence1 (zipWith wv3 wv41 wv51) wv60 ++ wv7",fontsize=16,color="black",shape="triangle"];27 -> 30[label="",style="solid", color="black", weight=3];
12.36/5.49	29[label="wv61",fontsize=16,color="green",shape="box"];30 -> 31[label="",style="dashed", color="red", weight=0];
12.36/5.49	30[label="(sequence (zipWith wv3 wv41 wv51) >>= sequence0 wv60) ++ wv7",fontsize=16,color="magenta"];30 -> 32[label="",style="dashed", color="magenta", weight=3];
12.36/5.49	32 -> 6[label="",style="dashed", color="red", weight=0];
12.36/5.49	32[label="sequence (zipWith wv3 wv41 wv51)",fontsize=16,color="magenta"];32 -> 33[label="",style="dashed", color="magenta", weight=3];
12.36/5.49	32 -> 34[label="",style="dashed", color="magenta", weight=3];
12.36/5.49	31[label="(wv8 >>= sequence0 wv60) ++ wv7",fontsize=16,color="burlywood",shape="triangle"];69[label="wv8/wv80 : wv81",fontsize=10,color="white",style="solid",shape="box"];31 -> 69[label="",style="solid", color="burlywood", weight=9];
12.36/5.49	69 -> 35[label="",style="solid", color="burlywood", weight=3];
12.36/5.49	70[label="wv8/[]",fontsize=10,color="white",style="solid",shape="box"];31 -> 70[label="",style="solid", color="burlywood", weight=9];
12.36/5.49	70 -> 36[label="",style="solid", color="burlywood", weight=3];
12.36/5.49	33[label="wv51",fontsize=16,color="green",shape="box"];34[label="wv41",fontsize=16,color="green",shape="box"];35[label="(wv80 : wv81 >>= sequence0 wv60) ++ wv7",fontsize=16,color="black",shape="box"];35 -> 37[label="",style="solid", color="black", weight=3];
12.36/5.49	36[label="([] >>= sequence0 wv60) ++ wv7",fontsize=16,color="black",shape="box"];36 -> 38[label="",style="solid", color="black", weight=3];
12.36/5.49	37[label="(sequence0 wv60 wv80 ++ (wv81 >>= sequence0 wv60)) ++ wv7",fontsize=16,color="black",shape="box"];37 -> 39[label="",style="solid", color="black", weight=3];
12.36/5.49	38[label="[] ++ wv7",fontsize=16,color="black",shape="triangle"];38 -> 40[label="",style="solid", color="black", weight=3];
12.36/5.49	39[label="(return (wv60 : wv80) ++ (wv81 >>= sequence0 wv60)) ++ wv7",fontsize=16,color="black",shape="box"];39 -> 41[label="",style="solid", color="black", weight=3];
12.36/5.49	40[label="wv7",fontsize=16,color="green",shape="box"];41[label="(((wv60 : wv80) : []) ++ (wv81 >>= sequence0 wv60)) ++ wv7",fontsize=16,color="black",shape="box"];41 -> 42[label="",style="solid", color="black", weight=3];
12.36/5.49	42 -> 43[label="",style="dashed", color="red", weight=0];
12.36/5.49	42[label="((wv60 : wv80) : [] ++ (wv81 >>= sequence0 wv60)) ++ wv7",fontsize=16,color="magenta"];42 -> 44[label="",style="dashed", color="magenta", weight=3];
12.36/5.49	44 -> 38[label="",style="dashed", color="red", weight=0];
12.36/5.49	44[label="[] ++ (wv81 >>= sequence0 wv60)",fontsize=16,color="magenta"];44 -> 45[label="",style="dashed", color="magenta", weight=3];
12.36/5.49	43[label="((wv60 : wv80) : wv9) ++ wv7",fontsize=16,color="black",shape="triangle"];43 -> 46[label="",style="solid", color="black", weight=3];
12.36/5.49	45[label="wv81 >>= sequence0 wv60",fontsize=16,color="burlywood",shape="triangle"];71[label="wv81/wv810 : wv811",fontsize=10,color="white",style="solid",shape="box"];45 -> 71[label="",style="solid", color="burlywood", weight=9];
12.36/5.49	71 -> 47[label="",style="solid", color="burlywood", weight=3];
12.36/5.49	72[label="wv81/[]",fontsize=10,color="white",style="solid",shape="box"];45 -> 72[label="",style="solid", color="burlywood", weight=9];
12.36/5.49	72 -> 48[label="",style="solid", color="burlywood", weight=3];
12.36/5.49	46[label="(wv60 : wv80) : wv9 ++ wv7",fontsize=16,color="green",shape="box"];46 -> 49[label="",style="dashed", color="green", weight=3];
12.36/5.49	47[label="wv810 : wv811 >>= sequence0 wv60",fontsize=16,color="black",shape="box"];47 -> 50[label="",style="solid", color="black", weight=3];
12.36/5.49	48[label="[] >>= sequence0 wv60",fontsize=16,color="black",shape="box"];48 -> 51[label="",style="solid", color="black", weight=3];
12.36/5.49	49[label="wv9 ++ wv7",fontsize=16,color="burlywood",shape="triangle"];73[label="wv9/wv90 : wv91",fontsize=10,color="white",style="solid",shape="box"];49 -> 73[label="",style="solid", color="burlywood", weight=9];
12.36/5.49	73 -> 52[label="",style="solid", color="burlywood", weight=3];
12.36/5.49	74[label="wv9/[]",fontsize=10,color="white",style="solid",shape="box"];49 -> 74[label="",style="solid", color="burlywood", weight=9];
12.36/5.49	74 -> 53[label="",style="solid", color="burlywood", weight=3];
12.36/5.49	50 -> 49[label="",style="dashed", color="red", weight=0];
12.36/5.49	50[label="sequence0 wv60 wv810 ++ (wv811 >>= sequence0 wv60)",fontsize=16,color="magenta"];50 -> 54[label="",style="dashed", color="magenta", weight=3];
12.36/5.49	50 -> 55[label="",style="dashed", color="magenta", weight=3];
12.36/5.49	51[label="[]",fontsize=16,color="green",shape="box"];52[label="(wv90 : wv91) ++ wv7",fontsize=16,color="black",shape="box"];52 -> 56[label="",style="solid", color="black", weight=3];
12.36/5.49	53[label="[] ++ wv7",fontsize=16,color="black",shape="box"];53 -> 57[label="",style="solid", color="black", weight=3];
12.36/5.49	54[label="sequence0 wv60 wv810",fontsize=16,color="black",shape="box"];54 -> 58[label="",style="solid", color="black", weight=3];
12.36/5.49	55 -> 45[label="",style="dashed", color="red", weight=0];
12.36/5.49	55[label="wv811 >>= sequence0 wv60",fontsize=16,color="magenta"];55 -> 59[label="",style="dashed", color="magenta", weight=3];
12.36/5.49	56[label="wv90 : wv91 ++ wv7",fontsize=16,color="green",shape="box"];56 -> 60[label="",style="dashed", color="green", weight=3];
12.36/5.49	57[label="wv7",fontsize=16,color="green",shape="box"];58[label="return (wv60 : wv810)",fontsize=16,color="black",shape="box"];58 -> 61[label="",style="solid", color="black", weight=3];
12.36/5.49	59[label="wv811",fontsize=16,color="green",shape="box"];60 -> 49[label="",style="dashed", color="red", weight=0];
12.36/5.49	60[label="wv91 ++ wv7",fontsize=16,color="magenta"];60 -> 62[label="",style="dashed", color="magenta", weight=3];
12.36/5.49	61[label="(wv60 : wv810) : []",fontsize=16,color="green",shape="box"];62[label="wv91",fontsize=16,color="green",shape="box"];}
12.36/5.49	
12.36/5.49	----------------------------------------
12.36/5.49	
12.36/5.49	(8)
12.36/5.49	Complex Obligation (AND)
12.36/5.49	
12.36/5.49	----------------------------------------
12.36/5.49	
12.36/5.49	(9)
12.36/5.49	Obligation:
12.36/5.49	Q DP problem:
12.36/5.49	The TRS P consists of the following rules:
12.36/5.49	
12.36/5.49	   new_gtGtEs(:(wv810, wv811), wv60, h) -> new_gtGtEs(wv811, wv60, h)
12.36/5.49	
12.36/5.49	R is empty.
12.36/5.49	Q is empty.
12.36/5.49	We have to consider all minimal (P,Q,R)-chains.
12.36/5.49	----------------------------------------
12.36/5.49	
12.36/5.49	(10) QDPSizeChangeProof (EQUIVALENT)
12.36/5.49	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.36/5.49	
12.36/5.49	From the DPs we obtained the following set of size-change graphs:
12.36/5.49	*new_gtGtEs(:(wv810, wv811), wv60, h) -> new_gtGtEs(wv811, wv60, h)
12.36/5.49	The graph contains the following edges 1 > 1, 2 >= 2, 3 >= 3
12.36/5.49	
12.36/5.49	
12.36/5.49	----------------------------------------
12.36/5.49	
12.36/5.49	(11)
12.36/5.49	YES
12.36/5.49	
12.36/5.49	----------------------------------------
12.36/5.49	
12.36/5.49	(12)
12.36/5.49	Obligation:
12.36/5.49	Q DP problem:
12.36/5.49	The TRS P consists of the following rules:
12.36/5.49	
12.36/5.49	   new_gtGtEs0(wv3, wv41, wv51, h, ba, bb) -> new_psPs0(wv3, wv41, wv51, h, ba, bb)
12.36/5.49	   new_psPs0(wv3, wv41, wv51, h, ba, bb) -> new_sequence(wv3, wv41, wv51, h, ba, bb)
12.36/5.49	   new_gtGtEs0(wv3, wv41, wv51, h, ba, bb) -> new_gtGtEs0(wv3, wv41, wv51, h, ba, bb)
12.36/5.49	   new_sequence(wv3, :(wv40, wv41), :(wv50, wv51), h, ba, bb) -> new_gtGtEs0(wv3, wv41, wv51, h, ba, bb)
12.36/5.49	
12.36/5.49	The TRS R consists of the following rules:
12.36/5.49	
12.36/5.49	   new_gtGtEs2(:(wv810, wv811), wv60, h) -> new_psPs1(:(:(wv60, wv810), []), new_gtGtEs2(wv811, wv60, h), h)
12.36/5.49	   new_gtGtEs1([], wv3, wv41, wv51, h, ba, bb) -> []
12.36/5.49	   new_psPs2(wv3, wv41, wv51, wv60, wv7, h, ba, bb) -> new_psPs4(new_sequence0(wv3, wv41, wv51, h, ba, bb), wv60, wv7, h)
12.36/5.49	   new_psPs1(:(wv90, wv91), wv7, h) -> :(wv90, new_psPs1(wv91, wv7, h))
12.36/5.49	   new_psPs3(wv60, wv80, wv9, wv7, h) -> :(:(wv60, wv80), new_psPs1(wv9, wv7, h))
12.36/5.49	   new_gtGtEs2([], wv60, h) -> []
12.36/5.49	   new_psPs1([], wv7, h) -> wv7
12.36/5.49	   new_gtGtEs1(:(wv60, wv61), wv3, wv41, wv51, h, ba, bb) -> new_psPs2(wv3, wv41, wv51, wv60, new_gtGtEs1(wv61, wv3, wv41, wv51, h, ba, bb), h, ba, bb)
12.36/5.49	   new_psPs4(:(wv80, wv81), wv60, wv7, h) -> new_psPs3(wv60, wv80, new_psPs5(new_gtGtEs2(wv81, wv60, h), h), wv7, h)
12.36/5.49	   new_psPs4([], wv60, wv7, h) -> new_psPs5(wv7, h)
12.36/5.49	   new_psPs5(wv7, h) -> wv7
12.36/5.49	
12.36/5.49	The set Q consists of the following terms:
12.36/5.49	
12.36/5.49	   new_psPs1(:(x0, x1), x2, x3)
12.36/5.49	   new_gtGtEs2(:(x0, x1), x2, x3)
12.36/5.49	   new_psPs2(x0, x1, x2, x3, x4, x5, x6, x7)
12.36/5.49	   new_gtGtEs1(:(x0, x1), x2, x3, x4, x5, x6, x7)
12.36/5.49	   new_psPs3(x0, x1, x2, x3, x4)
12.36/5.49	   new_psPs4(:(x0, x1), x2, x3, x4)
12.36/5.49	   new_psPs4([], x0, x1, x2)
12.36/5.49	   new_gtGtEs1([], x0, x1, x2, x3, x4, x5)
12.36/5.49	   new_gtGtEs2([], x0, x1)
12.36/5.49	   new_psPs1([], x0, x1)
12.36/5.49	   new_psPs5(x0, x1)
12.36/5.49	
12.36/5.49	We have to consider all minimal (P,Q,R)-chains.
12.36/5.49	----------------------------------------
12.36/5.49	
12.36/5.49	(13) QDPOrderProof (EQUIVALENT)
12.36/5.49	We use the reduction pair processor [LPAR04,JAR06].
12.36/5.49	
12.36/5.49	
12.36/5.49	The following pairs can be oriented strictly and are deleted.
12.36/5.49	
12.36/5.49	   new_sequence(wv3, :(wv40, wv41), :(wv50, wv51), h, ba, bb) -> new_gtGtEs0(wv3, wv41, wv51, h, ba, bb)
12.36/5.49	The remaining pairs can at least be oriented weakly.
12.36/5.49	Used ordering:  Polynomial interpretation [POLO]:
12.36/5.49	
12.36/5.49	   POL(:(x_1, x_2)) = 1 + x_2
12.36/5.49	   POL(new_gtGtEs0(x_1, x_2, x_3, x_4, x_5, x_6)) = x_2 + x_3
12.36/5.49	   POL(new_psPs0(x_1, x_2, x_3, x_4, x_5, x_6)) = x_2 + x_3
12.36/5.49	   POL(new_sequence(x_1, x_2, x_3, x_4, x_5, x_6)) = x_2 + x_3
12.36/5.49	
12.36/5.49	The following usable rules [FROCOS05] with respect to the argument filtering of the ordering [JAR06] were oriented:
12.36/5.49	none
12.36/5.49	
12.36/5.49	
12.36/5.49	----------------------------------------
12.36/5.49	
12.36/5.49	(14)
12.36/5.49	Obligation:
12.36/5.49	Q DP problem:
12.36/5.49	The TRS P consists of the following rules:
12.36/5.49	
12.36/5.49	   new_gtGtEs0(wv3, wv41, wv51, h, ba, bb) -> new_psPs0(wv3, wv41, wv51, h, ba, bb)
12.36/5.49	   new_psPs0(wv3, wv41, wv51, h, ba, bb) -> new_sequence(wv3, wv41, wv51, h, ba, bb)
12.36/5.49	   new_gtGtEs0(wv3, wv41, wv51, h, ba, bb) -> new_gtGtEs0(wv3, wv41, wv51, h, ba, bb)
12.36/5.49	
12.36/5.49	The TRS R consists of the following rules:
12.36/5.49	
12.36/5.49	   new_gtGtEs2(:(wv810, wv811), wv60, h) -> new_psPs1(:(:(wv60, wv810), []), new_gtGtEs2(wv811, wv60, h), h)
12.36/5.49	   new_gtGtEs1([], wv3, wv41, wv51, h, ba, bb) -> []
12.36/5.49	   new_psPs2(wv3, wv41, wv51, wv60, wv7, h, ba, bb) -> new_psPs4(new_sequence0(wv3, wv41, wv51, h, ba, bb), wv60, wv7, h)
12.36/5.49	   new_psPs1(:(wv90, wv91), wv7, h) -> :(wv90, new_psPs1(wv91, wv7, h))
12.36/5.49	   new_psPs3(wv60, wv80, wv9, wv7, h) -> :(:(wv60, wv80), new_psPs1(wv9, wv7, h))
12.36/5.49	   new_gtGtEs2([], wv60, h) -> []
12.36/5.49	   new_psPs1([], wv7, h) -> wv7
12.36/5.49	   new_gtGtEs1(:(wv60, wv61), wv3, wv41, wv51, h, ba, bb) -> new_psPs2(wv3, wv41, wv51, wv60, new_gtGtEs1(wv61, wv3, wv41, wv51, h, ba, bb), h, ba, bb)
12.36/5.49	   new_psPs4(:(wv80, wv81), wv60, wv7, h) -> new_psPs3(wv60, wv80, new_psPs5(new_gtGtEs2(wv81, wv60, h), h), wv7, h)
12.36/5.49	   new_psPs4([], wv60, wv7, h) -> new_psPs5(wv7, h)
12.36/5.49	   new_psPs5(wv7, h) -> wv7
12.36/5.49	
12.36/5.49	The set Q consists of the following terms:
12.36/5.49	
12.36/5.49	   new_psPs1(:(x0, x1), x2, x3)
12.36/5.49	   new_gtGtEs2(:(x0, x1), x2, x3)
12.36/5.49	   new_psPs2(x0, x1, x2, x3, x4, x5, x6, x7)
12.36/5.49	   new_gtGtEs1(:(x0, x1), x2, x3, x4, x5, x6, x7)
12.36/5.49	   new_psPs3(x0, x1, x2, x3, x4)
12.36/5.49	   new_psPs4(:(x0, x1), x2, x3, x4)
12.36/5.49	   new_psPs4([], x0, x1, x2)
12.36/5.49	   new_gtGtEs1([], x0, x1, x2, x3, x4, x5)
12.36/5.49	   new_gtGtEs2([], x0, x1)
12.36/5.49	   new_psPs1([], x0, x1)
12.36/5.49	   new_psPs5(x0, x1)
12.36/5.49	
12.36/5.49	We have to consider all minimal (P,Q,R)-chains.
12.36/5.49	----------------------------------------
12.36/5.49	
12.36/5.49	(15) DependencyGraphProof (EQUIVALENT)
12.36/5.49	The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 1 SCC with 2 less nodes.
12.36/5.49	----------------------------------------
12.36/5.49	
12.36/5.49	(16)
12.36/5.49	Obligation:
12.36/5.49	Q DP problem:
12.36/5.49	The TRS P consists of the following rules:
12.36/5.49	
12.36/5.49	   new_gtGtEs0(wv3, wv41, wv51, h, ba, bb) -> new_gtGtEs0(wv3, wv41, wv51, h, ba, bb)
12.36/5.49	
12.36/5.49	The TRS R consists of the following rules:
12.36/5.49	
12.36/5.49	   new_gtGtEs2(:(wv810, wv811), wv60, h) -> new_psPs1(:(:(wv60, wv810), []), new_gtGtEs2(wv811, wv60, h), h)
12.36/5.49	   new_gtGtEs1([], wv3, wv41, wv51, h, ba, bb) -> []
12.36/5.49	   new_psPs2(wv3, wv41, wv51, wv60, wv7, h, ba, bb) -> new_psPs4(new_sequence0(wv3, wv41, wv51, h, ba, bb), wv60, wv7, h)
12.36/5.49	   new_psPs1(:(wv90, wv91), wv7, h) -> :(wv90, new_psPs1(wv91, wv7, h))
12.36/5.49	   new_psPs3(wv60, wv80, wv9, wv7, h) -> :(:(wv60, wv80), new_psPs1(wv9, wv7, h))
12.36/5.49	   new_gtGtEs2([], wv60, h) -> []
12.36/5.49	   new_psPs1([], wv7, h) -> wv7
12.36/5.49	   new_gtGtEs1(:(wv60, wv61), wv3, wv41, wv51, h, ba, bb) -> new_psPs2(wv3, wv41, wv51, wv60, new_gtGtEs1(wv61, wv3, wv41, wv51, h, ba, bb), h, ba, bb)
12.36/5.49	   new_psPs4(:(wv80, wv81), wv60, wv7, h) -> new_psPs3(wv60, wv80, new_psPs5(new_gtGtEs2(wv81, wv60, h), h), wv7, h)
12.36/5.49	   new_psPs4([], wv60, wv7, h) -> new_psPs5(wv7, h)
12.36/5.49	   new_psPs5(wv7, h) -> wv7
12.36/5.49	
12.36/5.49	The set Q consists of the following terms:
12.36/5.49	
12.36/5.49	   new_psPs1(:(x0, x1), x2, x3)
12.36/5.49	   new_gtGtEs2(:(x0, x1), x2, x3)
12.36/5.49	   new_psPs2(x0, x1, x2, x3, x4, x5, x6, x7)
12.36/5.49	   new_gtGtEs1(:(x0, x1), x2, x3, x4, x5, x6, x7)
12.36/5.49	   new_psPs3(x0, x1, x2, x3, x4)
12.36/5.49	   new_psPs4(:(x0, x1), x2, x3, x4)
12.36/5.49	   new_psPs4([], x0, x1, x2)
12.36/5.50	   new_gtGtEs1([], x0, x1, x2, x3, x4, x5)
12.36/5.50	   new_gtGtEs2([], x0, x1)
12.36/5.50	   new_psPs1([], x0, x1)
12.36/5.50	   new_psPs5(x0, x1)
12.36/5.50	
12.36/5.50	We have to consider all minimal (P,Q,R)-chains.
12.36/5.50	----------------------------------------
12.36/5.50	
12.36/5.50	(17) MNOCProof (EQUIVALENT)
12.36/5.50	We use the modular non-overlap check [FROCOS05] to decrease Q to the empty set.
12.36/5.50	----------------------------------------
12.36/5.50	
12.36/5.50	(18)
12.36/5.50	Obligation:
12.36/5.50	Q DP problem:
12.36/5.50	The TRS P consists of the following rules:
12.36/5.50	
12.36/5.50	   new_gtGtEs0(wv3, wv41, wv51, h, ba, bb) -> new_gtGtEs0(wv3, wv41, wv51, h, ba, bb)
12.36/5.50	
12.36/5.50	The TRS R consists of the following rules:
12.36/5.50	
12.36/5.50	   new_gtGtEs2(:(wv810, wv811), wv60, h) -> new_psPs1(:(:(wv60, wv810), []), new_gtGtEs2(wv811, wv60, h), h)
12.36/5.50	   new_gtGtEs1([], wv3, wv41, wv51, h, ba, bb) -> []
12.36/5.50	   new_psPs2(wv3, wv41, wv51, wv60, wv7, h, ba, bb) -> new_psPs4(new_sequence0(wv3, wv41, wv51, h, ba, bb), wv60, wv7, h)
12.36/5.50	   new_psPs1(:(wv90, wv91), wv7, h) -> :(wv90, new_psPs1(wv91, wv7, h))
12.36/5.50	   new_psPs3(wv60, wv80, wv9, wv7, h) -> :(:(wv60, wv80), new_psPs1(wv9, wv7, h))
12.36/5.50	   new_gtGtEs2([], wv60, h) -> []
12.36/5.50	   new_psPs1([], wv7, h) -> wv7
12.36/5.50	   new_gtGtEs1(:(wv60, wv61), wv3, wv41, wv51, h, ba, bb) -> new_psPs2(wv3, wv41, wv51, wv60, new_gtGtEs1(wv61, wv3, wv41, wv51, h, ba, bb), h, ba, bb)
12.36/5.50	   new_psPs4(:(wv80, wv81), wv60, wv7, h) -> new_psPs3(wv60, wv80, new_psPs5(new_gtGtEs2(wv81, wv60, h), h), wv7, h)
12.36/5.50	   new_psPs4([], wv60, wv7, h) -> new_psPs5(wv7, h)
12.36/5.50	   new_psPs5(wv7, h) -> wv7
12.36/5.50	
12.36/5.50	Q is empty.
12.36/5.50	We have to consider all (P,Q,R)-chains.
12.36/5.50	----------------------------------------
12.36/5.50	
12.36/5.50	(19) NonTerminationLoopProof (COMPLETE)
12.36/5.50	We used the non-termination processor [FROCOS05] to show that the DP problem is infinite.
12.36/5.50	Found a loop by semiunifying a rule from P directly.
12.36/5.50	
12.36/5.50	s = new_gtGtEs0(wv3, wv41, wv51, h, ba, bb) evaluates to  t =new_gtGtEs0(wv3, wv41, wv51, h, ba, bb)
12.36/5.50	
12.36/5.50	Thus s starts an infinite chain as s semiunifies with t with the following substitutions:
12.36/5.50	* Matcher: [ ]
12.36/5.50	* Semiunifier: [ ]
12.36/5.50	
12.36/5.50	--------------------------------------------------------------------------------
12.36/5.50	Rewriting sequence
12.36/5.50	
12.36/5.50	The DP semiunifies directly so there is only one rewrite step from new_gtGtEs0(wv3, wv41, wv51, h, ba, bb) to new_gtGtEs0(wv3, wv41, wv51, h, ba, bb).
12.36/5.50	
12.36/5.50	
12.36/5.50	
12.36/5.50	
12.36/5.50	----------------------------------------
12.36/5.50	
12.36/5.50	(20)
12.36/5.50	NO
12.36/5.50	
12.36/5.50	----------------------------------------
12.36/5.50	
12.36/5.50	(21)
12.36/5.50	Obligation:
12.36/5.50	Q DP problem:
12.36/5.50	The TRS P consists of the following rules:
12.36/5.50	
12.36/5.50	   new_psPs(:(wv90, wv91), wv7, h) -> new_psPs(wv91, wv7, h)
12.36/5.50	
12.36/5.50	R is empty.
12.36/5.50	Q is empty.
12.36/5.50	We have to consider all minimal (P,Q,R)-chains.
12.36/5.50	----------------------------------------
12.36/5.50	
12.36/5.50	(22) QDPSizeChangeProof (EQUIVALENT)
12.36/5.50	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.36/5.50	
12.36/5.50	From the DPs we obtained the following set of size-change graphs:
12.36/5.50	*new_psPs(:(wv90, wv91), wv7, h) -> new_psPs(wv91, wv7, h)
12.36/5.50	The graph contains the following edges 1 > 1, 2 >= 2, 3 >= 3
12.36/5.50	
12.36/5.50	
12.36/5.50	----------------------------------------
12.36/5.50	
12.36/5.50	(23)
12.36/5.50	YES
12.36/5.50	
12.36/5.50	----------------------------------------
12.36/5.50	
12.36/5.50	(24) Narrow (COMPLETE)
12.36/5.50	Haskell To QDPs
12.36/5.50	
12.36/5.50	digraph dp_graph {
12.36/5.50	node [outthreshold=100, inthreshold=100];1[label="Monad.zipWithM",fontsize=16,color="grey",shape="box"];1 -> 3[label="",style="dashed", color="grey", weight=3];
12.36/5.50	3[label="Monad.zipWithM wv3",fontsize=16,color="grey",shape="box"];3 -> 4[label="",style="dashed", color="grey", weight=3];
12.36/5.50	4[label="Monad.zipWithM wv3 wv4",fontsize=16,color="grey",shape="box"];4 -> 5[label="",style="dashed", color="grey", weight=3];
12.36/5.50	5[label="Monad.zipWithM wv3 wv4 wv5",fontsize=16,color="black",shape="triangle"];5 -> 6[label="",style="solid", color="black", weight=3];
12.36/5.50	6[label="sequence (zipWith wv3 wv4 wv5)",fontsize=16,color="burlywood",shape="triangle"];63[label="wv4/wv40 : wv41",fontsize=10,color="white",style="solid",shape="box"];6 -> 63[label="",style="solid", color="burlywood", weight=9];
12.36/5.50	63 -> 7[label="",style="solid", color="burlywood", weight=3];
12.36/5.50	64[label="wv4/[]",fontsize=10,color="white",style="solid",shape="box"];6 -> 64[label="",style="solid", color="burlywood", weight=9];
12.36/5.50	64 -> 8[label="",style="solid", color="burlywood", weight=3];
12.36/5.50	7[label="sequence (zipWith wv3 (wv40 : wv41) wv5)",fontsize=16,color="burlywood",shape="box"];65[label="wv5/wv50 : wv51",fontsize=10,color="white",style="solid",shape="box"];7 -> 65[label="",style="solid", color="burlywood", weight=9];
12.36/5.50	65 -> 9[label="",style="solid", color="burlywood", weight=3];
12.36/5.50	66[label="wv5/[]",fontsize=10,color="white",style="solid",shape="box"];7 -> 66[label="",style="solid", color="burlywood", weight=9];
12.36/5.50	66 -> 10[label="",style="solid", color="burlywood", weight=3];
12.36/5.50	8[label="sequence (zipWith wv3 [] wv5)",fontsize=16,color="black",shape="box"];8 -> 11[label="",style="solid", color="black", weight=3];
12.36/5.50	9[label="sequence (zipWith wv3 (wv40 : wv41) (wv50 : wv51))",fontsize=16,color="black",shape="box"];9 -> 12[label="",style="solid", color="black", weight=3];
12.36/5.50	10[label="sequence (zipWith wv3 (wv40 : wv41) [])",fontsize=16,color="black",shape="box"];10 -> 13[label="",style="solid", color="black", weight=3];
12.36/5.50	11[label="sequence []",fontsize=16,color="black",shape="triangle"];11 -> 14[label="",style="solid", color="black", weight=3];
12.36/5.50	12[label="sequence (wv3 wv40 wv50 : zipWith wv3 wv41 wv51)",fontsize=16,color="black",shape="box"];12 -> 15[label="",style="solid", color="black", weight=3];
12.36/5.50	13 -> 11[label="",style="dashed", color="red", weight=0];
12.36/5.50	13[label="sequence []",fontsize=16,color="magenta"];14[label="return []",fontsize=16,color="black",shape="box"];14 -> 16[label="",style="solid", color="black", weight=3];
12.36/5.50	15 -> 17[label="",style="dashed", color="red", weight=0];
12.36/5.50	15[label="wv3 wv40 wv50 >>= sequence1 (zipWith wv3 wv41 wv51)",fontsize=16,color="magenta"];15 -> 18[label="",style="dashed", color="magenta", weight=3];
12.36/5.50	16[label="[] : []",fontsize=16,color="green",shape="box"];18[label="wv3 wv40 wv50",fontsize=16,color="green",shape="box"];18 -> 23[label="",style="dashed", color="green", weight=3];
12.36/5.50	18 -> 24[label="",style="dashed", color="green", weight=3];
12.36/5.50	17[label="wv6 >>= sequence1 (zipWith wv3 wv41 wv51)",fontsize=16,color="burlywood",shape="triangle"];67[label="wv6/wv60 : wv61",fontsize=10,color="white",style="solid",shape="box"];17 -> 67[label="",style="solid", color="burlywood", weight=9];
12.36/5.50	67 -> 21[label="",style="solid", color="burlywood", weight=3];
12.36/5.50	68[label="wv6/[]",fontsize=10,color="white",style="solid",shape="box"];17 -> 68[label="",style="solid", color="burlywood", weight=9];
12.36/5.50	68 -> 22[label="",style="solid", color="burlywood", weight=3];
12.36/5.50	23[label="wv40",fontsize=16,color="green",shape="box"];24[label="wv50",fontsize=16,color="green",shape="box"];21[label="wv60 : wv61 >>= sequence1 (zipWith wv3 wv41 wv51)",fontsize=16,color="black",shape="box"];21 -> 25[label="",style="solid", color="black", weight=3];
12.36/5.50	22[label="[] >>= sequence1 (zipWith wv3 wv41 wv51)",fontsize=16,color="black",shape="box"];22 -> 26[label="",style="solid", color="black", weight=3];
12.36/5.50	25 -> 27[label="",style="dashed", color="red", weight=0];
12.36/5.50	25[label="sequence1 (zipWith wv3 wv41 wv51) wv60 ++ (wv61 >>= sequence1 (zipWith wv3 wv41 wv51))",fontsize=16,color="magenta"];25 -> 28[label="",style="dashed", color="magenta", weight=3];
12.36/5.50	26[label="[]",fontsize=16,color="green",shape="box"];28 -> 17[label="",style="dashed", color="red", weight=0];
12.36/5.50	28[label="wv61 >>= sequence1 (zipWith wv3 wv41 wv51)",fontsize=16,color="magenta"];28 -> 29[label="",style="dashed", color="magenta", weight=3];
12.36/5.50	27[label="sequence1 (zipWith wv3 wv41 wv51) wv60 ++ wv7",fontsize=16,color="black",shape="triangle"];27 -> 30[label="",style="solid", color="black", weight=3];
12.36/5.50	29[label="wv61",fontsize=16,color="green",shape="box"];30 -> 31[label="",style="dashed", color="red", weight=0];
12.36/5.50	30[label="(sequence (zipWith wv3 wv41 wv51) >>= sequence0 wv60) ++ wv7",fontsize=16,color="magenta"];30 -> 32[label="",style="dashed", color="magenta", weight=3];
12.36/5.50	32 -> 6[label="",style="dashed", color="red", weight=0];
12.36/5.50	32[label="sequence (zipWith wv3 wv41 wv51)",fontsize=16,color="magenta"];32 -> 33[label="",style="dashed", color="magenta", weight=3];
12.36/5.50	32 -> 34[label="",style="dashed", color="magenta", weight=3];
12.36/5.50	31[label="(wv8 >>= sequence0 wv60) ++ wv7",fontsize=16,color="burlywood",shape="triangle"];69[label="wv8/wv80 : wv81",fontsize=10,color="white",style="solid",shape="box"];31 -> 69[label="",style="solid", color="burlywood", weight=9];
12.36/5.50	69 -> 35[label="",style="solid", color="burlywood", weight=3];
12.36/5.50	70[label="wv8/[]",fontsize=10,color="white",style="solid",shape="box"];31 -> 70[label="",style="solid", color="burlywood", weight=9];
12.36/5.50	70 -> 36[label="",style="solid", color="burlywood", weight=3];
12.36/5.50	33[label="wv51",fontsize=16,color="green",shape="box"];34[label="wv41",fontsize=16,color="green",shape="box"];35[label="(wv80 : wv81 >>= sequence0 wv60) ++ wv7",fontsize=16,color="black",shape="box"];35 -> 37[label="",style="solid", color="black", weight=3];
12.36/5.50	36[label="([] >>= sequence0 wv60) ++ wv7",fontsize=16,color="black",shape="box"];36 -> 38[label="",style="solid", color="black", weight=3];
12.36/5.50	37[label="(sequence0 wv60 wv80 ++ (wv81 >>= sequence0 wv60)) ++ wv7",fontsize=16,color="black",shape="box"];37 -> 39[label="",style="solid", color="black", weight=3];
12.36/5.50	38[label="[] ++ wv7",fontsize=16,color="black",shape="triangle"];38 -> 40[label="",style="solid", color="black", weight=3];
12.36/5.50	39[label="(return (wv60 : wv80) ++ (wv81 >>= sequence0 wv60)) ++ wv7",fontsize=16,color="black",shape="box"];39 -> 41[label="",style="solid", color="black", weight=3];
12.36/5.50	40[label="wv7",fontsize=16,color="green",shape="box"];41[label="(((wv60 : wv80) : []) ++ (wv81 >>= sequence0 wv60)) ++ wv7",fontsize=16,color="black",shape="box"];41 -> 42[label="",style="solid", color="black", weight=3];
12.36/5.50	42 -> 43[label="",style="dashed", color="red", weight=0];
12.36/5.50	42[label="((wv60 : wv80) : [] ++ (wv81 >>= sequence0 wv60)) ++ wv7",fontsize=16,color="magenta"];42 -> 44[label="",style="dashed", color="magenta", weight=3];
12.36/5.50	44 -> 38[label="",style="dashed", color="red", weight=0];
12.36/5.50	44[label="[] ++ (wv81 >>= sequence0 wv60)",fontsize=16,color="magenta"];44 -> 45[label="",style="dashed", color="magenta", weight=3];
12.36/5.50	43[label="((wv60 : wv80) : wv9) ++ wv7",fontsize=16,color="black",shape="triangle"];43 -> 46[label="",style="solid", color="black", weight=3];
12.36/5.50	45[label="wv81 >>= sequence0 wv60",fontsize=16,color="burlywood",shape="triangle"];71[label="wv81/wv810 : wv811",fontsize=10,color="white",style="solid",shape="box"];45 -> 71[label="",style="solid", color="burlywood", weight=9];
12.36/5.50	71 -> 47[label="",style="solid", color="burlywood", weight=3];
12.36/5.50	72[label="wv81/[]",fontsize=10,color="white",style="solid",shape="box"];45 -> 72[label="",style="solid", color="burlywood", weight=9];
12.36/5.50	72 -> 48[label="",style="solid", color="burlywood", weight=3];
12.36/5.50	46[label="(wv60 : wv80) : wv9 ++ wv7",fontsize=16,color="green",shape="box"];46 -> 49[label="",style="dashed", color="green", weight=3];
12.36/5.50	47[label="wv810 : wv811 >>= sequence0 wv60",fontsize=16,color="black",shape="box"];47 -> 50[label="",style="solid", color="black", weight=3];
12.36/5.50	48[label="[] >>= sequence0 wv60",fontsize=16,color="black",shape="box"];48 -> 51[label="",style="solid", color="black", weight=3];
12.36/5.50	49[label="wv9 ++ wv7",fontsize=16,color="burlywood",shape="triangle"];73[label="wv9/wv90 : wv91",fontsize=10,color="white",style="solid",shape="box"];49 -> 73[label="",style="solid", color="burlywood", weight=9];
12.36/5.50	73 -> 52[label="",style="solid", color="burlywood", weight=3];
12.36/5.50	74[label="wv9/[]",fontsize=10,color="white",style="solid",shape="box"];49 -> 74[label="",style="solid", color="burlywood", weight=9];
12.36/5.50	74 -> 53[label="",style="solid", color="burlywood", weight=3];
12.36/5.50	50 -> 49[label="",style="dashed", color="red", weight=0];
12.36/5.50	50[label="sequence0 wv60 wv810 ++ (wv811 >>= sequence0 wv60)",fontsize=16,color="magenta"];50 -> 54[label="",style="dashed", color="magenta", weight=3];
12.36/5.50	50 -> 55[label="",style="dashed", color="magenta", weight=3];
12.36/5.50	51[label="[]",fontsize=16,color="green",shape="box"];52[label="(wv90 : wv91) ++ wv7",fontsize=16,color="black",shape="box"];52 -> 56[label="",style="solid", color="black", weight=3];
12.36/5.50	53[label="[] ++ wv7",fontsize=16,color="black",shape="box"];53 -> 57[label="",style="solid", color="black", weight=3];
12.36/5.50	54[label="sequence0 wv60 wv810",fontsize=16,color="black",shape="box"];54 -> 58[label="",style="solid", color="black", weight=3];
12.36/5.50	55 -> 45[label="",style="dashed", color="red", weight=0];
12.36/5.50	55[label="wv811 >>= sequence0 wv60",fontsize=16,color="magenta"];55 -> 59[label="",style="dashed", color="magenta", weight=3];
12.36/5.50	56[label="wv90 : wv91 ++ wv7",fontsize=16,color="green",shape="box"];56 -> 60[label="",style="dashed", color="green", weight=3];
12.36/5.50	57[label="wv7",fontsize=16,color="green",shape="box"];58[label="return (wv60 : wv810)",fontsize=16,color="black",shape="box"];58 -> 61[label="",style="solid", color="black", weight=3];
12.36/5.50	59[label="wv811",fontsize=16,color="green",shape="box"];60 -> 49[label="",style="dashed", color="red", weight=0];
12.36/5.50	60[label="wv91 ++ wv7",fontsize=16,color="magenta"];60 -> 62[label="",style="dashed", color="magenta", weight=3];
12.36/5.50	61[label="(wv60 : wv810) : []",fontsize=16,color="green",shape="box"];62[label="wv91",fontsize=16,color="green",shape="box"];}
12.36/5.50	
12.36/5.50	----------------------------------------
12.36/5.50	
12.36/5.50	(25)
12.36/5.50	TRUE
12.54/5.53	EOF