8.33/3.69 YES 10.21/4.19 proof of /export/starexec/sandbox2/benchmark/theBenchmark.hs 10.21/4.19 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 10.21/4.19 10.21/4.19 10.21/4.19 H-Termination with start terms of the given HASKELL could be proven: 10.21/4.19 10.21/4.19 (0) HASKELL 10.21/4.19 (1) BR [EQUIVALENT, 0 ms] 10.21/4.19 (2) HASKELL 10.21/4.19 (3) COR [EQUIVALENT, 0 ms] 10.21/4.19 (4) HASKELL 10.21/4.19 (5) Narrow [SOUND, 0 ms] 10.21/4.19 (6) QDP 10.21/4.19 (7) DependencyGraphProof [EQUIVALENT, 0 ms] 10.21/4.19 (8) AND 10.21/4.19 (9) QDP 10.21/4.19 (10) QDPSizeChangeProof [EQUIVALENT, 0 ms] 10.21/4.19 (11) YES 10.21/4.19 (12) QDP 10.21/4.19 (13) QDPSizeChangeProof [EQUIVALENT, 0 ms] 10.21/4.19 (14) YES 10.21/4.19 (15) QDP 10.21/4.19 (16) QDPSizeChangeProof [EQUIVALENT, 0 ms] 10.21/4.19 (17) YES 10.21/4.19 10.21/4.19 10.21/4.19 ---------------------------------------- 10.21/4.19 10.21/4.19 (0) 10.21/4.19 Obligation: 10.21/4.19 mainModule Main 10.21/4.19 module Main where { 10.21/4.19 import qualified Prelude; 10.21/4.19 } 10.21/4.19 10.21/4.19 ---------------------------------------- 10.21/4.19 10.21/4.19 (1) BR (EQUIVALENT) 10.21/4.19 Replaced joker patterns by fresh variables and removed binding patterns. 10.21/4.19 ---------------------------------------- 10.21/4.19 10.21/4.19 (2) 10.21/4.19 Obligation: 10.21/4.19 mainModule Main 10.21/4.19 module Main where { 10.21/4.19 import qualified Prelude; 10.21/4.19 } 10.21/4.19 10.21/4.19 ---------------------------------------- 10.21/4.19 10.21/4.19 (3) COR (EQUIVALENT) 10.21/4.19 Cond Reductions: 10.21/4.19 The following Function with conditions 10.21/4.19 "lookup k [] = Nothing; 10.21/4.19 lookup k ((x,y) : xys)|k == xJust y|otherwiselookup k xys; 10.21/4.19 " 10.21/4.19 is transformed to 10.21/4.19 "lookup k [] = lookup3 k []; 10.21/4.19 lookup k ((x,y) : xys) = lookup2 k ((x,y) : xys); 10.21/4.19 " 10.21/4.19 "lookup1 k x y xys True = Just y; 10.21/4.19 lookup1 k x y xys False = lookup0 k x y xys otherwise; 10.21/4.19 " 10.21/4.19 "lookup0 k x y xys True = lookup k xys; 10.21/4.19 " 10.21/4.19 "lookup2 k ((x,y) : xys) = lookup1 k x y xys (k == x); 10.21/4.19 " 10.21/4.19 "lookup3 k [] = Nothing; 10.21/4.19 lookup3 wu wv = lookup2 wu wv; 10.21/4.19 " 10.21/4.19 The following Function with conditions 10.21/4.19 "undefined |Falseundefined; 10.21/4.19 " 10.21/4.19 is transformed to 10.21/4.19 "undefined = undefined1; 10.21/4.19 " 10.21/4.19 "undefined0 True = undefined; 10.21/4.19 " 10.21/4.19 "undefined1 = undefined0 False; 10.21/4.19 " 10.21/4.19 10.21/4.19 ---------------------------------------- 10.21/4.19 10.21/4.19 (4) 10.21/4.19 Obligation: 10.21/4.19 mainModule Main 10.21/4.19 module Main where { 10.21/4.19 import qualified Prelude; 10.21/4.19 } 10.21/4.19 10.21/4.19 ---------------------------------------- 10.21/4.19 10.21/4.19 (5) Narrow (SOUND) 10.21/4.19 Haskell To QDPs 10.21/4.19 10.21/4.19 digraph dp_graph { 10.21/4.19 node [outthreshold=100, inthreshold=100];1[label="lookup",fontsize=16,color="grey",shape="box"];1 -> 3[label="",style="dashed", color="grey", weight=3]; 10.21/4.19 3[label="lookup ww3",fontsize=16,color="grey",shape="box"];3 -> 4[label="",style="dashed", color="grey", weight=3]; 10.21/4.19 4[label="lookup ww3 ww4",fontsize=16,color="burlywood",shape="triangle"];66[label="ww4/ww40 : ww41",fontsize=10,color="white",style="solid",shape="box"];4 -> 66[label="",style="solid", color="burlywood", weight=9]; 10.21/4.19 66 -> 5[label="",style="solid", color="burlywood", weight=3]; 10.21/4.19 67[label="ww4/[]",fontsize=10,color="white",style="solid",shape="box"];4 -> 67[label="",style="solid", color="burlywood", weight=9]; 10.21/4.19 67 -> 6[label="",style="solid", color="burlywood", weight=3]; 10.21/4.19 5[label="lookup ww3 (ww40 : ww41)",fontsize=16,color="burlywood",shape="box"];68[label="ww40/(ww400,ww401)",fontsize=10,color="white",style="solid",shape="box"];5 -> 68[label="",style="solid", color="burlywood", weight=9]; 10.21/4.19 68 -> 7[label="",style="solid", color="burlywood", weight=3]; 10.21/4.19 6[label="lookup ww3 []",fontsize=16,color="black",shape="box"];6 -> 8[label="",style="solid", color="black", weight=3]; 10.21/4.19 7[label="lookup ww3 ((ww400,ww401) : ww41)",fontsize=16,color="black",shape="box"];7 -> 9[label="",style="solid", color="black", weight=3]; 10.21/4.19 8[label="lookup3 ww3 []",fontsize=16,color="black",shape="box"];8 -> 10[label="",style="solid", color="black", weight=3]; 10.21/4.19 9[label="lookup2 ww3 ((ww400,ww401) : ww41)",fontsize=16,color="black",shape="box"];9 -> 11[label="",style="solid", color="black", weight=3]; 10.21/4.19 10[label="Nothing",fontsize=16,color="green",shape="box"];11[label="lookup1 ww3 ww400 ww401 ww41 (ww3 == ww400)",fontsize=16,color="burlywood",shape="box"];69[label="ww3/LT",fontsize=10,color="white",style="solid",shape="box"];11 -> 69[label="",style="solid", color="burlywood", weight=9]; 10.21/4.19 69 -> 12[label="",style="solid", color="burlywood", weight=3]; 10.21/4.19 70[label="ww3/EQ",fontsize=10,color="white",style="solid",shape="box"];11 -> 70[label="",style="solid", color="burlywood", weight=9]; 10.21/4.19 70 -> 13[label="",style="solid", color="burlywood", weight=3]; 10.21/4.19 71[label="ww3/GT",fontsize=10,color="white",style="solid",shape="box"];11 -> 71[label="",style="solid", color="burlywood", weight=9]; 10.21/4.19 71 -> 14[label="",style="solid", color="burlywood", weight=3]; 10.21/4.19 12[label="lookup1 LT ww400 ww401 ww41 (LT == ww400)",fontsize=16,color="burlywood",shape="box"];72[label="ww400/LT",fontsize=10,color="white",style="solid",shape="box"];12 -> 72[label="",style="solid", color="burlywood", weight=9]; 10.21/4.19 72 -> 15[label="",style="solid", color="burlywood", weight=3]; 10.21/4.19 73[label="ww400/EQ",fontsize=10,color="white",style="solid",shape="box"];12 -> 73[label="",style="solid", color="burlywood", weight=9]; 10.21/4.19 73 -> 16[label="",style="solid", color="burlywood", weight=3]; 10.21/4.19 74[label="ww400/GT",fontsize=10,color="white",style="solid",shape="box"];12 -> 74[label="",style="solid", color="burlywood", weight=9]; 10.21/4.19 74 -> 17[label="",style="solid", color="burlywood", weight=3]; 10.21/4.19 13[label="lookup1 EQ ww400 ww401 ww41 (EQ == ww400)",fontsize=16,color="burlywood",shape="box"];75[label="ww400/LT",fontsize=10,color="white",style="solid",shape="box"];13 -> 75[label="",style="solid", color="burlywood", weight=9]; 10.21/4.19 75 -> 18[label="",style="solid", color="burlywood", weight=3]; 10.21/4.19 76[label="ww400/EQ",fontsize=10,color="white",style="solid",shape="box"];13 -> 76[label="",style="solid", color="burlywood", weight=9]; 10.21/4.19 76 -> 19[label="",style="solid", color="burlywood", weight=3]; 10.21/4.19 77[label="ww400/GT",fontsize=10,color="white",style="solid",shape="box"];13 -> 77[label="",style="solid", color="burlywood", weight=9]; 10.21/4.19 77 -> 20[label="",style="solid", color="burlywood", weight=3]; 10.21/4.19 14[label="lookup1 GT ww400 ww401 ww41 (GT == ww400)",fontsize=16,color="burlywood",shape="box"];78[label="ww400/LT",fontsize=10,color="white",style="solid",shape="box"];14 -> 78[label="",style="solid", color="burlywood", weight=9]; 10.21/4.19 78 -> 21[label="",style="solid", color="burlywood", weight=3]; 10.21/4.19 79[label="ww400/EQ",fontsize=10,color="white",style="solid",shape="box"];14 -> 79[label="",style="solid", color="burlywood", weight=9]; 10.21/4.19 79 -> 22[label="",style="solid", color="burlywood", weight=3]; 10.21/4.19 80[label="ww400/GT",fontsize=10,color="white",style="solid",shape="box"];14 -> 80[label="",style="solid", color="burlywood", weight=9]; 10.21/4.19 80 -> 23[label="",style="solid", color="burlywood", weight=3]; 10.21/4.19 15[label="lookup1 LT LT ww401 ww41 (LT == LT)",fontsize=16,color="black",shape="box"];15 -> 24[label="",style="solid", color="black", weight=3]; 10.21/4.19 16[label="lookup1 LT EQ ww401 ww41 (LT == EQ)",fontsize=16,color="black",shape="box"];16 -> 25[label="",style="solid", color="black", weight=3]; 10.21/4.19 17[label="lookup1 LT GT ww401 ww41 (LT == GT)",fontsize=16,color="black",shape="box"];17 -> 26[label="",style="solid", color="black", weight=3]; 10.21/4.19 18[label="lookup1 EQ LT ww401 ww41 (EQ == LT)",fontsize=16,color="black",shape="box"];18 -> 27[label="",style="solid", color="black", weight=3]; 10.21/4.19 19[label="lookup1 EQ EQ ww401 ww41 (EQ == EQ)",fontsize=16,color="black",shape="box"];19 -> 28[label="",style="solid", color="black", weight=3]; 10.21/4.19 20[label="lookup1 EQ GT ww401 ww41 (EQ == GT)",fontsize=16,color="black",shape="box"];20 -> 29[label="",style="solid", color="black", weight=3]; 10.21/4.19 21[label="lookup1 GT LT ww401 ww41 (GT == LT)",fontsize=16,color="black",shape="box"];21 -> 30[label="",style="solid", color="black", weight=3]; 10.21/4.19 22[label="lookup1 GT EQ ww401 ww41 (GT == EQ)",fontsize=16,color="black",shape="box"];22 -> 31[label="",style="solid", color="black", weight=3]; 10.21/4.19 23[label="lookup1 GT GT ww401 ww41 (GT == GT)",fontsize=16,color="black",shape="box"];23 -> 32[label="",style="solid", color="black", weight=3]; 10.21/4.19 24[label="lookup1 LT LT ww401 ww41 True",fontsize=16,color="black",shape="box"];24 -> 33[label="",style="solid", color="black", weight=3]; 10.21/4.19 25[label="lookup1 LT EQ ww401 ww41 False",fontsize=16,color="black",shape="box"];25 -> 34[label="",style="solid", color="black", weight=3]; 10.21/4.19 26[label="lookup1 LT GT ww401 ww41 False",fontsize=16,color="black",shape="box"];26 -> 35[label="",style="solid", color="black", weight=3]; 10.21/4.19 27[label="lookup1 EQ LT ww401 ww41 False",fontsize=16,color="black",shape="box"];27 -> 36[label="",style="solid", color="black", weight=3]; 10.21/4.19 28[label="lookup1 EQ EQ ww401 ww41 True",fontsize=16,color="black",shape="box"];28 -> 37[label="",style="solid", color="black", weight=3]; 10.21/4.19 29[label="lookup1 EQ GT ww401 ww41 False",fontsize=16,color="black",shape="box"];29 -> 38[label="",style="solid", color="black", weight=3]; 10.21/4.19 30[label="lookup1 GT LT ww401 ww41 False",fontsize=16,color="black",shape="box"];30 -> 39[label="",style="solid", color="black", weight=3]; 10.21/4.19 31[label="lookup1 GT EQ ww401 ww41 False",fontsize=16,color="black",shape="box"];31 -> 40[label="",style="solid", color="black", weight=3]; 10.21/4.19 32[label="lookup1 GT GT ww401 ww41 True",fontsize=16,color="black",shape="box"];32 -> 41[label="",style="solid", color="black", weight=3]; 10.21/4.19 33[label="Just ww401",fontsize=16,color="green",shape="box"];34[label="lookup0 LT EQ ww401 ww41 otherwise",fontsize=16,color="black",shape="box"];34 -> 42[label="",style="solid", color="black", weight=3]; 10.21/4.19 35[label="lookup0 LT GT ww401 ww41 otherwise",fontsize=16,color="black",shape="box"];35 -> 43[label="",style="solid", color="black", weight=3]; 10.21/4.19 36[label="lookup0 EQ LT ww401 ww41 otherwise",fontsize=16,color="black",shape="box"];36 -> 44[label="",style="solid", color="black", weight=3]; 10.21/4.19 37[label="Just ww401",fontsize=16,color="green",shape="box"];38[label="lookup0 EQ GT ww401 ww41 otherwise",fontsize=16,color="black",shape="box"];38 -> 45[label="",style="solid", color="black", weight=3]; 10.21/4.19 39[label="lookup0 GT LT ww401 ww41 otherwise",fontsize=16,color="black",shape="box"];39 -> 46[label="",style="solid", color="black", weight=3]; 10.21/4.19 40[label="lookup0 GT EQ ww401 ww41 otherwise",fontsize=16,color="black",shape="box"];40 -> 47[label="",style="solid", color="black", weight=3]; 10.21/4.19 41[label="Just ww401",fontsize=16,color="green",shape="box"];42[label="lookup0 LT EQ ww401 ww41 True",fontsize=16,color="black",shape="box"];42 -> 48[label="",style="solid", color="black", weight=3]; 10.21/4.19 43[label="lookup0 LT GT ww401 ww41 True",fontsize=16,color="black",shape="box"];43 -> 49[label="",style="solid", color="black", weight=3]; 10.21/4.19 44[label="lookup0 EQ LT ww401 ww41 True",fontsize=16,color="black",shape="box"];44 -> 50[label="",style="solid", color="black", weight=3]; 10.21/4.19 45[label="lookup0 EQ GT ww401 ww41 True",fontsize=16,color="black",shape="box"];45 -> 51[label="",style="solid", color="black", weight=3]; 10.21/4.19 46[label="lookup0 GT LT ww401 ww41 True",fontsize=16,color="black",shape="box"];46 -> 52[label="",style="solid", color="black", weight=3]; 10.21/4.19 47[label="lookup0 GT EQ ww401 ww41 True",fontsize=16,color="black",shape="box"];47 -> 53[label="",style="solid", color="black", weight=3]; 10.21/4.19 48 -> 4[label="",style="dashed", color="red", weight=0]; 10.21/4.19 48[label="lookup LT ww41",fontsize=16,color="magenta"];48 -> 54[label="",style="dashed", color="magenta", weight=3]; 10.21/4.19 48 -> 55[label="",style="dashed", color="magenta", weight=3]; 10.21/4.19 49 -> 4[label="",style="dashed", color="red", weight=0]; 10.21/4.19 49[label="lookup LT ww41",fontsize=16,color="magenta"];49 -> 56[label="",style="dashed", color="magenta", weight=3]; 10.21/4.19 49 -> 57[label="",style="dashed", color="magenta", weight=3]; 10.21/4.19 50 -> 4[label="",style="dashed", color="red", weight=0]; 10.21/4.19 50[label="lookup EQ ww41",fontsize=16,color="magenta"];50 -> 58[label="",style="dashed", color="magenta", weight=3]; 10.21/4.19 50 -> 59[label="",style="dashed", color="magenta", weight=3]; 10.21/4.19 51 -> 4[label="",style="dashed", color="red", weight=0]; 10.21/4.19 51[label="lookup EQ ww41",fontsize=16,color="magenta"];51 -> 60[label="",style="dashed", color="magenta", weight=3]; 10.21/4.19 51 -> 61[label="",style="dashed", color="magenta", weight=3]; 10.21/4.19 52 -> 4[label="",style="dashed", color="red", weight=0]; 10.21/4.19 52[label="lookup GT ww41",fontsize=16,color="magenta"];52 -> 62[label="",style="dashed", color="magenta", weight=3]; 10.21/4.19 52 -> 63[label="",style="dashed", color="magenta", weight=3]; 10.21/4.19 53 -> 4[label="",style="dashed", color="red", weight=0]; 10.21/4.19 53[label="lookup GT ww41",fontsize=16,color="magenta"];53 -> 64[label="",style="dashed", color="magenta", weight=3]; 10.21/4.19 53 -> 65[label="",style="dashed", color="magenta", weight=3]; 10.21/4.19 54[label="ww41",fontsize=16,color="green",shape="box"];55[label="LT",fontsize=16,color="green",shape="box"];56[label="ww41",fontsize=16,color="green",shape="box"];57[label="LT",fontsize=16,color="green",shape="box"];58[label="ww41",fontsize=16,color="green",shape="box"];59[label="EQ",fontsize=16,color="green",shape="box"];60[label="ww41",fontsize=16,color="green",shape="box"];61[label="EQ",fontsize=16,color="green",shape="box"];62[label="ww41",fontsize=16,color="green",shape="box"];63[label="GT",fontsize=16,color="green",shape="box"];64[label="ww41",fontsize=16,color="green",shape="box"];65[label="GT",fontsize=16,color="green",shape="box"];} 10.21/4.19 10.21/4.19 ---------------------------------------- 10.21/4.19 10.21/4.19 (6) 10.21/4.19 Obligation: 10.21/4.19 Q DP problem: 10.21/4.19 The TRS P consists of the following rules: 10.21/4.19 10.21/4.19 new_lookup(LT, :(@2(GT, ww401), ww41), h) -> new_lookup(LT, ww41, h) 10.21/4.19 new_lookup(LT, :(@2(EQ, ww401), ww41), h) -> new_lookup(LT, ww41, h) 10.21/4.19 new_lookup(EQ, :(@2(LT, ww401), ww41), h) -> new_lookup(EQ, ww41, h) 10.21/4.19 new_lookup(GT, :(@2(LT, ww401), ww41), h) -> new_lookup(GT, ww41, h) 10.21/4.19 new_lookup(GT, :(@2(EQ, ww401), ww41), h) -> new_lookup(GT, ww41, h) 10.21/4.19 new_lookup(EQ, :(@2(GT, ww401), ww41), h) -> new_lookup(EQ, ww41, h) 10.21/4.19 10.21/4.19 R is empty. 10.21/4.19 Q is empty. 10.21/4.19 We have to consider all minimal (P,Q,R)-chains. 10.21/4.19 ---------------------------------------- 10.21/4.19 10.21/4.19 (7) DependencyGraphProof (EQUIVALENT) 10.21/4.19 The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 3 SCCs. 10.21/4.19 ---------------------------------------- 10.21/4.19 10.21/4.19 (8) 10.21/4.19 Complex Obligation (AND) 10.21/4.19 10.21/4.19 ---------------------------------------- 10.21/4.19 10.21/4.19 (9) 10.21/4.19 Obligation: 10.21/4.19 Q DP problem: 10.21/4.19 The TRS P consists of the following rules: 10.21/4.19 10.21/4.19 new_lookup(GT, :(@2(EQ, ww401), ww41), h) -> new_lookup(GT, ww41, h) 10.21/4.19 new_lookup(GT, :(@2(LT, ww401), ww41), h) -> new_lookup(GT, ww41, h) 10.21/4.19 10.21/4.19 R is empty. 10.21/4.19 Q is empty. 10.21/4.19 We have to consider all minimal (P,Q,R)-chains. 10.21/4.19 ---------------------------------------- 10.21/4.19 10.21/4.19 (10) QDPSizeChangeProof (EQUIVALENT) 10.21/4.19 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. 10.21/4.19 10.21/4.19 From the DPs we obtained the following set of size-change graphs: 10.21/4.19 *new_lookup(GT, :(@2(EQ, ww401), ww41), h) -> new_lookup(GT, ww41, h) 10.21/4.19 The graph contains the following edges 1 >= 1, 2 > 2, 3 >= 3 10.21/4.19 10.21/4.19 10.21/4.19 *new_lookup(GT, :(@2(LT, ww401), ww41), h) -> new_lookup(GT, ww41, h) 10.21/4.19 The graph contains the following edges 1 >= 1, 2 > 2, 3 >= 3 10.21/4.19 10.21/4.19 10.21/4.19 ---------------------------------------- 10.21/4.19 10.21/4.19 (11) 10.21/4.19 YES 10.21/4.19 10.21/4.19 ---------------------------------------- 10.21/4.19 10.21/4.19 (12) 10.21/4.19 Obligation: 10.21/4.19 Q DP problem: 10.21/4.19 The TRS P consists of the following rules: 10.21/4.19 10.21/4.19 new_lookup(EQ, :(@2(GT, ww401), ww41), h) -> new_lookup(EQ, ww41, h) 10.21/4.19 new_lookup(EQ, :(@2(LT, ww401), ww41), h) -> new_lookup(EQ, ww41, h) 10.21/4.19 10.21/4.19 R is empty. 10.21/4.19 Q is empty. 10.21/4.19 We have to consider all minimal (P,Q,R)-chains. 10.21/4.19 ---------------------------------------- 10.21/4.19 10.21/4.19 (13) QDPSizeChangeProof (EQUIVALENT) 10.21/4.19 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. 10.21/4.19 10.21/4.19 From the DPs we obtained the following set of size-change graphs: 10.21/4.19 *new_lookup(EQ, :(@2(GT, ww401), ww41), h) -> new_lookup(EQ, ww41, h) 10.21/4.19 The graph contains the following edges 1 >= 1, 2 > 2, 3 >= 3 10.21/4.19 10.21/4.19 10.21/4.19 *new_lookup(EQ, :(@2(LT, ww401), ww41), h) -> new_lookup(EQ, ww41, h) 10.21/4.19 The graph contains the following edges 1 >= 1, 2 > 2, 3 >= 3 10.21/4.19 10.21/4.19 10.21/4.19 ---------------------------------------- 10.21/4.19 10.21/4.19 (14) 10.21/4.19 YES 10.21/4.19 10.21/4.19 ---------------------------------------- 10.21/4.19 10.21/4.19 (15) 10.21/4.19 Obligation: 10.21/4.19 Q DP problem: 10.21/4.19 The TRS P consists of the following rules: 10.21/4.19 10.21/4.19 new_lookup(LT, :(@2(EQ, ww401), ww41), h) -> new_lookup(LT, ww41, h) 10.21/4.19 new_lookup(LT, :(@2(GT, ww401), ww41), h) -> new_lookup(LT, ww41, h) 10.21/4.19 10.21/4.19 R is empty. 10.21/4.19 Q is empty. 10.21/4.19 We have to consider all minimal (P,Q,R)-chains. 10.21/4.19 ---------------------------------------- 10.21/4.19 10.21/4.19 (16) QDPSizeChangeProof (EQUIVALENT) 10.21/4.19 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. 10.21/4.19 10.21/4.19 From the DPs we obtained the following set of size-change graphs: 10.21/4.19 *new_lookup(LT, :(@2(EQ, ww401), ww41), h) -> new_lookup(LT, ww41, h) 10.21/4.19 The graph contains the following edges 1 >= 1, 2 > 2, 3 >= 3 10.21/4.19 10.21/4.19 10.21/4.19 *new_lookup(LT, :(@2(GT, ww401), ww41), h) -> new_lookup(LT, ww41, h) 10.21/4.19 The graph contains the following edges 1 >= 1, 2 > 2, 3 >= 3 10.21/4.19 10.21/4.19 10.21/4.19 ---------------------------------------- 10.21/4.19 10.21/4.19 (17) 10.21/4.19 YES 10.21/4.24 EOF