10.81/4.49 YES 12.87/5.11 proof of /export/starexec/sandbox/benchmark/theBenchmark.hs 12.87/5.11 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 12.87/5.11 12.87/5.11 12.87/5.11 H-Termination with start terms of the given HASKELL could be proven: 12.87/5.11 12.87/5.11 (0) HASKELL 12.87/5.11 (1) LR [EQUIVALENT, 0 ms] 12.87/5.11 (2) HASKELL 12.87/5.11 (3) BR [EQUIVALENT, 0 ms] 12.87/5.11 (4) HASKELL 12.87/5.11 (5) COR [EQUIVALENT, 0 ms] 12.87/5.11 (6) HASKELL 12.87/5.11 (7) LetRed [EQUIVALENT, 0 ms] 12.87/5.11 (8) HASKELL 12.87/5.11 (9) Narrow [SOUND, 0 ms] 12.87/5.11 (10) QDP 12.87/5.11 (11) QDPSizeChangeProof [EQUIVALENT, 0 ms] 12.87/5.11 (12) YES 12.87/5.11 12.87/5.11 12.87/5.11 ---------------------------------------- 12.87/5.11 12.87/5.11 (0) 12.87/5.11 Obligation: 12.87/5.11 mainModule Main 12.87/5.11 module Maybe where { 12.87/5.11 import qualified List; 12.87/5.11 import qualified Main; 12.87/5.11 import qualified Prelude; 12.87/5.11 } 12.87/5.11 module List where { 12.87/5.11 import qualified Main; 12.87/5.11 import qualified Maybe; 12.87/5.11 import qualified Prelude; 12.87/5.11 mapAccumR :: (a -> c -> (a,b)) -> a -> [c] -> (a,[b]); 12.87/5.11 mapAccumR _ s [] = (s,[]); 12.87/5.11 mapAccumR f s (x : xs) = (s'',y : ys) where { 12.87/5.11 s' = (\(s',_) ->s') vv8; 12.87/5.11 s'' = (\(s'',_) ->s'') vv7; 12.87/5.11 vv7 = f s' x; 12.87/5.11 vv8 = mapAccumR f s xs; 12.87/5.11 y = (\(_,y) ->y) vv7; 12.87/5.11 ys = (\(_,ys) ->ys) vv8; 12.87/5.11 }; 12.87/5.11 12.87/5.11 } 12.87/5.11 module Main where { 12.87/5.11 import qualified List; 12.87/5.11 import qualified Maybe; 12.87/5.11 import qualified Prelude; 12.87/5.11 } 12.87/5.11 12.87/5.11 ---------------------------------------- 12.87/5.11 12.87/5.11 (1) LR (EQUIVALENT) 12.87/5.11 Lambda Reductions: 12.87/5.11 The following Lambda expression 12.87/5.11 "\(s'',_)->s''" 12.87/5.11 is transformed to 12.87/5.11 "s''0 (s'',_) = s''; 12.87/5.11 " 12.87/5.11 The following Lambda expression 12.87/5.11 "\(s',_)->s'" 12.87/5.11 is transformed to 12.87/5.11 "s'0 (s',_) = s'; 12.87/5.11 " 12.87/5.11 The following Lambda expression 12.87/5.11 "\(_,y)->y" 12.87/5.11 is transformed to 12.87/5.11 "y0 (_,y) = y; 12.87/5.11 " 12.87/5.11 The following Lambda expression 12.87/5.11 "\(_,ys)->ys" 12.87/5.11 is transformed to 12.87/5.11 "ys0 (_,ys) = ys; 12.87/5.11 " 12.87/5.11 12.87/5.11 ---------------------------------------- 12.87/5.11 12.87/5.11 (2) 12.87/5.11 Obligation: 12.87/5.11 mainModule Main 12.87/5.11 module Maybe where { 12.87/5.11 import qualified List; 12.87/5.11 import qualified Main; 12.87/5.11 import qualified Prelude; 12.87/5.11 } 12.87/5.11 module List where { 12.87/5.11 import qualified Main; 12.87/5.11 import qualified Maybe; 12.87/5.11 import qualified Prelude; 12.87/5.11 mapAccumR :: (b -> a -> (b,c)) -> b -> [a] -> (b,[c]); 12.87/5.11 mapAccumR _ s [] = (s,[]); 12.87/5.11 mapAccumR f s (x : xs) = (s'',y : ys) where { 12.87/5.11 s' = s'0 vv8; 12.87/5.11 s'' = s''0 vv7; 12.87/5.11 s''0 (s'',_) = s''; 12.87/5.11 s'0 (s',_) = s'; 12.87/5.11 vv7 = f s' x; 12.87/5.11 vv8 = mapAccumR f s xs; 12.87/5.11 y = y0 vv7; 12.87/5.11 y0 (_,y) = y; 12.87/5.11 ys = ys0 vv8; 12.87/5.11 ys0 (_,ys) = ys; 12.87/5.11 }; 12.87/5.11 12.87/5.11 } 12.87/5.11 module Main where { 12.87/5.11 import qualified List; 12.87/5.11 import qualified Maybe; 12.87/5.11 import qualified Prelude; 12.87/5.11 } 12.87/5.11 12.87/5.11 ---------------------------------------- 12.87/5.11 12.87/5.11 (3) BR (EQUIVALENT) 12.87/5.11 Replaced joker patterns by fresh variables and removed binding patterns. 12.87/5.11 ---------------------------------------- 12.87/5.11 12.87/5.11 (4) 12.87/5.11 Obligation: 12.87/5.11 mainModule Main 12.87/5.11 module Maybe where { 12.87/5.11 import qualified List; 12.87/5.11 import qualified Main; 12.87/5.11 import qualified Prelude; 12.87/5.11 } 12.87/5.11 module List where { 12.87/5.11 import qualified Main; 12.87/5.11 import qualified Maybe; 12.87/5.11 import qualified Prelude; 12.87/5.11 mapAccumR :: (a -> c -> (a,b)) -> a -> [c] -> (a,[b]); 12.87/5.11 mapAccumR vy s [] = (s,[]); 12.87/5.11 mapAccumR f s (x : xs) = (s'',y : ys) where { 12.87/5.11 s' = s'0 vv8; 12.87/5.11 s'' = s''0 vv7; 12.87/5.11 s''0 (s'',wv) = s''; 12.87/5.11 s'0 (s',ww) = s'; 12.87/5.11 vv7 = f s' x; 12.87/5.11 vv8 = mapAccumR f s xs; 12.87/5.11 y = y0 vv7; 12.87/5.11 y0 (vz,y) = y; 12.87/5.11 ys = ys0 vv8; 12.87/5.11 ys0 (wu,ys) = ys; 12.87/5.11 }; 12.87/5.11 12.87/5.11 } 12.87/5.11 module Main where { 12.87/5.11 import qualified List; 12.87/5.11 import qualified Maybe; 12.87/5.11 import qualified Prelude; 12.87/5.11 } 12.87/5.11 12.87/5.11 ---------------------------------------- 12.87/5.11 12.87/5.11 (5) COR (EQUIVALENT) 12.87/5.11 Cond Reductions: 12.87/5.11 The following Function with conditions 12.87/5.11 "undefined |Falseundefined; 12.87/5.11 " 12.87/5.11 is transformed to 12.87/5.11 "undefined = undefined1; 12.87/5.11 " 12.87/5.11 "undefined0 True = undefined; 12.87/5.11 " 12.87/5.11 "undefined1 = undefined0 False; 12.87/5.11 " 12.87/5.11 12.87/5.11 ---------------------------------------- 12.87/5.11 12.87/5.11 (6) 12.87/5.11 Obligation: 12.87/5.11 mainModule Main 12.87/5.11 module Maybe where { 12.87/5.11 import qualified List; 12.87/5.11 import qualified Main; 12.87/5.11 import qualified Prelude; 12.87/5.11 } 12.87/5.11 module List where { 12.87/5.11 import qualified Main; 12.87/5.11 import qualified Maybe; 12.87/5.11 import qualified Prelude; 12.87/5.11 mapAccumR :: (c -> a -> (c,b)) -> c -> [a] -> (c,[b]); 12.87/5.11 mapAccumR vy s [] = (s,[]); 12.87/5.11 mapAccumR f s (x : xs) = (s'',y : ys) where { 12.87/5.11 s' = s'0 vv8; 12.87/5.11 s'' = s''0 vv7; 12.87/5.11 s''0 (s'',wv) = s''; 12.87/5.11 s'0 (s',ww) = s'; 12.87/5.11 vv7 = f s' x; 12.87/5.11 vv8 = mapAccumR f s xs; 12.87/5.11 y = y0 vv7; 12.87/5.11 y0 (vz,y) = y; 12.87/5.11 ys = ys0 vv8; 12.87/5.11 ys0 (wu,ys) = ys; 12.87/5.11 }; 12.87/5.11 12.87/5.11 } 12.87/5.11 module Main where { 12.87/5.11 import qualified List; 12.87/5.11 import qualified Maybe; 12.87/5.11 import qualified Prelude; 12.87/5.11 } 12.87/5.11 12.87/5.11 ---------------------------------------- 12.87/5.11 12.87/5.11 (7) LetRed (EQUIVALENT) 12.87/5.11 Let/Where Reductions: 12.87/5.11 The bindings of the following Let/Where expression 12.87/5.11 "(s'',y : ys) where { 12.87/5.11 s' = s'0 vv8; 12.87/5.11 ; 12.87/5.11 s'' = s''0 vv7; 12.87/5.11 ; 12.87/5.11 s''0 (s'',wv) = s''; 12.87/5.11 ; 12.87/5.11 s'0 (s',ww) = s'; 12.87/5.11 ; 12.87/5.11 vv7 = f s' x; 12.87/5.11 ; 12.87/5.11 vv8 = mapAccumR f s xs; 12.87/5.11 ; 12.87/5.11 y = y0 vv7; 12.87/5.11 ; 12.87/5.11 y0 (vz,y) = y; 12.87/5.11 ; 12.87/5.11 ys = ys0 vv8; 12.87/5.11 ; 12.87/5.11 ys0 (wu,ys) = ys; 12.87/5.11 } 12.87/5.11 " 12.87/5.11 are unpacked to the following functions on top level 12.87/5.11 "mapAccumRVv8 wx wy wz xu = mapAccumR wx wy wz; 12.87/5.11 " 12.87/5.11 "mapAccumRS''0 wx wy wz xu (s'',wv) = s''; 12.87/5.11 " 12.87/5.11 "mapAccumRY wx wy wz xu = mapAccumRY0 wx wy wz xu (mapAccumRVv7 wx wy wz xu); 12.87/5.11 " 12.87/5.11 "mapAccumRYs0 wx wy wz xu (wu,ys) = ys; 12.87/5.11 " 12.87/5.11 "mapAccumRS' wx wy wz xu = mapAccumRS'0 wx wy wz xu (mapAccumRVv8 wx wy wz xu); 12.87/5.11 " 12.87/5.11 "mapAccumRYs wx wy wz xu = mapAccumRYs0 wx wy wz xu (mapAccumRVv8 wx wy wz xu); 12.87/5.11 " 12.87/5.11 "mapAccumRS'0 wx wy wz xu (s',ww) = s'; 12.87/5.11 " 12.87/5.11 "mapAccumRS'' wx wy wz xu = mapAccumRS''0 wx wy wz xu (mapAccumRVv7 wx wy wz xu); 12.87/5.11 " 12.87/5.11 "mapAccumRVv7 wx wy wz xu = wx (mapAccumRS' wx wy wz xu) xu; 12.87/5.11 " 12.87/5.11 "mapAccumRY0 wx wy wz xu (vz,y) = y; 12.87/5.11 " 12.87/5.11 12.87/5.11 ---------------------------------------- 12.87/5.11 12.87/5.11 (8) 12.87/5.11 Obligation: 12.87/5.11 mainModule Main 12.87/5.11 module Maybe where { 12.87/5.11 import qualified List; 12.87/5.11 import qualified Main; 12.87/5.11 import qualified Prelude; 12.87/5.11 } 12.87/5.11 module List where { 12.87/5.11 import qualified Main; 12.87/5.11 import qualified Maybe; 12.87/5.11 import qualified Prelude; 12.87/5.11 mapAccumR :: (c -> a -> (c,b)) -> c -> [a] -> (c,[b]); 12.87/5.11 mapAccumR vy s [] = (s,[]); 12.87/5.11 mapAccumR f s (x : xs) = (mapAccumRS'' f s xs x,mapAccumRY f s xs x : mapAccumRYs f s xs x); 12.87/5.11 12.87/5.11 mapAccumRS' wx wy wz xu = mapAccumRS'0 wx wy wz xu (mapAccumRVv8 wx wy wz xu); 12.87/5.11 12.87/5.11 mapAccumRS'' wx wy wz xu = mapAccumRS''0 wx wy wz xu (mapAccumRVv7 wx wy wz xu); 12.87/5.11 12.87/5.11 mapAccumRS''0 wx wy wz xu (s'',wv) = s''; 12.87/5.11 12.87/5.11 mapAccumRS'0 wx wy wz xu (s',ww) = s'; 12.87/5.11 12.87/5.11 mapAccumRVv7 wx wy wz xu = wx (mapAccumRS' wx wy wz xu) xu; 12.87/5.11 12.87/5.11 mapAccumRVv8 wx wy wz xu = mapAccumR wx wy wz; 12.87/5.11 12.87/5.11 mapAccumRY wx wy wz xu = mapAccumRY0 wx wy wz xu (mapAccumRVv7 wx wy wz xu); 12.87/5.11 12.87/5.11 mapAccumRY0 wx wy wz xu (vz,y) = y; 12.87/5.11 12.87/5.11 mapAccumRYs wx wy wz xu = mapAccumRYs0 wx wy wz xu (mapAccumRVv8 wx wy wz xu); 12.87/5.11 12.87/5.11 mapAccumRYs0 wx wy wz xu (wu,ys) = ys; 12.87/5.11 12.87/5.11 } 12.87/5.11 module Main where { 12.87/5.11 import qualified List; 12.87/5.11 import qualified Maybe; 12.87/5.11 import qualified Prelude; 12.87/5.11 } 12.87/5.11 12.87/5.11 ---------------------------------------- 12.87/5.11 12.87/5.11 (9) Narrow (SOUND) 12.87/5.11 Haskell To QDPs 12.87/5.11 12.87/5.11 digraph dp_graph { 12.87/5.11 node [outthreshold=100, inthreshold=100];1[label="List.mapAccumR",fontsize=16,color="grey",shape="box"];1 -> 3[label="",style="dashed", color="grey", weight=3]; 12.87/5.11 3[label="List.mapAccumR xv3",fontsize=16,color="grey",shape="box"];3 -> 4[label="",style="dashed", color="grey", weight=3]; 12.87/5.11 4[label="List.mapAccumR xv3 xv4",fontsize=16,color="grey",shape="box"];4 -> 5[label="",style="dashed", color="grey", weight=3]; 12.87/5.11 5[label="List.mapAccumR xv3 xv4 xv5",fontsize=16,color="burlywood",shape="triangle"];44[label="xv5/xv50 : xv51",fontsize=10,color="white",style="solid",shape="box"];5 -> 44[label="",style="solid", color="burlywood", weight=9]; 12.87/5.11 44 -> 6[label="",style="solid", color="burlywood", weight=3]; 12.87/5.11 45[label="xv5/[]",fontsize=10,color="white",style="solid",shape="box"];5 -> 45[label="",style="solid", color="burlywood", weight=9]; 12.87/5.11 45 -> 7[label="",style="solid", color="burlywood", weight=3]; 12.87/5.11 6[label="List.mapAccumR xv3 xv4 (xv50 : xv51)",fontsize=16,color="black",shape="box"];6 -> 8[label="",style="solid", color="black", weight=3]; 12.87/5.11 7[label="List.mapAccumR xv3 xv4 []",fontsize=16,color="black",shape="box"];7 -> 9[label="",style="solid", color="black", weight=3]; 12.87/5.11 8[label="(List.mapAccumRS'' xv3 xv4 xv51 xv50,List.mapAccumRY xv3 xv4 xv51 xv50 : List.mapAccumRYs xv3 xv4 xv51 xv50)",fontsize=16,color="green",shape="box"];8 -> 10[label="",style="dashed", color="green", weight=3]; 12.87/5.11 8 -> 11[label="",style="dashed", color="green", weight=3]; 12.87/5.11 8 -> 12[label="",style="dashed", color="green", weight=3]; 12.87/5.11 9[label="(xv4,[])",fontsize=16,color="green",shape="box"];10[label="List.mapAccumRS'' xv3 xv4 xv51 xv50",fontsize=16,color="black",shape="box"];10 -> 13[label="",style="solid", color="black", weight=3]; 12.87/5.11 11[label="List.mapAccumRY xv3 xv4 xv51 xv50",fontsize=16,color="black",shape="box"];11 -> 14[label="",style="solid", color="black", weight=3]; 12.87/5.11 12[label="List.mapAccumRYs xv3 xv4 xv51 xv50",fontsize=16,color="black",shape="box"];12 -> 15[label="",style="solid", color="black", weight=3]; 12.87/5.11 13 -> 19[label="",style="dashed", color="red", weight=0]; 12.87/5.11 13[label="List.mapAccumRS''0 xv3 xv4 xv51 xv50 (List.mapAccumRVv7 xv3 xv4 xv51 xv50)",fontsize=16,color="magenta"];13 -> 20[label="",style="dashed", color="magenta", weight=3]; 12.87/5.11 14 -> 24[label="",style="dashed", color="red", weight=0]; 12.87/5.11 14[label="List.mapAccumRY0 xv3 xv4 xv51 xv50 (List.mapAccumRVv7 xv3 xv4 xv51 xv50)",fontsize=16,color="magenta"];14 -> 25[label="",style="dashed", color="magenta", weight=3]; 12.87/5.11 15 -> 28[label="",style="dashed", color="red", weight=0]; 12.87/5.11 15[label="List.mapAccumRYs0 xv3 xv4 xv51 xv50 (List.mapAccumRVv8 xv3 xv4 xv51 xv50)",fontsize=16,color="magenta"];15 -> 29[label="",style="dashed", color="magenta", weight=3]; 12.87/5.11 20[label="List.mapAccumRVv7 xv3 xv4 xv51 xv50",fontsize=16,color="black",shape="triangle"];20 -> 22[label="",style="solid", color="black", weight=3]; 12.87/5.11 19[label="List.mapAccumRS''0 xv3 xv4 xv51 xv50 xv6",fontsize=16,color="burlywood",shape="triangle"];46[label="xv6/(xv60,xv61)",fontsize=10,color="white",style="solid",shape="box"];19 -> 46[label="",style="solid", color="burlywood", weight=9]; 12.87/5.11 46 -> 23[label="",style="solid", color="burlywood", weight=3]; 12.87/5.11 25 -> 20[label="",style="dashed", color="red", weight=0]; 12.87/5.11 25[label="List.mapAccumRVv7 xv3 xv4 xv51 xv50",fontsize=16,color="magenta"];24[label="List.mapAccumRY0 xv3 xv4 xv51 xv50 xv7",fontsize=16,color="burlywood",shape="triangle"];47[label="xv7/(xv70,xv71)",fontsize=10,color="white",style="solid",shape="box"];24 -> 47[label="",style="solid", color="burlywood", weight=9]; 12.87/5.11 47 -> 27[label="",style="solid", color="burlywood", weight=3]; 12.87/5.11 29[label="List.mapAccumRVv8 xv3 xv4 xv51 xv50",fontsize=16,color="black",shape="triangle"];29 -> 31[label="",style="solid", color="black", weight=3]; 12.87/5.11 28[label="List.mapAccumRYs0 xv3 xv4 xv51 xv50 xv8",fontsize=16,color="burlywood",shape="triangle"];48[label="xv8/(xv80,xv81)",fontsize=10,color="white",style="solid",shape="box"];28 -> 48[label="",style="solid", color="burlywood", weight=9]; 12.87/5.11 48 -> 32[label="",style="solid", color="burlywood", weight=3]; 12.87/5.11 22[label="xv3 (List.mapAccumRS' xv3 xv4 xv51 xv50) xv50",fontsize=16,color="green",shape="box"];22 -> 33[label="",style="dashed", color="green", weight=3]; 12.87/5.11 22 -> 34[label="",style="dashed", color="green", weight=3]; 12.87/5.11 23[label="List.mapAccumRS''0 xv3 xv4 xv51 xv50 (xv60,xv61)",fontsize=16,color="black",shape="box"];23 -> 35[label="",style="solid", color="black", weight=3]; 12.87/5.11 27[label="List.mapAccumRY0 xv3 xv4 xv51 xv50 (xv70,xv71)",fontsize=16,color="black",shape="box"];27 -> 36[label="",style="solid", color="black", weight=3]; 12.87/5.11 31 -> 5[label="",style="dashed", color="red", weight=0]; 12.87/5.11 31[label="List.mapAccumR xv3 xv4 xv51",fontsize=16,color="magenta"];31 -> 37[label="",style="dashed", color="magenta", weight=3]; 12.87/5.11 32[label="List.mapAccumRYs0 xv3 xv4 xv51 xv50 (xv80,xv81)",fontsize=16,color="black",shape="box"];32 -> 38[label="",style="solid", color="black", weight=3]; 12.87/5.11 33[label="List.mapAccumRS' xv3 xv4 xv51 xv50",fontsize=16,color="black",shape="box"];33 -> 39[label="",style="solid", color="black", weight=3]; 12.87/5.11 34[label="xv50",fontsize=16,color="green",shape="box"];35[label="xv60",fontsize=16,color="green",shape="box"];36[label="xv71",fontsize=16,color="green",shape="box"];37[label="xv51",fontsize=16,color="green",shape="box"];38[label="xv81",fontsize=16,color="green",shape="box"];39 -> 40[label="",style="dashed", color="red", weight=0]; 12.87/5.11 39[label="List.mapAccumRS'0 xv3 xv4 xv51 xv50 (List.mapAccumRVv8 xv3 xv4 xv51 xv50)",fontsize=16,color="magenta"];39 -> 41[label="",style="dashed", color="magenta", weight=3]; 12.87/5.11 41 -> 29[label="",style="dashed", color="red", weight=0]; 12.87/5.11 41[label="List.mapAccumRVv8 xv3 xv4 xv51 xv50",fontsize=16,color="magenta"];40[label="List.mapAccumRS'0 xv3 xv4 xv51 xv50 xv9",fontsize=16,color="burlywood",shape="triangle"];49[label="xv9/(xv90,xv91)",fontsize=10,color="white",style="solid",shape="box"];40 -> 49[label="",style="solid", color="burlywood", weight=9]; 12.87/5.11 49 -> 42[label="",style="solid", color="burlywood", weight=3]; 12.87/5.11 42[label="List.mapAccumRS'0 xv3 xv4 xv51 xv50 (xv90,xv91)",fontsize=16,color="black",shape="box"];42 -> 43[label="",style="solid", color="black", weight=3]; 12.87/5.11 43[label="xv90",fontsize=16,color="green",shape="box"];} 12.87/5.11 12.87/5.11 ---------------------------------------- 12.87/5.11 12.87/5.11 (10) 12.87/5.11 Obligation: 12.87/5.11 Q DP problem: 12.87/5.11 The TRS P consists of the following rules: 12.87/5.11 12.87/5.11 new_mapAccumRVv8(xv3, xv4, xv51, xv50, ba, bb, bc) -> new_mapAccumR(xv3, xv4, xv51, ba, bb, bc) 12.87/5.11 new_mapAccumR(xv3, xv4, :(xv50, xv51), ba, bb, bc) -> new_mapAccumRVv8(xv3, xv4, xv51, xv50, ba, bb, bc) 12.87/5.11 new_mapAccumR(xv3, xv4, :(xv50, xv51), ba, bb, bc) -> new_mapAccumRVv7(xv3, xv4, xv51, xv50, ba, bb, bc) 12.87/5.11 new_mapAccumRVv7(xv3, xv4, xv51, xv50, ba, bb, bc) -> new_mapAccumRVv8(xv3, xv4, xv51, xv50, ba, bb, bc) 12.87/5.11 new_mapAccumR(xv3, xv4, :(xv50, xv51), ba, bb, bc) -> new_mapAccumR(xv3, xv4, xv51, ba, bb, bc) 12.87/5.11 12.87/5.11 R is empty. 12.87/5.11 Q is empty. 12.87/5.11 We have to consider all minimal (P,Q,R)-chains. 12.87/5.11 ---------------------------------------- 12.87/5.11 12.87/5.11 (11) QDPSizeChangeProof (EQUIVALENT) 12.87/5.11 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.87/5.11 12.87/5.11 From the DPs we obtained the following set of size-change graphs: 12.87/5.11 *new_mapAccumR(xv3, xv4, :(xv50, xv51), ba, bb, bc) -> new_mapAccumRVv8(xv3, xv4, xv51, xv50, ba, bb, bc) 12.87/5.11 The graph contains the following edges 1 >= 1, 2 >= 2, 3 > 3, 3 > 4, 4 >= 5, 5 >= 6, 6 >= 7 12.87/5.11 12.87/5.11 12.87/5.11 *new_mapAccumRVv7(xv3, xv4, xv51, xv50, ba, bb, bc) -> new_mapAccumRVv8(xv3, xv4, xv51, xv50, ba, bb, bc) 12.87/5.11 The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 7 >= 7 12.87/5.11 12.87/5.11 12.87/5.11 *new_mapAccumRVv8(xv3, xv4, xv51, xv50, ba, bb, bc) -> new_mapAccumR(xv3, xv4, xv51, ba, bb, bc) 12.87/5.11 The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 5 >= 4, 6 >= 5, 7 >= 6 12.87/5.11 12.87/5.11 12.87/5.11 *new_mapAccumR(xv3, xv4, :(xv50, xv51), ba, bb, bc) -> new_mapAccumR(xv3, xv4, xv51, ba, bb, bc) 12.87/5.11 The graph contains the following edges 1 >= 1, 2 >= 2, 3 > 3, 4 >= 4, 5 >= 5, 6 >= 6 12.87/5.11 12.87/5.11 12.87/5.11 *new_mapAccumR(xv3, xv4, :(xv50, xv51), ba, bb, bc) -> new_mapAccumRVv7(xv3, xv4, xv51, xv50, ba, bb, bc) 12.87/5.11 The graph contains the following edges 1 >= 1, 2 >= 2, 3 > 3, 3 > 4, 4 >= 5, 5 >= 6, 6 >= 7 12.87/5.11 12.87/5.11 12.87/5.11 ---------------------------------------- 12.87/5.11 12.87/5.11 (12) 12.87/5.11 YES 13.20/5.16 EOF