10.55/4.39	YES
13.09/5.09	proof of /export/starexec/sandbox/benchmark/theBenchmark.hs
13.09/5.09	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
13.09/5.09	
13.09/5.09	
13.09/5.09	H-Termination with start terms of the given HASKELL could be proven:
13.09/5.09	
13.09/5.09	(0) HASKELL
13.09/5.09	(1) LR [EQUIVALENT, 0 ms]
13.09/5.09	(2) HASKELL
13.09/5.09	(3) CR [EQUIVALENT, 0 ms]
13.09/5.09	(4) HASKELL
13.09/5.09	(5) IFR [EQUIVALENT, 0 ms]
13.09/5.09	(6) HASKELL
13.09/5.09	(7) BR [EQUIVALENT, 0 ms]
13.09/5.09	(8) HASKELL
13.09/5.09	(9) COR [EQUIVALENT, 16 ms]
13.09/5.09	(10) HASKELL
13.09/5.09	(11) NumRed [SOUND, 0 ms]
13.09/5.09	(12) HASKELL
13.09/5.09	(13) Narrow [EQUIVALENT, 32 ms]
13.09/5.09	(14) YES
13.09/5.09	
13.09/5.09	
13.09/5.09	----------------------------------------
13.09/5.09	
13.09/5.09	(0)
13.09/5.09	Obligation:
13.09/5.09	mainModule Main 
13.09/5.09	module Maybe where {
13.09/5.09	import qualified List;
13.09/5.09	import qualified Main;
13.09/5.09	import qualified Prelude;
13.09/5.09	listToMaybe :: [a]  ->  Maybe a;
13.09/5.09	listToMaybe [] = Nothing;
13.09/5.09	listToMaybe (a : _) = Just a;
13.09/5.09	
13.09/5.09	}
13.09/5.09	module List where {
13.09/5.09	import qualified Main;
13.09/5.09	import qualified Maybe;
13.09/5.09	import qualified Prelude;
13.09/5.09	elemIndex :: Eq a => a  ->  [a]  ->  Maybe Int;
13.09/5.09	elemIndex x = findIndex (== x);
13.09/5.09	
13.09/5.09	findIndex :: (a  ->  Bool)  ->  [a]  ->  Maybe Int;
13.09/5.09	findIndex p = Maybe.listToMaybe . findIndices p;
13.09/5.09	
13.09/5.09	findIndices :: (a  ->  Bool)  ->  [a]  ->  [Int];
13.09/5.09	findIndices p xs = concatMap (\vv1 ->case vv1 of { 
13.09/5.09	(x,i)->  if p x then i : [] else []; 
13.09/5.09	_-> []; 
13.09/5.09	 } ) (zip xs (enumFrom 0));
13.09/5.09	
13.09/5.09	}
13.09/5.09	module Main where {
13.09/5.09	import qualified List;
13.09/5.09	import qualified Maybe;
13.09/5.09	import qualified Prelude;
13.09/5.09	}
13.09/5.09	
13.09/5.09	----------------------------------------
13.09/5.09	
13.09/5.09	(1) LR (EQUIVALENT)
13.09/5.09	Lambda Reductions:
13.09/5.09	The following Lambda expression
13.09/5.09	"\ab->(a,b)"
13.09/5.09	is transformed to
13.09/5.09	"zip0 a b = (a,b);
13.09/5.09	"
13.09/5.09	The following Lambda expression
13.09/5.09	"\vv1->case vv1 of {
13.09/5.09	(x,i)  -> if p x then i : [] else [];
13.09/5.09	_  -> []}
13.09/5.09	"
13.09/5.09	is transformed to
13.09/5.09	"findIndices0 p vv1 = case vv1 of {
13.09/5.09	(x,i)  -> if p x then i : [] else [];
13.09/5.09	_  -> []}
13.09/5.09	;
13.09/5.09	"
13.09/5.09	
13.09/5.09	----------------------------------------
13.09/5.09	
13.09/5.09	(2)
13.09/5.09	Obligation:
13.09/5.09	mainModule Main 
13.09/5.09	module Maybe where {
13.09/5.09	import qualified List;
13.09/5.09	import qualified Main;
13.09/5.09	import qualified Prelude;
13.09/5.09	listToMaybe :: [a]  ->  Maybe a;
13.09/5.09	listToMaybe [] = Nothing;
13.09/5.09	listToMaybe (a : _) = Just a;
13.09/5.09	
13.09/5.09	}
13.09/5.09	module List where {
13.09/5.09	import qualified Main;
13.09/5.09	import qualified Maybe;
13.09/5.09	import qualified Prelude;
13.09/5.09	elemIndex :: Eq a => a  ->  [a]  ->  Maybe Int;
13.09/5.09	elemIndex x = findIndex (== x);
13.09/5.09	
13.09/5.09	findIndex :: (a  ->  Bool)  ->  [a]  ->  Maybe Int;
13.09/5.09	findIndex p = Maybe.listToMaybe . findIndices p;
13.09/5.09	
13.09/5.09	findIndices :: (a  ->  Bool)  ->  [a]  ->  [Int];
13.09/5.09	findIndices p xs = concatMap (findIndices0 p) (zip xs (enumFrom 0));
13.09/5.09	
13.09/5.09	findIndices0 p vv1 = case vv1 of { 
13.09/5.09	(x,i)->  if p x then i : [] else []; 
13.09/5.09	_-> []; 
13.09/5.09	 } ;
13.09/5.09	
13.09/5.09	}
13.09/5.09	module Main where {
13.09/5.09	import qualified List;
13.09/5.09	import qualified Maybe;
13.09/5.09	import qualified Prelude;
13.09/5.09	}
13.09/5.09	
13.09/5.09	----------------------------------------
13.09/5.09	
13.09/5.09	(3) CR (EQUIVALENT)
13.09/5.09	Case Reductions:
13.09/5.09	The following Case expression
13.09/5.09	"case vv1 of {
13.09/5.09	(x,i)  -> if p x then i : [] else [];
13.09/5.09	_  -> []}
13.09/5.09	"
13.09/5.09	is transformed to
13.09/5.09	"findIndices00 p (x,i) = if p x then i : [] else [];
13.09/5.09	findIndices00 p _ = [];
13.09/5.09	"
13.09/5.09	
13.09/5.09	----------------------------------------
13.09/5.09	
13.09/5.09	(4)
13.09/5.09	Obligation:
13.09/5.09	mainModule Main 
13.09/5.09	module Maybe where {
13.09/5.09	import qualified List;
13.09/5.09	import qualified Main;
13.09/5.09	import qualified Prelude;
13.09/5.09	listToMaybe :: [a]  ->  Maybe a;
13.09/5.09	listToMaybe [] = Nothing;
13.09/5.09	listToMaybe (a : _) = Just a;
13.09/5.09	
13.09/5.09	}
13.09/5.09	module List where {
13.09/5.09	import qualified Main;
13.09/5.09	import qualified Maybe;
13.09/5.09	import qualified Prelude;
13.09/5.09	elemIndex :: Eq a => a  ->  [a]  ->  Maybe Int;
13.09/5.09	elemIndex x = findIndex (== x);
13.09/5.09	
13.09/5.09	findIndex :: (a  ->  Bool)  ->  [a]  ->  Maybe Int;
13.09/5.09	findIndex p = Maybe.listToMaybe . findIndices p;
13.09/5.09	
13.09/5.09	findIndices :: (a  ->  Bool)  ->  [a]  ->  [Int];
13.09/5.09	findIndices p xs = concatMap (findIndices0 p) (zip xs (enumFrom 0));
13.09/5.09	
13.09/5.09	findIndices0 p vv1 = findIndices00 p vv1;
13.09/5.09	
13.09/5.09	findIndices00 p (x,i) =  if p x then i : [] else [];
13.09/5.09	findIndices00 p _ = [];
13.09/5.09	
13.09/5.09	}
13.09/5.09	module Main where {
13.09/5.09	import qualified List;
13.09/5.09	import qualified Maybe;
13.09/5.09	import qualified Prelude;
13.09/5.09	}
13.09/5.09	
13.09/5.09	----------------------------------------
13.09/5.09	
13.09/5.09	(5) IFR (EQUIVALENT)
13.09/5.09	If Reductions:
13.09/5.09	The following If expression
13.09/5.09	"if p x then i : [] else []"
13.09/5.09	is transformed to
13.09/5.09	"findIndices000 i True = i : [];
13.09/5.09	findIndices000 i False = [];
13.09/5.09	"
13.09/5.09	
13.09/5.09	----------------------------------------
13.09/5.09	
13.09/5.09	(6)
13.09/5.09	Obligation:
13.09/5.09	mainModule Main 
13.09/5.09	module Maybe where {
13.09/5.09	import qualified List;
13.09/5.09	import qualified Main;
13.09/5.09	import qualified Prelude;
13.09/5.09	listToMaybe :: [a]  ->  Maybe a;
13.09/5.09	listToMaybe [] = Nothing;
13.09/5.09	listToMaybe (a : _) = Just a;
13.09/5.09	
13.09/5.09	}
13.09/5.09	module List where {
13.09/5.09	import qualified Main;
13.09/5.09	import qualified Maybe;
13.09/5.09	import qualified Prelude;
13.09/5.09	elemIndex :: Eq a => a  ->  [a]  ->  Maybe Int;
13.09/5.09	elemIndex x = findIndex (== x);
13.09/5.09	
13.09/5.09	findIndex :: (a  ->  Bool)  ->  [a]  ->  Maybe Int;
13.09/5.09	findIndex p = Maybe.listToMaybe . findIndices p;
13.09/5.09	
13.09/5.09	findIndices :: (a  ->  Bool)  ->  [a]  ->  [Int];
13.09/5.09	findIndices p xs = concatMap (findIndices0 p) (zip xs (enumFrom 0));
13.09/5.09	
13.09/5.09	findIndices0 p vv1 = findIndices00 p vv1;
13.09/5.09	
13.09/5.09	findIndices00 p (x,i) = findIndices000 i (p x);
13.09/5.09	findIndices00 p _ = [];
13.09/5.09	
13.09/5.09	findIndices000 i True = i : [];
13.09/5.09	findIndices000 i False = [];
13.09/5.09	
13.09/5.09	}
13.09/5.09	module Main where {
13.09/5.09	import qualified List;
13.09/5.09	import qualified Maybe;
13.09/5.09	import qualified Prelude;
13.09/5.09	}
13.09/5.09	
13.09/5.09	----------------------------------------
13.09/5.09	
13.09/5.09	(7) BR (EQUIVALENT)
13.09/5.09	Replaced joker patterns by fresh variables and removed binding patterns.
13.09/5.09	----------------------------------------
13.09/5.09	
13.09/5.09	(8)
13.09/5.09	Obligation:
13.09/5.09	mainModule Main 
13.09/5.09	module Maybe where {
13.09/5.09	import qualified List;
13.09/5.09	import qualified Main;
13.09/5.09	import qualified Prelude;
13.09/5.09	listToMaybe :: [a]  ->  Maybe a;
13.09/5.09	listToMaybe [] = Nothing;
13.09/5.09	listToMaybe (a : wv) = Just a;
13.09/5.09	
13.09/5.09	}
13.09/5.09	module List where {
13.09/5.09	import qualified Main;
13.09/5.09	import qualified Maybe;
13.09/5.09	import qualified Prelude;
13.09/5.09	elemIndex :: Eq a => a  ->  [a]  ->  Maybe Int;
13.09/5.09	elemIndex x = findIndex (== x);
13.09/5.09	
13.09/5.09	findIndex :: (a  ->  Bool)  ->  [a]  ->  Maybe Int;
13.09/5.09	findIndex p = Maybe.listToMaybe . findIndices p;
13.09/5.09	
13.09/5.09	findIndices :: (a  ->  Bool)  ->  [a]  ->  [Int];
13.09/5.09	findIndices p xs = concatMap (findIndices0 p) (zip xs (enumFrom 0));
13.09/5.09	
13.09/5.09	findIndices0 p vv1 = findIndices00 p vv1;
13.09/5.09	
13.09/5.09	findIndices00 p (x,i) = findIndices000 i (p x);
13.09/5.09	findIndices00 p ww = [];
13.09/5.09	
13.09/5.09	findIndices000 i True = i : [];
13.09/5.09	findIndices000 i False = [];
13.09/5.09	
13.09/5.09	}
13.09/5.09	module Main where {
13.09/5.09	import qualified List;
13.09/5.09	import qualified Maybe;
13.09/5.09	import qualified Prelude;
13.09/5.09	}
13.09/5.09	
13.09/5.09	----------------------------------------
13.09/5.09	
13.09/5.09	(9) COR (EQUIVALENT)
13.09/5.09	Cond Reductions:
13.09/5.09	The following Function with conditions
13.09/5.09	"undefined |Falseundefined;
13.09/5.09	"
13.09/5.09	is transformed to
13.09/5.09	"undefined  = undefined1;
13.09/5.09	"
13.09/5.09	"undefined0 True = undefined;
13.09/5.09	"
13.09/5.09	"undefined1  = undefined0 False;
13.09/5.09	"
13.09/5.09	
13.09/5.09	----------------------------------------
13.09/5.09	
13.09/5.09	(10)
13.09/5.09	Obligation:
13.09/5.09	mainModule Main 
13.09/5.09	module Maybe where {
13.09/5.09	import qualified List;
13.09/5.09	import qualified Main;
13.09/5.09	import qualified Prelude;
13.09/5.09	listToMaybe :: [a]  ->  Maybe a;
13.09/5.09	listToMaybe [] = Nothing;
13.09/5.09	listToMaybe (a : wv) = Just a;
13.09/5.09	
13.09/5.09	}
13.09/5.09	module List where {
13.09/5.09	import qualified Main;
13.09/5.09	import qualified Maybe;
13.09/5.09	import qualified Prelude;
13.09/5.09	elemIndex :: Eq a => a  ->  [a]  ->  Maybe Int;
13.09/5.09	elemIndex x = findIndex (== x);
13.09/5.09	
13.09/5.09	findIndex :: (a  ->  Bool)  ->  [a]  ->  Maybe Int;
13.09/5.09	findIndex p = Maybe.listToMaybe . findIndices p;
13.09/5.09	
13.09/5.09	findIndices :: (a  ->  Bool)  ->  [a]  ->  [Int];
13.09/5.09	findIndices p xs = concatMap (findIndices0 p) (zip xs (enumFrom 0));
13.09/5.09	
13.09/5.09	findIndices0 p vv1 = findIndices00 p vv1;
13.09/5.09	
13.09/5.09	findIndices00 p (x,i) = findIndices000 i (p x);
13.09/5.09	findIndices00 p ww = [];
13.09/5.09	
13.09/5.09	findIndices000 i True = i : [];
13.09/5.09	findIndices000 i False = [];
13.09/5.09	
13.09/5.09	}
13.09/5.09	module Main where {
13.09/5.09	import qualified List;
13.09/5.09	import qualified Maybe;
13.09/5.09	import qualified Prelude;
13.09/5.09	}
13.09/5.09	
13.09/5.09	----------------------------------------
13.09/5.09	
13.09/5.09	(11) NumRed (SOUND)
13.09/5.09	Num Reduction:All numbers are transformed to their corresponding representation with Succ, Pred and Zero.
13.09/5.09	----------------------------------------
13.09/5.09	
13.09/5.09	(12)
13.09/5.09	Obligation:
13.09/5.09	mainModule Main 
13.09/5.09	module Maybe where {
13.09/5.09	import qualified List;
13.09/5.09	import qualified Main;
13.09/5.09	import qualified Prelude;
13.09/5.09	listToMaybe :: [a]  ->  Maybe a;
13.09/5.09	listToMaybe [] = Nothing;
13.09/5.09	listToMaybe (a : wv) = Just a;
13.09/5.09	
13.09/5.09	}
13.09/5.09	module List where {
13.09/5.09	import qualified Main;
13.09/5.09	import qualified Maybe;
13.09/5.09	import qualified Prelude;
13.09/5.09	elemIndex :: Eq a => a  ->  [a]  ->  Maybe Int;
13.09/5.09	elemIndex x = findIndex (== x);
13.09/5.09	
13.09/5.09	findIndex :: (a  ->  Bool)  ->  [a]  ->  Maybe Int;
13.09/5.09	findIndex p = Maybe.listToMaybe . findIndices p;
13.09/5.09	
13.09/5.09	findIndices :: (a  ->  Bool)  ->  [a]  ->  [Int];
13.09/5.09	findIndices p xs = concatMap (findIndices0 p) (zip xs (enumFrom (Pos Zero)));
13.09/5.09	
13.09/5.09	findIndices0 p vv1 = findIndices00 p vv1;
13.09/5.09	
13.09/5.09	findIndices00 p (x,i) = findIndices000 i (p x);
13.09/5.09	findIndices00 p ww = [];
13.09/5.09	
13.09/5.09	findIndices000 i True = i : [];
13.09/5.09	findIndices000 i False = [];
13.09/5.09	
13.09/5.09	}
13.09/5.09	module Main where {
13.09/5.09	import qualified List;
13.09/5.09	import qualified Maybe;
13.09/5.09	import qualified Prelude;
13.09/5.09	}
13.09/5.09	
13.09/5.09	----------------------------------------
13.09/5.09	
13.09/5.09	(13) Narrow (EQUIVALENT)
13.09/5.09	Haskell To QDPs
13.09/5.09	
13.09/5.09	digraph dp_graph {
13.09/5.09	node [outthreshold=100, inthreshold=100];1[label="List.elemIndex",fontsize=16,color="grey",shape="box"];1 -> 3[label="",style="dashed", color="grey", weight=3];
13.09/5.09	3[label="List.elemIndex wx3",fontsize=16,color="grey",shape="box"];3 -> 4[label="",style="dashed", color="grey", weight=3];
13.09/5.09	4[label="List.elemIndex wx3 wx4",fontsize=16,color="black",shape="triangle"];4 -> 5[label="",style="solid", color="black", weight=3];
13.09/5.09	5[label="List.findIndex (wx3 ==) wx4",fontsize=16,color="black",shape="box"];5 -> 6[label="",style="solid", color="black", weight=3];
13.09/5.09	6[label="Maybe.listToMaybe . List.findIndices (wx3 ==)",fontsize=16,color="black",shape="box"];6 -> 7[label="",style="solid", color="black", weight=3];
13.09/5.09	7[label="Maybe.listToMaybe (List.findIndices (wx3 ==) wx4)",fontsize=16,color="black",shape="box"];7 -> 8[label="",style="solid", color="black", weight=3];
13.09/5.09	8[label="Maybe.listToMaybe (concatMap (List.findIndices0 (wx3 ==)) (zip wx4 (enumFrom (Pos Zero))))",fontsize=16,color="black",shape="box"];8 -> 9[label="",style="solid", color="black", weight=3];
13.09/5.09	9[label="Maybe.listToMaybe (concat . map (List.findIndices0 (wx3 ==)))",fontsize=16,color="black",shape="box"];9 -> 10[label="",style="solid", color="black", weight=3];
13.09/5.09	10[label="Maybe.listToMaybe (concat (map (List.findIndices0 (wx3 ==)) (zip wx4 (enumFrom (Pos Zero)))))",fontsize=16,color="black",shape="box"];10 -> 11[label="",style="solid", color="black", weight=3];
13.09/5.09	11[label="Maybe.listToMaybe (foldr (++) [] (map (List.findIndices0 (wx3 ==)) (zip wx4 (enumFrom (Pos Zero)))))",fontsize=16,color="black",shape="box"];11 -> 12[label="",style="solid", color="black", weight=3];
13.09/5.09	12[label="Maybe.listToMaybe (foldr (++) [] (map (List.findIndices0 (wx3 ==)) (zipWith zip0 wx4 (enumFrom (Pos Zero)))))",fontsize=16,color="burlywood",shape="box"];33[label="wx4/wx40 : wx41",fontsize=10,color="white",style="solid",shape="box"];12 -> 33[label="",style="solid", color="burlywood", weight=9];
13.09/5.09	33 -> 13[label="",style="solid", color="burlywood", weight=3];
13.09/5.09	34[label="wx4/[]",fontsize=10,color="white",style="solid",shape="box"];12 -> 34[label="",style="solid", color="burlywood", weight=9];
13.09/5.09	34 -> 14[label="",style="solid", color="burlywood", weight=3];
13.09/5.09	13[label="Maybe.listToMaybe (foldr (++) [] (map (List.findIndices0 (wx3 ==)) (zipWith zip0 (wx40 : wx41) (enumFrom (Pos Zero)))))",fontsize=16,color="black",shape="box"];13 -> 15[label="",style="solid", color="black", weight=3];
13.09/5.09	14[label="Maybe.listToMaybe (foldr (++) [] (map (List.findIndices0 (wx3 ==)) (zipWith zip0 [] (enumFrom (Pos Zero)))))",fontsize=16,color="black",shape="box"];14 -> 16[label="",style="solid", color="black", weight=3];
13.09/5.09	15[label="Maybe.listToMaybe (foldr (++) [] (map (List.findIndices0 (wx3 ==)) (zipWith zip0 (wx40 : wx41) (numericEnumFrom (Pos Zero)))))",fontsize=16,color="black",shape="box"];15 -> 17[label="",style="solid", color="black", weight=3];
13.09/5.09	16[label="Maybe.listToMaybe (foldr (++) [] (map (List.findIndices0 (wx3 ==)) []))",fontsize=16,color="black",shape="box"];16 -> 18[label="",style="solid", color="black", weight=3];
13.09/5.09	17[label="Maybe.listToMaybe (foldr (++) [] (map (List.findIndices0 (wx3 ==)) (zipWith zip0 (wx40 : wx41) (Pos Zero : (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero)))))))",fontsize=16,color="black",shape="box"];17 -> 19[label="",style="solid", color="black", weight=3];
13.09/5.09	18[label="Maybe.listToMaybe (foldr (++) [] [])",fontsize=16,color="black",shape="box"];18 -> 20[label="",style="solid", color="black", weight=3];
13.09/5.09	19[label="Maybe.listToMaybe (foldr (++) [] (map (List.findIndices0 (wx3 ==)) (zip0 wx40 (Pos Zero) : zipWith zip0 wx41 (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="box"];19 -> 21[label="",style="solid", color="black", weight=3];
13.09/5.09	20[label="Maybe.listToMaybe []",fontsize=16,color="black",shape="box"];20 -> 22[label="",style="solid", color="black", weight=3];
13.09/5.09	21[label="Maybe.listToMaybe (foldr (++) [] (List.findIndices0 (wx3 ==) (zip0 wx40 (Pos Zero)) : map (List.findIndices0 (wx3 ==)) (zipWith zip0 wx41 (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="box"];21 -> 23[label="",style="solid", color="black", weight=3];
13.09/5.09	22[label="Nothing",fontsize=16,color="green",shape="box"];23[label="Maybe.listToMaybe ((++) List.findIndices0 (wx3 ==) (zip0 wx40 (Pos Zero)) foldr (++) [] (map (List.findIndices0 (wx3 ==)) (zipWith zip0 wx41 (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="box"];23 -> 24[label="",style="solid", color="black", weight=3];
13.09/5.09	24[label="Maybe.listToMaybe ((++) List.findIndices00 (wx3 ==) (zip0 wx40 (Pos Zero)) foldr (++) [] (map (List.findIndices0 (wx3 ==)) (zipWith zip0 wx41 (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="box"];24 -> 25[label="",style="solid", color="black", weight=3];
13.09/5.09	25[label="Maybe.listToMaybe ((++) List.findIndices00 (wx3 ==) (wx40,Pos Zero) foldr (++) [] (map (List.findIndices0 (wx3 ==)) (zipWith zip0 wx41 (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="box"];25 -> 26[label="",style="solid", color="black", weight=3];
13.09/5.09	26[label="Maybe.listToMaybe ((++) List.findIndices000 (Pos Zero) (wx3 == wx40) foldr (++) [] (map (List.findIndices0 (wx3 ==)) (zipWith zip0 wx41 (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero))))))",fontsize=16,color="burlywood",shape="box"];35[label="wx3/()",fontsize=10,color="white",style="solid",shape="box"];26 -> 35[label="",style="solid", color="burlywood", weight=9];
13.09/5.09	35 -> 27[label="",style="solid", color="burlywood", weight=3];
13.09/5.09	27[label="Maybe.listToMaybe ((++) List.findIndices000 (Pos Zero) (() == wx40) foldr (++) [] (map (List.findIndices0 (() ==)) (zipWith zip0 wx41 (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero))))))",fontsize=16,color="burlywood",shape="box"];36[label="wx40/()",fontsize=10,color="white",style="solid",shape="box"];27 -> 36[label="",style="solid", color="burlywood", weight=9];
13.09/5.09	36 -> 28[label="",style="solid", color="burlywood", weight=3];
13.09/5.09	28[label="Maybe.listToMaybe ((++) List.findIndices000 (Pos Zero) (() == ()) foldr (++) [] (map (List.findIndices0 (() ==)) (zipWith zip0 wx41 (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="box"];28 -> 29[label="",style="solid", color="black", weight=3];
13.09/5.09	29[label="Maybe.listToMaybe ((++) List.findIndices000 (Pos Zero) True foldr (++) [] (map (List.findIndices0 (() ==)) (zipWith zip0 wx41 (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="box"];29 -> 30[label="",style="solid", color="black", weight=3];
13.09/5.09	30[label="Maybe.listToMaybe ((++) (Pos Zero : []) foldr (++) [] (map (List.findIndices0 (() ==)) (zipWith zip0 wx41 (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="box"];30 -> 31[label="",style="solid", color="black", weight=3];
13.09/5.09	31[label="Maybe.listToMaybe (Pos Zero : [] ++ foldr (++) [] (map (List.findIndices0 (() ==)) (zipWith zip0 wx41 (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="box"];31 -> 32[label="",style="solid", color="black", weight=3];
13.09/5.09	32[label="Just (Pos Zero)",fontsize=16,color="green",shape="box"];}
13.09/5.09	
13.09/5.09	----------------------------------------
13.09/5.09	
13.09/5.09	(14)
13.09/5.09	YES
13.26/5.15	EOF