10.55/4.50 YES 12.65/5.12 proof of /export/starexec/sandbox2/benchmark/theBenchmark.hs 12.65/5.12 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 12.65/5.12 12.65/5.12 12.65/5.12 H-Termination with start terms of the given HASKELL could be proven: 12.65/5.12 12.65/5.12 (0) HASKELL 12.65/5.12 (1) LR [EQUIVALENT, 0 ms] 12.65/5.12 (2) HASKELL 12.65/5.12 (3) BR [EQUIVALENT, 0 ms] 12.65/5.12 (4) HASKELL 12.65/5.12 (5) COR [EQUIVALENT, 0 ms] 12.65/5.12 (6) HASKELL 12.65/5.12 (7) LetRed [EQUIVALENT, 0 ms] 12.65/5.12 (8) HASKELL 12.65/5.12 (9) Narrow [SOUND, 0 ms] 12.65/5.12 (10) QDP 12.65/5.12 (11) QDPSizeChangeProof [EQUIVALENT, 0 ms] 12.65/5.12 (12) YES 12.65/5.12 12.65/5.12 12.65/5.12 ---------------------------------------- 12.65/5.12 12.65/5.12 (0) 12.65/5.12 Obligation: 12.65/5.12 mainModule Main 12.65/5.12 module Maybe where { 12.65/5.12 import qualified List; 12.65/5.12 import qualified Main; 12.65/5.12 import qualified Prelude; 12.65/5.12 } 12.65/5.12 module List where { 12.65/5.12 import qualified Main; 12.65/5.12 import qualified Maybe; 12.65/5.12 import qualified Prelude; 12.65/5.12 mapAccumL :: (a -> b -> (a,c)) -> a -> [b] -> (a,[c]); 12.65/5.12 mapAccumL _ s [] = (s,[]); 12.65/5.12 mapAccumL f s (x : xs) = (s'',y : ys) where { 12.65/5.12 s' = (\(s',_) ->s') vv5; 12.65/5.12 s'' = (\(s'',_) ->s'') vv6; 12.65/5.12 vv5 = f s x; 12.65/5.12 vv6 = mapAccumL f s' xs; 12.65/5.12 y = (\(_,y) ->y) vv5; 12.65/5.12 ys = (\(_,ys) ->ys) vv6; 12.65/5.12 }; 12.65/5.12 12.65/5.12 } 12.65/5.12 module Main where { 12.65/5.12 import qualified List; 12.65/5.12 import qualified Maybe; 12.65/5.12 import qualified Prelude; 12.65/5.12 } 12.65/5.12 12.65/5.12 ---------------------------------------- 12.65/5.12 12.65/5.12 (1) LR (EQUIVALENT) 12.65/5.12 Lambda Reductions: 12.65/5.12 The following Lambda expression 12.65/5.12 "\(s'',_)->s''" 12.65/5.12 is transformed to 12.65/5.12 "s''0 (s'',_) = s''; 12.65/5.12 " 12.65/5.12 The following Lambda expression 12.65/5.12 "\(s',_)->s'" 12.65/5.12 is transformed to 12.65/5.12 "s'0 (s',_) = s'; 12.65/5.12 " 12.65/5.12 The following Lambda expression 12.65/5.12 "\(_,y)->y" 12.65/5.12 is transformed to 12.65/5.12 "y0 (_,y) = y; 12.65/5.12 " 12.65/5.12 The following Lambda expression 12.65/5.12 "\(_,ys)->ys" 12.65/5.12 is transformed to 12.65/5.12 "ys0 (_,ys) = ys; 12.65/5.12 " 12.65/5.12 12.65/5.12 ---------------------------------------- 12.65/5.12 12.65/5.12 (2) 12.65/5.12 Obligation: 12.65/5.12 mainModule Main 12.65/5.12 module Maybe where { 12.65/5.12 import qualified List; 12.65/5.12 import qualified Main; 12.65/5.12 import qualified Prelude; 12.65/5.12 } 12.65/5.12 module List where { 12.65/5.12 import qualified Main; 12.65/5.12 import qualified Maybe; 12.65/5.12 import qualified Prelude; 12.65/5.12 mapAccumL :: (c -> b -> (c,a)) -> c -> [b] -> (c,[a]); 12.65/5.12 mapAccumL _ s [] = (s,[]); 12.65/5.12 mapAccumL f s (x : xs) = (s'',y : ys) where { 12.65/5.12 s' = s'0 vv5; 12.65/5.12 s'' = s''0 vv6; 12.65/5.12 s''0 (s'',_) = s''; 12.65/5.12 s'0 (s',_) = s'; 12.65/5.12 vv5 = f s x; 12.65/5.12 vv6 = mapAccumL f s' xs; 12.65/5.12 y = y0 vv5; 12.65/5.12 y0 (_,y) = y; 12.65/5.12 ys = ys0 vv6; 12.65/5.12 ys0 (_,ys) = ys; 12.65/5.12 }; 12.65/5.12 12.65/5.12 } 12.65/5.12 module Main where { 12.65/5.12 import qualified List; 12.65/5.12 import qualified Maybe; 12.65/5.12 import qualified Prelude; 12.65/5.12 } 12.65/5.12 12.65/5.12 ---------------------------------------- 12.65/5.12 12.65/5.12 (3) BR (EQUIVALENT) 12.65/5.12 Replaced joker patterns by fresh variables and removed binding patterns. 12.65/5.12 ---------------------------------------- 12.65/5.12 12.65/5.12 (4) 12.65/5.12 Obligation: 12.65/5.12 mainModule Main 12.65/5.12 module Maybe where { 12.65/5.12 import qualified List; 12.65/5.12 import qualified Main; 12.65/5.12 import qualified Prelude; 12.65/5.12 } 12.65/5.12 module List where { 12.65/5.12 import qualified Main; 12.65/5.12 import qualified Maybe; 12.65/5.12 import qualified Prelude; 12.65/5.12 mapAccumL :: (b -> c -> (b,a)) -> b -> [c] -> (b,[a]); 12.65/5.12 mapAccumL vy s [] = (s,[]); 12.65/5.12 mapAccumL f s (x : xs) = (s'',y : ys) where { 12.65/5.12 s' = s'0 vv5; 12.65/5.12 s'' = s''0 vv6; 12.65/5.12 s''0 (s'',wv) = s''; 12.65/5.12 s'0 (s',ww) = s'; 12.65/5.12 vv5 = f s x; 12.65/5.12 vv6 = mapAccumL f s' xs; 12.65/5.12 y = y0 vv5; 12.65/5.12 y0 (vz,y) = y; 12.65/5.12 ys = ys0 vv6; 12.65/5.12 ys0 (wu,ys) = ys; 12.65/5.12 }; 12.65/5.12 12.65/5.12 } 12.65/5.12 module Main where { 12.65/5.12 import qualified List; 12.65/5.12 import qualified Maybe; 12.65/5.12 import qualified Prelude; 12.65/5.12 } 12.65/5.12 12.65/5.12 ---------------------------------------- 12.65/5.12 12.65/5.12 (5) COR (EQUIVALENT) 12.65/5.12 Cond Reductions: 12.65/5.12 The following Function with conditions 12.65/5.12 "undefined |Falseundefined; 12.65/5.12 " 12.65/5.12 is transformed to 12.65/5.12 "undefined = undefined1; 12.65/5.12 " 12.65/5.12 "undefined0 True = undefined; 12.65/5.12 " 12.65/5.12 "undefined1 = undefined0 False; 12.65/5.12 " 12.65/5.12 12.65/5.12 ---------------------------------------- 12.65/5.12 12.65/5.12 (6) 12.65/5.12 Obligation: 12.65/5.12 mainModule Main 12.65/5.12 module Maybe where { 12.65/5.12 import qualified List; 12.65/5.12 import qualified Main; 12.65/5.12 import qualified Prelude; 12.65/5.12 } 12.65/5.12 module List where { 12.65/5.12 import qualified Main; 12.65/5.12 import qualified Maybe; 12.65/5.12 import qualified Prelude; 12.65/5.12 mapAccumL :: (c -> a -> (c,b)) -> c -> [a] -> (c,[b]); 12.65/5.12 mapAccumL vy s [] = (s,[]); 12.65/5.12 mapAccumL f s (x : xs) = (s'',y : ys) where { 12.65/5.12 s' = s'0 vv5; 12.65/5.12 s'' = s''0 vv6; 12.65/5.12 s''0 (s'',wv) = s''; 12.65/5.12 s'0 (s',ww) = s'; 12.65/5.12 vv5 = f s x; 12.65/5.12 vv6 = mapAccumL f s' xs; 12.65/5.12 y = y0 vv5; 12.65/5.12 y0 (vz,y) = y; 12.65/5.12 ys = ys0 vv6; 12.65/5.12 ys0 (wu,ys) = ys; 12.65/5.12 }; 12.65/5.12 12.65/5.12 } 12.65/5.12 module Main where { 12.65/5.12 import qualified List; 12.65/5.12 import qualified Maybe; 12.65/5.12 import qualified Prelude; 12.65/5.12 } 12.65/5.12 12.65/5.12 ---------------------------------------- 12.65/5.12 12.65/5.12 (7) LetRed (EQUIVALENT) 12.65/5.12 Let/Where Reductions: 12.65/5.12 The bindings of the following Let/Where expression 12.65/5.12 "(s'',y : ys) where { 12.65/5.12 s' = s'0 vv5; 12.65/5.12 ; 12.65/5.12 s'' = s''0 vv6; 12.65/5.12 ; 12.65/5.12 s''0 (s'',wv) = s''; 12.65/5.12 ; 12.65/5.12 s'0 (s',ww) = s'; 12.65/5.12 ; 12.65/5.12 vv5 = f s x; 12.65/5.12 ; 12.65/5.12 vv6 = mapAccumL f s' xs; 12.65/5.12 ; 12.65/5.12 y = y0 vv5; 12.65/5.12 ; 12.65/5.12 y0 (vz,y) = y; 12.65/5.12 ; 12.65/5.12 ys = ys0 vv6; 12.65/5.12 ; 12.65/5.12 ys0 (wu,ys) = ys; 12.65/5.12 } 12.65/5.12 " 12.65/5.12 are unpacked to the following functions on top level 12.65/5.12 "mapAccumLS'' wx wy wz xu = mapAccumLS''0 wx wy wz xu (mapAccumLVv6 wx wy wz xu); 12.65/5.12 " 12.65/5.12 "mapAccumLVv5 wx wy wz xu = wx wy wz; 12.65/5.12 " 12.65/5.12 "mapAccumLY0 wx wy wz xu (vz,y) = y; 12.65/5.12 " 12.65/5.12 "mapAccumLVv6 wx wy wz xu = mapAccumL wx (mapAccumLS' wx wy wz xu) xu; 12.65/5.12 " 12.65/5.12 "mapAccumLS'0 wx wy wz xu (s',ww) = s'; 12.65/5.12 " 12.65/5.12 "mapAccumLS' wx wy wz xu = mapAccumLS'0 wx wy wz xu (mapAccumLVv5 wx wy wz xu); 12.65/5.12 " 12.65/5.12 "mapAccumLYs wx wy wz xu = mapAccumLYs0 wx wy wz xu (mapAccumLVv6 wx wy wz xu); 12.65/5.12 " 12.65/5.12 "mapAccumLY wx wy wz xu = mapAccumLY0 wx wy wz xu (mapAccumLVv5 wx wy wz xu); 12.65/5.12 " 12.65/5.12 "mapAccumLS''0 wx wy wz xu (s'',wv) = s''; 12.65/5.12 " 12.65/5.12 "mapAccumLYs0 wx wy wz xu (wu,ys) = ys; 12.65/5.12 " 12.65/5.12 12.65/5.12 ---------------------------------------- 12.65/5.12 12.65/5.12 (8) 12.65/5.12 Obligation: 12.65/5.12 mainModule Main 12.65/5.12 module Maybe where { 12.65/5.12 import qualified List; 12.65/5.12 import qualified Main; 12.65/5.12 import qualified Prelude; 12.65/5.12 } 12.65/5.12 module List where { 12.65/5.12 import qualified Main; 12.65/5.12 import qualified Maybe; 12.65/5.12 import qualified Prelude; 12.65/5.12 mapAccumL :: (c -> a -> (c,b)) -> c -> [a] -> (c,[b]); 12.65/5.12 mapAccumL vy s [] = (s,[]); 12.65/5.12 mapAccumL f s (x : xs) = (mapAccumLS'' f s x xs,mapAccumLY f s x xs : mapAccumLYs f s x xs); 12.65/5.12 12.65/5.12 mapAccumLS' wx wy wz xu = mapAccumLS'0 wx wy wz xu (mapAccumLVv5 wx wy wz xu); 12.65/5.12 12.65/5.12 mapAccumLS'' wx wy wz xu = mapAccumLS''0 wx wy wz xu (mapAccumLVv6 wx wy wz xu); 12.65/5.12 12.65/5.12 mapAccumLS''0 wx wy wz xu (s'',wv) = s''; 12.65/5.12 12.65/5.12 mapAccumLS'0 wx wy wz xu (s',ww) = s'; 12.65/5.12 12.65/5.12 mapAccumLVv5 wx wy wz xu = wx wy wz; 12.65/5.12 12.65/5.12 mapAccumLVv6 wx wy wz xu = mapAccumL wx (mapAccumLS' wx wy wz xu) xu; 12.65/5.12 12.65/5.12 mapAccumLY wx wy wz xu = mapAccumLY0 wx wy wz xu (mapAccumLVv5 wx wy wz xu); 12.65/5.12 12.65/5.12 mapAccumLY0 wx wy wz xu (vz,y) = y; 12.65/5.12 12.65/5.12 mapAccumLYs wx wy wz xu = mapAccumLYs0 wx wy wz xu (mapAccumLVv6 wx wy wz xu); 12.65/5.12 12.65/5.12 mapAccumLYs0 wx wy wz xu (wu,ys) = ys; 12.65/5.12 12.65/5.12 } 12.65/5.12 module Main where { 12.65/5.12 import qualified List; 12.65/5.12 import qualified Maybe; 12.65/5.12 import qualified Prelude; 12.65/5.12 } 12.65/5.12 12.65/5.12 ---------------------------------------- 12.65/5.12 12.65/5.12 (9) Narrow (SOUND) 12.65/5.12 Haskell To QDPs 12.65/5.12 12.65/5.12 digraph dp_graph { 12.65/5.12 node [outthreshold=100, inthreshold=100];1[label="List.mapAccumL",fontsize=16,color="grey",shape="box"];1 -> 3[label="",style="dashed", color="grey", weight=3]; 12.65/5.12 3[label="List.mapAccumL xv3",fontsize=16,color="grey",shape="box"];3 -> 4[label="",style="dashed", color="grey", weight=3]; 12.65/5.12 4[label="List.mapAccumL xv3 xv4",fontsize=16,color="grey",shape="box"];4 -> 5[label="",style="dashed", color="grey", weight=3]; 12.65/5.12 5[label="List.mapAccumL xv3 xv4 xv5",fontsize=16,color="burlywood",shape="triangle"];45[label="xv5/xv50 : xv51",fontsize=10,color="white",style="solid",shape="box"];5 -> 45[label="",style="solid", color="burlywood", weight=9]; 12.65/5.12 45 -> 6[label="",style="solid", color="burlywood", weight=3]; 12.65/5.12 46[label="xv5/[]",fontsize=10,color="white",style="solid",shape="box"];5 -> 46[label="",style="solid", color="burlywood", weight=9]; 12.65/5.12 46 -> 7[label="",style="solid", color="burlywood", weight=3]; 12.65/5.12 6[label="List.mapAccumL xv3 xv4 (xv50 : xv51)",fontsize=16,color="black",shape="box"];6 -> 8[label="",style="solid", color="black", weight=3]; 12.65/5.12 7[label="List.mapAccumL xv3 xv4 []",fontsize=16,color="black",shape="box"];7 -> 9[label="",style="solid", color="black", weight=3]; 12.65/5.12 8[label="(List.mapAccumLS'' xv3 xv4 xv50 xv51,List.mapAccumLY xv3 xv4 xv50 xv51 : List.mapAccumLYs xv3 xv4 xv50 xv51)",fontsize=16,color="green",shape="box"];8 -> 10[label="",style="dashed", color="green", weight=3]; 12.65/5.12 8 -> 11[label="",style="dashed", color="green", weight=3]; 12.65/5.12 8 -> 12[label="",style="dashed", color="green", weight=3]; 12.65/5.12 9[label="(xv4,[])",fontsize=16,color="green",shape="box"];10[label="List.mapAccumLS'' xv3 xv4 xv50 xv51",fontsize=16,color="black",shape="box"];10 -> 13[label="",style="solid", color="black", weight=3]; 12.65/5.12 11[label="List.mapAccumLY xv3 xv4 xv50 xv51",fontsize=16,color="black",shape="box"];11 -> 14[label="",style="solid", color="black", weight=3]; 12.65/5.12 12[label="List.mapAccumLYs xv3 xv4 xv50 xv51",fontsize=16,color="black",shape="box"];12 -> 15[label="",style="solid", color="black", weight=3]; 12.65/5.12 13 -> 19[label="",style="dashed", color="red", weight=0]; 12.65/5.12 13[label="List.mapAccumLS''0 xv3 xv4 xv50 xv51 (List.mapAccumLVv6 xv3 xv4 xv50 xv51)",fontsize=16,color="magenta"];13 -> 20[label="",style="dashed", color="magenta", weight=3]; 12.65/5.12 14 -> 24[label="",style="dashed", color="red", weight=0]; 12.65/5.12 14[label="List.mapAccumLY0 xv3 xv4 xv50 xv51 (List.mapAccumLVv5 xv3 xv4 xv50 xv51)",fontsize=16,color="magenta"];14 -> 25[label="",style="dashed", color="magenta", weight=3]; 12.65/5.12 15 -> 29[label="",style="dashed", color="red", weight=0]; 12.65/5.12 15[label="List.mapAccumLYs0 xv3 xv4 xv50 xv51 (List.mapAccumLVv6 xv3 xv4 xv50 xv51)",fontsize=16,color="magenta"];15 -> 30[label="",style="dashed", color="magenta", weight=3]; 12.65/5.12 20[label="List.mapAccumLVv6 xv3 xv4 xv50 xv51",fontsize=16,color="black",shape="triangle"];20 -> 22[label="",style="solid", color="black", weight=3]; 12.65/5.12 19[label="List.mapAccumLS''0 xv3 xv4 xv50 xv51 xv6",fontsize=16,color="burlywood",shape="triangle"];47[label="xv6/(xv60,xv61)",fontsize=10,color="white",style="solid",shape="box"];19 -> 47[label="",style="solid", color="burlywood", weight=9]; 12.65/5.12 47 -> 23[label="",style="solid", color="burlywood", weight=3]; 12.65/5.12 25[label="List.mapAccumLVv5 xv3 xv4 xv50 xv51",fontsize=16,color="black",shape="triangle"];25 -> 27[label="",style="solid", color="black", weight=3]; 12.65/5.12 24[label="List.mapAccumLY0 xv3 xv4 xv50 xv51 xv7",fontsize=16,color="burlywood",shape="triangle"];48[label="xv7/(xv70,xv71)",fontsize=10,color="white",style="solid",shape="box"];24 -> 48[label="",style="solid", color="burlywood", weight=9]; 12.65/5.12 48 -> 28[label="",style="solid", color="burlywood", weight=3]; 12.65/5.12 30 -> 20[label="",style="dashed", color="red", weight=0]; 12.65/5.12 30[label="List.mapAccumLVv6 xv3 xv4 xv50 xv51",fontsize=16,color="magenta"];29[label="List.mapAccumLYs0 xv3 xv4 xv50 xv51 xv8",fontsize=16,color="burlywood",shape="triangle"];49[label="xv8/(xv80,xv81)",fontsize=10,color="white",style="solid",shape="box"];29 -> 49[label="",style="solid", color="burlywood", weight=9]; 12.65/5.12 49 -> 32[label="",style="solid", color="burlywood", weight=3]; 12.65/5.12 22 -> 5[label="",style="dashed", color="red", weight=0]; 12.65/5.12 22[label="List.mapAccumL xv3 (List.mapAccumLS' xv3 xv4 xv50 xv51) xv51",fontsize=16,color="magenta"];22 -> 33[label="",style="dashed", color="magenta", weight=3]; 12.65/5.12 22 -> 34[label="",style="dashed", color="magenta", weight=3]; 12.65/5.12 23[label="List.mapAccumLS''0 xv3 xv4 xv50 xv51 (xv60,xv61)",fontsize=16,color="black",shape="box"];23 -> 35[label="",style="solid", color="black", weight=3]; 12.65/5.12 27[label="xv3 xv4 xv50",fontsize=16,color="green",shape="box"];27 -> 36[label="",style="dashed", color="green", weight=3]; 12.65/5.12 27 -> 37[label="",style="dashed", color="green", weight=3]; 12.65/5.12 28[label="List.mapAccumLY0 xv3 xv4 xv50 xv51 (xv70,xv71)",fontsize=16,color="black",shape="box"];28 -> 38[label="",style="solid", color="black", weight=3]; 12.65/5.12 32[label="List.mapAccumLYs0 xv3 xv4 xv50 xv51 (xv80,xv81)",fontsize=16,color="black",shape="box"];32 -> 39[label="",style="solid", color="black", weight=3]; 12.65/5.12 33[label="List.mapAccumLS' xv3 xv4 xv50 xv51",fontsize=16,color="black",shape="box"];33 -> 40[label="",style="solid", color="black", weight=3]; 12.65/5.12 34[label="xv51",fontsize=16,color="green",shape="box"];35[label="xv60",fontsize=16,color="green",shape="box"];36[label="xv4",fontsize=16,color="green",shape="box"];37[label="xv50",fontsize=16,color="green",shape="box"];38[label="xv71",fontsize=16,color="green",shape="box"];39[label="xv81",fontsize=16,color="green",shape="box"];40 -> 41[label="",style="dashed", color="red", weight=0]; 12.65/5.12 40[label="List.mapAccumLS'0 xv3 xv4 xv50 xv51 (List.mapAccumLVv5 xv3 xv4 xv50 xv51)",fontsize=16,color="magenta"];40 -> 42[label="",style="dashed", color="magenta", weight=3]; 12.65/5.12 42 -> 25[label="",style="dashed", color="red", weight=0]; 12.65/5.12 42[label="List.mapAccumLVv5 xv3 xv4 xv50 xv51",fontsize=16,color="magenta"];41[label="List.mapAccumLS'0 xv3 xv4 xv50 xv51 xv9",fontsize=16,color="burlywood",shape="triangle"];50[label="xv9/(xv90,xv91)",fontsize=10,color="white",style="solid",shape="box"];41 -> 50[label="",style="solid", color="burlywood", weight=9]; 12.65/5.12 50 -> 43[label="",style="solid", color="burlywood", weight=3]; 12.65/5.12 43[label="List.mapAccumLS'0 xv3 xv4 xv50 xv51 (xv90,xv91)",fontsize=16,color="black",shape="box"];43 -> 44[label="",style="solid", color="black", weight=3]; 12.65/5.12 44[label="xv90",fontsize=16,color="green",shape="box"];} 12.65/5.12 12.65/5.12 ---------------------------------------- 12.65/5.12 12.65/5.12 (10) 12.65/5.12 Obligation: 12.65/5.12 Q DP problem: 12.65/5.12 The TRS P consists of the following rules: 12.65/5.12 12.65/5.12 new_mapAccumL(xv3, :(xv50, xv51), ba, bb, bc) -> new_mapAccumLVv6(xv3, xv50, xv51, ba, bb, bc) 12.65/5.12 new_mapAccumL(xv3, :(xv50, xv51), ba, bb, bc) -> new_mapAccumL(xv3, xv51, ba, bb, bc) 12.65/5.12 new_mapAccumLVv6(xv3, xv50, xv51, ba, bb, bc) -> new_mapAccumL(xv3, xv51, ba, bb, bc) 12.65/5.12 12.65/5.12 R is empty. 12.65/5.12 Q is empty. 12.65/5.12 We have to consider all minimal (P,Q,R)-chains. 12.65/5.12 ---------------------------------------- 12.65/5.12 12.65/5.12 (11) QDPSizeChangeProof (EQUIVALENT) 12.65/5.12 By using the subterm criterion [SUBTERM_CRITERION] together with the size-change analysis [AAECC05] we have proven that there are no infinite chains for this DP problem. 12.65/5.12 12.65/5.12 From the DPs we obtained the following set of size-change graphs: 12.65/5.12 *new_mapAccumLVv6(xv3, xv50, xv51, ba, bb, bc) -> new_mapAccumL(xv3, xv51, ba, bb, bc) 12.65/5.12 The graph contains the following edges 1 >= 1, 3 >= 2, 4 >= 3, 5 >= 4, 6 >= 5 12.65/5.12 12.65/5.12 12.65/5.12 *new_mapAccumL(xv3, :(xv50, xv51), ba, bb, bc) -> new_mapAccumL(xv3, xv51, ba, bb, bc) 12.65/5.12 The graph contains the following edges 1 >= 1, 2 > 2, 3 >= 3, 4 >= 4, 5 >= 5 12.65/5.12 12.65/5.12 12.65/5.12 *new_mapAccumL(xv3, :(xv50, xv51), ba, bb, bc) -> new_mapAccumLVv6(xv3, xv50, xv51, ba, bb, bc) 12.65/5.12 The graph contains the following edges 1 >= 1, 2 > 2, 2 > 3, 3 >= 4, 4 >= 5, 5 >= 6 12.65/5.12 12.65/5.12 12.65/5.12 ---------------------------------------- 12.65/5.12 12.65/5.12 (12) 12.65/5.12 YES 12.85/10.49 EOF