12.93/5.93 YES 15.53/6.67 proof of /export/starexec/sandbox/benchmark/theBenchmark.hs 15.53/6.67 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 15.53/6.67 15.53/6.67 15.53/6.67 H-Termination with start terms of the given HASKELL could be proven: 15.53/6.67 15.53/6.67 (0) HASKELL 15.53/6.67 (1) LR [EQUIVALENT, 0 ms] 15.53/6.67 (2) HASKELL 15.53/6.67 (3) CR [EQUIVALENT, 0 ms] 15.53/6.67 (4) HASKELL 15.53/6.67 (5) IFR [EQUIVALENT, 0 ms] 15.53/6.67 (6) HASKELL 15.53/6.67 (7) BR [EQUIVALENT, 0 ms] 15.53/6.67 (8) HASKELL 15.53/6.67 (9) COR [EQUIVALENT, 6 ms] 15.53/6.67 (10) HASKELL 15.53/6.67 (11) NumRed [SOUND, 0 ms] 15.53/6.67 (12) HASKELL 15.53/6.67 (13) Narrow [SOUND, 0 ms] 15.53/6.67 (14) AND 15.53/6.67 (15) QDP 15.53/6.67 (16) QDPSizeChangeProof [EQUIVALENT, 0 ms] 15.53/6.67 (17) YES 15.53/6.67 (18) QDP 15.53/6.67 (19) TransformationProof [EQUIVALENT, 0 ms] 15.53/6.67 (20) QDP 15.53/6.67 (21) QDPSizeChangeProof [EQUIVALENT, 0 ms] 15.53/6.67 (22) YES 15.53/6.67 (23) QDP 15.53/6.67 (24) QDPSizeChangeProof [EQUIVALENT, 0 ms] 15.53/6.67 (25) YES 15.53/6.67 (26) QDP 15.53/6.67 (27) TransformationProof [EQUIVALENT, 0 ms] 15.53/6.67 (28) QDP 15.53/6.67 (29) QDPSizeChangeProof [EQUIVALENT, 0 ms] 15.53/6.67 (30) YES 15.53/6.67 15.53/6.67 15.53/6.67 ---------------------------------------- 15.53/6.67 15.53/6.67 (0) 15.53/6.67 Obligation: 15.53/6.67 mainModule Main 15.53/6.67 module Maybe where { 15.53/6.67 import qualified List; 15.53/6.67 import qualified Main; 15.53/6.67 import qualified Prelude; 15.53/6.67 listToMaybe :: [a] -> Maybe a; 15.53/6.67 listToMaybe [] = Nothing; 15.53/6.67 listToMaybe (a : _) = Just a; 15.53/6.67 15.53/6.67 } 15.53/6.67 module List where { 15.53/6.67 import qualified Main; 15.53/6.67 import qualified Maybe; 15.53/6.67 import qualified Prelude; 15.53/6.67 elemIndex :: Eq a => a -> [a] -> Maybe Int; 15.53/6.67 elemIndex x = findIndex (== x); 15.53/6.67 15.53/6.67 findIndex :: (a -> Bool) -> [a] -> Maybe Int; 15.53/6.67 findIndex p = Maybe.listToMaybe . findIndices p; 15.53/6.67 15.53/6.67 findIndices :: (a -> Bool) -> [a] -> [Int]; 15.53/6.67 findIndices p xs = concatMap (\vv1 ->case vv1 of { 15.53/6.67 (x,i)-> if p x then i : [] else []; 15.53/6.67 _-> []; 15.53/6.67 } ) (zip xs (enumFrom 0)); 15.53/6.67 15.53/6.67 } 15.53/6.67 module Main where { 15.53/6.67 import qualified List; 15.53/6.67 import qualified Maybe; 15.53/6.67 import qualified Prelude; 15.53/6.67 } 15.53/6.67 15.53/6.67 ---------------------------------------- 15.53/6.67 15.53/6.67 (1) LR (EQUIVALENT) 15.53/6.67 Lambda Reductions: 15.53/6.67 The following Lambda expression 15.53/6.67 "\ab->(a,b)" 15.53/6.67 is transformed to 15.53/6.67 "zip0 a b = (a,b); 15.53/6.67 " 15.53/6.67 The following Lambda expression 15.53/6.67 "\vv1->case vv1 of { 15.53/6.67 (x,i) -> if p x then i : [] else []; 15.53/6.67 _ -> []} 15.53/6.67 " 15.53/6.67 is transformed to 15.53/6.67 "findIndices0 p vv1 = case vv1 of { 15.53/6.67 (x,i) -> if p x then i : [] else []; 15.53/6.67 _ -> []} 15.53/6.67 ; 15.53/6.67 " 15.53/6.67 15.53/6.67 ---------------------------------------- 15.53/6.67 15.53/6.67 (2) 15.53/6.67 Obligation: 15.53/6.67 mainModule Main 15.53/6.67 module Maybe where { 15.53/6.67 import qualified List; 15.53/6.67 import qualified Main; 15.53/6.67 import qualified Prelude; 15.53/6.67 listToMaybe :: [a] -> Maybe a; 15.53/6.67 listToMaybe [] = Nothing; 15.53/6.67 listToMaybe (a : _) = Just a; 15.53/6.67 15.53/6.67 } 15.53/6.67 module List where { 15.53/6.67 import qualified Main; 15.53/6.67 import qualified Maybe; 15.53/6.67 import qualified Prelude; 15.53/6.67 elemIndex :: Eq a => a -> [a] -> Maybe Int; 15.53/6.67 elemIndex x = findIndex (== x); 15.53/6.67 15.53/6.67 findIndex :: (a -> Bool) -> [a] -> Maybe Int; 15.53/6.67 findIndex p = Maybe.listToMaybe . findIndices p; 15.53/6.67 15.53/6.67 findIndices :: (a -> Bool) -> [a] -> [Int]; 15.53/6.67 findIndices p xs = concatMap (findIndices0 p) (zip xs (enumFrom 0)); 15.53/6.67 15.53/6.67 findIndices0 p vv1 = case vv1 of { 15.53/6.67 (x,i)-> if p x then i : [] else []; 15.53/6.67 _-> []; 15.53/6.67 } ; 15.53/6.67 15.53/6.67 } 15.53/6.67 module Main where { 15.53/6.67 import qualified List; 15.53/6.67 import qualified Maybe; 15.53/6.67 import qualified Prelude; 15.53/6.67 } 15.53/6.67 15.53/6.67 ---------------------------------------- 15.53/6.67 15.53/6.67 (3) CR (EQUIVALENT) 15.53/6.67 Case Reductions: 15.53/6.67 The following Case expression 15.53/6.67 "case vv1 of { 15.53/6.67 (x,i) -> if p x then i : [] else []; 15.53/6.67 _ -> []} 15.53/6.67 " 15.53/6.67 is transformed to 15.53/6.67 "findIndices00 p (x,i) = if p x then i : [] else []; 15.53/6.67 findIndices00 p _ = []; 15.53/6.67 " 15.53/6.67 15.53/6.67 ---------------------------------------- 15.53/6.67 15.53/6.67 (4) 15.53/6.67 Obligation: 15.53/6.67 mainModule Main 15.53/6.67 module Maybe where { 15.53/6.67 import qualified List; 15.53/6.67 import qualified Main; 15.53/6.67 import qualified Prelude; 15.53/6.67 listToMaybe :: [a] -> Maybe a; 15.53/6.67 listToMaybe [] = Nothing; 15.53/6.67 listToMaybe (a : _) = Just a; 15.53/6.67 15.53/6.67 } 15.53/6.67 module List where { 15.53/6.67 import qualified Main; 15.53/6.67 import qualified Maybe; 15.53/6.67 import qualified Prelude; 15.53/6.67 elemIndex :: Eq a => a -> [a] -> Maybe Int; 15.53/6.67 elemIndex x = findIndex (== x); 15.53/6.67 15.53/6.67 findIndex :: (a -> Bool) -> [a] -> Maybe Int; 15.53/6.67 findIndex p = Maybe.listToMaybe . findIndices p; 15.53/6.67 15.53/6.67 findIndices :: (a -> Bool) -> [a] -> [Int]; 15.53/6.67 findIndices p xs = concatMap (findIndices0 p) (zip xs (enumFrom 0)); 15.53/6.67 15.53/6.67 findIndices0 p vv1 = findIndices00 p vv1; 15.53/6.67 15.53/6.67 findIndices00 p (x,i) = if p x then i : [] else []; 15.53/6.67 findIndices00 p _ = []; 15.53/6.67 15.53/6.67 } 15.53/6.67 module Main where { 15.53/6.67 import qualified List; 15.53/6.67 import qualified Maybe; 15.53/6.67 import qualified Prelude; 15.53/6.67 } 15.53/6.67 15.53/6.67 ---------------------------------------- 15.53/6.67 15.53/6.67 (5) IFR (EQUIVALENT) 15.53/6.67 If Reductions: 15.53/6.67 The following If expression 15.53/6.67 "if p x then i : [] else []" 15.53/6.67 is transformed to 15.53/6.67 "findIndices000 i True = i : []; 15.53/6.67 findIndices000 i False = []; 15.53/6.67 " 15.53/6.67 15.53/6.67 ---------------------------------------- 15.53/6.67 15.53/6.67 (6) 15.53/6.67 Obligation: 15.53/6.67 mainModule Main 15.53/6.67 module Maybe where { 15.53/6.67 import qualified List; 15.53/6.67 import qualified Main; 15.53/6.67 import qualified Prelude; 15.53/6.67 listToMaybe :: [a] -> Maybe a; 15.53/6.67 listToMaybe [] = Nothing; 15.53/6.67 listToMaybe (a : _) = Just a; 15.53/6.67 15.53/6.67 } 15.53/6.67 module List where { 15.53/6.67 import qualified Main; 15.53/6.67 import qualified Maybe; 15.53/6.67 import qualified Prelude; 15.53/6.67 elemIndex :: Eq a => a -> [a] -> Maybe Int; 15.53/6.67 elemIndex x = findIndex (== x); 15.53/6.67 15.53/6.67 findIndex :: (a -> Bool) -> [a] -> Maybe Int; 15.53/6.67 findIndex p = Maybe.listToMaybe . findIndices p; 15.53/6.67 15.53/6.67 findIndices :: (a -> Bool) -> [a] -> [Int]; 15.53/6.67 findIndices p xs = concatMap (findIndices0 p) (zip xs (enumFrom 0)); 15.53/6.67 15.53/6.67 findIndices0 p vv1 = findIndices00 p vv1; 15.53/6.67 15.53/6.67 findIndices00 p (x,i) = findIndices000 i (p x); 15.53/6.67 findIndices00 p _ = []; 15.53/6.67 15.53/6.67 findIndices000 i True = i : []; 15.53/6.67 findIndices000 i False = []; 15.53/6.67 15.53/6.67 } 15.53/6.67 module Main where { 15.53/6.67 import qualified List; 15.53/6.67 import qualified Maybe; 15.53/6.67 import qualified Prelude; 15.53/6.67 } 15.53/6.67 15.53/6.67 ---------------------------------------- 15.53/6.67 15.53/6.67 (7) BR (EQUIVALENT) 15.53/6.67 Replaced joker patterns by fresh variables and removed binding patterns. 15.53/6.67 ---------------------------------------- 15.53/6.67 15.53/6.67 (8) 15.53/6.67 Obligation: 15.53/6.67 mainModule Main 15.53/6.67 module Maybe where { 15.53/6.67 import qualified List; 15.53/6.67 import qualified Main; 15.53/6.67 import qualified Prelude; 15.53/6.67 listToMaybe :: [a] -> Maybe a; 15.53/6.67 listToMaybe [] = Nothing; 15.53/6.67 listToMaybe (a : wx) = Just a; 15.53/6.67 15.53/6.67 } 15.53/6.67 module List where { 15.53/6.67 import qualified Main; 15.53/6.67 import qualified Maybe; 15.53/6.67 import qualified Prelude; 15.53/6.67 elemIndex :: Eq a => a -> [a] -> Maybe Int; 15.53/6.67 elemIndex x = findIndex (== x); 15.53/6.67 15.53/6.67 findIndex :: (a -> Bool) -> [a] -> Maybe Int; 15.53/6.67 findIndex p = Maybe.listToMaybe . findIndices p; 15.53/6.67 15.53/6.67 findIndices :: (a -> Bool) -> [a] -> [Int]; 15.53/6.67 findIndices p xs = concatMap (findIndices0 p) (zip xs (enumFrom 0)); 15.53/6.67 15.53/6.67 findIndices0 p vv1 = findIndices00 p vv1; 15.53/6.67 15.53/6.67 findIndices00 p (x,i) = findIndices000 i (p x); 15.53/6.67 findIndices00 p wy = []; 15.53/6.67 15.53/6.67 findIndices000 i True = i : []; 15.53/6.67 findIndices000 i False = []; 15.53/6.67 15.53/6.67 } 15.53/6.67 module Main where { 15.53/6.67 import qualified List; 15.53/6.67 import qualified Maybe; 15.53/6.67 import qualified Prelude; 15.53/6.67 } 15.53/6.67 15.53/6.67 ---------------------------------------- 15.53/6.67 15.53/6.67 (9) COR (EQUIVALENT) 15.53/6.67 Cond Reductions: 15.53/6.67 The following Function with conditions 15.53/6.67 "undefined |Falseundefined; 15.53/6.67 " 15.53/6.67 is transformed to 15.53/6.67 "undefined = undefined1; 15.53/6.67 " 15.53/6.67 "undefined0 True = undefined; 15.53/6.67 " 15.53/6.67 "undefined1 = undefined0 False; 15.53/6.67 " 15.53/6.67 15.53/6.67 ---------------------------------------- 15.53/6.67 15.53/6.67 (10) 15.53/6.67 Obligation: 15.53/6.67 mainModule Main 15.53/6.67 module Maybe where { 15.53/6.67 import qualified List; 15.53/6.67 import qualified Main; 15.53/6.67 import qualified Prelude; 15.53/6.67 listToMaybe :: [a] -> Maybe a; 15.53/6.67 listToMaybe [] = Nothing; 15.53/6.67 listToMaybe (a : wx) = Just a; 15.53/6.67 15.53/6.67 } 15.53/6.67 module List where { 15.53/6.67 import qualified Main; 15.53/6.67 import qualified Maybe; 15.53/6.67 import qualified Prelude; 15.53/6.67 elemIndex :: Eq a => a -> [a] -> Maybe Int; 15.53/6.67 elemIndex x = findIndex (== x); 15.53/6.67 15.53/6.67 findIndex :: (a -> Bool) -> [a] -> Maybe Int; 15.53/6.67 findIndex p = Maybe.listToMaybe . findIndices p; 15.53/6.67 15.53/6.67 findIndices :: (a -> Bool) -> [a] -> [Int]; 15.53/6.67 findIndices p xs = concatMap (findIndices0 p) (zip xs (enumFrom 0)); 15.53/6.67 15.53/6.67 findIndices0 p vv1 = findIndices00 p vv1; 15.53/6.67 15.53/6.67 findIndices00 p (x,i) = findIndices000 i (p x); 15.53/6.67 findIndices00 p wy = []; 15.53/6.67 15.53/6.67 findIndices000 i True = i : []; 15.53/6.67 findIndices000 i False = []; 15.53/6.67 15.53/6.67 } 15.53/6.67 module Main where { 15.53/6.67 import qualified List; 15.53/6.67 import qualified Maybe; 15.53/6.67 import qualified Prelude; 15.53/6.67 } 15.53/6.67 15.53/6.67 ---------------------------------------- 15.53/6.67 15.53/6.67 (11) NumRed (SOUND) 15.53/6.67 Num Reduction:All numbers are transformed to their corresponding representation with Succ, Pred and Zero. 15.53/6.67 ---------------------------------------- 15.53/6.67 15.53/6.67 (12) 15.53/6.67 Obligation: 15.53/6.67 mainModule Main 15.53/6.67 module Maybe where { 15.53/6.67 import qualified List; 15.53/6.67 import qualified Main; 15.53/6.67 import qualified Prelude; 15.53/6.67 listToMaybe :: [a] -> Maybe a; 15.53/6.67 listToMaybe [] = Nothing; 15.53/6.67 listToMaybe (a : wx) = Just a; 15.53/6.67 15.53/6.67 } 15.53/6.67 module List where { 15.53/6.67 import qualified Main; 15.53/6.67 import qualified Maybe; 15.53/6.67 import qualified Prelude; 15.53/6.67 elemIndex :: Eq a => a -> [a] -> Maybe Int; 15.53/6.67 elemIndex x = findIndex (== x); 15.53/6.67 15.53/6.67 findIndex :: (a -> Bool) -> [a] -> Maybe Int; 15.53/6.67 findIndex p = Maybe.listToMaybe . findIndices p; 15.53/6.67 15.53/6.67 findIndices :: (a -> Bool) -> [a] -> [Int]; 15.53/6.67 findIndices p xs = concatMap (findIndices0 p) (zip xs (enumFrom (Pos Zero))); 15.53/6.67 15.53/6.67 findIndices0 p vv1 = findIndices00 p vv1; 15.53/6.67 15.53/6.67 findIndices00 p (x,i) = findIndices000 i (p x); 15.53/6.67 findIndices00 p wy = []; 15.53/6.67 15.53/6.67 findIndices000 i True = i : []; 15.53/6.67 findIndices000 i False = []; 15.53/6.67 15.53/6.67 } 15.53/6.67 module Main where { 15.53/6.67 import qualified List; 15.53/6.67 import qualified Maybe; 15.53/6.67 import qualified Prelude; 15.53/6.67 } 15.53/6.67 15.53/6.67 ---------------------------------------- 15.53/6.67 15.53/6.67 (13) Narrow (SOUND) 15.53/6.67 Haskell To QDPs 15.53/6.67 15.53/6.67 digraph dp_graph { 15.53/6.67 node [outthreshold=100, inthreshold=100];1[label="List.elemIndex",fontsize=16,color="grey",shape="box"];1 -> 3[label="",style="dashed", color="grey", weight=3]; 15.53/6.67 3[label="List.elemIndex wz3",fontsize=16,color="grey",shape="box"];3 -> 4[label="",style="dashed", color="grey", weight=3]; 15.53/6.67 4[label="List.elemIndex wz3 wz4",fontsize=16,color="black",shape="triangle"];4 -> 5[label="",style="solid", color="black", weight=3]; 15.53/6.67 5[label="List.findIndex (wz3 ==) wz4",fontsize=16,color="black",shape="box"];5 -> 6[label="",style="solid", color="black", weight=3]; 15.53/6.67 6[label="Maybe.listToMaybe . List.findIndices (wz3 ==)",fontsize=16,color="black",shape="box"];6 -> 7[label="",style="solid", color="black", weight=3]; 15.53/6.67 7[label="Maybe.listToMaybe (List.findIndices (wz3 ==) wz4)",fontsize=16,color="black",shape="box"];7 -> 8[label="",style="solid", color="black", weight=3]; 15.53/6.67 8[label="Maybe.listToMaybe (concatMap (List.findIndices0 (wz3 ==)) (zip wz4 (enumFrom (Pos Zero))))",fontsize=16,color="black",shape="box"];8 -> 9[label="",style="solid", color="black", weight=3]; 15.53/6.67 9[label="Maybe.listToMaybe (concat . map (List.findIndices0 (wz3 ==)))",fontsize=16,color="black",shape="box"];9 -> 10[label="",style="solid", color="black", weight=3]; 15.53/6.67 10[label="Maybe.listToMaybe (concat (map (List.findIndices0 (wz3 ==)) (zip wz4 (enumFrom (Pos Zero)))))",fontsize=16,color="black",shape="box"];10 -> 11[label="",style="solid", color="black", weight=3]; 15.53/6.67 11[label="Maybe.listToMaybe (foldr (++) [] (map (List.findIndices0 (wz3 ==)) (zip wz4 (enumFrom (Pos Zero)))))",fontsize=16,color="black",shape="box"];11 -> 12[label="",style="solid", color="black", weight=3]; 15.53/6.67 12[label="Maybe.listToMaybe (foldr (++) [] (map (List.findIndices0 (wz3 ==)) (zipWith zip0 wz4 (enumFrom (Pos Zero)))))",fontsize=16,color="burlywood",shape="box"];1404[label="wz4/wz40 : wz41",fontsize=10,color="white",style="solid",shape="box"];12 -> 1404[label="",style="solid", color="burlywood", weight=9]; 15.53/6.67 1404 -> 13[label="",style="solid", color="burlywood", weight=3]; 15.53/6.67 1405[label="wz4/[]",fontsize=10,color="white",style="solid",shape="box"];12 -> 1405[label="",style="solid", color="burlywood", weight=9]; 15.53/6.67 1405 -> 14[label="",style="solid", color="burlywood", weight=3]; 15.53/6.67 13[label="Maybe.listToMaybe (foldr (++) [] (map (List.findIndices0 (wz3 ==)) (zipWith zip0 (wz40 : wz41) (enumFrom (Pos Zero)))))",fontsize=16,color="black",shape="box"];13 -> 15[label="",style="solid", color="black", weight=3]; 15.53/6.67 14[label="Maybe.listToMaybe (foldr (++) [] (map (List.findIndices0 (wz3 ==)) (zipWith zip0 [] (enumFrom (Pos Zero)))))",fontsize=16,color="black",shape="box"];14 -> 16[label="",style="solid", color="black", weight=3]; 15.53/6.67 15[label="Maybe.listToMaybe (foldr (++) [] (map (List.findIndices0 (wz3 ==)) (zipWith zip0 (wz40 : wz41) (numericEnumFrom (Pos Zero)))))",fontsize=16,color="black",shape="box"];15 -> 17[label="",style="solid", color="black", weight=3]; 15.53/6.67 16[label="Maybe.listToMaybe (foldr (++) [] (map (List.findIndices0 (wz3 ==)) []))",fontsize=16,color="black",shape="box"];16 -> 18[label="",style="solid", color="black", weight=3]; 15.53/6.67 17[label="Maybe.listToMaybe (foldr (++) [] (map (List.findIndices0 (wz3 ==)) (zipWith zip0 (wz40 : wz41) (Pos Zero : (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero)))))))",fontsize=16,color="black",shape="box"];17 -> 19[label="",style="solid", color="black", weight=3]; 15.53/6.67 18[label="Maybe.listToMaybe (foldr (++) [] [])",fontsize=16,color="black",shape="triangle"];18 -> 20[label="",style="solid", color="black", weight=3]; 15.53/6.67 19[label="Maybe.listToMaybe (foldr (++) [] (map (List.findIndices0 (wz3 ==)) (zip0 wz40 (Pos Zero) : zipWith zip0 wz41 (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="box"];19 -> 21[label="",style="solid", color="black", weight=3]; 15.53/6.67 20[label="Maybe.listToMaybe []",fontsize=16,color="black",shape="box"];20 -> 22[label="",style="solid", color="black", weight=3]; 15.53/6.67 21[label="Maybe.listToMaybe (foldr (++) [] (List.findIndices0 (wz3 ==) (zip0 wz40 (Pos Zero)) : map (List.findIndices0 (wz3 ==)) (zipWith zip0 wz41 (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="box"];21 -> 23[label="",style="solid", color="black", weight=3]; 15.53/6.67 22[label="Nothing",fontsize=16,color="green",shape="box"];23[label="Maybe.listToMaybe ((++) List.findIndices0 (wz3 ==) (zip0 wz40 (Pos Zero)) foldr (++) [] (map (List.findIndices0 (wz3 ==)) (zipWith zip0 wz41 (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="box"];23 -> 24[label="",style="solid", color="black", weight=3]; 15.53/6.67 24[label="Maybe.listToMaybe ((++) List.findIndices00 (wz3 ==) (zip0 wz40 (Pos Zero)) foldr (++) [] (map (List.findIndices0 (wz3 ==)) (zipWith zip0 wz41 (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="box"];24 -> 25[label="",style="solid", color="black", weight=3]; 15.53/6.67 25[label="Maybe.listToMaybe ((++) List.findIndices00 (wz3 ==) (wz40,Pos Zero) foldr (++) [] (map (List.findIndices0 (wz3 ==)) (zipWith zip0 wz41 (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="box"];25 -> 26[label="",style="solid", color="black", weight=3]; 15.53/6.67 26[label="Maybe.listToMaybe ((++) List.findIndices000 (Pos Zero) (wz3 == wz40) foldr (++) [] (map (List.findIndices0 (wz3 ==)) (zipWith zip0 wz41 (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="box"];26 -> 27[label="",style="solid", color="black", weight=3]; 15.53/6.67 27[label="Maybe.listToMaybe ((++) List.findIndices000 (Pos Zero) (primEqInt wz3 wz40) foldr (++) [] (map (List.findIndices0 (primEqInt wz3)) (zipWith zip0 wz41 (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero))))))",fontsize=16,color="burlywood",shape="box"];1406[label="wz3/Pos wz30",fontsize=10,color="white",style="solid",shape="box"];27 -> 1406[label="",style="solid", color="burlywood", weight=9]; 15.53/6.67 1406 -> 28[label="",style="solid", color="burlywood", weight=3]; 15.53/6.67 1407[label="wz3/Neg wz30",fontsize=10,color="white",style="solid",shape="box"];27 -> 1407[label="",style="solid", color="burlywood", weight=9]; 15.53/6.67 1407 -> 29[label="",style="solid", color="burlywood", weight=3]; 15.53/6.67 28[label="Maybe.listToMaybe ((++) List.findIndices000 (Pos Zero) (primEqInt (Pos wz30) wz40) foldr (++) [] (map (List.findIndices0 (primEqInt (Pos wz30))) (zipWith zip0 wz41 (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero))))))",fontsize=16,color="burlywood",shape="box"];1408[label="wz30/Succ wz300",fontsize=10,color="white",style="solid",shape="box"];28 -> 1408[label="",style="solid", color="burlywood", weight=9]; 15.53/6.67 1408 -> 30[label="",style="solid", color="burlywood", weight=3]; 15.53/6.67 1409[label="wz30/Zero",fontsize=10,color="white",style="solid",shape="box"];28 -> 1409[label="",style="solid", color="burlywood", weight=9]; 15.53/6.67 1409 -> 31[label="",style="solid", color="burlywood", weight=3]; 15.53/6.67 29[label="Maybe.listToMaybe ((++) List.findIndices000 (Pos Zero) (primEqInt (Neg wz30) wz40) foldr (++) [] (map (List.findIndices0 (primEqInt (Neg wz30))) (zipWith zip0 wz41 (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero))))))",fontsize=16,color="burlywood",shape="box"];1410[label="wz30/Succ wz300",fontsize=10,color="white",style="solid",shape="box"];29 -> 1410[label="",style="solid", color="burlywood", weight=9]; 15.53/6.67 1410 -> 32[label="",style="solid", color="burlywood", weight=3]; 15.53/6.67 1411[label="wz30/Zero",fontsize=10,color="white",style="solid",shape="box"];29 -> 1411[label="",style="solid", color="burlywood", weight=9]; 15.53/6.67 1411 -> 33[label="",style="solid", color="burlywood", weight=3]; 15.53/6.67 30[label="Maybe.listToMaybe ((++) List.findIndices000 (Pos Zero) (primEqInt (Pos (Succ wz300)) wz40) foldr (++) [] (map (List.findIndices0 (primEqInt (Pos (Succ wz300)))) (zipWith zip0 wz41 (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero))))))",fontsize=16,color="burlywood",shape="box"];1412[label="wz40/Pos wz400",fontsize=10,color="white",style="solid",shape="box"];30 -> 1412[label="",style="solid", color="burlywood", weight=9]; 15.53/6.67 1412 -> 34[label="",style="solid", color="burlywood", weight=3]; 15.53/6.67 1413[label="wz40/Neg wz400",fontsize=10,color="white",style="solid",shape="box"];30 -> 1413[label="",style="solid", color="burlywood", weight=9]; 15.53/6.67 1413 -> 35[label="",style="solid", color="burlywood", weight=3]; 15.53/6.67 31[label="Maybe.listToMaybe ((++) List.findIndices000 (Pos Zero) (primEqInt (Pos Zero) wz40) foldr (++) [] (map (List.findIndices0 (primEqInt (Pos Zero))) (zipWith zip0 wz41 (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero))))))",fontsize=16,color="burlywood",shape="box"];1414[label="wz40/Pos wz400",fontsize=10,color="white",style="solid",shape="box"];31 -> 1414[label="",style="solid", color="burlywood", weight=9]; 15.53/6.67 1414 -> 36[label="",style="solid", color="burlywood", weight=3]; 15.53/6.67 1415[label="wz40/Neg wz400",fontsize=10,color="white",style="solid",shape="box"];31 -> 1415[label="",style="solid", color="burlywood", weight=9]; 15.53/6.67 1415 -> 37[label="",style="solid", color="burlywood", weight=3]; 15.53/6.67 32[label="Maybe.listToMaybe ((++) List.findIndices000 (Pos Zero) (primEqInt (Neg (Succ wz300)) wz40) foldr (++) [] (map (List.findIndices0 (primEqInt (Neg (Succ wz300)))) (zipWith zip0 wz41 (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero))))))",fontsize=16,color="burlywood",shape="box"];1416[label="wz40/Pos wz400",fontsize=10,color="white",style="solid",shape="box"];32 -> 1416[label="",style="solid", color="burlywood", weight=9]; 15.53/6.67 1416 -> 38[label="",style="solid", color="burlywood", weight=3]; 15.53/6.67 1417[label="wz40/Neg wz400",fontsize=10,color="white",style="solid",shape="box"];32 -> 1417[label="",style="solid", color="burlywood", weight=9]; 15.53/6.67 1417 -> 39[label="",style="solid", color="burlywood", weight=3]; 15.53/6.67 33[label="Maybe.listToMaybe ((++) List.findIndices000 (Pos Zero) (primEqInt (Neg Zero) wz40) foldr (++) [] (map (List.findIndices0 (primEqInt (Neg Zero))) (zipWith zip0 wz41 (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero))))))",fontsize=16,color="burlywood",shape="box"];1418[label="wz40/Pos wz400",fontsize=10,color="white",style="solid",shape="box"];33 -> 1418[label="",style="solid", color="burlywood", weight=9]; 15.53/6.67 1418 -> 40[label="",style="solid", color="burlywood", weight=3]; 15.53/6.67 1419[label="wz40/Neg wz400",fontsize=10,color="white",style="solid",shape="box"];33 -> 1419[label="",style="solid", color="burlywood", weight=9]; 15.53/6.67 1419 -> 41[label="",style="solid", color="burlywood", weight=3]; 15.53/6.67 34[label="Maybe.listToMaybe ((++) List.findIndices000 (Pos Zero) (primEqInt (Pos (Succ wz300)) (Pos wz400)) foldr (++) [] (map (List.findIndices0 (primEqInt (Pos (Succ wz300)))) (zipWith zip0 wz41 (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero))))))",fontsize=16,color="burlywood",shape="box"];1420[label="wz400/Succ wz4000",fontsize=10,color="white",style="solid",shape="box"];34 -> 1420[label="",style="solid", color="burlywood", weight=9]; 15.53/6.67 1420 -> 42[label="",style="solid", color="burlywood", weight=3]; 15.53/6.67 1421[label="wz400/Zero",fontsize=10,color="white",style="solid",shape="box"];34 -> 1421[label="",style="solid", color="burlywood", weight=9]; 15.53/6.67 1421 -> 43[label="",style="solid", color="burlywood", weight=3]; 15.53/6.67 35[label="Maybe.listToMaybe ((++) List.findIndices000 (Pos Zero) (primEqInt (Pos (Succ wz300)) (Neg wz400)) foldr (++) [] (map (List.findIndices0 (primEqInt (Pos (Succ wz300)))) (zipWith zip0 wz41 (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="box"];35 -> 44[label="",style="solid", color="black", weight=3]; 15.53/6.67 36[label="Maybe.listToMaybe ((++) List.findIndices000 (Pos Zero) (primEqInt (Pos Zero) (Pos wz400)) foldr (++) [] (map (List.findIndices0 (primEqInt (Pos Zero))) (zipWith zip0 wz41 (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero))))))",fontsize=16,color="burlywood",shape="box"];1422[label="wz400/Succ wz4000",fontsize=10,color="white",style="solid",shape="box"];36 -> 1422[label="",style="solid", color="burlywood", weight=9]; 15.53/6.67 1422 -> 45[label="",style="solid", color="burlywood", weight=3]; 15.53/6.67 1423[label="wz400/Zero",fontsize=10,color="white",style="solid",shape="box"];36 -> 1423[label="",style="solid", color="burlywood", weight=9]; 15.53/6.67 1423 -> 46[label="",style="solid", color="burlywood", weight=3]; 15.53/6.67 37[label="Maybe.listToMaybe ((++) List.findIndices000 (Pos Zero) (primEqInt (Pos Zero) (Neg wz400)) foldr (++) [] (map (List.findIndices0 (primEqInt (Pos Zero))) (zipWith zip0 wz41 (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero))))))",fontsize=16,color="burlywood",shape="box"];1424[label="wz400/Succ wz4000",fontsize=10,color="white",style="solid",shape="box"];37 -> 1424[label="",style="solid", color="burlywood", weight=9]; 15.53/6.67 1424 -> 47[label="",style="solid", color="burlywood", weight=3]; 15.53/6.67 1425[label="wz400/Zero",fontsize=10,color="white",style="solid",shape="box"];37 -> 1425[label="",style="solid", color="burlywood", weight=9]; 15.53/6.67 1425 -> 48[label="",style="solid", color="burlywood", weight=3]; 15.53/6.67 38[label="Maybe.listToMaybe ((++) List.findIndices000 (Pos Zero) (primEqInt (Neg (Succ wz300)) (Pos wz400)) foldr (++) [] (map (List.findIndices0 (primEqInt (Neg (Succ wz300)))) (zipWith zip0 wz41 (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="box"];38 -> 49[label="",style="solid", color="black", weight=3]; 15.53/6.67 39[label="Maybe.listToMaybe ((++) List.findIndices000 (Pos Zero) (primEqInt (Neg (Succ wz300)) (Neg wz400)) foldr (++) [] (map (List.findIndices0 (primEqInt (Neg (Succ wz300)))) (zipWith zip0 wz41 (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero))))))",fontsize=16,color="burlywood",shape="box"];1426[label="wz400/Succ wz4000",fontsize=10,color="white",style="solid",shape="box"];39 -> 1426[label="",style="solid", color="burlywood", weight=9]; 15.53/6.67 1426 -> 50[label="",style="solid", color="burlywood", weight=3]; 15.53/6.67 1427[label="wz400/Zero",fontsize=10,color="white",style="solid",shape="box"];39 -> 1427[label="",style="solid", color="burlywood", weight=9]; 15.53/6.67 1427 -> 51[label="",style="solid", color="burlywood", weight=3]; 15.53/6.67 40[label="Maybe.listToMaybe ((++) List.findIndices000 (Pos Zero) (primEqInt (Neg Zero) (Pos wz400)) foldr (++) [] (map (List.findIndices0 (primEqInt (Neg Zero))) (zipWith zip0 wz41 (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero))))))",fontsize=16,color="burlywood",shape="box"];1428[label="wz400/Succ wz4000",fontsize=10,color="white",style="solid",shape="box"];40 -> 1428[label="",style="solid", color="burlywood", weight=9]; 15.53/6.67 1428 -> 52[label="",style="solid", color="burlywood", weight=3]; 15.53/6.67 1429[label="wz400/Zero",fontsize=10,color="white",style="solid",shape="box"];40 -> 1429[label="",style="solid", color="burlywood", weight=9]; 15.53/6.67 1429 -> 53[label="",style="solid", color="burlywood", weight=3]; 15.53/6.67 41[label="Maybe.listToMaybe ((++) List.findIndices000 (Pos Zero) (primEqInt (Neg Zero) (Neg wz400)) foldr (++) [] (map (List.findIndices0 (primEqInt (Neg Zero))) (zipWith zip0 wz41 (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero))))))",fontsize=16,color="burlywood",shape="box"];1430[label="wz400/Succ wz4000",fontsize=10,color="white",style="solid",shape="box"];41 -> 1430[label="",style="solid", color="burlywood", weight=9]; 15.53/6.67 1430 -> 54[label="",style="solid", color="burlywood", weight=3]; 15.53/6.67 1431[label="wz400/Zero",fontsize=10,color="white",style="solid",shape="box"];41 -> 1431[label="",style="solid", color="burlywood", weight=9]; 15.53/6.67 1431 -> 55[label="",style="solid", color="burlywood", weight=3]; 15.53/6.67 42[label="Maybe.listToMaybe ((++) List.findIndices000 (Pos Zero) (primEqInt (Pos (Succ wz300)) (Pos (Succ wz4000))) foldr (++) [] (map (List.findIndices0 (primEqInt (Pos (Succ wz300)))) (zipWith zip0 wz41 (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="box"];42 -> 56[label="",style="solid", color="black", weight=3]; 15.53/6.67 43[label="Maybe.listToMaybe ((++) List.findIndices000 (Pos Zero) (primEqInt (Pos (Succ wz300)) (Pos Zero)) foldr (++) [] (map (List.findIndices0 (primEqInt (Pos (Succ wz300)))) (zipWith zip0 wz41 (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="box"];43 -> 57[label="",style="solid", color="black", weight=3]; 15.53/6.67 44[label="Maybe.listToMaybe ((++) List.findIndices000 (Pos Zero) False foldr (++) [] (map (List.findIndices0 (primEqInt (Pos (Succ wz300)))) (zipWith zip0 wz41 (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="triangle"];44 -> 58[label="",style="solid", color="black", weight=3]; 15.53/6.67 45[label="Maybe.listToMaybe ((++) List.findIndices000 (Pos Zero) (primEqInt (Pos Zero) (Pos (Succ wz4000))) foldr (++) [] (map (List.findIndices0 (primEqInt (Pos Zero))) (zipWith zip0 wz41 (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="box"];45 -> 59[label="",style="solid", color="black", weight=3]; 15.53/6.67 46[label="Maybe.listToMaybe ((++) List.findIndices000 (Pos Zero) (primEqInt (Pos Zero) (Pos Zero)) foldr (++) [] (map (List.findIndices0 (primEqInt (Pos Zero))) (zipWith zip0 wz41 (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="box"];46 -> 60[label="",style="solid", color="black", weight=3]; 15.53/6.67 47[label="Maybe.listToMaybe ((++) List.findIndices000 (Pos Zero) (primEqInt (Pos Zero) (Neg (Succ wz4000))) foldr (++) [] (map (List.findIndices0 (primEqInt (Pos Zero))) (zipWith zip0 wz41 (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="box"];47 -> 61[label="",style="solid", color="black", weight=3]; 15.53/6.67 48[label="Maybe.listToMaybe ((++) List.findIndices000 (Pos Zero) (primEqInt (Pos Zero) (Neg Zero)) foldr (++) [] (map (List.findIndices0 (primEqInt (Pos Zero))) (zipWith zip0 wz41 (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="box"];48 -> 62[label="",style="solid", color="black", weight=3]; 15.53/6.67 49[label="Maybe.listToMaybe ((++) List.findIndices000 (Pos Zero) False foldr (++) [] (map (List.findIndices0 (primEqInt (Neg (Succ wz300)))) (zipWith zip0 wz41 (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="triangle"];49 -> 63[label="",style="solid", color="black", weight=3]; 15.53/6.67 50[label="Maybe.listToMaybe ((++) List.findIndices000 (Pos Zero) (primEqInt (Neg (Succ wz300)) (Neg (Succ wz4000))) foldr (++) [] (map (List.findIndices0 (primEqInt (Neg (Succ wz300)))) (zipWith zip0 wz41 (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="box"];50 -> 64[label="",style="solid", color="black", weight=3]; 15.53/6.67 51[label="Maybe.listToMaybe ((++) List.findIndices000 (Pos Zero) (primEqInt (Neg (Succ wz300)) (Neg Zero)) foldr (++) [] (map (List.findIndices0 (primEqInt (Neg (Succ wz300)))) (zipWith zip0 wz41 (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="box"];51 -> 65[label="",style="solid", color="black", weight=3]; 15.53/6.67 52[label="Maybe.listToMaybe ((++) List.findIndices000 (Pos Zero) (primEqInt (Neg Zero) (Pos (Succ wz4000))) foldr (++) [] (map (List.findIndices0 (primEqInt (Neg Zero))) (zipWith zip0 wz41 (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="box"];52 -> 66[label="",style="solid", color="black", weight=3]; 15.53/6.67 53[label="Maybe.listToMaybe ((++) List.findIndices000 (Pos Zero) (primEqInt (Neg Zero) (Pos Zero)) foldr (++) [] (map (List.findIndices0 (primEqInt (Neg Zero))) (zipWith zip0 wz41 (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="box"];53 -> 67[label="",style="solid", color="black", weight=3]; 15.53/6.67 54[label="Maybe.listToMaybe ((++) List.findIndices000 (Pos Zero) (primEqInt (Neg Zero) (Neg (Succ wz4000))) foldr (++) [] (map (List.findIndices0 (primEqInt (Neg Zero))) (zipWith zip0 wz41 (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="box"];54 -> 68[label="",style="solid", color="black", weight=3]; 15.53/6.67 55[label="Maybe.listToMaybe ((++) List.findIndices000 (Pos Zero) (primEqInt (Neg Zero) (Neg Zero)) foldr (++) [] (map (List.findIndices0 (primEqInt (Neg Zero))) (zipWith zip0 wz41 (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="box"];55 -> 69[label="",style="solid", color="black", weight=3]; 15.53/6.67 56 -> 1322[label="",style="dashed", color="red", weight=0]; 15.53/6.67 56[label="Maybe.listToMaybe ((++) List.findIndices000 (Pos Zero) (primEqNat wz300 wz4000) foldr (++) [] (map (List.findIndices0 (primEqInt (Pos (Succ wz300)))) (zipWith zip0 wz41 (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero))))))",fontsize=16,color="magenta"];56 -> 1323[label="",style="dashed", color="magenta", weight=3]; 15.53/6.67 56 -> 1324[label="",style="dashed", color="magenta", weight=3]; 15.53/6.67 56 -> 1325[label="",style="dashed", color="magenta", weight=3]; 15.53/6.67 56 -> 1326[label="",style="dashed", color="magenta", weight=3]; 15.53/6.67 56 -> 1327[label="",style="dashed", color="magenta", weight=3]; 15.53/6.67 57 -> 44[label="",style="dashed", color="red", weight=0]; 15.53/6.67 57[label="Maybe.listToMaybe ((++) List.findIndices000 (Pos Zero) False foldr (++) [] (map (List.findIndices0 (primEqInt (Pos (Succ wz300)))) (zipWith zip0 wz41 (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero))))))",fontsize=16,color="magenta"];58[label="Maybe.listToMaybe ((++) [] foldr (++) [] (map (List.findIndices0 (primEqInt (Pos (Succ wz300)))) (zipWith zip0 wz41 (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="box"];58 -> 72[label="",style="solid", color="black", weight=3]; 15.53/6.67 59 -> 812[label="",style="dashed", color="red", weight=0]; 15.53/6.67 59[label="Maybe.listToMaybe ((++) List.findIndices000 (Pos Zero) False foldr (++) [] (map (List.findIndices0 (primEqInt (Pos Zero))) (zipWith zip0 wz41 (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero))))))",fontsize=16,color="magenta"];59 -> 813[label="",style="dashed", color="magenta", weight=3]; 15.53/6.67 59 -> 814[label="",style="dashed", color="magenta", weight=3]; 15.53/6.67 59 -> 815[label="",style="dashed", color="magenta", weight=3]; 15.53/6.67 60[label="Maybe.listToMaybe ((++) List.findIndices000 (Pos Zero) True foldr (++) [] (map (List.findIndices0 (primEqInt (Pos Zero))) (zipWith zip0 wz41 (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="triangle"];60 -> 74[label="",style="solid", color="black", weight=3]; 15.53/6.67 61 -> 812[label="",style="dashed", color="red", weight=0]; 15.53/6.67 61[label="Maybe.listToMaybe ((++) List.findIndices000 (Pos Zero) False foldr (++) [] (map (List.findIndices0 (primEqInt (Pos Zero))) (zipWith zip0 wz41 (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero))))))",fontsize=16,color="magenta"];61 -> 816[label="",style="dashed", color="magenta", weight=3]; 15.53/6.67 61 -> 817[label="",style="dashed", color="magenta", weight=3]; 15.53/6.67 61 -> 818[label="",style="dashed", color="magenta", weight=3]; 15.53/6.67 62 -> 60[label="",style="dashed", color="red", weight=0]; 15.53/6.67 62[label="Maybe.listToMaybe ((++) List.findIndices000 (Pos Zero) True foldr (++) [] (map (List.findIndices0 (primEqInt (Pos Zero))) (zipWith zip0 wz41 (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero))))))",fontsize=16,color="magenta"];63[label="Maybe.listToMaybe ((++) [] foldr (++) [] (map (List.findIndices0 (primEqInt (Neg (Succ wz300)))) (zipWith zip0 wz41 (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="box"];63 -> 75[label="",style="solid", color="black", weight=3]; 15.53/6.67 64 -> 1100[label="",style="dashed", color="red", weight=0]; 15.53/6.67 64[label="Maybe.listToMaybe ((++) List.findIndices000 (Pos Zero) (primEqNat wz300 wz4000) foldr (++) [] (map (List.findIndices0 (primEqInt (Neg (Succ wz300)))) (zipWith zip0 wz41 (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero))))))",fontsize=16,color="magenta"];64 -> 1101[label="",style="dashed", color="magenta", weight=3]; 15.53/6.67 64 -> 1102[label="",style="dashed", color="magenta", weight=3]; 15.53/6.67 64 -> 1103[label="",style="dashed", color="magenta", weight=3]; 15.53/6.67 64 -> 1104[label="",style="dashed", color="magenta", weight=3]; 15.53/6.67 64 -> 1105[label="",style="dashed", color="magenta", weight=3]; 15.53/6.67 64 -> 1106[label="",style="dashed", color="magenta", weight=3]; 15.53/6.67 65 -> 49[label="",style="dashed", color="red", weight=0]; 15.53/6.67 65[label="Maybe.listToMaybe ((++) List.findIndices000 (Pos Zero) False foldr (++) [] (map (List.findIndices0 (primEqInt (Neg (Succ wz300)))) (zipWith zip0 wz41 (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero))))))",fontsize=16,color="magenta"];66[label="Maybe.listToMaybe ((++) List.findIndices000 (Pos Zero) False foldr (++) [] (map (List.findIndices0 (primEqInt (Neg Zero))) (zipWith zip0 wz41 (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="triangle"];66 -> 78[label="",style="solid", color="black", weight=3]; 15.53/6.67 67[label="Maybe.listToMaybe ((++) List.findIndices000 (Pos Zero) True foldr (++) [] (map (List.findIndices0 (primEqInt (Neg Zero))) (zipWith zip0 wz41 (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="triangle"];67 -> 79[label="",style="solid", color="black", weight=3]; 15.53/6.67 68 -> 66[label="",style="dashed", color="red", weight=0]; 15.53/6.67 68[label="Maybe.listToMaybe ((++) List.findIndices000 (Pos Zero) False foldr (++) [] (map (List.findIndices0 (primEqInt (Neg Zero))) (zipWith zip0 wz41 (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero))))))",fontsize=16,color="magenta"];69 -> 67[label="",style="dashed", color="red", weight=0]; 15.53/6.67 69[label="Maybe.listToMaybe ((++) List.findIndices000 (Pos Zero) True foldr (++) [] (map (List.findIndices0 (primEqInt (Neg Zero))) (zipWith zip0 wz41 (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero))))))",fontsize=16,color="magenta"];1323[label="wz300",fontsize=16,color="green",shape="box"];1324[label="wz4000",fontsize=16,color="green",shape="box"];1325[label="Zero",fontsize=16,color="green",shape="box"];1326[label="wz41",fontsize=16,color="green",shape="box"];1327[label="wz300",fontsize=16,color="green",shape="box"];1322[label="Maybe.listToMaybe ((++) List.findIndices000 (Pos wz66) (primEqNat wz67 wz68) foldr (++) [] (map (List.findIndices0 (primEqInt (Pos (Succ wz69)))) (zipWith zip0 wz70 (numericEnumFrom $! Pos wz66 + fromInt (Pos (Succ Zero))))))",fontsize=16,color="burlywood",shape="triangle"];1432[label="wz67/Succ wz670",fontsize=10,color="white",style="solid",shape="box"];1322 -> 1432[label="",style="solid", color="burlywood", weight=9]; 15.53/6.67 1432 -> 1383[label="",style="solid", color="burlywood", weight=3]; 15.53/6.67 1433[label="wz67/Zero",fontsize=10,color="white",style="solid",shape="box"];1322 -> 1433[label="",style="solid", color="burlywood", weight=9]; 15.53/6.67 1433 -> 1384[label="",style="solid", color="burlywood", weight=3]; 15.53/6.67 72[label="Maybe.listToMaybe (foldr (++) [] (map (List.findIndices0 (primEqInt (Pos (Succ wz300)))) (zipWith zip0 wz41 (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero))))))",fontsize=16,color="burlywood",shape="box"];1434[label="wz41/wz410 : wz411",fontsize=10,color="white",style="solid",shape="box"];72 -> 1434[label="",style="solid", color="burlywood", weight=9]; 15.53/6.67 1434 -> 84[label="",style="solid", color="burlywood", weight=3]; 15.53/6.67 1435[label="wz41/[]",fontsize=10,color="white",style="solid",shape="box"];72 -> 1435[label="",style="solid", color="burlywood", weight=9]; 15.53/6.67 1435 -> 85[label="",style="solid", color="burlywood", weight=3]; 15.53/6.67 813[label="wz41",fontsize=16,color="green",shape="box"];814[label="Zero",fontsize=16,color="green",shape="box"];815[label="Zero",fontsize=16,color="green",shape="box"];812[label="Maybe.listToMaybe ((++) List.findIndices000 (Pos wz35) False foldr (++) [] (map (List.findIndices0 (primEqInt (Pos Zero))) (zipWith zip0 wz4111 (numericEnumFrom $! Pos wz36 + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="triangle"];812 -> 823[label="",style="solid", color="black", weight=3]; 15.53/6.67 74[label="Maybe.listToMaybe ((++) (Pos Zero : []) foldr (++) [] (map (List.findIndices0 (primEqInt (Pos Zero))) (zipWith zip0 wz41 (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="box"];74 -> 87[label="",style="solid", color="black", weight=3]; 15.53/6.67 816[label="wz41",fontsize=16,color="green",shape="box"];817[label="Zero",fontsize=16,color="green",shape="box"];818[label="Zero",fontsize=16,color="green",shape="box"];75[label="Maybe.listToMaybe (foldr (++) [] (map (List.findIndices0 (primEqInt (Neg (Succ wz300)))) (zipWith zip0 wz41 (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero))))))",fontsize=16,color="burlywood",shape="box"];1436[label="wz41/wz410 : wz411",fontsize=10,color="white",style="solid",shape="box"];75 -> 1436[label="",style="solid", color="burlywood", weight=9]; 15.53/6.67 1436 -> 88[label="",style="solid", color="burlywood", weight=3]; 15.53/6.67 1437[label="wz41/[]",fontsize=10,color="white",style="solid",shape="box"];75 -> 1437[label="",style="solid", color="burlywood", weight=9]; 15.53/6.67 1437 -> 89[label="",style="solid", color="burlywood", weight=3]; 15.53/6.67 1101[label="wz41",fontsize=16,color="green",shape="box"];1102[label="wz300",fontsize=16,color="green",shape="box"];1103[label="wz300",fontsize=16,color="green",shape="box"];1104[label="Zero",fontsize=16,color="green",shape="box"];1105[label="wz4000",fontsize=16,color="green",shape="box"];1106[label="Zero",fontsize=16,color="green",shape="box"];1100[label="Maybe.listToMaybe ((++) List.findIndices000 (Pos wz55) (primEqNat wz56 wz57) foldr (++) [] (map (List.findIndices0 (primEqInt (Neg (Succ wz58)))) (zipWith zip0 wz59 (numericEnumFrom $! Pos wz60 + fromInt (Pos (Succ Zero))))))",fontsize=16,color="burlywood",shape="triangle"];1438[label="wz56/Succ wz560",fontsize=10,color="white",style="solid",shape="box"];1100 -> 1438[label="",style="solid", color="burlywood", weight=9]; 15.53/6.67 1438 -> 1179[label="",style="solid", color="burlywood", weight=3]; 15.53/6.67 1439[label="wz56/Zero",fontsize=10,color="white",style="solid",shape="box"];1100 -> 1439[label="",style="solid", color="burlywood", weight=9]; 15.53/6.67 1439 -> 1180[label="",style="solid", color="burlywood", weight=3]; 15.53/6.67 78[label="Maybe.listToMaybe ((++) [] foldr (++) [] (map (List.findIndices0 (primEqInt (Neg Zero))) (zipWith zip0 wz41 (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="box"];78 -> 94[label="",style="solid", color="black", weight=3]; 15.53/6.67 79[label="Maybe.listToMaybe ((++) (Pos Zero : []) foldr (++) [] (map (List.findIndices0 (primEqInt (Neg Zero))) (zipWith zip0 wz41 (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="box"];79 -> 95[label="",style="solid", color="black", weight=3]; 15.53/6.67 1383[label="Maybe.listToMaybe ((++) List.findIndices000 (Pos wz66) (primEqNat (Succ wz670) wz68) foldr (++) [] (map (List.findIndices0 (primEqInt (Pos (Succ wz69)))) (zipWith zip0 wz70 (numericEnumFrom $! Pos wz66 + fromInt (Pos (Succ Zero))))))",fontsize=16,color="burlywood",shape="box"];1440[label="wz68/Succ wz680",fontsize=10,color="white",style="solid",shape="box"];1383 -> 1440[label="",style="solid", color="burlywood", weight=9]; 15.53/6.67 1440 -> 1385[label="",style="solid", color="burlywood", weight=3]; 15.53/6.67 1441[label="wz68/Zero",fontsize=10,color="white",style="solid",shape="box"];1383 -> 1441[label="",style="solid", color="burlywood", weight=9]; 15.53/6.67 1441 -> 1386[label="",style="solid", color="burlywood", weight=3]; 15.53/6.67 1384[label="Maybe.listToMaybe ((++) List.findIndices000 (Pos wz66) (primEqNat Zero wz68) foldr (++) [] (map (List.findIndices0 (primEqInt (Pos (Succ wz69)))) (zipWith zip0 wz70 (numericEnumFrom $! Pos wz66 + fromInt (Pos (Succ Zero))))))",fontsize=16,color="burlywood",shape="box"];1442[label="wz68/Succ wz680",fontsize=10,color="white",style="solid",shape="box"];1384 -> 1442[label="",style="solid", color="burlywood", weight=9]; 15.53/6.67 1442 -> 1387[label="",style="solid", color="burlywood", weight=3]; 15.53/6.67 1443[label="wz68/Zero",fontsize=10,color="white",style="solid",shape="box"];1384 -> 1443[label="",style="solid", color="burlywood", weight=9]; 15.53/6.67 1443 -> 1388[label="",style="solid", color="burlywood", weight=3]; 15.53/6.67 84[label="Maybe.listToMaybe (foldr (++) [] (map (List.findIndices0 (primEqInt (Pos (Succ wz300)))) (zipWith zip0 (wz410 : wz411) (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="box"];84 -> 100[label="",style="solid", color="black", weight=3]; 15.53/6.67 85[label="Maybe.listToMaybe (foldr (++) [] (map (List.findIndices0 (primEqInt (Pos (Succ wz300)))) (zipWith zip0 [] (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="box"];85 -> 101[label="",style="solid", color="black", weight=3]; 15.53/6.67 823[label="Maybe.listToMaybe ((++) [] foldr (++) [] (map (List.findIndices0 (primEqInt (Pos Zero))) (zipWith zip0 wz4111 (numericEnumFrom $! Pos wz36 + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="box"];823 -> 827[label="",style="solid", color="black", weight=3]; 15.53/6.67 87[label="Maybe.listToMaybe (Pos Zero : [] ++ foldr (++) [] (map (List.findIndices0 (primEqInt (Pos Zero))) (zipWith zip0 wz41 (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="box"];87 -> 104[label="",style="solid", color="black", weight=3]; 15.53/6.67 88[label="Maybe.listToMaybe (foldr (++) [] (map (List.findIndices0 (primEqInt (Neg (Succ wz300)))) (zipWith zip0 (wz410 : wz411) (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="box"];88 -> 105[label="",style="solid", color="black", weight=3]; 15.53/6.67 89[label="Maybe.listToMaybe (foldr (++) [] (map (List.findIndices0 (primEqInt (Neg (Succ wz300)))) (zipWith zip0 [] (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="box"];89 -> 106[label="",style="solid", color="black", weight=3]; 15.53/6.67 1179[label="Maybe.listToMaybe ((++) List.findIndices000 (Pos wz55) (primEqNat (Succ wz560) wz57) foldr (++) [] (map (List.findIndices0 (primEqInt (Neg (Succ wz58)))) (zipWith zip0 wz59 (numericEnumFrom $! Pos wz60 + fromInt (Pos (Succ Zero))))))",fontsize=16,color="burlywood",shape="box"];1444[label="wz57/Succ wz570",fontsize=10,color="white",style="solid",shape="box"];1179 -> 1444[label="",style="solid", color="burlywood", weight=9]; 15.53/6.67 1444 -> 1186[label="",style="solid", color="burlywood", weight=3]; 15.53/6.67 1445[label="wz57/Zero",fontsize=10,color="white",style="solid",shape="box"];1179 -> 1445[label="",style="solid", color="burlywood", weight=9]; 15.53/6.67 1445 -> 1187[label="",style="solid", color="burlywood", weight=3]; 15.53/6.67 1180[label="Maybe.listToMaybe ((++) List.findIndices000 (Pos wz55) (primEqNat Zero wz57) foldr (++) [] (map (List.findIndices0 (primEqInt (Neg (Succ wz58)))) (zipWith zip0 wz59 (numericEnumFrom $! Pos wz60 + fromInt (Pos (Succ Zero))))))",fontsize=16,color="burlywood",shape="box"];1446[label="wz57/Succ wz570",fontsize=10,color="white",style="solid",shape="box"];1180 -> 1446[label="",style="solid", color="burlywood", weight=9]; 15.53/6.67 1446 -> 1188[label="",style="solid", color="burlywood", weight=3]; 15.53/6.67 1447[label="wz57/Zero",fontsize=10,color="white",style="solid",shape="box"];1180 -> 1447[label="",style="solid", color="burlywood", weight=9]; 15.53/6.67 1447 -> 1189[label="",style="solid", color="burlywood", weight=3]; 15.53/6.67 94[label="Maybe.listToMaybe (foldr (++) [] (map (List.findIndices0 (primEqInt (Neg Zero))) (zipWith zip0 wz41 (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero))))))",fontsize=16,color="burlywood",shape="box"];1448[label="wz41/wz410 : wz411",fontsize=10,color="white",style="solid",shape="box"];94 -> 1448[label="",style="solid", color="burlywood", weight=9]; 15.53/6.67 1448 -> 111[label="",style="solid", color="burlywood", weight=3]; 15.53/6.67 1449[label="wz41/[]",fontsize=10,color="white",style="solid",shape="box"];94 -> 1449[label="",style="solid", color="burlywood", weight=9]; 15.53/6.67 1449 -> 112[label="",style="solid", color="burlywood", weight=3]; 15.53/6.67 95[label="Maybe.listToMaybe (Pos Zero : [] ++ foldr (++) [] (map (List.findIndices0 (primEqInt (Neg Zero))) (zipWith zip0 wz41 (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="box"];95 -> 113[label="",style="solid", color="black", weight=3]; 15.53/6.67 1385[label="Maybe.listToMaybe ((++) List.findIndices000 (Pos wz66) (primEqNat (Succ wz670) (Succ wz680)) foldr (++) [] (map (List.findIndices0 (primEqInt (Pos (Succ wz69)))) (zipWith zip0 wz70 (numericEnumFrom $! Pos wz66 + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="box"];1385 -> 1389[label="",style="solid", color="black", weight=3]; 15.53/6.67 1386[label="Maybe.listToMaybe ((++) List.findIndices000 (Pos wz66) (primEqNat (Succ wz670) Zero) foldr (++) [] (map (List.findIndices0 (primEqInt (Pos (Succ wz69)))) (zipWith zip0 wz70 (numericEnumFrom $! Pos wz66 + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="box"];1386 -> 1390[label="",style="solid", color="black", weight=3]; 15.53/6.67 1387[label="Maybe.listToMaybe ((++) List.findIndices000 (Pos wz66) (primEqNat Zero (Succ wz680)) foldr (++) [] (map (List.findIndices0 (primEqInt (Pos (Succ wz69)))) (zipWith zip0 wz70 (numericEnumFrom $! Pos wz66 + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="box"];1387 -> 1391[label="",style="solid", color="black", weight=3]; 15.53/6.67 1388[label="Maybe.listToMaybe ((++) List.findIndices000 (Pos wz66) (primEqNat Zero Zero) foldr (++) [] (map (List.findIndices0 (primEqInt (Pos (Succ wz69)))) (zipWith zip0 wz70 (numericEnumFrom $! Pos wz66 + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="box"];1388 -> 1392[label="",style="solid", color="black", weight=3]; 15.53/6.67 100 -> 835[label="",style="dashed", color="red", weight=0]; 15.53/6.67 100[label="Maybe.listToMaybe (foldr (++) [] (map (List.findIndices0 (primEqInt (Pos (Succ wz300)))) (zipWith zip0 (wz410 : wz411) (Pos Zero + fromInt (Pos (Succ Zero)) `seq` numericEnumFrom (Pos Zero + fromInt (Pos (Succ Zero)))))))",fontsize=16,color="magenta"];100 -> 836[label="",style="dashed", color="magenta", weight=3]; 15.53/6.67 100 -> 837[label="",style="dashed", color="magenta", weight=3]; 15.53/6.67 100 -> 838[label="",style="dashed", color="magenta", weight=3]; 15.53/6.67 100 -> 839[label="",style="dashed", color="magenta", weight=3]; 15.53/6.67 101[label="Maybe.listToMaybe (foldr (++) [] (map (List.findIndices0 (primEqInt (Pos (Succ wz300)))) []))",fontsize=16,color="black",shape="triangle"];101 -> 120[label="",style="solid", color="black", weight=3]; 15.53/6.67 827[label="Maybe.listToMaybe (foldr (++) [] (map (List.findIndices0 (primEqInt (Pos Zero))) (zipWith zip0 wz4111 (numericEnumFrom $! Pos wz36 + fromInt (Pos (Succ Zero))))))",fontsize=16,color="burlywood",shape="box"];1450[label="wz4111/wz41110 : wz41111",fontsize=10,color="white",style="solid",shape="box"];827 -> 1450[label="",style="solid", color="burlywood", weight=9]; 15.53/6.67 1450 -> 833[label="",style="solid", color="burlywood", weight=3]; 15.53/6.67 1451[label="wz4111/[]",fontsize=10,color="white",style="solid",shape="box"];827 -> 1451[label="",style="solid", color="burlywood", weight=9]; 15.53/6.67 1451 -> 834[label="",style="solid", color="burlywood", weight=3]; 15.53/6.67 104[label="Just (Pos Zero)",fontsize=16,color="green",shape="box"];105[label="Maybe.listToMaybe (foldr (++) [] (map (List.findIndices0 (primEqInt (Neg (Succ wz300)))) (zipWith zip0 (wz410 : wz411) (Pos Zero + fromInt (Pos (Succ Zero)) `seq` numericEnumFrom (Pos Zero + fromInt (Pos (Succ Zero)))))))",fontsize=16,color="black",shape="box"];105 -> 123[label="",style="solid", color="black", weight=3]; 15.53/6.67 106[label="Maybe.listToMaybe (foldr (++) [] (map (List.findIndices0 (primEqInt (Neg (Succ wz300)))) []))",fontsize=16,color="black",shape="triangle"];106 -> 124[label="",style="solid", color="black", weight=3]; 15.53/6.67 1186[label="Maybe.listToMaybe ((++) List.findIndices000 (Pos wz55) (primEqNat (Succ wz560) (Succ wz570)) foldr (++) [] (map (List.findIndices0 (primEqInt (Neg (Succ wz58)))) (zipWith zip0 wz59 (numericEnumFrom $! Pos wz60 + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="box"];1186 -> 1195[label="",style="solid", color="black", weight=3]; 15.53/6.67 1187[label="Maybe.listToMaybe ((++) List.findIndices000 (Pos wz55) (primEqNat (Succ wz560) Zero) foldr (++) [] (map (List.findIndices0 (primEqInt (Neg (Succ wz58)))) (zipWith zip0 wz59 (numericEnumFrom $! Pos wz60 + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="box"];1187 -> 1196[label="",style="solid", color="black", weight=3]; 15.53/6.67 1188[label="Maybe.listToMaybe ((++) List.findIndices000 (Pos wz55) (primEqNat Zero (Succ wz570)) foldr (++) [] (map (List.findIndices0 (primEqInt (Neg (Succ wz58)))) (zipWith zip0 wz59 (numericEnumFrom $! Pos wz60 + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="box"];1188 -> 1197[label="",style="solid", color="black", weight=3]; 15.53/6.67 1189[label="Maybe.listToMaybe ((++) List.findIndices000 (Pos wz55) (primEqNat Zero Zero) foldr (++) [] (map (List.findIndices0 (primEqInt (Neg (Succ wz58)))) (zipWith zip0 wz59 (numericEnumFrom $! Pos wz60 + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="box"];1189 -> 1198[label="",style="solid", color="black", weight=3]; 15.53/6.67 111[label="Maybe.listToMaybe (foldr (++) [] (map (List.findIndices0 (primEqInt (Neg Zero))) (zipWith zip0 (wz410 : wz411) (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="box"];111 -> 130[label="",style="solid", color="black", weight=3]; 15.53/6.67 112[label="Maybe.listToMaybe (foldr (++) [] (map (List.findIndices0 (primEqInt (Neg Zero))) (zipWith zip0 [] (numericEnumFrom $! Pos Zero + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="box"];112 -> 131[label="",style="solid", color="black", weight=3]; 15.53/6.67 113[label="Just (Pos Zero)",fontsize=16,color="green",shape="box"];1389 -> 1322[label="",style="dashed", color="red", weight=0]; 15.53/6.67 1389[label="Maybe.listToMaybe ((++) List.findIndices000 (Pos wz66) (primEqNat wz670 wz680) foldr (++) [] (map (List.findIndices0 (primEqInt (Pos (Succ wz69)))) (zipWith zip0 wz70 (numericEnumFrom $! Pos wz66 + fromInt (Pos (Succ Zero))))))",fontsize=16,color="magenta"];1389 -> 1393[label="",style="dashed", color="magenta", weight=3]; 15.53/6.67 1389 -> 1394[label="",style="dashed", color="magenta", weight=3]; 15.53/6.67 1390 -> 1016[label="",style="dashed", color="red", weight=0]; 15.53/6.67 1390[label="Maybe.listToMaybe ((++) List.findIndices000 (Pos wz66) False foldr (++) [] (map (List.findIndices0 (primEqInt (Pos (Succ wz69)))) (zipWith zip0 wz70 (numericEnumFrom $! Pos wz66 + fromInt (Pos (Succ Zero))))))",fontsize=16,color="magenta"];1390 -> 1395[label="",style="dashed", color="magenta", weight=3]; 15.53/6.67 1390 -> 1396[label="",style="dashed", color="magenta", weight=3]; 15.53/6.67 1390 -> 1397[label="",style="dashed", color="magenta", weight=3]; 15.53/6.67 1391 -> 1016[label="",style="dashed", color="red", weight=0]; 15.53/6.67 1391[label="Maybe.listToMaybe ((++) List.findIndices000 (Pos wz66) False foldr (++) [] (map (List.findIndices0 (primEqInt (Pos (Succ wz69)))) (zipWith zip0 wz70 (numericEnumFrom $! Pos wz66 + fromInt (Pos (Succ Zero))))))",fontsize=16,color="magenta"];1391 -> 1398[label="",style="dashed", color="magenta", weight=3]; 15.53/6.67 1391 -> 1399[label="",style="dashed", color="magenta", weight=3]; 15.53/6.67 1391 -> 1400[label="",style="dashed", color="magenta", weight=3]; 15.53/6.67 1392[label="Maybe.listToMaybe ((++) List.findIndices000 (Pos wz66) True foldr (++) [] (map (List.findIndices0 (primEqInt (Pos (Succ wz69)))) (zipWith zip0 wz70 (numericEnumFrom $! Pos wz66 + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="box"];1392 -> 1401[label="",style="solid", color="black", weight=3]; 15.53/6.67 836[label="Zero",fontsize=16,color="green",shape="box"];837[label="wz411",fontsize=16,color="green",shape="box"];838[label="Zero",fontsize=16,color="green",shape="box"];839[label="wz410",fontsize=16,color="green",shape="box"];835[label="Maybe.listToMaybe (foldr (++) [] (map (List.findIndices0 (primEqInt (Pos (Succ wz300)))) (zipWith zip0 (wz41110 : wz41111) (Pos wz41 + fromInt (Pos (Succ Zero)) `seq` numericEnumFrom (Pos wz42 + fromInt (Pos (Succ Zero)))))))",fontsize=16,color="black",shape="triangle"];835 -> 842[label="",style="solid", color="black", weight=3]; 15.53/6.67 120 -> 18[label="",style="dashed", color="red", weight=0]; 15.53/6.67 120[label="Maybe.listToMaybe (foldr (++) [] [])",fontsize=16,color="magenta"];833[label="Maybe.listToMaybe (foldr (++) [] (map (List.findIndices0 (primEqInt (Pos Zero))) (zipWith zip0 (wz41110 : wz41111) (numericEnumFrom $! Pos wz36 + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="box"];833 -> 843[label="",style="solid", color="black", weight=3]; 15.53/6.67 834[label="Maybe.listToMaybe (foldr (++) [] (map (List.findIndices0 (primEqInt (Pos Zero))) (zipWith zip0 [] (numericEnumFrom $! Pos wz36 + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="box"];834 -> 844[label="",style="solid", color="black", weight=3]; 15.53/6.67 123[label="Maybe.listToMaybe (foldr (++) [] (map (List.findIndices0 (primEqInt (Neg (Succ wz300)))) (zipWith zip0 (wz410 : wz411) (enforceWHNF (WHNF (Pos Zero + fromInt (Pos (Succ Zero)))) (numericEnumFrom (Pos Zero + fromInt (Pos (Succ Zero))))))))",fontsize=16,color="black",shape="box"];123 -> 140[label="",style="solid", color="black", weight=3]; 15.53/6.67 124 -> 18[label="",style="dashed", color="red", weight=0]; 15.53/6.67 124[label="Maybe.listToMaybe (foldr (++) [] [])",fontsize=16,color="magenta"];1195 -> 1100[label="",style="dashed", color="red", weight=0]; 15.53/6.67 1195[label="Maybe.listToMaybe ((++) List.findIndices000 (Pos wz55) (primEqNat wz560 wz570) foldr (++) [] (map (List.findIndices0 (primEqInt (Neg (Succ wz58)))) (zipWith zip0 wz59 (numericEnumFrom $! Pos wz60 + fromInt (Pos (Succ Zero))))))",fontsize=16,color="magenta"];1195 -> 1204[label="",style="dashed", color="magenta", weight=3]; 15.53/6.67 1195 -> 1205[label="",style="dashed", color="magenta", weight=3]; 15.53/6.67 1196[label="Maybe.listToMaybe ((++) List.findIndices000 (Pos wz55) False foldr (++) [] (map (List.findIndices0 (primEqInt (Neg (Succ wz58)))) (zipWith zip0 wz59 (numericEnumFrom $! Pos wz60 + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="triangle"];1196 -> 1206[label="",style="solid", color="black", weight=3]; 15.53/6.67 1197 -> 1196[label="",style="dashed", color="red", weight=0]; 15.53/6.67 1197[label="Maybe.listToMaybe ((++) List.findIndices000 (Pos wz55) False foldr (++) [] (map (List.findIndices0 (primEqInt (Neg (Succ wz58)))) (zipWith zip0 wz59 (numericEnumFrom $! Pos wz60 + fromInt (Pos (Succ Zero))))))",fontsize=16,color="magenta"];1198[label="Maybe.listToMaybe ((++) List.findIndices000 (Pos wz55) True foldr (++) [] (map (List.findIndices0 (primEqInt (Neg (Succ wz58)))) (zipWith zip0 wz59 (numericEnumFrom $! Pos wz60 + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="box"];1198 -> 1207[label="",style="solid", color="black", weight=3]; 15.53/6.67 130 -> 527[label="",style="dashed", color="red", weight=0]; 15.53/6.67 130[label="Maybe.listToMaybe (foldr (++) [] (map (List.findIndices0 (primEqInt (Neg Zero))) (zipWith zip0 (wz410 : wz411) (Pos Zero + fromInt (Pos (Succ Zero)) `seq` numericEnumFrom (Pos Zero + fromInt (Pos (Succ Zero)))))))",fontsize=16,color="magenta"];130 -> 528[label="",style="dashed", color="magenta", weight=3]; 15.53/6.67 130 -> 529[label="",style="dashed", color="magenta", weight=3]; 15.53/6.67 130 -> 530[label="",style="dashed", color="magenta", weight=3]; 15.53/6.67 130 -> 531[label="",style="dashed", color="magenta", weight=3]; 15.53/6.67 131[label="Maybe.listToMaybe (foldr (++) [] (map (List.findIndices0 (primEqInt (Neg Zero))) []))",fontsize=16,color="black",shape="triangle"];131 -> 147[label="",style="solid", color="black", weight=3]; 15.53/6.67 1393[label="wz680",fontsize=16,color="green",shape="box"];1394[label="wz670",fontsize=16,color="green",shape="box"];1395[label="wz66",fontsize=16,color="green",shape="box"];1396[label="wz70",fontsize=16,color="green",shape="box"];1397[label="wz69",fontsize=16,color="green",shape="box"];1016[label="Maybe.listToMaybe ((++) List.findIndices000 (Pos wz45) False foldr (++) [] (map (List.findIndices0 (primEqInt (Pos (Succ wz300)))) (zipWith zip0 wz41111 (numericEnumFrom $! Pos wz45 + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="triangle"];1016 -> 1029[label="",style="solid", color="black", weight=3]; 15.53/6.67 1398[label="wz66",fontsize=16,color="green",shape="box"];1399[label="wz70",fontsize=16,color="green",shape="box"];1400[label="wz69",fontsize=16,color="green",shape="box"];1401[label="Maybe.listToMaybe ((++) (Pos wz66 : []) foldr (++) [] (map (List.findIndices0 (primEqInt (Pos (Succ wz69)))) (zipWith zip0 wz70 (numericEnumFrom $! Pos wz66 + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="box"];1401 -> 1402[label="",style="solid", color="black", weight=3]; 15.53/6.67 842[label="Maybe.listToMaybe (foldr (++) [] (map (List.findIndices0 (primEqInt (Pos (Succ wz300)))) (zipWith zip0 (wz41110 : wz41111) (enforceWHNF (WHNF (Pos wz41 + fromInt (Pos (Succ Zero)))) (numericEnumFrom (Pos wz42 + fromInt (Pos (Succ Zero))))))))",fontsize=16,color="black",shape="box"];842 -> 855[label="",style="solid", color="black", weight=3]; 15.53/6.67 843[label="Maybe.listToMaybe (foldr (++) [] (map (List.findIndices0 (primEqInt (Pos Zero))) (zipWith zip0 (wz41110 : wz41111) (Pos wz36 + fromInt (Pos (Succ Zero)) `seq` numericEnumFrom (Pos wz36 + fromInt (Pos (Succ Zero)))))))",fontsize=16,color="black",shape="box"];843 -> 856[label="",style="solid", color="black", weight=3]; 15.53/6.67 844[label="Maybe.listToMaybe (foldr (++) [] (map (List.findIndices0 (primEqInt (Pos Zero))) []))",fontsize=16,color="black",shape="box"];844 -> 857[label="",style="solid", color="black", weight=3]; 15.53/6.67 140 -> 515[label="",style="dashed", color="red", weight=0]; 15.53/6.67 140[label="Maybe.listToMaybe (foldr (++) [] (map (List.findIndices0 (primEqInt (Neg (Succ wz300)))) (zipWith zip0 (wz410 : wz411) (enforceWHNF (WHNF (primPlusInt (Pos Zero) (fromInt (Pos (Succ Zero))))) (numericEnumFrom (primPlusInt (Pos Zero) (fromInt (Pos (Succ Zero)))))))))",fontsize=16,color="magenta"];140 -> 516[label="",style="dashed", color="magenta", weight=3]; 15.53/6.67 140 -> 517[label="",style="dashed", color="magenta", weight=3]; 15.53/6.67 140 -> 518[label="",style="dashed", color="magenta", weight=3]; 15.53/6.67 140 -> 519[label="",style="dashed", color="magenta", weight=3]; 15.53/6.67 1204[label="wz560",fontsize=16,color="green",shape="box"];1205[label="wz570",fontsize=16,color="green",shape="box"];1206[label="Maybe.listToMaybe ((++) [] foldr (++) [] (map (List.findIndices0 (primEqInt (Neg (Succ wz58)))) (zipWith zip0 wz59 (numericEnumFrom $! Pos wz60 + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="box"];1206 -> 1213[label="",style="solid", color="black", weight=3]; 15.53/6.67 1207[label="Maybe.listToMaybe ((++) (Pos wz55 : []) foldr (++) [] (map (List.findIndices0 (primEqInt (Neg (Succ wz58)))) (zipWith zip0 wz59 (numericEnumFrom $! Pos wz60 + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="box"];1207 -> 1214[label="",style="solid", color="black", weight=3]; 15.53/6.67 528[label="wz411",fontsize=16,color="green",shape="box"];529[label="Zero",fontsize=16,color="green",shape="box"];530[label="wz410",fontsize=16,color="green",shape="box"];531[label="Zero",fontsize=16,color="green",shape="box"];527[label="Maybe.listToMaybe (foldr (++) [] (map (List.findIndices0 (primEqInt (Neg Zero))) (zipWith zip0 (wz4110 : wz4111) (Pos wz13 + fromInt (Pos (Succ Zero)) `seq` numericEnumFrom (Pos wz14 + fromInt (Pos (Succ Zero)))))))",fontsize=16,color="black",shape="triangle"];527 -> 534[label="",style="solid", color="black", weight=3]; 15.53/6.67 147 -> 18[label="",style="dashed", color="red", weight=0]; 15.53/6.67 147[label="Maybe.listToMaybe (foldr (++) [] [])",fontsize=16,color="magenta"];1029[label="Maybe.listToMaybe ((++) [] foldr (++) [] (map (List.findIndices0 (primEqInt (Pos (Succ wz300)))) (zipWith zip0 wz41111 (numericEnumFrom $! Pos wz45 + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="box"];1029 -> 1040[label="",style="solid", color="black", weight=3]; 15.53/6.67 1402[label="Maybe.listToMaybe (Pos wz66 : [] ++ foldr (++) [] (map (List.findIndices0 (primEqInt (Pos (Succ wz69)))) (zipWith zip0 wz70 (numericEnumFrom $! Pos wz66 + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="box"];1402 -> 1403[label="",style="solid", color="black", weight=3]; 15.53/6.67 855[label="Maybe.listToMaybe (foldr (++) [] (map (List.findIndices0 (primEqInt (Pos (Succ wz300)))) (zipWith zip0 (wz41110 : wz41111) (enforceWHNF (WHNF (primPlusInt (Pos wz41) (fromInt (Pos (Succ Zero))))) (numericEnumFrom (primPlusInt (Pos wz42) (fromInt (Pos (Succ Zero)))))))))",fontsize=16,color="black",shape="box"];855 -> 866[label="",style="solid", color="black", weight=3]; 15.53/6.67 856[label="Maybe.listToMaybe (foldr (++) [] (map (List.findIndices0 (primEqInt (Pos Zero))) (zipWith zip0 (wz41110 : wz41111) (enforceWHNF (WHNF (Pos wz36 + fromInt (Pos (Succ Zero)))) (numericEnumFrom (Pos wz36 + fromInt (Pos (Succ Zero))))))))",fontsize=16,color="black",shape="box"];856 -> 867[label="",style="solid", color="black", weight=3]; 15.53/6.67 857 -> 18[label="",style="dashed", color="red", weight=0]; 15.53/6.67 857[label="Maybe.listToMaybe (foldr (++) [] [])",fontsize=16,color="magenta"];516[label="wz411",fontsize=16,color="green",shape="box"];517[label="wz410",fontsize=16,color="green",shape="box"];518[label="Zero",fontsize=16,color="green",shape="box"];519[label="Zero",fontsize=16,color="green",shape="box"];515[label="Maybe.listToMaybe (foldr (++) [] (map (List.findIndices0 (primEqInt (Neg (Succ wz300)))) (zipWith zip0 (wz4110 : wz4111) (enforceWHNF (WHNF (primPlusInt (Pos wz12) (fromInt (Pos (Succ Zero))))) (numericEnumFrom (primPlusInt (Pos wz11) (fromInt (Pos (Succ Zero)))))))))",fontsize=16,color="black",shape="triangle"];515 -> 522[label="",style="solid", color="black", weight=3]; 15.53/6.67 1213[label="Maybe.listToMaybe (foldr (++) [] (map (List.findIndices0 (primEqInt (Neg (Succ wz58)))) (zipWith zip0 wz59 (numericEnumFrom $! Pos wz60 + fromInt (Pos (Succ Zero))))))",fontsize=16,color="burlywood",shape="box"];1452[label="wz59/wz590 : wz591",fontsize=10,color="white",style="solid",shape="box"];1213 -> 1452[label="",style="solid", color="burlywood", weight=9]; 15.53/6.67 1452 -> 1220[label="",style="solid", color="burlywood", weight=3]; 15.53/6.67 1453[label="wz59/[]",fontsize=10,color="white",style="solid",shape="box"];1213 -> 1453[label="",style="solid", color="burlywood", weight=9]; 15.53/6.67 1453 -> 1221[label="",style="solid", color="burlywood", weight=3]; 15.53/6.67 1214[label="Maybe.listToMaybe (Pos wz55 : [] ++ foldr (++) [] (map (List.findIndices0 (primEqInt (Neg (Succ wz58)))) (zipWith zip0 wz59 (numericEnumFrom $! Pos wz60 + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="box"];1214 -> 1222[label="",style="solid", color="black", weight=3]; 15.53/6.67 534[label="Maybe.listToMaybe (foldr (++) [] (map (List.findIndices0 (primEqInt (Neg Zero))) (zipWith zip0 (wz4110 : wz4111) (enforceWHNF (WHNF (Pos wz13 + fromInt (Pos (Succ Zero)))) (numericEnumFrom (Pos wz14 + fromInt (Pos (Succ Zero))))))))",fontsize=16,color="black",shape="box"];534 -> 575[label="",style="solid", color="black", weight=3]; 15.53/6.67 1040[label="Maybe.listToMaybe (foldr (++) [] (map (List.findIndices0 (primEqInt (Pos (Succ wz300)))) (zipWith zip0 wz41111 (numericEnumFrom $! Pos wz45 + fromInt (Pos (Succ Zero))))))",fontsize=16,color="burlywood",shape="box"];1454[label="wz41111/wz411110 : wz411111",fontsize=10,color="white",style="solid",shape="box"];1040 -> 1454[label="",style="solid", color="burlywood", weight=9]; 15.53/6.67 1454 -> 1053[label="",style="solid", color="burlywood", weight=3]; 15.53/6.67 1455[label="wz41111/[]",fontsize=10,color="white",style="solid",shape="box"];1040 -> 1455[label="",style="solid", color="burlywood", weight=9]; 15.53/6.67 1455 -> 1054[label="",style="solid", color="burlywood", weight=3]; 15.53/6.67 1403[label="Just (Pos wz66)",fontsize=16,color="green",shape="box"];866[label="Maybe.listToMaybe (foldr (++) [] (map (List.findIndices0 (primEqInt (Pos (Succ wz300)))) (zipWith zip0 (wz41110 : wz41111) (enforceWHNF (WHNF (primPlusInt (Pos wz41) (Pos (Succ Zero)))) (numericEnumFrom (primPlusInt (Pos wz42) (Pos (Succ Zero))))))))",fontsize=16,color="black",shape="box"];866 -> 874[label="",style="solid", color="black", weight=3]; 15.53/6.67 867[label="Maybe.listToMaybe (foldr (++) [] (map (List.findIndices0 (primEqInt (Pos Zero))) (zipWith zip0 (wz41110 : wz41111) (enforceWHNF (WHNF (primPlusInt (Pos wz36) (fromInt (Pos (Succ Zero))))) (numericEnumFrom (primPlusInt (Pos wz36) (fromInt (Pos (Succ Zero)))))))))",fontsize=16,color="black",shape="box"];867 -> 875[label="",style="solid", color="black", weight=3]; 15.53/6.67 522[label="Maybe.listToMaybe (foldr (++) [] (map (List.findIndices0 (primEqInt (Neg (Succ wz300)))) (zipWith zip0 (wz4110 : wz4111) (enforceWHNF (WHNF (primPlusInt (Pos wz12) (Pos (Succ Zero)))) (numericEnumFrom (primPlusInt (Pos wz11) (Pos (Succ Zero))))))))",fontsize=16,color="black",shape="box"];522 -> 535[label="",style="solid", color="black", weight=3]; 15.53/6.67 1220[label="Maybe.listToMaybe (foldr (++) [] (map (List.findIndices0 (primEqInt (Neg (Succ wz58)))) (zipWith zip0 (wz590 : wz591) (numericEnumFrom $! Pos wz60 + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="box"];1220 -> 1228[label="",style="solid", color="black", weight=3]; 15.53/6.67 1221[label="Maybe.listToMaybe (foldr (++) [] (map (List.findIndices0 (primEqInt (Neg (Succ wz58)))) (zipWith zip0 [] (numericEnumFrom $! Pos wz60 + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="box"];1221 -> 1229[label="",style="solid", color="black", weight=3]; 15.53/6.67 1222[label="Just (Pos wz55)",fontsize=16,color="green",shape="box"];575[label="Maybe.listToMaybe (foldr (++) [] (map (List.findIndices0 (primEqInt (Neg Zero))) (zipWith zip0 (wz4110 : wz4111) (enforceWHNF (WHNF (primPlusInt (Pos wz13) (fromInt (Pos (Succ Zero))))) (numericEnumFrom (primPlusInt (Pos wz14) (fromInt (Pos (Succ Zero)))))))))",fontsize=16,color="black",shape="box"];575 -> 584[label="",style="solid", color="black", weight=3]; 15.53/6.67 1053[label="Maybe.listToMaybe (foldr (++) [] (map (List.findIndices0 (primEqInt (Pos (Succ wz300)))) (zipWith zip0 (wz411110 : wz411111) (numericEnumFrom $! Pos wz45 + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="box"];1053 -> 1074[label="",style="solid", color="black", weight=3]; 15.53/6.67 1054[label="Maybe.listToMaybe (foldr (++) [] (map (List.findIndices0 (primEqInt (Pos (Succ wz300)))) (zipWith zip0 [] (numericEnumFrom $! Pos wz45 + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="box"];1054 -> 1075[label="",style="solid", color="black", weight=3]; 15.53/6.67 874 -> 883[label="",style="dashed", color="red", weight=0]; 15.53/6.67 874[label="Maybe.listToMaybe (foldr (++) [] (map (List.findIndices0 (primEqInt (Pos (Succ wz300)))) (zipWith zip0 (wz41110 : wz41111) (enforceWHNF (WHNF (Pos (primPlusNat wz41 (Succ Zero)))) (numericEnumFrom (Pos (primPlusNat wz41 (Succ Zero))))))))",fontsize=16,color="magenta"];874 -> 884[label="",style="dashed", color="magenta", weight=3]; 15.53/6.67 874 -> 885[label="",style="dashed", color="magenta", weight=3]; 15.53/6.67 875[label="Maybe.listToMaybe (foldr (++) [] (map (List.findIndices0 (primEqInt (Pos Zero))) (zipWith zip0 (wz41110 : wz41111) (enforceWHNF (WHNF (primPlusInt (Pos wz36) (Pos (Succ Zero)))) (numericEnumFrom (primPlusInt (Pos wz36) (Pos (Succ Zero))))))))",fontsize=16,color="black",shape="box"];875 -> 886[label="",style="solid", color="black", weight=3]; 15.53/6.67 535[label="Maybe.listToMaybe (foldr (++) [] (map (List.findIndices0 (primEqInt (Neg (Succ wz300)))) (zipWith zip0 (wz4110 : wz4111) (enforceWHNF (WHNF (Pos (primPlusNat wz12 (Succ Zero)))) (numericEnumFrom (Pos (primPlusNat wz12 (Succ Zero))))))))",fontsize=16,color="black",shape="box"];535 -> 576[label="",style="solid", color="black", weight=3]; 15.53/6.67 1228[label="Maybe.listToMaybe (foldr (++) [] (map (List.findIndices0 (primEqInt (Neg (Succ wz58)))) (zipWith zip0 (wz590 : wz591) (Pos wz60 + fromInt (Pos (Succ Zero)) `seq` numericEnumFrom (Pos wz60 + fromInt (Pos (Succ Zero)))))))",fontsize=16,color="black",shape="box"];1228 -> 1235[label="",style="solid", color="black", weight=3]; 15.53/6.67 1229 -> 106[label="",style="dashed", color="red", weight=0]; 15.53/6.67 1229[label="Maybe.listToMaybe (foldr (++) [] (map (List.findIndices0 (primEqInt (Neg (Succ wz58)))) []))",fontsize=16,color="magenta"];1229 -> 1236[label="",style="dashed", color="magenta", weight=3]; 15.53/6.67 584[label="Maybe.listToMaybe (foldr (++) [] (map (List.findIndices0 (primEqInt (Neg Zero))) (zipWith zip0 (wz4110 : wz4111) (enforceWHNF (WHNF (primPlusInt (Pos wz13) (Pos (Succ Zero)))) (numericEnumFrom (primPlusInt (Pos wz14) (Pos (Succ Zero))))))))",fontsize=16,color="black",shape="box"];584 -> 595[label="",style="solid", color="black", weight=3]; 15.53/6.67 1074 -> 835[label="",style="dashed", color="red", weight=0]; 15.53/6.67 1074[label="Maybe.listToMaybe (foldr (++) [] (map (List.findIndices0 (primEqInt (Pos (Succ wz300)))) (zipWith zip0 (wz411110 : wz411111) (Pos wz45 + fromInt (Pos (Succ Zero)) `seq` numericEnumFrom (Pos wz45 + fromInt (Pos (Succ Zero)))))))",fontsize=16,color="magenta"];1074 -> 1086[label="",style="dashed", color="magenta", weight=3]; 15.53/6.67 1074 -> 1087[label="",style="dashed", color="magenta", weight=3]; 15.53/6.67 1074 -> 1088[label="",style="dashed", color="magenta", weight=3]; 15.53/6.67 1074 -> 1089[label="",style="dashed", color="magenta", weight=3]; 15.53/6.67 1075 -> 101[label="",style="dashed", color="red", weight=0]; 15.53/6.67 1075[label="Maybe.listToMaybe (foldr (++) [] (map (List.findIndices0 (primEqInt (Pos (Succ wz300)))) []))",fontsize=16,color="magenta"];884 -> 787[label="",style="dashed", color="red", weight=0]; 15.53/6.67 884[label="primPlusNat wz41 (Succ Zero)",fontsize=16,color="magenta"];884 -> 887[label="",style="dashed", color="magenta", weight=3]; 15.53/6.67 885 -> 787[label="",style="dashed", color="red", weight=0]; 15.53/6.67 885[label="primPlusNat wz41 (Succ Zero)",fontsize=16,color="magenta"];885 -> 888[label="",style="dashed", color="magenta", weight=3]; 15.53/6.67 883[label="Maybe.listToMaybe (foldr (++) [] (map (List.findIndices0 (primEqInt (Pos (Succ wz300)))) (zipWith zip0 (wz41110 : wz41111) (enforceWHNF (WHNF (Pos wz46)) (numericEnumFrom (Pos wz45))))))",fontsize=16,color="black",shape="triangle"];883 -> 889[label="",style="solid", color="black", weight=3]; 15.53/6.67 886 -> 897[label="",style="dashed", color="red", weight=0]; 15.53/6.67 886[label="Maybe.listToMaybe (foldr (++) [] (map (List.findIndices0 (primEqInt (Pos Zero))) (zipWith zip0 (wz41110 : wz41111) (enforceWHNF (WHNF (Pos (primPlusNat wz36 (Succ Zero)))) (numericEnumFrom (Pos (primPlusNat wz36 (Succ Zero))))))))",fontsize=16,color="magenta"];886 -> 898[label="",style="dashed", color="magenta", weight=3]; 15.53/6.67 886 -> 899[label="",style="dashed", color="magenta", weight=3]; 15.53/6.67 576[label="Maybe.listToMaybe (foldr (++) [] (map (List.findIndices0 (primEqInt (Neg (Succ wz300)))) (zipWith zip0 (wz4110 : wz4111) (numericEnumFrom (Pos (primPlusNat wz12 (Succ Zero)))))))",fontsize=16,color="black",shape="box"];576 -> 585[label="",style="solid", color="black", weight=3]; 15.53/6.67 1235[label="Maybe.listToMaybe (foldr (++) [] (map (List.findIndices0 (primEqInt (Neg (Succ wz58)))) (zipWith zip0 (wz590 : wz591) (enforceWHNF (WHNF (Pos wz60 + fromInt (Pos (Succ Zero)))) (numericEnumFrom (Pos wz60 + fromInt (Pos (Succ Zero))))))))",fontsize=16,color="black",shape="box"];1235 -> 1242[label="",style="solid", color="black", weight=3]; 15.53/6.67 1236[label="wz58",fontsize=16,color="green",shape="box"];595[label="Maybe.listToMaybe (foldr (++) [] (map (List.findIndices0 (primEqInt (Neg Zero))) (zipWith zip0 (wz4110 : wz4111) (enforceWHNF (WHNF (Pos (primPlusNat wz13 (Succ Zero)))) (numericEnumFrom (Pos (primPlusNat wz13 (Succ Zero))))))))",fontsize=16,color="black",shape="box"];595 -> 613[label="",style="solid", color="black", weight=3]; 15.53/6.67 1086[label="wz45",fontsize=16,color="green",shape="box"];1087[label="wz411111",fontsize=16,color="green",shape="box"];1088[label="wz45",fontsize=16,color="green",shape="box"];1089[label="wz411110",fontsize=16,color="green",shape="box"];887[label="wz41",fontsize=16,color="green",shape="box"];787[label="primPlusNat wz12 (Succ Zero)",fontsize=16,color="burlywood",shape="triangle"];1456[label="wz12/Succ wz120",fontsize=10,color="white",style="solid",shape="box"];787 -> 1456[label="",style="solid", color="burlywood", weight=9]; 15.53/6.67 1456 -> 807[label="",style="solid", color="burlywood", weight=3]; 15.53/6.67 1457[label="wz12/Zero",fontsize=10,color="white",style="solid",shape="box"];787 -> 1457[label="",style="solid", color="burlywood", weight=9]; 15.53/6.67 1457 -> 808[label="",style="solid", color="burlywood", weight=3]; 15.53/6.67 888[label="wz41",fontsize=16,color="green",shape="box"];889[label="Maybe.listToMaybe (foldr (++) [] (map (List.findIndices0 (primEqInt (Pos (Succ wz300)))) (zipWith zip0 (wz41110 : wz41111) (numericEnumFrom (Pos wz45)))))",fontsize=16,color="black",shape="box"];889 -> 900[label="",style="solid", color="black", weight=3]; 15.53/6.67 898 -> 787[label="",style="dashed", color="red", weight=0]; 15.53/6.67 898[label="primPlusNat wz36 (Succ Zero)",fontsize=16,color="magenta"];898 -> 901[label="",style="dashed", color="magenta", weight=3]; 15.53/6.67 899 -> 787[label="",style="dashed", color="red", weight=0]; 15.53/6.67 899[label="primPlusNat wz36 (Succ Zero)",fontsize=16,color="magenta"];899 -> 902[label="",style="dashed", color="magenta", weight=3]; 15.53/6.67 897[label="Maybe.listToMaybe (foldr (++) [] (map (List.findIndices0 (primEqInt (Pos Zero))) (zipWith zip0 (wz41110 : wz41111) (enforceWHNF (WHNF (Pos wz48)) (numericEnumFrom (Pos wz47))))))",fontsize=16,color="black",shape="triangle"];897 -> 903[label="",style="solid", color="black", weight=3]; 15.53/6.67 585[label="Maybe.listToMaybe (foldr (++) [] (map (List.findIndices0 (primEqInt (Neg (Succ wz300)))) (zipWith zip0 (wz4110 : wz4111) (Pos (primPlusNat wz12 (Succ Zero)) : (numericEnumFrom $! Pos (primPlusNat wz12 (Succ Zero)) + fromInt (Pos (Succ Zero)))))))",fontsize=16,color="black",shape="box"];585 -> 596[label="",style="solid", color="black", weight=3]; 15.53/6.67 1242 -> 515[label="",style="dashed", color="red", weight=0]; 15.53/6.67 1242[label="Maybe.listToMaybe (foldr (++) [] (map (List.findIndices0 (primEqInt (Neg (Succ wz58)))) (zipWith zip0 (wz590 : wz591) (enforceWHNF (WHNF (primPlusInt (Pos wz60) (fromInt (Pos (Succ Zero))))) (numericEnumFrom (primPlusInt (Pos wz60) (fromInt (Pos (Succ Zero)))))))))",fontsize=16,color="magenta"];1242 -> 1248[label="",style="dashed", color="magenta", weight=3]; 15.53/6.67 1242 -> 1249[label="",style="dashed", color="magenta", weight=3]; 15.53/6.67 1242 -> 1250[label="",style="dashed", color="magenta", weight=3]; 15.53/6.67 1242 -> 1251[label="",style="dashed", color="magenta", weight=3]; 15.53/6.67 1242 -> 1252[label="",style="dashed", color="magenta", weight=3]; 15.53/6.67 613[label="Maybe.listToMaybe (foldr (++) [] (map (List.findIndices0 (primEqInt (Neg Zero))) (zipWith zip0 (wz4110 : wz4111) (numericEnumFrom (Pos (primPlusNat wz13 (Succ Zero)))))))",fontsize=16,color="black",shape="box"];613 -> 625[label="",style="solid", color="black", weight=3]; 15.53/6.67 807[label="primPlusNat (Succ wz120) (Succ Zero)",fontsize=16,color="black",shape="box"];807 -> 861[label="",style="solid", color="black", weight=3]; 15.53/6.67 808[label="primPlusNat Zero (Succ Zero)",fontsize=16,color="black",shape="box"];808 -> 862[label="",style="solid", color="black", weight=3]; 15.53/6.67 900[label="Maybe.listToMaybe (foldr (++) [] (map (List.findIndices0 (primEqInt (Pos (Succ wz300)))) (zipWith zip0 (wz41110 : wz41111) (Pos wz45 : (numericEnumFrom $! Pos wz45 + fromInt (Pos (Succ Zero)))))))",fontsize=16,color="black",shape="box"];900 -> 911[label="",style="solid", color="black", weight=3]; 15.53/6.67 901[label="wz36",fontsize=16,color="green",shape="box"];902[label="wz36",fontsize=16,color="green",shape="box"];903[label="Maybe.listToMaybe (foldr (++) [] (map (List.findIndices0 (primEqInt (Pos Zero))) (zipWith zip0 (wz41110 : wz41111) (numericEnumFrom (Pos wz47)))))",fontsize=16,color="black",shape="box"];903 -> 912[label="",style="solid", color="black", weight=3]; 15.53/6.67 596[label="Maybe.listToMaybe (foldr (++) [] (map (List.findIndices0 (primEqInt (Neg (Succ wz300)))) (zip0 wz4110 (Pos (primPlusNat wz12 (Succ Zero))) : zipWith zip0 wz4111 (numericEnumFrom $! Pos (primPlusNat wz12 (Succ Zero)) + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="box"];596 -> 614[label="",style="solid", color="black", weight=3]; 15.53/6.67 1248[label="wz591",fontsize=16,color="green",shape="box"];1249[label="wz58",fontsize=16,color="green",shape="box"];1250[label="wz590",fontsize=16,color="green",shape="box"];1251[label="wz60",fontsize=16,color="green",shape="box"];1252[label="wz60",fontsize=16,color="green",shape="box"];625[label="Maybe.listToMaybe (foldr (++) [] (map (List.findIndices0 (primEqInt (Neg Zero))) (zipWith zip0 (wz4110 : wz4111) (Pos (primPlusNat wz13 (Succ Zero)) : (numericEnumFrom $! Pos (primPlusNat wz13 (Succ Zero)) + fromInt (Pos (Succ Zero)))))))",fontsize=16,color="black",shape="box"];625 -> 669[label="",style="solid", color="black", weight=3]; 15.53/6.67 861[label="Succ (Succ (primPlusNat wz120 Zero))",fontsize=16,color="green",shape="box"];861 -> 868[label="",style="dashed", color="green", weight=3]; 15.53/6.67 862[label="Succ Zero",fontsize=16,color="green",shape="box"];911[label="Maybe.listToMaybe (foldr (++) [] (map (List.findIndices0 (primEqInt (Pos (Succ wz300)))) (zip0 wz41110 (Pos wz45) : zipWith zip0 wz41111 (numericEnumFrom $! Pos wz45 + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="box"];911 -> 922[label="",style="solid", color="black", weight=3]; 15.53/6.67 912[label="Maybe.listToMaybe (foldr (++) [] (map (List.findIndices0 (primEqInt (Pos Zero))) (zipWith zip0 (wz41110 : wz41111) (Pos wz47 : (numericEnumFrom $! Pos wz47 + fromInt (Pos (Succ Zero)))))))",fontsize=16,color="black",shape="box"];912 -> 923[label="",style="solid", color="black", weight=3]; 15.53/6.67 614[label="Maybe.listToMaybe (foldr (++) [] (List.findIndices0 (primEqInt (Neg (Succ wz300))) (zip0 wz4110 (Pos (primPlusNat wz12 (Succ Zero)))) : map (List.findIndices0 (primEqInt (Neg (Succ wz300)))) (zipWith zip0 wz4111 (numericEnumFrom $! Pos (primPlusNat wz12 (Succ Zero)) + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="box"];614 -> 626[label="",style="solid", color="black", weight=3]; 15.53/6.67 669[label="Maybe.listToMaybe (foldr (++) [] (map (List.findIndices0 (primEqInt (Neg Zero))) (zip0 wz4110 (Pos (primPlusNat wz13 (Succ Zero))) : zipWith zip0 wz4111 (numericEnumFrom $! Pos (primPlusNat wz13 (Succ Zero)) + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="box"];669 -> 677[label="",style="solid", color="black", weight=3]; 15.53/6.67 868[label="primPlusNat wz120 Zero",fontsize=16,color="burlywood",shape="box"];1458[label="wz120/Succ wz1200",fontsize=10,color="white",style="solid",shape="box"];868 -> 1458[label="",style="solid", color="burlywood", weight=9]; 15.53/6.67 1458 -> 876[label="",style="solid", color="burlywood", weight=3]; 15.53/6.67 1459[label="wz120/Zero",fontsize=10,color="white",style="solid",shape="box"];868 -> 1459[label="",style="solid", color="burlywood", weight=9]; 15.53/6.67 1459 -> 877[label="",style="solid", color="burlywood", weight=3]; 15.53/6.67 922[label="Maybe.listToMaybe (foldr (++) [] (List.findIndices0 (primEqInt (Pos (Succ wz300))) (zip0 wz41110 (Pos wz45)) : map (List.findIndices0 (primEqInt (Pos (Succ wz300)))) (zipWith zip0 wz41111 (numericEnumFrom $! Pos wz45 + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="box"];922 -> 933[label="",style="solid", color="black", weight=3]; 15.53/6.67 923[label="Maybe.listToMaybe (foldr (++) [] (map (List.findIndices0 (primEqInt (Pos Zero))) (zip0 wz41110 (Pos wz47) : zipWith zip0 wz41111 (numericEnumFrom $! Pos wz47 + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="box"];923 -> 934[label="",style="solid", color="black", weight=3]; 15.53/6.67 626[label="Maybe.listToMaybe ((++) List.findIndices0 (primEqInt (Neg (Succ wz300))) (zip0 wz4110 (Pos (primPlusNat wz12 (Succ Zero)))) foldr (++) [] (map (List.findIndices0 (primEqInt (Neg (Succ wz300)))) (zipWith zip0 wz4111 (numericEnumFrom $! Pos (primPlusNat wz12 (Succ Zero)) + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="box"];626 -> 670[label="",style="solid", color="black", weight=3]; 15.53/6.67 677[label="Maybe.listToMaybe (foldr (++) [] (List.findIndices0 (primEqInt (Neg Zero)) (zip0 wz4110 (Pos (primPlusNat wz13 (Succ Zero)))) : map (List.findIndices0 (primEqInt (Neg Zero))) (zipWith zip0 wz4111 (numericEnumFrom $! Pos (primPlusNat wz13 (Succ Zero)) + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="box"];677 -> 685[label="",style="solid", color="black", weight=3]; 15.53/6.67 876[label="primPlusNat (Succ wz1200) Zero",fontsize=16,color="black",shape="box"];876 -> 890[label="",style="solid", color="black", weight=3]; 15.53/6.67 877[label="primPlusNat Zero Zero",fontsize=16,color="black",shape="box"];877 -> 891[label="",style="solid", color="black", weight=3]; 15.53/6.67 933[label="Maybe.listToMaybe ((++) List.findIndices0 (primEqInt (Pos (Succ wz300))) (zip0 wz41110 (Pos wz45)) foldr (++) [] (map (List.findIndices0 (primEqInt (Pos (Succ wz300)))) (zipWith zip0 wz41111 (numericEnumFrom $! Pos wz45 + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="box"];933 -> 944[label="",style="solid", color="black", weight=3]; 15.53/6.67 934[label="Maybe.listToMaybe (foldr (++) [] (List.findIndices0 (primEqInt (Pos Zero)) (zip0 wz41110 (Pos wz47)) : map (List.findIndices0 (primEqInt (Pos Zero))) (zipWith zip0 wz41111 (numericEnumFrom $! Pos wz47 + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="box"];934 -> 945[label="",style="solid", color="black", weight=3]; 15.53/6.67 670[label="Maybe.listToMaybe ((++) List.findIndices00 (primEqInt (Neg (Succ wz300))) (zip0 wz4110 (Pos (primPlusNat wz12 (Succ Zero)))) foldr (++) [] (map (List.findIndices0 (primEqInt (Neg (Succ wz300)))) (zipWith zip0 wz4111 (numericEnumFrom $! Pos (primPlusNat wz12 (Succ Zero)) + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="box"];670 -> 678[label="",style="solid", color="black", weight=3]; 15.53/6.67 685[label="Maybe.listToMaybe ((++) List.findIndices0 (primEqInt (Neg Zero)) (zip0 wz4110 (Pos (primPlusNat wz13 (Succ Zero)))) foldr (++) [] (map (List.findIndices0 (primEqInt (Neg Zero))) (zipWith zip0 wz4111 (numericEnumFrom $! Pos (primPlusNat wz13 (Succ Zero)) + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="box"];685 -> 696[label="",style="solid", color="black", weight=3]; 15.53/6.67 890[label="Succ wz1200",fontsize=16,color="green",shape="box"];891[label="Zero",fontsize=16,color="green",shape="box"];944[label="Maybe.listToMaybe ((++) List.findIndices00 (primEqInt (Pos (Succ wz300))) (zip0 wz41110 (Pos wz45)) foldr (++) [] (map (List.findIndices0 (primEqInt (Pos (Succ wz300)))) (zipWith zip0 wz41111 (numericEnumFrom $! Pos wz45 + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="box"];944 -> 953[label="",style="solid", color="black", weight=3]; 15.53/6.67 945[label="Maybe.listToMaybe ((++) List.findIndices0 (primEqInt (Pos Zero)) (zip0 wz41110 (Pos wz47)) foldr (++) [] (map (List.findIndices0 (primEqInt (Pos Zero))) (zipWith zip0 wz41111 (numericEnumFrom $! Pos wz47 + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="box"];945 -> 954[label="",style="solid", color="black", weight=3]; 15.53/6.67 678[label="Maybe.listToMaybe ((++) List.findIndices00 (primEqInt (Neg (Succ wz300))) (wz4110,Pos (primPlusNat wz12 (Succ Zero))) foldr (++) [] (map (List.findIndices0 (primEqInt (Neg (Succ wz300)))) (zipWith zip0 wz4111 (numericEnumFrom $! Pos (primPlusNat wz12 (Succ Zero)) + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="box"];678 -> 686[label="",style="solid", color="black", weight=3]; 15.53/6.67 696[label="Maybe.listToMaybe ((++) List.findIndices00 (primEqInt (Neg Zero)) (zip0 wz4110 (Pos (primPlusNat wz13 (Succ Zero)))) foldr (++) [] (map (List.findIndices0 (primEqInt (Neg Zero))) (zipWith zip0 wz4111 (numericEnumFrom $! Pos (primPlusNat wz13 (Succ Zero)) + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="box"];696 -> 702[label="",style="solid", color="black", weight=3]; 15.53/6.67 953[label="Maybe.listToMaybe ((++) List.findIndices00 (primEqInt (Pos (Succ wz300))) (wz41110,Pos wz45) foldr (++) [] (map (List.findIndices0 (primEqInt (Pos (Succ wz300)))) (zipWith zip0 wz41111 (numericEnumFrom $! Pos wz45 + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="box"];953 -> 989[label="",style="solid", color="black", weight=3]; 15.53/6.67 954[label="Maybe.listToMaybe ((++) List.findIndices00 (primEqInt (Pos Zero)) (zip0 wz41110 (Pos wz47)) foldr (++) [] (map (List.findIndices0 (primEqInt (Pos Zero))) (zipWith zip0 wz41111 (numericEnumFrom $! Pos wz47 + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="box"];954 -> 990[label="",style="solid", color="black", weight=3]; 15.53/6.67 686[label="Maybe.listToMaybe ((++) List.findIndices000 (Pos (primPlusNat wz12 (Succ Zero))) (primEqInt (Neg (Succ wz300)) wz4110) foldr (++) [] (map (List.findIndices0 (primEqInt (Neg (Succ wz300)))) (zipWith zip0 wz4111 (numericEnumFrom $! Pos (primPlusNat wz12 (Succ Zero)) + fromInt (Pos (Succ Zero))))))",fontsize=16,color="burlywood",shape="box"];1460[label="wz4110/Pos wz41100",fontsize=10,color="white",style="solid",shape="box"];686 -> 1460[label="",style="solid", color="burlywood", weight=9]; 15.53/6.67 1460 -> 697[label="",style="solid", color="burlywood", weight=3]; 15.53/6.67 1461[label="wz4110/Neg wz41100",fontsize=10,color="white",style="solid",shape="box"];686 -> 1461[label="",style="solid", color="burlywood", weight=9]; 15.53/6.67 1461 -> 698[label="",style="solid", color="burlywood", weight=3]; 15.53/6.67 702[label="Maybe.listToMaybe ((++) List.findIndices00 (primEqInt (Neg Zero)) (wz4110,Pos (primPlusNat wz13 (Succ Zero))) foldr (++) [] (map (List.findIndices0 (primEqInt (Neg Zero))) (zipWith zip0 wz4111 (numericEnumFrom $! Pos (primPlusNat wz13 (Succ Zero)) + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="box"];702 -> 709[label="",style="solid", color="black", weight=3]; 15.53/6.67 989[label="Maybe.listToMaybe ((++) List.findIndices000 (Pos wz45) (primEqInt (Pos (Succ wz300)) wz41110) foldr (++) [] (map (List.findIndices0 (primEqInt (Pos (Succ wz300)))) (zipWith zip0 wz41111 (numericEnumFrom $! Pos wz45 + fromInt (Pos (Succ Zero))))))",fontsize=16,color="burlywood",shape="box"];1462[label="wz41110/Pos wz411100",fontsize=10,color="white",style="solid",shape="box"];989 -> 1462[label="",style="solid", color="burlywood", weight=9]; 15.53/6.67 1462 -> 1006[label="",style="solid", color="burlywood", weight=3]; 15.53/6.67 1463[label="wz41110/Neg wz411100",fontsize=10,color="white",style="solid",shape="box"];989 -> 1463[label="",style="solid", color="burlywood", weight=9]; 15.53/6.67 1463 -> 1007[label="",style="solid", color="burlywood", weight=3]; 15.53/6.67 990[label="Maybe.listToMaybe ((++) List.findIndices00 (primEqInt (Pos Zero)) (wz41110,Pos wz47) foldr (++) [] (map (List.findIndices0 (primEqInt (Pos Zero))) (zipWith zip0 wz41111 (numericEnumFrom $! Pos wz47 + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="box"];990 -> 1008[label="",style="solid", color="black", weight=3]; 15.53/6.67 697[label="Maybe.listToMaybe ((++) List.findIndices000 (Pos (primPlusNat wz12 (Succ Zero))) (primEqInt (Neg (Succ wz300)) (Pos wz41100)) foldr (++) [] (map (List.findIndices0 (primEqInt (Neg (Succ wz300)))) (zipWith zip0 wz4111 (numericEnumFrom $! Pos (primPlusNat wz12 (Succ Zero)) + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="box"];697 -> 703[label="",style="solid", color="black", weight=3]; 15.53/6.67 698[label="Maybe.listToMaybe ((++) List.findIndices000 (Pos (primPlusNat wz12 (Succ Zero))) (primEqInt (Neg (Succ wz300)) (Neg wz41100)) foldr (++) [] (map (List.findIndices0 (primEqInt (Neg (Succ wz300)))) (zipWith zip0 wz4111 (numericEnumFrom $! Pos (primPlusNat wz12 (Succ Zero)) + fromInt (Pos (Succ Zero))))))",fontsize=16,color="burlywood",shape="box"];1464[label="wz41100/Succ wz411000",fontsize=10,color="white",style="solid",shape="box"];698 -> 1464[label="",style="solid", color="burlywood", weight=9]; 15.53/6.67 1464 -> 704[label="",style="solid", color="burlywood", weight=3]; 15.53/6.67 1465[label="wz41100/Zero",fontsize=10,color="white",style="solid",shape="box"];698 -> 1465[label="",style="solid", color="burlywood", weight=9]; 15.53/6.67 1465 -> 705[label="",style="solid", color="burlywood", weight=3]; 15.53/6.67 709[label="Maybe.listToMaybe ((++) List.findIndices000 (Pos (primPlusNat wz13 (Succ Zero))) (primEqInt (Neg Zero) wz4110) foldr (++) [] (map (List.findIndices0 (primEqInt (Neg Zero))) (zipWith zip0 wz4111 (numericEnumFrom $! Pos (primPlusNat wz13 (Succ Zero)) + fromInt (Pos (Succ Zero))))))",fontsize=16,color="burlywood",shape="box"];1466[label="wz4110/Pos wz41100",fontsize=10,color="white",style="solid",shape="box"];709 -> 1466[label="",style="solid", color="burlywood", weight=9]; 15.53/6.67 1466 -> 715[label="",style="solid", color="burlywood", weight=3]; 15.53/6.67 1467[label="wz4110/Neg wz41100",fontsize=10,color="white",style="solid",shape="box"];709 -> 1467[label="",style="solid", color="burlywood", weight=9]; 15.53/6.67 1467 -> 716[label="",style="solid", color="burlywood", weight=3]; 15.53/6.67 1006[label="Maybe.listToMaybe ((++) List.findIndices000 (Pos wz45) (primEqInt (Pos (Succ wz300)) (Pos wz411100)) foldr (++) [] (map (List.findIndices0 (primEqInt (Pos (Succ wz300)))) (zipWith zip0 wz41111 (numericEnumFrom $! Pos wz45 + fromInt (Pos (Succ Zero))))))",fontsize=16,color="burlywood",shape="box"];1468[label="wz411100/Succ wz4111000",fontsize=10,color="white",style="solid",shape="box"];1006 -> 1468[label="",style="solid", color="burlywood", weight=9]; 15.53/6.67 1468 -> 1014[label="",style="solid", color="burlywood", weight=3]; 15.53/6.67 1469[label="wz411100/Zero",fontsize=10,color="white",style="solid",shape="box"];1006 -> 1469[label="",style="solid", color="burlywood", weight=9]; 15.53/6.67 1469 -> 1015[label="",style="solid", color="burlywood", weight=3]; 15.53/6.67 1007[label="Maybe.listToMaybe ((++) List.findIndices000 (Pos wz45) (primEqInt (Pos (Succ wz300)) (Neg wz411100)) foldr (++) [] (map (List.findIndices0 (primEqInt (Pos (Succ wz300)))) (zipWith zip0 wz41111 (numericEnumFrom $! Pos wz45 + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="box"];1007 -> 1016[label="",style="solid", color="black", weight=3]; 15.53/6.67 1008[label="Maybe.listToMaybe ((++) List.findIndices000 (Pos wz47) (primEqInt (Pos Zero) wz41110) foldr (++) [] (map (List.findIndices0 (primEqInt (Pos Zero))) (zipWith zip0 wz41111 (numericEnumFrom $! Pos wz47 + fromInt (Pos (Succ Zero))))))",fontsize=16,color="burlywood",shape="box"];1470[label="wz41110/Pos wz411100",fontsize=10,color="white",style="solid",shape="box"];1008 -> 1470[label="",style="solid", color="burlywood", weight=9]; 15.53/6.67 1470 -> 1017[label="",style="solid", color="burlywood", weight=3]; 15.53/6.67 1471[label="wz41110/Neg wz411100",fontsize=10,color="white",style="solid",shape="box"];1008 -> 1471[label="",style="solid", color="burlywood", weight=9]; 15.53/6.67 1471 -> 1018[label="",style="solid", color="burlywood", weight=3]; 15.53/6.67 703[label="Maybe.listToMaybe ((++) List.findIndices000 (Pos (primPlusNat wz12 (Succ Zero))) False foldr (++) [] (map (List.findIndices0 (primEqInt (Neg (Succ wz300)))) (zipWith zip0 wz4111 (numericEnumFrom $! Pos (primPlusNat wz12 (Succ Zero)) + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="triangle"];703 -> 710[label="",style="solid", color="black", weight=3]; 15.53/6.67 704[label="Maybe.listToMaybe ((++) List.findIndices000 (Pos (primPlusNat wz12 (Succ Zero))) (primEqInt (Neg (Succ wz300)) (Neg (Succ wz411000))) foldr (++) [] (map (List.findIndices0 (primEqInt (Neg (Succ wz300)))) (zipWith zip0 wz4111 (numericEnumFrom $! Pos (primPlusNat wz12 (Succ Zero)) + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="box"];704 -> 711[label="",style="solid", color="black", weight=3]; 15.53/6.67 705[label="Maybe.listToMaybe ((++) List.findIndices000 (Pos (primPlusNat wz12 (Succ Zero))) (primEqInt (Neg (Succ wz300)) (Neg Zero)) foldr (++) [] (map (List.findIndices0 (primEqInt (Neg (Succ wz300)))) (zipWith zip0 wz4111 (numericEnumFrom $! Pos (primPlusNat wz12 (Succ Zero)) + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="box"];705 -> 712[label="",style="solid", color="black", weight=3]; 15.53/6.67 715[label="Maybe.listToMaybe ((++) List.findIndices000 (Pos (primPlusNat wz13 (Succ Zero))) (primEqInt (Neg Zero) (Pos wz41100)) foldr (++) [] (map (List.findIndices0 (primEqInt (Neg Zero))) (zipWith zip0 wz4111 (numericEnumFrom $! Pos (primPlusNat wz13 (Succ Zero)) + fromInt (Pos (Succ Zero))))))",fontsize=16,color="burlywood",shape="box"];1472[label="wz41100/Succ wz411000",fontsize=10,color="white",style="solid",shape="box"];715 -> 1472[label="",style="solid", color="burlywood", weight=9]; 15.53/6.67 1472 -> 723[label="",style="solid", color="burlywood", weight=3]; 15.53/6.67 1473[label="wz41100/Zero",fontsize=10,color="white",style="solid",shape="box"];715 -> 1473[label="",style="solid", color="burlywood", weight=9]; 15.53/6.67 1473 -> 724[label="",style="solid", color="burlywood", weight=3]; 15.53/6.67 716[label="Maybe.listToMaybe ((++) List.findIndices000 (Pos (primPlusNat wz13 (Succ Zero))) (primEqInt (Neg Zero) (Neg wz41100)) foldr (++) [] (map (List.findIndices0 (primEqInt (Neg Zero))) (zipWith zip0 wz4111 (numericEnumFrom $! Pos (primPlusNat wz13 (Succ Zero)) + fromInt (Pos (Succ Zero))))))",fontsize=16,color="burlywood",shape="box"];1474[label="wz41100/Succ wz411000",fontsize=10,color="white",style="solid",shape="box"];716 -> 1474[label="",style="solid", color="burlywood", weight=9]; 15.53/6.67 1474 -> 725[label="",style="solid", color="burlywood", weight=3]; 15.53/6.67 1475[label="wz41100/Zero",fontsize=10,color="white",style="solid",shape="box"];716 -> 1475[label="",style="solid", color="burlywood", weight=9]; 15.53/6.67 1475 -> 726[label="",style="solid", color="burlywood", weight=3]; 15.53/6.67 1014[label="Maybe.listToMaybe ((++) List.findIndices000 (Pos wz45) (primEqInt (Pos (Succ wz300)) (Pos (Succ wz4111000))) foldr (++) [] (map (List.findIndices0 (primEqInt (Pos (Succ wz300)))) (zipWith zip0 wz41111 (numericEnumFrom $! Pos wz45 + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="box"];1014 -> 1027[label="",style="solid", color="black", weight=3]; 15.53/6.67 1015[label="Maybe.listToMaybe ((++) List.findIndices000 (Pos wz45) (primEqInt (Pos (Succ wz300)) (Pos Zero)) foldr (++) [] (map (List.findIndices0 (primEqInt (Pos (Succ wz300)))) (zipWith zip0 wz41111 (numericEnumFrom $! Pos wz45 + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="box"];1015 -> 1028[label="",style="solid", color="black", weight=3]; 15.53/6.67 1017[label="Maybe.listToMaybe ((++) List.findIndices000 (Pos wz47) (primEqInt (Pos Zero) (Pos wz411100)) foldr (++) [] (map (List.findIndices0 (primEqInt (Pos Zero))) (zipWith zip0 wz41111 (numericEnumFrom $! Pos wz47 + fromInt (Pos (Succ Zero))))))",fontsize=16,color="burlywood",shape="box"];1476[label="wz411100/Succ wz4111000",fontsize=10,color="white",style="solid",shape="box"];1017 -> 1476[label="",style="solid", color="burlywood", weight=9]; 15.53/6.67 1476 -> 1030[label="",style="solid", color="burlywood", weight=3]; 15.53/6.67 1477[label="wz411100/Zero",fontsize=10,color="white",style="solid",shape="box"];1017 -> 1477[label="",style="solid", color="burlywood", weight=9]; 15.53/6.67 1477 -> 1031[label="",style="solid", color="burlywood", weight=3]; 15.53/6.67 1018[label="Maybe.listToMaybe ((++) List.findIndices000 (Pos wz47) (primEqInt (Pos Zero) (Neg wz411100)) foldr (++) [] (map (List.findIndices0 (primEqInt (Pos Zero))) (zipWith zip0 wz41111 (numericEnumFrom $! Pos wz47 + fromInt (Pos (Succ Zero))))))",fontsize=16,color="burlywood",shape="box"];1478[label="wz411100/Succ wz4111000",fontsize=10,color="white",style="solid",shape="box"];1018 -> 1478[label="",style="solid", color="burlywood", weight=9]; 15.53/6.67 1478 -> 1032[label="",style="solid", color="burlywood", weight=3]; 15.53/6.67 1479[label="wz411100/Zero",fontsize=10,color="white",style="solid",shape="box"];1018 -> 1479[label="",style="solid", color="burlywood", weight=9]; 15.53/6.67 1479 -> 1033[label="",style="solid", color="burlywood", weight=3]; 15.53/6.67 710[label="Maybe.listToMaybe ((++) [] foldr (++) [] (map (List.findIndices0 (primEqInt (Neg (Succ wz300)))) (zipWith zip0 wz4111 (numericEnumFrom $! Pos (primPlusNat wz12 (Succ Zero)) + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="box"];710 -> 717[label="",style="solid", color="black", weight=3]; 15.53/6.67 711 -> 1100[label="",style="dashed", color="red", weight=0]; 15.53/6.67 711[label="Maybe.listToMaybe ((++) List.findIndices000 (Pos (primPlusNat wz12 (Succ Zero))) (primEqNat wz300 wz411000) foldr (++) [] (map (List.findIndices0 (primEqInt (Neg (Succ wz300)))) (zipWith zip0 wz4111 (numericEnumFrom $! Pos (primPlusNat wz12 (Succ Zero)) + fromInt (Pos (Succ Zero))))))",fontsize=16,color="magenta"];711 -> 1119[label="",style="dashed", color="magenta", weight=3]; 15.53/6.67 711 -> 1120[label="",style="dashed", color="magenta", weight=3]; 15.53/6.67 711 -> 1121[label="",style="dashed", color="magenta", weight=3]; 15.53/6.67 711 -> 1122[label="",style="dashed", color="magenta", weight=3]; 15.53/6.67 711 -> 1123[label="",style="dashed", color="magenta", weight=3]; 15.53/6.67 711 -> 1124[label="",style="dashed", color="magenta", weight=3]; 15.53/6.67 712 -> 703[label="",style="dashed", color="red", weight=0]; 15.53/6.67 712[label="Maybe.listToMaybe ((++) List.findIndices000 (Pos (primPlusNat wz12 (Succ Zero))) False foldr (++) [] (map (List.findIndices0 (primEqInt (Neg (Succ wz300)))) (zipWith zip0 wz4111 (numericEnumFrom $! Pos (primPlusNat wz12 (Succ Zero)) + fromInt (Pos (Succ Zero))))))",fontsize=16,color="magenta"];723[label="Maybe.listToMaybe ((++) List.findIndices000 (Pos (primPlusNat wz13 (Succ Zero))) (primEqInt (Neg Zero) (Pos (Succ wz411000))) foldr (++) [] (map (List.findIndices0 (primEqInt (Neg Zero))) (zipWith zip0 wz4111 (numericEnumFrom $! Pos (primPlusNat wz13 (Succ Zero)) + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="box"];723 -> 737[label="",style="solid", color="black", weight=3]; 15.53/6.67 724[label="Maybe.listToMaybe ((++) List.findIndices000 (Pos (primPlusNat wz13 (Succ Zero))) (primEqInt (Neg Zero) (Pos Zero)) foldr (++) [] (map (List.findIndices0 (primEqInt (Neg Zero))) (zipWith zip0 wz4111 (numericEnumFrom $! Pos (primPlusNat wz13 (Succ Zero)) + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="box"];724 -> 738[label="",style="solid", color="black", weight=3]; 15.53/6.67 725[label="Maybe.listToMaybe ((++) List.findIndices000 (Pos (primPlusNat wz13 (Succ Zero))) (primEqInt (Neg Zero) (Neg (Succ wz411000))) foldr (++) [] (map (List.findIndices0 (primEqInt (Neg Zero))) (zipWith zip0 wz4111 (numericEnumFrom $! Pos (primPlusNat wz13 (Succ Zero)) + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="box"];725 -> 739[label="",style="solid", color="black", weight=3]; 15.53/6.67 726[label="Maybe.listToMaybe ((++) List.findIndices000 (Pos (primPlusNat wz13 (Succ Zero))) (primEqInt (Neg Zero) (Neg Zero)) foldr (++) [] (map (List.findIndices0 (primEqInt (Neg Zero))) (zipWith zip0 wz4111 (numericEnumFrom $! Pos (primPlusNat wz13 (Succ Zero)) + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="box"];726 -> 740[label="",style="solid", color="black", weight=3]; 15.53/6.67 1027 -> 1322[label="",style="dashed", color="red", weight=0]; 15.53/6.67 1027[label="Maybe.listToMaybe ((++) List.findIndices000 (Pos wz45) (primEqNat wz300 wz4111000) foldr (++) [] (map (List.findIndices0 (primEqInt (Pos (Succ wz300)))) (zipWith zip0 wz41111 (numericEnumFrom $! Pos wz45 + fromInt (Pos (Succ Zero))))))",fontsize=16,color="magenta"];1027 -> 1338[label="",style="dashed", color="magenta", weight=3]; 15.53/6.67 1027 -> 1339[label="",style="dashed", color="magenta", weight=3]; 15.53/6.67 1027 -> 1340[label="",style="dashed", color="magenta", weight=3]; 15.53/6.67 1027 -> 1341[label="",style="dashed", color="magenta", weight=3]; 15.53/6.67 1027 -> 1342[label="",style="dashed", color="magenta", weight=3]; 15.53/6.67 1028 -> 1016[label="",style="dashed", color="red", weight=0]; 15.53/6.67 1028[label="Maybe.listToMaybe ((++) List.findIndices000 (Pos wz45) False foldr (++) [] (map (List.findIndices0 (primEqInt (Pos (Succ wz300)))) (zipWith zip0 wz41111 (numericEnumFrom $! Pos wz45 + fromInt (Pos (Succ Zero))))))",fontsize=16,color="magenta"];1030[label="Maybe.listToMaybe ((++) List.findIndices000 (Pos wz47) (primEqInt (Pos Zero) (Pos (Succ wz4111000))) foldr (++) [] (map (List.findIndices0 (primEqInt (Pos Zero))) (zipWith zip0 wz41111 (numericEnumFrom $! Pos wz47 + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="box"];1030 -> 1041[label="",style="solid", color="black", weight=3]; 15.53/6.67 1031[label="Maybe.listToMaybe ((++) List.findIndices000 (Pos wz47) (primEqInt (Pos Zero) (Pos Zero)) foldr (++) [] (map (List.findIndices0 (primEqInt (Pos Zero))) (zipWith zip0 wz41111 (numericEnumFrom $! Pos wz47 + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="box"];1031 -> 1042[label="",style="solid", color="black", weight=3]; 15.53/6.67 1032[label="Maybe.listToMaybe ((++) List.findIndices000 (Pos wz47) (primEqInt (Pos Zero) (Neg (Succ wz4111000))) foldr (++) [] (map (List.findIndices0 (primEqInt (Pos Zero))) (zipWith zip0 wz41111 (numericEnumFrom $! Pos wz47 + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="box"];1032 -> 1043[label="",style="solid", color="black", weight=3]; 15.53/6.67 1033[label="Maybe.listToMaybe ((++) List.findIndices000 (Pos wz47) (primEqInt (Pos Zero) (Neg Zero)) foldr (++) [] (map (List.findIndices0 (primEqInt (Pos Zero))) (zipWith zip0 wz41111 (numericEnumFrom $! Pos wz47 + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="box"];1033 -> 1044[label="",style="solid", color="black", weight=3]; 15.53/6.67 717[label="Maybe.listToMaybe (foldr (++) [] (map (List.findIndices0 (primEqInt (Neg (Succ wz300)))) (zipWith zip0 wz4111 (numericEnumFrom $! Pos (primPlusNat wz12 (Succ Zero)) + fromInt (Pos (Succ Zero))))))",fontsize=16,color="burlywood",shape="box"];1480[label="wz4111/wz41110 : wz41111",fontsize=10,color="white",style="solid",shape="box"];717 -> 1480[label="",style="solid", color="burlywood", weight=9]; 15.53/6.67 1480 -> 727[label="",style="solid", color="burlywood", weight=3]; 15.53/6.67 1481[label="wz4111/[]",fontsize=10,color="white",style="solid",shape="box"];717 -> 1481[label="",style="solid", color="burlywood", weight=9]; 15.53/6.67 1481 -> 728[label="",style="solid", color="burlywood", weight=3]; 15.53/6.67 1119[label="wz4111",fontsize=16,color="green",shape="box"];1120[label="wz300",fontsize=16,color="green",shape="box"];1121[label="wz300",fontsize=16,color="green",shape="box"];1122 -> 787[label="",style="dashed", color="red", weight=0]; 15.53/6.67 1122[label="primPlusNat wz12 (Succ Zero)",fontsize=16,color="magenta"];1123[label="wz411000",fontsize=16,color="green",shape="box"];1124 -> 787[label="",style="dashed", color="red", weight=0]; 15.53/6.67 1124[label="primPlusNat wz12 (Succ Zero)",fontsize=16,color="magenta"];737[label="Maybe.listToMaybe ((++) List.findIndices000 (Pos (primPlusNat wz13 (Succ Zero))) False foldr (++) [] (map (List.findIndices0 (primEqInt (Neg Zero))) (zipWith zip0 wz4111 (numericEnumFrom $! Pos (primPlusNat wz13 (Succ Zero)) + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="triangle"];737 -> 751[label="",style="solid", color="black", weight=3]; 15.53/6.67 738[label="Maybe.listToMaybe ((++) List.findIndices000 (Pos (primPlusNat wz13 (Succ Zero))) True foldr (++) [] (map (List.findIndices0 (primEqInt (Neg Zero))) (zipWith zip0 wz4111 (numericEnumFrom $! Pos (primPlusNat wz13 (Succ Zero)) + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="triangle"];738 -> 752[label="",style="solid", color="black", weight=3]; 15.53/6.67 739 -> 737[label="",style="dashed", color="red", weight=0]; 15.53/6.67 739[label="Maybe.listToMaybe ((++) List.findIndices000 (Pos (primPlusNat wz13 (Succ Zero))) False foldr (++) [] (map (List.findIndices0 (primEqInt (Neg Zero))) (zipWith zip0 wz4111 (numericEnumFrom $! Pos (primPlusNat wz13 (Succ Zero)) + fromInt (Pos (Succ Zero))))))",fontsize=16,color="magenta"];740 -> 738[label="",style="dashed", color="red", weight=0]; 15.53/6.67 740[label="Maybe.listToMaybe ((++) List.findIndices000 (Pos (primPlusNat wz13 (Succ Zero))) True foldr (++) [] (map (List.findIndices0 (primEqInt (Neg Zero))) (zipWith zip0 wz4111 (numericEnumFrom $! Pos (primPlusNat wz13 (Succ Zero)) + fromInt (Pos (Succ Zero))))))",fontsize=16,color="magenta"];1338[label="wz300",fontsize=16,color="green",shape="box"];1339[label="wz4111000",fontsize=16,color="green",shape="box"];1340[label="wz45",fontsize=16,color="green",shape="box"];1341[label="wz41111",fontsize=16,color="green",shape="box"];1342[label="wz300",fontsize=16,color="green",shape="box"];1041 -> 812[label="",style="dashed", color="red", weight=0]; 15.53/6.67 1041[label="Maybe.listToMaybe ((++) List.findIndices000 (Pos wz47) False foldr (++) [] (map (List.findIndices0 (primEqInt (Pos Zero))) (zipWith zip0 wz41111 (numericEnumFrom $! Pos wz47 + fromInt (Pos (Succ Zero))))))",fontsize=16,color="magenta"];1041 -> 1055[label="",style="dashed", color="magenta", weight=3]; 15.53/6.67 1041 -> 1056[label="",style="dashed", color="magenta", weight=3]; 15.53/6.67 1041 -> 1057[label="",style="dashed", color="magenta", weight=3]; 15.53/6.67 1042[label="Maybe.listToMaybe ((++) List.findIndices000 (Pos wz47) True foldr (++) [] (map (List.findIndices0 (primEqInt (Pos Zero))) (zipWith zip0 wz41111 (numericEnumFrom $! Pos wz47 + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="triangle"];1042 -> 1058[label="",style="solid", color="black", weight=3]; 15.53/6.67 1043 -> 812[label="",style="dashed", color="red", weight=0]; 15.53/6.67 1043[label="Maybe.listToMaybe ((++) List.findIndices000 (Pos wz47) False foldr (++) [] (map (List.findIndices0 (primEqInt (Pos Zero))) (zipWith zip0 wz41111 (numericEnumFrom $! Pos wz47 + fromInt (Pos (Succ Zero))))))",fontsize=16,color="magenta"];1043 -> 1059[label="",style="dashed", color="magenta", weight=3]; 15.53/6.67 1043 -> 1060[label="",style="dashed", color="magenta", weight=3]; 15.53/6.67 1043 -> 1061[label="",style="dashed", color="magenta", weight=3]; 15.53/6.67 1044 -> 1042[label="",style="dashed", color="red", weight=0]; 15.53/6.67 1044[label="Maybe.listToMaybe ((++) List.findIndices000 (Pos wz47) True foldr (++) [] (map (List.findIndices0 (primEqInt (Pos Zero))) (zipWith zip0 wz41111 (numericEnumFrom $! Pos wz47 + fromInt (Pos (Succ Zero))))))",fontsize=16,color="magenta"];727[label="Maybe.listToMaybe (foldr (++) [] (map (List.findIndices0 (primEqInt (Neg (Succ wz300)))) (zipWith zip0 (wz41110 : wz41111) (numericEnumFrom $! Pos (primPlusNat wz12 (Succ Zero)) + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="box"];727 -> 741[label="",style="solid", color="black", weight=3]; 15.53/6.67 728[label="Maybe.listToMaybe (foldr (++) [] (map (List.findIndices0 (primEqInt (Neg (Succ wz300)))) (zipWith zip0 [] (numericEnumFrom $! Pos (primPlusNat wz12 (Succ Zero)) + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="box"];728 -> 742[label="",style="solid", color="black", weight=3]; 15.53/6.67 751[label="Maybe.listToMaybe ((++) [] foldr (++) [] (map (List.findIndices0 (primEqInt (Neg Zero))) (zipWith zip0 wz4111 (numericEnumFrom $! Pos (primPlusNat wz13 (Succ Zero)) + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="box"];751 -> 764[label="",style="solid", color="black", weight=3]; 15.53/6.67 752[label="Maybe.listToMaybe ((++) (Pos (primPlusNat wz13 (Succ Zero)) : []) foldr (++) [] (map (List.findIndices0 (primEqInt (Neg Zero))) (zipWith zip0 wz4111 (numericEnumFrom $! Pos (primPlusNat wz13 (Succ Zero)) + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="box"];752 -> 765[label="",style="solid", color="black", weight=3]; 15.53/6.67 1055[label="wz41111",fontsize=16,color="green",shape="box"];1056[label="wz47",fontsize=16,color="green",shape="box"];1057[label="wz47",fontsize=16,color="green",shape="box"];1058[label="Maybe.listToMaybe ((++) (Pos wz47 : []) foldr (++) [] (map (List.findIndices0 (primEqInt (Pos Zero))) (zipWith zip0 wz41111 (numericEnumFrom $! Pos wz47 + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="box"];1058 -> 1076[label="",style="solid", color="black", weight=3]; 15.53/6.67 1059[label="wz41111",fontsize=16,color="green",shape="box"];1060[label="wz47",fontsize=16,color="green",shape="box"];1061[label="wz47",fontsize=16,color="green",shape="box"];741[label="Maybe.listToMaybe (foldr (++) [] (map (List.findIndices0 (primEqInt (Neg (Succ wz300)))) (zipWith zip0 (wz41110 : wz41111) (Pos (primPlusNat wz12 (Succ Zero)) + fromInt (Pos (Succ Zero)) `seq` numericEnumFrom (Pos (primPlusNat wz12 (Succ Zero)) + fromInt (Pos (Succ Zero)))))))",fontsize=16,color="black",shape="box"];741 -> 753[label="",style="solid", color="black", weight=3]; 15.53/6.67 742 -> 106[label="",style="dashed", color="red", weight=0]; 15.53/6.67 742[label="Maybe.listToMaybe (foldr (++) [] (map (List.findIndices0 (primEqInt (Neg (Succ wz300)))) []))",fontsize=16,color="magenta"];764[label="Maybe.listToMaybe (foldr (++) [] (map (List.findIndices0 (primEqInt (Neg Zero))) (zipWith zip0 wz4111 (numericEnumFrom $! Pos (primPlusNat wz13 (Succ Zero)) + fromInt (Pos (Succ Zero))))))",fontsize=16,color="burlywood",shape="box"];1482[label="wz4111/wz41110 : wz41111",fontsize=10,color="white",style="solid",shape="box"];764 -> 1482[label="",style="solid", color="burlywood", weight=9]; 15.53/6.67 1482 -> 782[label="",style="solid", color="burlywood", weight=3]; 15.53/6.67 1483[label="wz4111/[]",fontsize=10,color="white",style="solid",shape="box"];764 -> 1483[label="",style="solid", color="burlywood", weight=9]; 15.53/6.67 1483 -> 783[label="",style="solid", color="burlywood", weight=3]; 15.53/6.67 765[label="Maybe.listToMaybe (Pos (primPlusNat wz13 (Succ Zero)) : [] ++ foldr (++) [] (map (List.findIndices0 (primEqInt (Neg Zero))) (zipWith zip0 wz4111 (numericEnumFrom $! Pos (primPlusNat wz13 (Succ Zero)) + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="box"];765 -> 784[label="",style="solid", color="black", weight=3]; 15.53/6.67 1076[label="Maybe.listToMaybe (Pos wz47 : [] ++ foldr (++) [] (map (List.findIndices0 (primEqInt (Pos Zero))) (zipWith zip0 wz41111 (numericEnumFrom $! Pos wz47 + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="box"];1076 -> 1090[label="",style="solid", color="black", weight=3]; 15.53/6.67 753[label="Maybe.listToMaybe (foldr (++) [] (map (List.findIndices0 (primEqInt (Neg (Succ wz300)))) (zipWith zip0 (wz41110 : wz41111) (enforceWHNF (WHNF (Pos (primPlusNat wz12 (Succ Zero)) + fromInt (Pos (Succ Zero)))) (numericEnumFrom (Pos (primPlusNat wz12 (Succ Zero)) + fromInt (Pos (Succ Zero))))))))",fontsize=16,color="black",shape="box"];753 -> 766[label="",style="solid", color="black", weight=3]; 15.53/6.67 782[label="Maybe.listToMaybe (foldr (++) [] (map (List.findIndices0 (primEqInt (Neg Zero))) (zipWith zip0 (wz41110 : wz41111) (numericEnumFrom $! Pos (primPlusNat wz13 (Succ Zero)) + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="box"];782 -> 804[label="",style="solid", color="black", weight=3]; 15.53/6.67 783[label="Maybe.listToMaybe (foldr (++) [] (map (List.findIndices0 (primEqInt (Neg Zero))) (zipWith zip0 [] (numericEnumFrom $! Pos (primPlusNat wz13 (Succ Zero)) + fromInt (Pos (Succ Zero))))))",fontsize=16,color="black",shape="box"];783 -> 805[label="",style="solid", color="black", weight=3]; 15.53/6.67 784[label="Just (Pos (primPlusNat wz13 (Succ Zero)))",fontsize=16,color="green",shape="box"];784 -> 806[label="",style="dashed", color="green", weight=3]; 15.53/6.67 1090[label="Just (Pos wz47)",fontsize=16,color="green",shape="box"];766 -> 515[label="",style="dashed", color="red", weight=0]; 15.53/6.67 766[label="Maybe.listToMaybe (foldr (++) [] (map (List.findIndices0 (primEqInt (Neg (Succ wz300)))) (zipWith zip0 (wz41110 : wz41111) (enforceWHNF (WHNF (primPlusInt (Pos (primPlusNat wz12 (Succ Zero))) (fromInt (Pos (Succ Zero))))) (numericEnumFrom (primPlusInt (Pos (primPlusNat wz12 (Succ Zero))) (fromInt (Pos (Succ Zero)))))))))",fontsize=16,color="magenta"];766 -> 785[label="",style="dashed", color="magenta", weight=3]; 15.53/6.67 766 -> 786[label="",style="dashed", color="magenta", weight=3]; 15.53/6.67 766 -> 787[label="",style="dashed", color="magenta", weight=3]; 15.53/6.67 766 -> 788[label="",style="dashed", color="magenta", weight=3]; 15.53/6.67 804 -> 527[label="",style="dashed", color="red", weight=0]; 15.53/6.67 804[label="Maybe.listToMaybe (foldr (++) [] (map (List.findIndices0 (primEqInt (Neg Zero))) (zipWith zip0 (wz41110 : wz41111) (Pos (primPlusNat wz13 (Succ Zero)) + fromInt (Pos (Succ Zero)) `seq` numericEnumFrom (Pos (primPlusNat wz13 (Succ Zero)) + fromInt (Pos (Succ Zero)))))))",fontsize=16,color="magenta"];804 -> 845[label="",style="dashed", color="magenta", weight=3]; 15.53/6.67 804 -> 846[label="",style="dashed", color="magenta", weight=3]; 15.53/6.67 804 -> 847[label="",style="dashed", color="magenta", weight=3]; 15.53/6.67 804 -> 848[label="",style="dashed", color="magenta", weight=3]; 15.53/6.67 805 -> 131[label="",style="dashed", color="red", weight=0]; 15.53/6.67 805[label="Maybe.listToMaybe (foldr (++) [] (map (List.findIndices0 (primEqInt (Neg Zero))) []))",fontsize=16,color="magenta"];806 -> 787[label="",style="dashed", color="red", weight=0]; 15.53/6.67 806[label="primPlusNat wz13 (Succ Zero)",fontsize=16,color="magenta"];806 -> 849[label="",style="dashed", color="magenta", weight=3]; 15.53/6.67 785[label="wz41111",fontsize=16,color="green",shape="box"];786[label="wz41110",fontsize=16,color="green",shape="box"];788 -> 787[label="",style="dashed", color="red", weight=0]; 15.53/6.67 788[label="primPlusNat wz12 (Succ Zero)",fontsize=16,color="magenta"];845[label="wz41111",fontsize=16,color="green",shape="box"];846 -> 787[label="",style="dashed", color="red", weight=0]; 15.53/6.67 846[label="primPlusNat wz13 (Succ Zero)",fontsize=16,color="magenta"];846 -> 859[label="",style="dashed", color="magenta", weight=3]; 15.53/6.67 847[label="wz41110",fontsize=16,color="green",shape="box"];848 -> 787[label="",style="dashed", color="red", weight=0]; 15.53/6.67 848[label="primPlusNat wz13 (Succ Zero)",fontsize=16,color="magenta"];848 -> 860[label="",style="dashed", color="magenta", weight=3]; 15.53/6.67 849[label="wz13",fontsize=16,color="green",shape="box"];859[label="wz13",fontsize=16,color="green",shape="box"];860[label="wz13",fontsize=16,color="green",shape="box"];} 15.53/6.67 15.53/6.67 ---------------------------------------- 15.53/6.67 15.53/6.67 (14) 15.53/6.67 Complex Obligation (AND) 15.53/6.67 15.53/6.67 ---------------------------------------- 15.53/6.67 15.53/6.67 (15) 15.53/6.67 Obligation: 15.53/6.67 Q DP problem: 15.53/6.67 The TRS P consists of the following rules: 15.53/6.67 15.53/6.67 new_listToMaybe(Pos(Succ(wz411000)), :(wz41110, wz41111), wz13, wz14) -> new_listToMaybe(wz41110, wz41111, new_primPlusNat(wz13), new_primPlusNat(wz13)) 15.53/6.67 new_listToMaybe0(wz13, :(wz41110, wz41111)) -> new_listToMaybe(wz41110, wz41111, new_primPlusNat(wz13), new_primPlusNat(wz13)) 15.53/6.67 new_listToMaybe(Neg(Succ(wz411000)), wz4111, wz13, wz14) -> new_listToMaybe0(wz13, wz4111) 15.53/6.67 15.53/6.67 The TRS R consists of the following rules: 15.53/6.67 15.53/6.67 new_primPlusNat(Succ(wz120)) -> Succ(Succ(new_primPlusNat0(wz120))) 15.53/6.67 new_primPlusNat(Zero) -> Succ(Zero) 15.53/6.67 new_primPlusNat0(Succ(wz1200)) -> Succ(wz1200) 15.53/6.67 new_primPlusNat0(Zero) -> Zero 15.53/6.67 15.53/6.67 The set Q consists of the following terms: 15.53/6.67 15.53/6.67 new_primPlusNat0(Succ(x0)) 15.53/6.67 new_primPlusNat0(Zero) 15.53/6.67 new_primPlusNat(Succ(x0)) 15.53/6.67 new_primPlusNat(Zero) 15.53/6.67 15.53/6.67 We have to consider all minimal (P,Q,R)-chains. 15.53/6.67 ---------------------------------------- 15.53/6.67 15.53/6.67 (16) QDPSizeChangeProof (EQUIVALENT) 15.53/6.67 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. 15.53/6.67 15.53/6.67 From the DPs we obtained the following set of size-change graphs: 15.53/6.67 *new_listToMaybe(Pos(Succ(wz411000)), :(wz41110, wz41111), wz13, wz14) -> new_listToMaybe(wz41110, wz41111, new_primPlusNat(wz13), new_primPlusNat(wz13)) 15.53/6.67 The graph contains the following edges 2 > 1, 2 > 2 15.53/6.67 15.53/6.67 15.53/6.67 *new_listToMaybe(Neg(Succ(wz411000)), wz4111, wz13, wz14) -> new_listToMaybe0(wz13, wz4111) 15.53/6.67 The graph contains the following edges 3 >= 1, 2 >= 2 15.53/6.67 15.53/6.67 15.53/6.67 *new_listToMaybe0(wz13, :(wz41110, wz41111)) -> new_listToMaybe(wz41110, wz41111, new_primPlusNat(wz13), new_primPlusNat(wz13)) 15.53/6.67 The graph contains the following edges 2 > 1, 2 > 2 15.53/6.67 15.53/6.67 15.53/6.67 ---------------------------------------- 15.53/6.67 15.53/6.67 (17) 15.53/6.67 YES 15.53/6.67 15.53/6.67 ---------------------------------------- 15.53/6.67 15.53/6.67 (18) 15.53/6.67 Obligation: 15.53/6.67 Q DP problem: 15.53/6.67 The TRS P consists of the following rules: 15.53/6.67 15.53/6.67 new_listToMaybe5(Neg(Succ(wz4111000)), wz41111, wz48, wz47) -> new_listToMaybe6(wz47, wz41111, wz47) 15.53/6.67 new_listToMaybe5(Pos(Succ(wz4111000)), wz41111, wz48, wz47) -> new_listToMaybe6(wz47, wz41111, wz47) 15.53/6.67 new_listToMaybe6(wz35, :(wz41110, wz41111), wz36) -> new_listToMaybe5(wz41110, wz41111, new_primPlusNat(wz36), new_primPlusNat(wz36)) 15.53/6.67 15.53/6.67 The TRS R consists of the following rules: 15.53/6.67 15.53/6.67 new_primPlusNat(Succ(wz120)) -> Succ(Succ(new_primPlusNat0(wz120))) 15.53/6.67 new_primPlusNat(Zero) -> Succ(Zero) 15.53/6.67 new_primPlusNat0(Succ(wz1200)) -> Succ(wz1200) 15.53/6.67 new_primPlusNat0(Zero) -> Zero 15.53/6.67 15.53/6.67 The set Q consists of the following terms: 15.53/6.67 15.53/6.67 new_primPlusNat0(Succ(x0)) 15.53/6.67 new_primPlusNat0(Zero) 15.53/6.67 new_primPlusNat(Succ(x0)) 15.53/6.67 new_primPlusNat(Zero) 15.53/6.67 15.53/6.67 We have to consider all minimal (P,Q,R)-chains. 15.53/6.67 ---------------------------------------- 15.53/6.67 15.53/6.67 (19) TransformationProof (EQUIVALENT) 15.53/6.67 By instantiating [LPAR04] the rule new_listToMaybe6(wz35, :(wz41110, wz41111), wz36) -> new_listToMaybe5(wz41110, wz41111, new_primPlusNat(wz36), new_primPlusNat(wz36)) we obtained the following new rules [LPAR04]: 15.53/6.67 15.53/6.67 (new_listToMaybe6(z3, :(x1, x2), z3) -> new_listToMaybe5(x1, x2, new_primPlusNat(z3), new_primPlusNat(z3)),new_listToMaybe6(z3, :(x1, x2), z3) -> new_listToMaybe5(x1, x2, new_primPlusNat(z3), new_primPlusNat(z3))) 15.53/6.67 15.53/6.67 15.53/6.67 ---------------------------------------- 15.53/6.67 15.53/6.67 (20) 15.53/6.67 Obligation: 15.53/6.67 Q DP problem: 15.53/6.67 The TRS P consists of the following rules: 15.53/6.67 15.53/6.67 new_listToMaybe5(Neg(Succ(wz4111000)), wz41111, wz48, wz47) -> new_listToMaybe6(wz47, wz41111, wz47) 15.53/6.67 new_listToMaybe5(Pos(Succ(wz4111000)), wz41111, wz48, wz47) -> new_listToMaybe6(wz47, wz41111, wz47) 15.53/6.67 new_listToMaybe6(z3, :(x1, x2), z3) -> new_listToMaybe5(x1, x2, new_primPlusNat(z3), new_primPlusNat(z3)) 15.53/6.67 15.53/6.67 The TRS R consists of the following rules: 15.53/6.67 15.53/6.67 new_primPlusNat(Succ(wz120)) -> Succ(Succ(new_primPlusNat0(wz120))) 15.53/6.67 new_primPlusNat(Zero) -> Succ(Zero) 15.53/6.67 new_primPlusNat0(Succ(wz1200)) -> Succ(wz1200) 15.53/6.67 new_primPlusNat0(Zero) -> Zero 15.53/6.67 15.53/6.67 The set Q consists of the following terms: 15.53/6.67 15.53/6.67 new_primPlusNat0(Succ(x0)) 15.53/6.67 new_primPlusNat0(Zero) 15.53/6.67 new_primPlusNat(Succ(x0)) 15.53/6.67 new_primPlusNat(Zero) 15.53/6.67 15.53/6.67 We have to consider all minimal (P,Q,R)-chains. 15.53/6.67 ---------------------------------------- 15.53/6.67 15.53/6.67 (21) QDPSizeChangeProof (EQUIVALENT) 15.53/6.67 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. 15.53/6.67 15.53/6.67 From the DPs we obtained the following set of size-change graphs: 15.53/6.67 *new_listToMaybe6(z3, :(x1, x2), z3) -> new_listToMaybe5(x1, x2, new_primPlusNat(z3), new_primPlusNat(z3)) 15.53/6.67 The graph contains the following edges 2 > 1, 2 > 2 15.53/6.67 15.53/6.67 15.53/6.67 *new_listToMaybe5(Neg(Succ(wz4111000)), wz41111, wz48, wz47) -> new_listToMaybe6(wz47, wz41111, wz47) 15.53/6.67 The graph contains the following edges 4 >= 1, 2 >= 2, 4 >= 3 15.53/6.67 15.53/6.67 15.53/6.67 *new_listToMaybe5(Pos(Succ(wz4111000)), wz41111, wz48, wz47) -> new_listToMaybe6(wz47, wz41111, wz47) 15.53/6.67 The graph contains the following edges 4 >= 1, 2 >= 2, 4 >= 3 15.53/6.67 15.53/6.67 15.53/6.67 ---------------------------------------- 15.53/6.67 15.53/6.67 (22) 15.53/6.67 YES 15.53/6.67 15.53/6.67 ---------------------------------------- 15.53/6.67 15.53/6.67 (23) 15.53/6.67 Obligation: 15.53/6.67 Q DP problem: 15.53/6.67 The TRS P consists of the following rules: 15.53/6.67 15.53/6.67 new_listToMaybe1(wz300, Neg(Zero), wz4111, wz12, wz11) -> new_listToMaybe3(wz12, wz300, wz4111) 15.78/6.67 new_listToMaybe2(wz55, Succ(wz560), Zero, wz58, :(wz590, wz591), wz60) -> new_listToMaybe1(wz58, wz590, wz591, wz60, wz60) 15.78/6.67 new_listToMaybe4(wz55, wz58, :(wz590, wz591), wz60) -> new_listToMaybe1(wz58, wz590, wz591, wz60, wz60) 15.78/6.67 new_listToMaybe3(wz12, wz300, :(wz41110, wz41111)) -> new_listToMaybe1(wz300, wz41110, wz41111, new_primPlusNat(wz12), new_primPlusNat(wz12)) 15.78/6.67 new_listToMaybe1(wz300, Neg(Succ(wz411000)), wz4111, wz12, wz11) -> new_listToMaybe2(new_primPlusNat(wz12), wz300, wz411000, wz300, wz4111, new_primPlusNat(wz12)) 15.78/6.67 new_listToMaybe2(wz55, Zero, Succ(wz570), wz58, wz59, wz60) -> new_listToMaybe4(wz55, wz58, wz59, wz60) 15.78/6.67 new_listToMaybe1(wz300, Pos(wz41100), :(wz41110, wz41111), wz12, wz11) -> new_listToMaybe1(wz300, wz41110, wz41111, new_primPlusNat(wz12), new_primPlusNat(wz12)) 15.78/6.67 new_listToMaybe2(wz55, Succ(wz560), Succ(wz570), wz58, wz59, wz60) -> new_listToMaybe2(wz55, wz560, wz570, wz58, wz59, wz60) 15.78/6.67 15.78/6.67 The TRS R consists of the following rules: 15.78/6.67 15.78/6.67 new_primPlusNat(Succ(wz120)) -> Succ(Succ(new_primPlusNat0(wz120))) 15.78/6.67 new_primPlusNat(Zero) -> Succ(Zero) 15.78/6.67 new_primPlusNat0(Succ(wz1200)) -> Succ(wz1200) 15.78/6.67 new_primPlusNat0(Zero) -> Zero 15.78/6.67 15.78/6.67 The set Q consists of the following terms: 15.78/6.67 15.78/6.67 new_primPlusNat0(Succ(x0)) 15.78/6.67 new_primPlusNat0(Zero) 15.78/6.67 new_primPlusNat(Succ(x0)) 15.78/6.67 new_primPlusNat(Zero) 15.78/6.67 15.78/6.67 We have to consider all minimal (P,Q,R)-chains. 15.78/6.67 ---------------------------------------- 15.78/6.67 15.78/6.67 (24) QDPSizeChangeProof (EQUIVALENT) 15.78/6.67 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. 15.78/6.67 15.78/6.67 From the DPs we obtained the following set of size-change graphs: 15.78/6.67 *new_listToMaybe3(wz12, wz300, :(wz41110, wz41111)) -> new_listToMaybe1(wz300, wz41110, wz41111, new_primPlusNat(wz12), new_primPlusNat(wz12)) 15.78/6.67 The graph contains the following edges 2 >= 1, 3 > 2, 3 > 3 15.78/6.67 15.78/6.67 15.78/6.67 *new_listToMaybe1(wz300, Pos(wz41100), :(wz41110, wz41111), wz12, wz11) -> new_listToMaybe1(wz300, wz41110, wz41111, new_primPlusNat(wz12), new_primPlusNat(wz12)) 15.78/6.67 The graph contains the following edges 1 >= 1, 3 > 2, 3 > 3 15.78/6.67 15.78/6.67 15.78/6.67 *new_listToMaybe1(wz300, Neg(Succ(wz411000)), wz4111, wz12, wz11) -> new_listToMaybe2(new_primPlusNat(wz12), wz300, wz411000, wz300, wz4111, new_primPlusNat(wz12)) 15.78/6.67 The graph contains the following edges 1 >= 2, 2 > 3, 1 >= 4, 3 >= 5 15.78/6.67 15.78/6.67 15.78/6.67 *new_listToMaybe1(wz300, Neg(Zero), wz4111, wz12, wz11) -> new_listToMaybe3(wz12, wz300, wz4111) 15.78/6.67 The graph contains the following edges 4 >= 1, 1 >= 2, 3 >= 3 15.78/6.67 15.78/6.67 15.78/6.67 *new_listToMaybe2(wz55, Succ(wz560), Succ(wz570), wz58, wz59, wz60) -> new_listToMaybe2(wz55, wz560, wz570, wz58, wz59, wz60) 15.78/6.67 The graph contains the following edges 1 >= 1, 2 > 2, 3 > 3, 4 >= 4, 5 >= 5, 6 >= 6 15.78/6.67 15.78/6.67 15.78/6.67 *new_listToMaybe2(wz55, Zero, Succ(wz570), wz58, wz59, wz60) -> new_listToMaybe4(wz55, wz58, wz59, wz60) 15.78/6.67 The graph contains the following edges 1 >= 1, 4 >= 2, 5 >= 3, 6 >= 4 15.78/6.67 15.78/6.67 15.78/6.67 *new_listToMaybe2(wz55, Succ(wz560), Zero, wz58, :(wz590, wz591), wz60) -> new_listToMaybe1(wz58, wz590, wz591, wz60, wz60) 15.78/6.67 The graph contains the following edges 4 >= 1, 5 > 2, 5 > 3, 6 >= 4, 6 >= 5 15.78/6.67 15.78/6.67 15.78/6.67 *new_listToMaybe4(wz55, wz58, :(wz590, wz591), wz60) -> new_listToMaybe1(wz58, wz590, wz591, wz60, wz60) 15.78/6.67 The graph contains the following edges 2 >= 1, 3 > 2, 3 > 3, 4 >= 4, 4 >= 5 15.78/6.67 15.78/6.67 15.78/6.67 ---------------------------------------- 15.78/6.67 15.78/6.67 (25) 15.78/6.67 YES 15.78/6.67 15.78/6.67 ---------------------------------------- 15.78/6.67 15.78/6.67 (26) 15.78/6.67 Obligation: 15.78/6.67 Q DP problem: 15.78/6.67 The TRS P consists of the following rules: 15.78/6.67 15.78/6.67 new_listToMaybe9(wz300, wz41110, wz41111, wz41, wz42) -> new_listToMaybe10(wz300, wz41110, wz41111, new_primPlusNat(wz41), new_primPlusNat(wz41)) 15.78/6.67 new_listToMaybe10(wz300, Pos(Succ(wz4111000)), wz41111, wz46, wz45) -> new_listToMaybe7(wz45, wz300, wz4111000, wz300, wz41111) 15.78/6.67 new_listToMaybe10(wz300, Neg(wz411100), :(wz411110, wz411111), wz46, wz45) -> new_listToMaybe9(wz300, wz411110, wz411111, wz45, wz45) 15.78/6.67 new_listToMaybe7(wz66, Succ(wz670), Zero, wz69, wz70) -> new_listToMaybe8(wz66, wz69, wz70) 15.78/6.67 new_listToMaybe7(wz66, Zero, Succ(wz680), wz69, wz70) -> new_listToMaybe8(wz66, wz69, wz70) 15.78/6.67 new_listToMaybe8(wz45, wz300, :(wz411110, wz411111)) -> new_listToMaybe9(wz300, wz411110, wz411111, wz45, wz45) 15.78/6.67 new_listToMaybe7(wz66, Succ(wz670), Succ(wz680), wz69, wz70) -> new_listToMaybe7(wz66, wz670, wz680, wz69, wz70) 15.78/6.67 new_listToMaybe10(wz300, Pos(Zero), wz41111, wz46, wz45) -> new_listToMaybe8(wz45, wz300, wz41111) 15.78/6.67 15.78/6.67 The TRS R consists of the following rules: 15.78/6.67 15.78/6.67 new_primPlusNat(Succ(wz120)) -> Succ(Succ(new_primPlusNat0(wz120))) 15.78/6.67 new_primPlusNat(Zero) -> Succ(Zero) 15.78/6.67 new_primPlusNat0(Succ(wz1200)) -> Succ(wz1200) 15.78/6.67 new_primPlusNat0(Zero) -> Zero 15.78/6.67 15.78/6.67 The set Q consists of the following terms: 15.78/6.67 15.78/6.67 new_primPlusNat0(Succ(x0)) 15.78/6.67 new_primPlusNat0(Zero) 15.78/6.67 new_primPlusNat(Succ(x0)) 15.78/6.67 new_primPlusNat(Zero) 15.78/6.67 15.78/6.67 We have to consider all minimal (P,Q,R)-chains. 15.78/6.67 ---------------------------------------- 15.78/6.67 15.78/6.67 (27) TransformationProof (EQUIVALENT) 15.78/6.67 By instantiating [LPAR04] the rule new_listToMaybe9(wz300, wz41110, wz41111, wz41, wz42) -> new_listToMaybe10(wz300, wz41110, wz41111, new_primPlusNat(wz41), new_primPlusNat(wz41)) we obtained the following new rules [LPAR04]: 15.78/6.67 15.78/6.67 (new_listToMaybe9(z0, z2, z3, z5, z5) -> new_listToMaybe10(z0, z2, z3, new_primPlusNat(z5), new_primPlusNat(z5)),new_listToMaybe9(z0, z2, z3, z5, z5) -> new_listToMaybe10(z0, z2, z3, new_primPlusNat(z5), new_primPlusNat(z5))) 15.78/6.67 15.78/6.67 15.78/6.67 ---------------------------------------- 15.78/6.67 15.78/6.67 (28) 15.78/6.67 Obligation: 15.78/6.67 Q DP problem: 15.78/6.67 The TRS P consists of the following rules: 15.78/6.67 15.78/6.67 new_listToMaybe10(wz300, Pos(Succ(wz4111000)), wz41111, wz46, wz45) -> new_listToMaybe7(wz45, wz300, wz4111000, wz300, wz41111) 15.78/6.67 new_listToMaybe10(wz300, Neg(wz411100), :(wz411110, wz411111), wz46, wz45) -> new_listToMaybe9(wz300, wz411110, wz411111, wz45, wz45) 15.78/6.67 new_listToMaybe7(wz66, Succ(wz670), Zero, wz69, wz70) -> new_listToMaybe8(wz66, wz69, wz70) 15.78/6.67 new_listToMaybe7(wz66, Zero, Succ(wz680), wz69, wz70) -> new_listToMaybe8(wz66, wz69, wz70) 15.78/6.67 new_listToMaybe8(wz45, wz300, :(wz411110, wz411111)) -> new_listToMaybe9(wz300, wz411110, wz411111, wz45, wz45) 15.78/6.67 new_listToMaybe7(wz66, Succ(wz670), Succ(wz680), wz69, wz70) -> new_listToMaybe7(wz66, wz670, wz680, wz69, wz70) 15.78/6.67 new_listToMaybe10(wz300, Pos(Zero), wz41111, wz46, wz45) -> new_listToMaybe8(wz45, wz300, wz41111) 15.78/6.67 new_listToMaybe9(z0, z2, z3, z5, z5) -> new_listToMaybe10(z0, z2, z3, new_primPlusNat(z5), new_primPlusNat(z5)) 15.78/6.67 15.78/6.67 The TRS R consists of the following rules: 15.78/6.67 15.78/6.67 new_primPlusNat(Succ(wz120)) -> Succ(Succ(new_primPlusNat0(wz120))) 15.78/6.67 new_primPlusNat(Zero) -> Succ(Zero) 15.78/6.67 new_primPlusNat0(Succ(wz1200)) -> Succ(wz1200) 15.78/6.67 new_primPlusNat0(Zero) -> Zero 15.78/6.67 15.78/6.67 The set Q consists of the following terms: 15.78/6.67 15.78/6.67 new_primPlusNat0(Succ(x0)) 15.78/6.67 new_primPlusNat0(Zero) 15.78/6.67 new_primPlusNat(Succ(x0)) 15.78/6.67 new_primPlusNat(Zero) 15.78/6.67 15.78/6.67 We have to consider all minimal (P,Q,R)-chains. 15.78/6.67 ---------------------------------------- 15.78/6.67 15.78/6.67 (29) QDPSizeChangeProof (EQUIVALENT) 15.78/6.67 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. 15.78/6.67 15.78/6.67 From the DPs we obtained the following set of size-change graphs: 15.78/6.67 *new_listToMaybe9(z0, z2, z3, z5, z5) -> new_listToMaybe10(z0, z2, z3, new_primPlusNat(z5), new_primPlusNat(z5)) 15.78/6.67 The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3 15.78/6.67 15.78/6.67 15.78/6.67 *new_listToMaybe7(wz66, Succ(wz670), Succ(wz680), wz69, wz70) -> new_listToMaybe7(wz66, wz670, wz680, wz69, wz70) 15.78/6.67 The graph contains the following edges 1 >= 1, 2 > 2, 3 > 3, 4 >= 4, 5 >= 5 15.78/6.67 15.78/6.67 15.78/6.67 *new_listToMaybe8(wz45, wz300, :(wz411110, wz411111)) -> new_listToMaybe9(wz300, wz411110, wz411111, wz45, wz45) 15.78/6.67 The graph contains the following edges 2 >= 1, 3 > 2, 3 > 3, 1 >= 4, 1 >= 5 15.78/6.67 15.78/6.67 15.78/6.67 *new_listToMaybe10(wz300, Pos(Succ(wz4111000)), wz41111, wz46, wz45) -> new_listToMaybe7(wz45, wz300, wz4111000, wz300, wz41111) 15.78/6.67 The graph contains the following edges 5 >= 1, 1 >= 2, 2 > 3, 1 >= 4, 3 >= 5 15.78/6.67 15.78/6.67 15.78/6.67 *new_listToMaybe10(wz300, Pos(Zero), wz41111, wz46, wz45) -> new_listToMaybe8(wz45, wz300, wz41111) 15.78/6.67 The graph contains the following edges 5 >= 1, 1 >= 2, 3 >= 3 15.78/6.67 15.78/6.67 15.78/6.67 *new_listToMaybe10(wz300, Neg(wz411100), :(wz411110, wz411111), wz46, wz45) -> new_listToMaybe9(wz300, wz411110, wz411111, wz45, wz45) 15.78/6.67 The graph contains the following edges 1 >= 1, 3 > 2, 3 > 3, 5 >= 4, 5 >= 5 15.78/6.67 15.78/6.67 15.78/6.67 *new_listToMaybe7(wz66, Succ(wz670), Zero, wz69, wz70) -> new_listToMaybe8(wz66, wz69, wz70) 15.78/6.67 The graph contains the following edges 1 >= 1, 4 >= 2, 5 >= 3 15.78/6.67 15.78/6.67 15.78/6.67 *new_listToMaybe7(wz66, Zero, Succ(wz680), wz69, wz70) -> new_listToMaybe8(wz66, wz69, wz70) 15.78/6.67 The graph contains the following edges 1 >= 1, 4 >= 2, 5 >= 3 15.78/6.67 15.78/6.67 15.78/6.67 ---------------------------------------- 15.78/6.67 15.78/6.67 (30) 15.78/6.67 YES 15.83/9.93 EOF