10.43/4.46 YES 13.13/5.13 proof of /export/starexec/sandbox2/benchmark/theBenchmark.hs 13.13/5.13 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 13.13/5.13 13.13/5.13 13.13/5.13 H-Termination with start terms of the given HASKELL could be proven: 13.13/5.13 13.13/5.13 (0) HASKELL 13.13/5.13 (1) LR [EQUIVALENT, 0 ms] 13.13/5.13 (2) HASKELL 13.13/5.13 (3) CR [EQUIVALENT, 0 ms] 13.13/5.13 (4) HASKELL 13.13/5.13 (5) IFR [EQUIVALENT, 0 ms] 13.13/5.13 (6) HASKELL 13.13/5.13 (7) BR [EQUIVALENT, 0 ms] 13.13/5.13 (8) HASKELL 13.13/5.13 (9) COR [EQUIVALENT, 0 ms] 13.13/5.13 (10) HASKELL 13.13/5.13 (11) Narrow [SOUND, 0 ms] 13.13/5.13 (12) AND 13.13/5.13 (13) QDP 13.13/5.13 (14) DependencyGraphProof [EQUIVALENT, 0 ms] 13.13/5.13 (15) AND 13.13/5.13 (16) QDP 13.13/5.13 (17) QDPSizeChangeProof [EQUIVALENT, 0 ms] 13.13/5.13 (18) YES 13.13/5.13 (19) QDP 13.13/5.13 (20) QDPSizeChangeProof [EQUIVALENT, 0 ms] 13.13/5.13 (21) YES 13.13/5.13 (22) QDP 13.13/5.13 (23) QDPSizeChangeProof [EQUIVALENT, 0 ms] 13.13/5.13 (24) YES 13.13/5.13 (25) QDP 13.13/5.13 (26) QDPSizeChangeProof [EQUIVALENT, 0 ms] 13.13/5.13 (27) YES 13.13/5.13 13.13/5.13 13.13/5.13 ---------------------------------------- 13.13/5.13 13.13/5.13 (0) 13.13/5.13 Obligation: 13.13/5.13 mainModule Main 13.13/5.13 module Maybe where { 13.13/5.13 import qualified List; 13.13/5.13 import qualified Main; 13.13/5.13 import qualified Prelude; 13.13/5.13 } 13.13/5.13 module List where { 13.13/5.13 import qualified Main; 13.13/5.13 import qualified Maybe; 13.13/5.13 import qualified Prelude; 13.13/5.13 intersect :: Eq a => [a] -> [a] -> [a]; 13.13/5.13 intersect = intersectBy (==); 13.13/5.13 13.13/5.13 intersectBy :: (a -> a -> Bool) -> [a] -> [a] -> [a]; 13.13/5.13 intersectBy eq xs ys = concatMap (\vv2 ->case vv2 of { 13.13/5.13 x-> if any (eq x) ys then x : [] else []; 13.13/5.13 _-> []; 13.13/5.13 } ) xs; 13.13/5.13 13.13/5.13 } 13.13/5.13 module Main where { 13.13/5.13 import qualified List; 13.13/5.13 import qualified Maybe; 13.13/5.13 import qualified Prelude; 13.13/5.13 } 13.13/5.13 13.13/5.13 ---------------------------------------- 13.13/5.13 13.13/5.13 (1) LR (EQUIVALENT) 13.13/5.13 Lambda Reductions: 13.13/5.13 The following Lambda expression 13.13/5.13 "\vv2->case vv2 of { 13.13/5.13 x -> if any (eq x) ys then x : [] else []; 13.13/5.13 _ -> []} 13.13/5.13 " 13.13/5.13 is transformed to 13.13/5.13 "intersectBy0 eq ys vv2 = case vv2 of { 13.13/5.13 x -> if any (eq x) ys then x : [] else []; 13.13/5.13 _ -> []} 13.13/5.13 ; 13.13/5.13 " 13.13/5.13 13.13/5.13 ---------------------------------------- 13.13/5.13 13.13/5.13 (2) 13.13/5.13 Obligation: 13.13/5.13 mainModule Main 13.13/5.13 module Maybe where { 13.13/5.13 import qualified List; 13.13/5.13 import qualified Main; 13.13/5.13 import qualified Prelude; 13.13/5.13 } 13.13/5.13 module List where { 13.13/5.13 import qualified Main; 13.13/5.13 import qualified Maybe; 13.13/5.13 import qualified Prelude; 13.13/5.13 intersect :: Eq a => [a] -> [a] -> [a]; 13.13/5.13 intersect = intersectBy (==); 13.13/5.13 13.13/5.13 intersectBy :: (a -> a -> Bool) -> [a] -> [a] -> [a]; 13.13/5.13 intersectBy eq xs ys = concatMap (intersectBy0 eq ys) xs; 13.13/5.13 13.13/5.13 intersectBy0 eq ys vv2 = case vv2 of { 13.13/5.13 x-> if any (eq x) ys then x : [] else []; 13.13/5.13 _-> []; 13.13/5.13 } ; 13.13/5.13 13.13/5.13 } 13.13/5.13 module Main where { 13.13/5.13 import qualified List; 13.13/5.13 import qualified Maybe; 13.13/5.13 import qualified Prelude; 13.13/5.13 } 13.13/5.13 13.13/5.13 ---------------------------------------- 13.13/5.13 13.13/5.13 (3) CR (EQUIVALENT) 13.13/5.13 Case Reductions: 13.13/5.13 The following Case expression 13.13/5.13 "case vv2 of { 13.13/5.13 x -> if any (eq x) ys then x : [] else []; 13.13/5.13 _ -> []} 13.13/5.13 " 13.13/5.13 is transformed to 13.13/5.13 "intersectBy00 eq ys x = if any (eq x) ys then x : [] else []; 13.13/5.13 intersectBy00 eq ys _ = []; 13.13/5.13 " 13.13/5.13 13.13/5.13 ---------------------------------------- 13.13/5.13 13.13/5.13 (4) 13.13/5.13 Obligation: 13.13/5.13 mainModule Main 13.13/5.13 module Maybe where { 13.13/5.13 import qualified List; 13.13/5.13 import qualified Main; 13.13/5.13 import qualified Prelude; 13.13/5.13 } 13.13/5.13 module List where { 13.13/5.13 import qualified Main; 13.13/5.13 import qualified Maybe; 13.13/5.13 import qualified Prelude; 13.13/5.13 intersect :: Eq a => [a] -> [a] -> [a]; 13.13/5.13 intersect = intersectBy (==); 13.13/5.13 13.13/5.13 intersectBy :: (a -> a -> Bool) -> [a] -> [a] -> [a]; 13.13/5.13 intersectBy eq xs ys = concatMap (intersectBy0 eq ys) xs; 13.13/5.13 13.13/5.13 intersectBy0 eq ys vv2 = intersectBy00 eq ys vv2; 13.13/5.13 13.13/5.13 intersectBy00 eq ys x = if any (eq x) ys then x : [] else []; 13.13/5.13 intersectBy00 eq ys _ = []; 13.13/5.13 13.13/5.13 } 13.13/5.13 module Main where { 13.13/5.13 import qualified List; 13.13/5.13 import qualified Maybe; 13.13/5.13 import qualified Prelude; 13.13/5.13 } 13.13/5.13 13.13/5.13 ---------------------------------------- 13.13/5.13 13.13/5.13 (5) IFR (EQUIVALENT) 13.13/5.13 If Reductions: 13.13/5.13 The following If expression 13.13/5.13 "if any (eq x) ys then x : [] else []" 13.13/5.13 is transformed to 13.13/5.13 "intersectBy000 x True = x : []; 13.13/5.13 intersectBy000 x False = []; 13.13/5.13 " 13.13/5.13 13.13/5.13 ---------------------------------------- 13.13/5.13 13.13/5.13 (6) 13.13/5.13 Obligation: 13.13/5.13 mainModule Main 13.13/5.13 module Maybe where { 13.13/5.13 import qualified List; 13.13/5.13 import qualified Main; 13.13/5.13 import qualified Prelude; 13.13/5.13 } 13.13/5.13 module List where { 13.13/5.13 import qualified Main; 13.13/5.13 import qualified Maybe; 13.13/5.13 import qualified Prelude; 13.13/5.13 intersect :: Eq a => [a] -> [a] -> [a]; 13.13/5.13 intersect = intersectBy (==); 13.13/5.13 13.13/5.13 intersectBy :: (a -> a -> Bool) -> [a] -> [a] -> [a]; 13.13/5.13 intersectBy eq xs ys = concatMap (intersectBy0 eq ys) xs; 13.13/5.13 13.13/5.13 intersectBy0 eq ys vv2 = intersectBy00 eq ys vv2; 13.13/5.13 13.13/5.13 intersectBy00 eq ys x = intersectBy000 x (any (eq x) ys); 13.13/5.13 intersectBy00 eq ys _ = []; 13.13/5.13 13.13/5.13 intersectBy000 x True = x : []; 13.13/5.13 intersectBy000 x False = []; 13.13/5.13 13.13/5.13 } 13.13/5.13 module Main where { 13.13/5.13 import qualified List; 13.13/5.13 import qualified Maybe; 13.13/5.13 import qualified Prelude; 13.13/5.13 } 13.13/5.13 13.13/5.13 ---------------------------------------- 13.13/5.13 13.13/5.13 (7) BR (EQUIVALENT) 13.13/5.13 Replaced joker patterns by fresh variables and removed binding patterns. 13.13/5.13 ---------------------------------------- 13.13/5.13 13.13/5.13 (8) 13.13/5.13 Obligation: 13.13/5.13 mainModule Main 13.13/5.13 module Maybe where { 13.13/5.13 import qualified List; 13.13/5.13 import qualified Main; 13.13/5.13 import qualified Prelude; 13.13/5.13 } 13.13/5.13 module List where { 13.13/5.13 import qualified Main; 13.13/5.13 import qualified Maybe; 13.13/5.13 import qualified Prelude; 13.13/5.13 intersect :: Eq a => [a] -> [a] -> [a]; 13.13/5.13 intersect = intersectBy (==); 13.13/5.13 13.13/5.13 intersectBy :: (a -> a -> Bool) -> [a] -> [a] -> [a]; 13.13/5.13 intersectBy eq xs ys = concatMap (intersectBy0 eq ys) xs; 13.13/5.13 13.13/5.13 intersectBy0 eq ys vv2 = intersectBy00 eq ys vv2; 13.13/5.13 13.13/5.13 intersectBy00 eq ys x = intersectBy000 x (any (eq x) ys); 13.13/5.13 intersectBy00 eq ys vy = []; 13.13/5.13 13.13/5.13 intersectBy000 x True = x : []; 13.13/5.13 intersectBy000 x False = []; 13.13/5.13 13.13/5.13 } 13.13/5.13 module Main where { 13.13/5.13 import qualified List; 13.13/5.13 import qualified Maybe; 13.13/5.13 import qualified Prelude; 13.13/5.13 } 13.13/5.13 13.13/5.13 ---------------------------------------- 13.13/5.13 13.13/5.13 (9) COR (EQUIVALENT) 13.13/5.13 Cond Reductions: 13.13/5.13 The following Function with conditions 13.13/5.13 "undefined |Falseundefined; 13.13/5.13 " 13.13/5.13 is transformed to 13.13/5.13 "undefined = undefined1; 13.13/5.13 " 13.13/5.13 "undefined0 True = undefined; 13.13/5.13 " 13.13/5.13 "undefined1 = undefined0 False; 13.13/5.13 " 13.13/5.13 13.13/5.13 ---------------------------------------- 13.13/5.13 13.13/5.13 (10) 13.13/5.13 Obligation: 13.13/5.13 mainModule Main 13.13/5.13 module Maybe where { 13.13/5.13 import qualified List; 13.13/5.13 import qualified Main; 13.13/5.13 import qualified Prelude; 13.13/5.13 } 13.13/5.13 module List where { 13.13/5.13 import qualified Main; 13.13/5.13 import qualified Maybe; 13.13/5.13 import qualified Prelude; 13.13/5.13 intersect :: Eq a => [a] -> [a] -> [a]; 13.13/5.13 intersect = intersectBy (==); 13.13/5.13 13.13/5.13 intersectBy :: (a -> a -> Bool) -> [a] -> [a] -> [a]; 13.13/5.13 intersectBy eq xs ys = concatMap (intersectBy0 eq ys) xs; 13.13/5.13 13.13/5.13 intersectBy0 eq ys vv2 = intersectBy00 eq ys vv2; 13.13/5.13 13.13/5.13 intersectBy00 eq ys x = intersectBy000 x (any (eq x) ys); 13.13/5.13 intersectBy00 eq ys vy = []; 13.13/5.13 13.13/5.13 intersectBy000 x True = x : []; 13.13/5.13 intersectBy000 x False = []; 13.13/5.13 13.13/5.13 } 13.13/5.13 module Main where { 13.13/5.13 import qualified List; 13.13/5.13 import qualified Maybe; 13.13/5.13 import qualified Prelude; 13.13/5.13 } 13.13/5.13 13.13/5.13 ---------------------------------------- 13.13/5.13 13.13/5.13 (11) Narrow (SOUND) 13.13/5.13 Haskell To QDPs 13.13/5.13 13.13/5.13 digraph dp_graph { 13.13/5.13 node [outthreshold=100, inthreshold=100];1[label="List.intersect",fontsize=16,color="grey",shape="box"];1 -> 3[label="",style="dashed", color="grey", weight=3]; 13.13/5.13 3[label="List.intersect vz3",fontsize=16,color="grey",shape="box"];3 -> 4[label="",style="dashed", color="grey", weight=3]; 13.13/5.13 4[label="List.intersect vz3 vz4",fontsize=16,color="black",shape="triangle"];4 -> 5[label="",style="solid", color="black", weight=3]; 13.13/5.13 5[label="List.intersectBy (==) vz3 vz4",fontsize=16,color="black",shape="box"];5 -> 6[label="",style="solid", color="black", weight=3]; 13.13/5.13 6[label="concatMap (List.intersectBy0 (==) vz4) vz3",fontsize=16,color="black",shape="box"];6 -> 7[label="",style="solid", color="black", weight=3]; 13.13/5.13 7[label="concat . map (List.intersectBy0 (==) vz4)",fontsize=16,color="black",shape="box"];7 -> 8[label="",style="solid", color="black", weight=3]; 13.13/5.13 8[label="concat (map (List.intersectBy0 (==) vz4) vz3)",fontsize=16,color="black",shape="box"];8 -> 9[label="",style="solid", color="black", weight=3]; 13.13/5.13 9[label="foldr (++) [] (map (List.intersectBy0 (==) vz4) vz3)",fontsize=16,color="burlywood",shape="triangle"];74[label="vz3/vz30 : vz31",fontsize=10,color="white",style="solid",shape="box"];9 -> 74[label="",style="solid", color="burlywood", weight=9]; 13.13/5.13 74 -> 10[label="",style="solid", color="burlywood", weight=3]; 13.13/5.13 75[label="vz3/[]",fontsize=10,color="white",style="solid",shape="box"];9 -> 75[label="",style="solid", color="burlywood", weight=9]; 13.13/5.13 75 -> 11[label="",style="solid", color="burlywood", weight=3]; 13.13/5.13 10[label="foldr (++) [] (map (List.intersectBy0 (==) vz4) (vz30 : vz31))",fontsize=16,color="black",shape="box"];10 -> 12[label="",style="solid", color="black", weight=3]; 13.13/5.13 11[label="foldr (++) [] (map (List.intersectBy0 (==) vz4) [])",fontsize=16,color="black",shape="box"];11 -> 13[label="",style="solid", color="black", weight=3]; 13.13/5.13 12[label="foldr (++) [] (List.intersectBy0 (==) vz4 vz30 : map (List.intersectBy0 (==) vz4) vz31)",fontsize=16,color="black",shape="box"];12 -> 14[label="",style="solid", color="black", weight=3]; 13.13/5.13 13[label="foldr (++) [] []",fontsize=16,color="black",shape="box"];13 -> 15[label="",style="solid", color="black", weight=3]; 13.13/5.13 14 -> 16[label="",style="dashed", color="red", weight=0]; 13.13/5.13 14[label="(++) List.intersectBy0 (==) vz4 vz30 foldr (++) [] (map (List.intersectBy0 (==) vz4) vz31)",fontsize=16,color="magenta"];14 -> 17[label="",style="dashed", color="magenta", weight=3]; 13.13/5.13 15[label="[]",fontsize=16,color="green",shape="box"];17 -> 9[label="",style="dashed", color="red", weight=0]; 13.13/5.13 17[label="foldr (++) [] (map (List.intersectBy0 (==) vz4) vz31)",fontsize=16,color="magenta"];17 -> 18[label="",style="dashed", color="magenta", weight=3]; 13.13/5.13 16[label="(++) List.intersectBy0 (==) vz4 vz30 vz5",fontsize=16,color="black",shape="triangle"];16 -> 19[label="",style="solid", color="black", weight=3]; 13.13/5.13 18[label="vz31",fontsize=16,color="green",shape="box"];19[label="(++) List.intersectBy00 (==) vz4 vz30 vz5",fontsize=16,color="black",shape="box"];19 -> 20[label="",style="solid", color="black", weight=3]; 13.13/5.13 20[label="(++) List.intersectBy000 vz30 (any ((==) vz30) vz4) vz5",fontsize=16,color="black",shape="box"];20 -> 21[label="",style="solid", color="black", weight=3]; 13.13/5.13 21[label="(++) List.intersectBy000 vz30 (or . map ((==) vz30)) vz5",fontsize=16,color="black",shape="box"];21 -> 22[label="",style="solid", color="black", weight=3]; 13.13/5.13 22[label="(++) List.intersectBy000 vz30 (or (map ((==) vz30) vz4)) vz5",fontsize=16,color="black",shape="box"];22 -> 23[label="",style="solid", color="black", weight=3]; 13.13/5.13 23[label="(++) List.intersectBy000 vz30 (foldr (||) False (map ((==) vz30) vz4)) vz5",fontsize=16,color="burlywood",shape="triangle"];76[label="vz4/vz40 : vz41",fontsize=10,color="white",style="solid",shape="box"];23 -> 76[label="",style="solid", color="burlywood", weight=9]; 13.13/5.13 76 -> 24[label="",style="solid", color="burlywood", weight=3]; 13.13/5.13 77[label="vz4/[]",fontsize=10,color="white",style="solid",shape="box"];23 -> 77[label="",style="solid", color="burlywood", weight=9]; 13.13/5.13 77 -> 25[label="",style="solid", color="burlywood", weight=3]; 13.13/5.13 24[label="(++) List.intersectBy000 vz30 (foldr (||) False (map ((==) vz30) (vz40 : vz41))) vz5",fontsize=16,color="black",shape="box"];24 -> 26[label="",style="solid", color="black", weight=3]; 13.13/5.13 25[label="(++) List.intersectBy000 vz30 (foldr (||) False (map ((==) vz30) [])) vz5",fontsize=16,color="black",shape="box"];25 -> 27[label="",style="solid", color="black", weight=3]; 13.13/5.13 26[label="(++) List.intersectBy000 vz30 (foldr (||) False (((==) vz30 vz40) : map ((==) vz30) vz41)) vz5",fontsize=16,color="black",shape="box"];26 -> 28[label="",style="solid", color="black", weight=3]; 13.13/5.13 27[label="(++) List.intersectBy000 vz30 (foldr (||) False []) vz5",fontsize=16,color="black",shape="box"];27 -> 29[label="",style="solid", color="black", weight=3]; 13.13/5.13 28[label="(++) List.intersectBy000 vz30 ((||) (==) vz30 vz40 foldr (||) False (map ((==) vz30) vz41)) vz5",fontsize=16,color="burlywood",shape="box"];78[label="vz30/LT",fontsize=10,color="white",style="solid",shape="box"];28 -> 78[label="",style="solid", color="burlywood", weight=9]; 13.13/5.13 78 -> 30[label="",style="solid", color="burlywood", weight=3]; 13.13/5.13 79[label="vz30/EQ",fontsize=10,color="white",style="solid",shape="box"];28 -> 79[label="",style="solid", color="burlywood", weight=9]; 13.13/5.13 79 -> 31[label="",style="solid", color="burlywood", weight=3]; 13.13/5.13 80[label="vz30/GT",fontsize=10,color="white",style="solid",shape="box"];28 -> 80[label="",style="solid", color="burlywood", weight=9]; 13.13/5.13 80 -> 32[label="",style="solid", color="burlywood", weight=3]; 13.13/5.13 29[label="(++) List.intersectBy000 vz30 False vz5",fontsize=16,color="black",shape="box"];29 -> 33[label="",style="solid", color="black", weight=3]; 13.13/5.13 30[label="(++) List.intersectBy000 LT ((||) (==) LT vz40 foldr (||) False (map ((==) LT) vz41)) vz5",fontsize=16,color="burlywood",shape="box"];81[label="vz40/LT",fontsize=10,color="white",style="solid",shape="box"];30 -> 81[label="",style="solid", color="burlywood", weight=9]; 13.13/5.13 81 -> 34[label="",style="solid", color="burlywood", weight=3]; 13.13/5.13 82[label="vz40/EQ",fontsize=10,color="white",style="solid",shape="box"];30 -> 82[label="",style="solid", color="burlywood", weight=9]; 13.13/5.13 82 -> 35[label="",style="solid", color="burlywood", weight=3]; 13.13/5.13 83[label="vz40/GT",fontsize=10,color="white",style="solid",shape="box"];30 -> 83[label="",style="solid", color="burlywood", weight=9]; 13.13/5.13 83 -> 36[label="",style="solid", color="burlywood", weight=3]; 13.13/5.13 31[label="(++) List.intersectBy000 EQ ((||) (==) EQ vz40 foldr (||) False (map ((==) EQ) vz41)) vz5",fontsize=16,color="burlywood",shape="box"];84[label="vz40/LT",fontsize=10,color="white",style="solid",shape="box"];31 -> 84[label="",style="solid", color="burlywood", weight=9]; 13.13/5.13 84 -> 37[label="",style="solid", color="burlywood", weight=3]; 13.13/5.13 85[label="vz40/EQ",fontsize=10,color="white",style="solid",shape="box"];31 -> 85[label="",style="solid", color="burlywood", weight=9]; 13.13/5.13 85 -> 38[label="",style="solid", color="burlywood", weight=3]; 13.13/5.13 86[label="vz40/GT",fontsize=10,color="white",style="solid",shape="box"];31 -> 86[label="",style="solid", color="burlywood", weight=9]; 13.13/5.13 86 -> 39[label="",style="solid", color="burlywood", weight=3]; 13.13/5.13 32[label="(++) List.intersectBy000 GT ((||) (==) GT vz40 foldr (||) False (map ((==) GT) vz41)) vz5",fontsize=16,color="burlywood",shape="box"];87[label="vz40/LT",fontsize=10,color="white",style="solid",shape="box"];32 -> 87[label="",style="solid", color="burlywood", weight=9]; 13.13/5.13 87 -> 40[label="",style="solid", color="burlywood", weight=3]; 13.13/5.13 88[label="vz40/EQ",fontsize=10,color="white",style="solid",shape="box"];32 -> 88[label="",style="solid", color="burlywood", weight=9]; 13.13/5.13 88 -> 41[label="",style="solid", color="burlywood", weight=3]; 13.13/5.13 89[label="vz40/GT",fontsize=10,color="white",style="solid",shape="box"];32 -> 89[label="",style="solid", color="burlywood", weight=9]; 13.13/5.13 89 -> 42[label="",style="solid", color="burlywood", weight=3]; 13.13/5.13 33[label="(++) [] vz5",fontsize=16,color="black",shape="triangle"];33 -> 43[label="",style="solid", color="black", weight=3]; 13.13/5.13 34[label="(++) List.intersectBy000 LT ((||) (==) LT LT foldr (||) False (map ((==) LT) vz41)) vz5",fontsize=16,color="black",shape="box"];34 -> 44[label="",style="solid", color="black", weight=3]; 13.13/5.13 35[label="(++) List.intersectBy000 LT ((||) (==) LT EQ foldr (||) False (map ((==) LT) vz41)) vz5",fontsize=16,color="black",shape="box"];35 -> 45[label="",style="solid", color="black", weight=3]; 13.13/5.13 36[label="(++) List.intersectBy000 LT ((||) (==) LT GT foldr (||) False (map ((==) LT) vz41)) vz5",fontsize=16,color="black",shape="box"];36 -> 46[label="",style="solid", color="black", weight=3]; 13.13/5.13 37[label="(++) List.intersectBy000 EQ ((||) (==) EQ LT foldr (||) False (map ((==) EQ) vz41)) vz5",fontsize=16,color="black",shape="box"];37 -> 47[label="",style="solid", color="black", weight=3]; 13.13/5.13 38[label="(++) List.intersectBy000 EQ ((||) (==) EQ EQ foldr (||) False (map ((==) EQ) vz41)) vz5",fontsize=16,color="black",shape="box"];38 -> 48[label="",style="solid", color="black", weight=3]; 13.13/5.13 39[label="(++) List.intersectBy000 EQ ((||) (==) EQ GT foldr (||) False (map ((==) EQ) vz41)) vz5",fontsize=16,color="black",shape="box"];39 -> 49[label="",style="solid", color="black", weight=3]; 13.13/5.13 40[label="(++) List.intersectBy000 GT ((||) (==) GT LT foldr (||) False (map ((==) GT) vz41)) vz5",fontsize=16,color="black",shape="box"];40 -> 50[label="",style="solid", color="black", weight=3]; 13.13/5.13 41[label="(++) List.intersectBy000 GT ((||) (==) GT EQ foldr (||) False (map ((==) GT) vz41)) vz5",fontsize=16,color="black",shape="box"];41 -> 51[label="",style="solid", color="black", weight=3]; 13.13/5.13 42[label="(++) List.intersectBy000 GT ((||) (==) GT GT foldr (||) False (map ((==) GT) vz41)) vz5",fontsize=16,color="black",shape="box"];42 -> 52[label="",style="solid", color="black", weight=3]; 13.13/5.13 43[label="vz5",fontsize=16,color="green",shape="box"];44[label="(++) List.intersectBy000 LT ((||) True foldr (||) False (map ((==) LT) vz41)) vz5",fontsize=16,color="black",shape="box"];44 -> 53[label="",style="solid", color="black", weight=3]; 13.13/5.13 45[label="(++) List.intersectBy000 LT ((||) False foldr (||) False (map ((==) LT) vz41)) vz5",fontsize=16,color="black",shape="triangle"];45 -> 54[label="",style="solid", color="black", weight=3]; 13.13/5.13 46 -> 45[label="",style="dashed", color="red", weight=0]; 13.13/5.13 46[label="(++) List.intersectBy000 LT ((||) False foldr (||) False (map ((==) LT) vz41)) vz5",fontsize=16,color="magenta"];47[label="(++) List.intersectBy000 EQ ((||) False foldr (||) False (map ((==) EQ) vz41)) vz5",fontsize=16,color="black",shape="triangle"];47 -> 55[label="",style="solid", color="black", weight=3]; 13.13/5.13 48[label="(++) List.intersectBy000 EQ ((||) True foldr (||) False (map ((==) EQ) vz41)) vz5",fontsize=16,color="black",shape="box"];48 -> 56[label="",style="solid", color="black", weight=3]; 13.13/5.13 49 -> 47[label="",style="dashed", color="red", weight=0]; 13.13/5.13 49[label="(++) List.intersectBy000 EQ ((||) False foldr (||) False (map ((==) EQ) vz41)) vz5",fontsize=16,color="magenta"];50[label="(++) List.intersectBy000 GT ((||) False foldr (||) False (map ((==) GT) vz41)) vz5",fontsize=16,color="black",shape="triangle"];50 -> 57[label="",style="solid", color="black", weight=3]; 13.13/5.13 51 -> 50[label="",style="dashed", color="red", weight=0]; 13.13/5.13 51[label="(++) List.intersectBy000 GT ((||) False foldr (||) False (map ((==) GT) vz41)) vz5",fontsize=16,color="magenta"];52[label="(++) List.intersectBy000 GT ((||) True foldr (||) False (map ((==) GT) vz41)) vz5",fontsize=16,color="black",shape="box"];52 -> 58[label="",style="solid", color="black", weight=3]; 13.13/5.13 53[label="(++) List.intersectBy000 LT True vz5",fontsize=16,color="black",shape="box"];53 -> 59[label="",style="solid", color="black", weight=3]; 13.13/5.13 54 -> 23[label="",style="dashed", color="red", weight=0]; 13.13/5.13 54[label="(++) List.intersectBy000 LT (foldr (||) False (map ((==) LT) vz41)) vz5",fontsize=16,color="magenta"];54 -> 60[label="",style="dashed", color="magenta", weight=3]; 13.13/5.13 54 -> 61[label="",style="dashed", color="magenta", weight=3]; 13.13/5.13 55 -> 23[label="",style="dashed", color="red", weight=0]; 13.13/5.13 55[label="(++) List.intersectBy000 EQ (foldr (||) False (map ((==) EQ) vz41)) vz5",fontsize=16,color="magenta"];55 -> 62[label="",style="dashed", color="magenta", weight=3]; 13.13/5.13 55 -> 63[label="",style="dashed", color="magenta", weight=3]; 13.13/5.13 56[label="(++) List.intersectBy000 EQ True vz5",fontsize=16,color="black",shape="box"];56 -> 64[label="",style="solid", color="black", weight=3]; 13.13/5.13 57 -> 23[label="",style="dashed", color="red", weight=0]; 13.13/5.13 57[label="(++) List.intersectBy000 GT (foldr (||) False (map ((==) GT) vz41)) vz5",fontsize=16,color="magenta"];57 -> 65[label="",style="dashed", color="magenta", weight=3]; 13.13/5.13 57 -> 66[label="",style="dashed", color="magenta", weight=3]; 13.13/5.13 58[label="(++) List.intersectBy000 GT True vz5",fontsize=16,color="black",shape="box"];58 -> 67[label="",style="solid", color="black", weight=3]; 13.13/5.13 59[label="(++) (LT : []) vz5",fontsize=16,color="black",shape="box"];59 -> 68[label="",style="solid", color="black", weight=3]; 13.13/5.13 60[label="vz41",fontsize=16,color="green",shape="box"];61[label="LT",fontsize=16,color="green",shape="box"];62[label="vz41",fontsize=16,color="green",shape="box"];63[label="EQ",fontsize=16,color="green",shape="box"];64[label="(++) (EQ : []) vz5",fontsize=16,color="black",shape="box"];64 -> 69[label="",style="solid", color="black", weight=3]; 13.13/5.13 65[label="vz41",fontsize=16,color="green",shape="box"];66[label="GT",fontsize=16,color="green",shape="box"];67[label="(++) (GT : []) vz5",fontsize=16,color="black",shape="box"];67 -> 70[label="",style="solid", color="black", weight=3]; 13.13/5.13 68[label="LT : [] ++ vz5",fontsize=16,color="green",shape="box"];68 -> 71[label="",style="dashed", color="green", weight=3]; 13.13/5.13 69[label="EQ : [] ++ vz5",fontsize=16,color="green",shape="box"];69 -> 72[label="",style="dashed", color="green", weight=3]; 13.13/5.13 70[label="GT : [] ++ vz5",fontsize=16,color="green",shape="box"];70 -> 73[label="",style="dashed", color="green", weight=3]; 13.13/5.13 71 -> 33[label="",style="dashed", color="red", weight=0]; 13.13/5.13 71[label="[] ++ vz5",fontsize=16,color="magenta"];72 -> 33[label="",style="dashed", color="red", weight=0]; 13.13/5.13 72[label="[] ++ vz5",fontsize=16,color="magenta"];73 -> 33[label="",style="dashed", color="red", weight=0]; 13.13/5.13 73[label="[] ++ vz5",fontsize=16,color="magenta"];} 13.13/5.13 13.13/5.13 ---------------------------------------- 13.13/5.13 13.13/5.13 (12) 13.13/5.13 Complex Obligation (AND) 13.13/5.13 13.13/5.13 ---------------------------------------- 13.13/5.13 13.13/5.13 (13) 13.13/5.13 Obligation: 13.13/5.13 Q DP problem: 13.13/5.13 The TRS P consists of the following rules: 13.13/5.13 13.13/5.13 new_psPs0(EQ, :(LT, vz41), vz5) -> new_psPs0(EQ, vz41, vz5) 13.13/5.13 new_psPs(vz41, vz5) -> new_psPs0(LT, vz41, vz5) 13.13/5.13 new_psPs0(LT, :(GT, vz41), vz5) -> new_psPs(vz41, vz5) 13.13/5.13 new_psPs1(vz41, vz5) -> new_psPs0(EQ, vz41, vz5) 13.13/5.13 new_psPs2(vz41, vz5) -> new_psPs0(GT, vz41, vz5) 13.13/5.13 new_psPs0(GT, :(EQ, vz41), vz5) -> new_psPs2(vz41, vz5) 13.13/5.13 new_psPs0(LT, :(EQ, vz41), vz5) -> new_psPs0(LT, vz41, vz5) 13.13/5.13 new_psPs0(EQ, :(GT, vz41), vz5) -> new_psPs1(vz41, vz5) 13.13/5.13 new_psPs0(GT, :(LT, vz41), vz5) -> new_psPs0(GT, vz41, vz5) 13.13/5.13 13.13/5.13 R is empty. 13.13/5.13 Q is empty. 13.13/5.13 We have to consider all minimal (P,Q,R)-chains. 13.13/5.13 ---------------------------------------- 13.13/5.13 13.13/5.13 (14) DependencyGraphProof (EQUIVALENT) 13.13/5.13 The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 3 SCCs. 13.13/5.13 ---------------------------------------- 13.13/5.13 13.13/5.13 (15) 13.13/5.13 Complex Obligation (AND) 13.13/5.13 13.13/5.13 ---------------------------------------- 13.13/5.13 13.13/5.13 (16) 13.13/5.13 Obligation: 13.13/5.13 Q DP problem: 13.13/5.13 The TRS P consists of the following rules: 13.13/5.13 13.13/5.13 new_psPs0(GT, :(EQ, vz41), vz5) -> new_psPs2(vz41, vz5) 13.13/5.13 new_psPs2(vz41, vz5) -> new_psPs0(GT, vz41, vz5) 13.13/5.13 new_psPs0(GT, :(LT, vz41), vz5) -> new_psPs0(GT, vz41, vz5) 13.13/5.13 13.13/5.13 R is empty. 13.13/5.13 Q is empty. 13.13/5.13 We have to consider all minimal (P,Q,R)-chains. 13.13/5.13 ---------------------------------------- 13.13/5.13 13.13/5.13 (17) QDPSizeChangeProof (EQUIVALENT) 13.13/5.13 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. 13.13/5.13 13.13/5.13 From the DPs we obtained the following set of size-change graphs: 13.13/5.13 *new_psPs2(vz41, vz5) -> new_psPs0(GT, vz41, vz5) 13.13/5.13 The graph contains the following edges 1 >= 2, 2 >= 3 13.13/5.13 13.13/5.13 13.13/5.13 *new_psPs0(GT, :(LT, vz41), vz5) -> new_psPs0(GT, vz41, vz5) 13.13/5.13 The graph contains the following edges 1 >= 1, 2 > 2, 3 >= 3 13.13/5.13 13.13/5.13 13.13/5.13 *new_psPs0(GT, :(EQ, vz41), vz5) -> new_psPs2(vz41, vz5) 13.13/5.13 The graph contains the following edges 2 > 1, 3 >= 2 13.13/5.13 13.13/5.13 13.13/5.13 ---------------------------------------- 13.13/5.13 13.13/5.13 (18) 13.13/5.13 YES 13.13/5.13 13.13/5.13 ---------------------------------------- 13.13/5.13 13.13/5.13 (19) 13.13/5.13 Obligation: 13.13/5.13 Q DP problem: 13.13/5.13 The TRS P consists of the following rules: 13.13/5.13 13.13/5.13 new_psPs0(LT, :(GT, vz41), vz5) -> new_psPs(vz41, vz5) 13.13/5.13 new_psPs(vz41, vz5) -> new_psPs0(LT, vz41, vz5) 13.13/5.13 new_psPs0(LT, :(EQ, vz41), vz5) -> new_psPs0(LT, vz41, vz5) 13.13/5.13 13.13/5.13 R is empty. 13.13/5.13 Q is empty. 13.13/5.13 We have to consider all minimal (P,Q,R)-chains. 13.13/5.13 ---------------------------------------- 13.13/5.13 13.13/5.13 (20) QDPSizeChangeProof (EQUIVALENT) 13.13/5.13 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. 13.13/5.13 13.13/5.13 From the DPs we obtained the following set of size-change graphs: 13.13/5.13 *new_psPs(vz41, vz5) -> new_psPs0(LT, vz41, vz5) 13.13/5.13 The graph contains the following edges 1 >= 2, 2 >= 3 13.13/5.13 13.13/5.13 13.13/5.13 *new_psPs0(LT, :(EQ, vz41), vz5) -> new_psPs0(LT, vz41, vz5) 13.13/5.13 The graph contains the following edges 1 >= 1, 2 > 2, 3 >= 3 13.13/5.13 13.13/5.13 13.13/5.13 *new_psPs0(LT, :(GT, vz41), vz5) -> new_psPs(vz41, vz5) 13.13/5.13 The graph contains the following edges 2 > 1, 3 >= 2 13.13/5.13 13.13/5.13 13.13/5.13 ---------------------------------------- 13.13/5.13 13.13/5.13 (21) 13.13/5.13 YES 13.13/5.13 13.13/5.13 ---------------------------------------- 13.13/5.13 13.13/5.13 (22) 13.13/5.13 Obligation: 13.13/5.13 Q DP problem: 13.13/5.13 The TRS P consists of the following rules: 13.13/5.13 13.13/5.13 new_psPs0(EQ, :(GT, vz41), vz5) -> new_psPs1(vz41, vz5) 13.13/5.13 new_psPs1(vz41, vz5) -> new_psPs0(EQ, vz41, vz5) 13.13/5.13 new_psPs0(EQ, :(LT, vz41), vz5) -> new_psPs0(EQ, vz41, vz5) 13.13/5.13 13.13/5.13 R is empty. 13.13/5.13 Q is empty. 13.13/5.13 We have to consider all minimal (P,Q,R)-chains. 13.13/5.13 ---------------------------------------- 13.13/5.13 13.13/5.13 (23) QDPSizeChangeProof (EQUIVALENT) 13.13/5.13 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. 13.13/5.13 13.13/5.13 From the DPs we obtained the following set of size-change graphs: 13.13/5.13 *new_psPs1(vz41, vz5) -> new_psPs0(EQ, vz41, vz5) 13.13/5.13 The graph contains the following edges 1 >= 2, 2 >= 3 13.13/5.13 13.13/5.13 13.13/5.13 *new_psPs0(EQ, :(LT, vz41), vz5) -> new_psPs0(EQ, vz41, vz5) 13.13/5.13 The graph contains the following edges 1 >= 1, 2 > 2, 3 >= 3 13.13/5.13 13.13/5.13 13.13/5.13 *new_psPs0(EQ, :(GT, vz41), vz5) -> new_psPs1(vz41, vz5) 13.13/5.13 The graph contains the following edges 2 > 1, 3 >= 2 13.13/5.13 13.13/5.13 13.13/5.13 ---------------------------------------- 13.13/5.13 13.13/5.13 (24) 13.13/5.13 YES 13.13/5.13 13.13/5.13 ---------------------------------------- 13.13/5.13 13.13/5.13 (25) 13.13/5.13 Obligation: 13.13/5.13 Q DP problem: 13.13/5.13 The TRS P consists of the following rules: 13.13/5.13 13.13/5.13 new_foldr(vz4, :(vz30, vz31)) -> new_foldr(vz4, vz31) 13.13/5.13 13.13/5.13 R is empty. 13.13/5.13 Q is empty. 13.13/5.13 We have to consider all minimal (P,Q,R)-chains. 13.13/5.13 ---------------------------------------- 13.13/5.13 13.13/5.13 (26) QDPSizeChangeProof (EQUIVALENT) 13.13/5.13 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. 13.13/5.14 13.13/5.14 From the DPs we obtained the following set of size-change graphs: 13.13/5.14 *new_foldr(vz4, :(vz30, vz31)) -> new_foldr(vz4, vz31) 13.13/5.14 The graph contains the following edges 1 >= 1, 2 > 2 13.13/5.14 13.13/5.14 13.13/5.14 ---------------------------------------- 13.13/5.14 13.13/5.14 (27) 13.13/5.14 YES 13.13/5.19 EOF