/export/starexec/sandbox/solver/bin/starexec_run_standard /export/starexec/sandbox/benchmark/theBenchmark.hs /export/starexec/sandbox/output/output_files


--------------------------------------------------------------------------------


YES
proof of /export/starexec/sandbox/benchmark/theBenchmark.hs
# AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty


H-Termination with start terms of the given HASKELL could be proven:

(0) HASKELL
(1) LR [EQUIVALENT, 0 ms]
(2) HASKELL
(3) BR [EQUIVALENT, 0 ms]
(4) HASKELL
(5) COR [EQUIVALENT, 0 ms]
(6) HASKELL
(7) Narrow [SOUND, 0 ms]
(8) AND
    (9) QDP
        (10) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (11) YES
    (12) QDP
        (13) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (14) YES
    (15) QDP
        (16) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (17) YES


----------------------------------------

(0)
Obligation:
mainModule Main 
module Maybe where {
import qualified Main;
import qualified Monad;
import qualified Prelude;
}
module Main where {
import qualified Maybe;
import qualified Monad;
import qualified Prelude;
}
module Monad where {
import qualified Main;
import qualified Maybe;
import qualified Prelude;
liftM2 :: Monad d => (b  ->  a  ->  c)  ->  d b  ->  d a  ->  d c;
liftM2 f m1 m2 = m1 >>= (\x1 ->m2 >>= (\x2 ->return (f x1 x2)));

}

----------------------------------------

(1) LR (EQUIVALENT)
Lambda Reductions:
The following Lambda expression
"\x2->return (f x1 x2)"
is transformed to
"liftM20 f x1 x2 = return (f x1 x2);
"
The following Lambda expression
"\x1->m2 >>= liftM20 f x1"
is transformed to
"liftM21 m2 f x1 = m2 >>= liftM20 f x1;
"

----------------------------------------

(2)
Obligation:
mainModule Main 
module Maybe where {
import qualified Main;
import qualified Monad;
import qualified Prelude;
}
module Main where {
import qualified Maybe;
import qualified Monad;
import qualified Prelude;
}
module Monad where {
import qualified Main;
import qualified Maybe;
import qualified Prelude;
liftM2 :: Monad c => (a  ->  b  ->  d)  ->  c a  ->  c b  ->  c d;
liftM2 f m1 m2 = m1 >>= liftM21 m2 f;

liftM20 f x1 x2 = return (f x1 x2);

liftM21 m2 f x1 = m2 >>= liftM20 f x1;

}

----------------------------------------

(3) BR (EQUIVALENT)
Replaced joker patterns by fresh variables and removed binding patterns.
----------------------------------------

(4)
Obligation:
mainModule Main 
module Maybe where {
import qualified Main;
import qualified Monad;
import qualified Prelude;
}
module Main where {
import qualified Maybe;
import qualified Monad;
import qualified Prelude;
}
module Monad where {
import qualified Main;
import qualified Maybe;
import qualified Prelude;
liftM2 :: Monad c => (d  ->  a  ->  b)  ->  c d  ->  c a  ->  c b;
liftM2 f m1 m2 = m1 >>= liftM21 m2 f;

liftM20 f x1 x2 = return (f x1 x2);

liftM21 m2 f x1 = m2 >>= liftM20 f x1;

}

----------------------------------------

(5) COR (EQUIVALENT)
Cond Reductions:
The following Function with conditions
"undefined |Falseundefined;
"
is transformed to
"undefined  = undefined1;
"
"undefined0 True = undefined;
"
"undefined1  = undefined0 False;
"

----------------------------------------

(6)
Obligation:
mainModule Main 
module Maybe where {
import qualified Main;
import qualified Monad;
import qualified Prelude;
}
module Main where {
import qualified Maybe;
import qualified Monad;
import qualified Prelude;
}
module Monad where {
import qualified Main;
import qualified Maybe;
import qualified Prelude;
liftM2 :: Monad c => (a  ->  d  ->  b)  ->  c a  ->  c d  ->  c b;
liftM2 f m1 m2 = m1 >>= liftM21 m2 f;

liftM20 f x1 x2 = return (f x1 x2);

liftM21 m2 f x1 = m2 >>= liftM20 f x1;

}

----------------------------------------

(7) Narrow (SOUND)
Haskell To QDPs

digraph dp_graph {
node [outthreshold=100, inthreshold=100];1[label="Monad.liftM2",fontsize=16,color="grey",shape="box"];1 -> 3[label="",style="dashed", color="grey", weight=3];
3[label="Monad.liftM2 vy3",fontsize=16,color="grey",shape="box"];3 -> 4[label="",style="dashed", color="grey", weight=3];
4[label="Monad.liftM2 vy3 vy4",fontsize=16,color="grey",shape="box"];4 -> 5[label="",style="dashed", color="grey", weight=3];
5[label="Monad.liftM2 vy3 vy4 vy5",fontsize=16,color="black",shape="triangle"];5 -> 6[label="",style="solid", color="black", weight=3];
6[label="vy4 >>= Monad.liftM21 vy5 vy3",fontsize=16,color="blue",shape="box"];91[label=">>= :: (IO a) -> (a -> IO b) -> IO b",fontsize=10,color="white",style="solid",shape="box"];6 -> 91[label="",style="solid", color="blue", weight=9];
91 -> 7[label="",style="solid", color="blue", weight=3];
92[label=">>= :: ([] a) -> (a -> [] b) -> [] b",fontsize=10,color="white",style="solid",shape="box"];6 -> 92[label="",style="solid", color="blue", weight=9];
92 -> 8[label="",style="solid", color="blue", weight=3];
93[label=">>= :: (Maybe a) -> (a -> Maybe b) -> Maybe b",fontsize=10,color="white",style="solid",shape="box"];6 -> 93[label="",style="solid", color="blue", weight=9];
93 -> 9[label="",style="solid", color="blue", weight=3];
7[label="vy4 >>= Monad.liftM21 vy5 vy3",fontsize=16,color="black",shape="box"];7 -> 10[label="",style="solid", color="black", weight=3];
8[label="vy4 >>= Monad.liftM21 vy5 vy3",fontsize=16,color="burlywood",shape="triangle"];94[label="vy4/vy40 : vy41",fontsize=10,color="white",style="solid",shape="box"];8 -> 94[label="",style="solid", color="burlywood", weight=9];
94 -> 11[label="",style="solid", color="burlywood", weight=3];
95[label="vy4/[]",fontsize=10,color="white",style="solid",shape="box"];8 -> 95[label="",style="solid", color="burlywood", weight=9];
95 -> 12[label="",style="solid", color="burlywood", weight=3];
9[label="vy4 >>= Monad.liftM21 vy5 vy3",fontsize=16,color="burlywood",shape="box"];96[label="vy4/Nothing",fontsize=10,color="white",style="solid",shape="box"];9 -> 96[label="",style="solid", color="burlywood", weight=9];
96 -> 13[label="",style="solid", color="burlywood", weight=3];
97[label="vy4/Just vy40",fontsize=10,color="white",style="solid",shape="box"];9 -> 97[label="",style="solid", color="burlywood", weight=9];
97 -> 14[label="",style="solid", color="burlywood", weight=3];
10[label="primbindIO vy4 (Monad.liftM21 vy5 vy3)",fontsize=16,color="burlywood",shape="box"];98[label="vy4/IO vy40",fontsize=10,color="white",style="solid",shape="box"];10 -> 98[label="",style="solid", color="burlywood", weight=9];
98 -> 15[label="",style="solid", color="burlywood", weight=3];
99[label="vy4/AProVE_IO vy40",fontsize=10,color="white",style="solid",shape="box"];10 -> 99[label="",style="solid", color="burlywood", weight=9];
99 -> 16[label="",style="solid", color="burlywood", weight=3];
100[label="vy4/AProVE_Exception vy40",fontsize=10,color="white",style="solid",shape="box"];10 -> 100[label="",style="solid", color="burlywood", weight=9];
100 -> 17[label="",style="solid", color="burlywood", weight=3];
101[label="vy4/AProVE_Error vy40",fontsize=10,color="white",style="solid",shape="box"];10 -> 101[label="",style="solid", color="burlywood", weight=9];
101 -> 18[label="",style="solid", color="burlywood", weight=3];
11[label="vy40 : vy41 >>= Monad.liftM21 vy5 vy3",fontsize=16,color="black",shape="box"];11 -> 19[label="",style="solid", color="black", weight=3];
12[label="[] >>= Monad.liftM21 vy5 vy3",fontsize=16,color="black",shape="box"];12 -> 20[label="",style="solid", color="black", weight=3];
13[label="Nothing >>= Monad.liftM21 vy5 vy3",fontsize=16,color="black",shape="box"];13 -> 21[label="",style="solid", color="black", weight=3];
14[label="Just vy40 >>= Monad.liftM21 vy5 vy3",fontsize=16,color="black",shape="box"];14 -> 22[label="",style="solid", color="black", weight=3];
15[label="primbindIO (IO vy40) (Monad.liftM21 vy5 vy3)",fontsize=16,color="black",shape="box"];15 -> 23[label="",style="solid", color="black", weight=3];
16[label="primbindIO (AProVE_IO vy40) (Monad.liftM21 vy5 vy3)",fontsize=16,color="black",shape="box"];16 -> 24[label="",style="solid", color="black", weight=3];
17[label="primbindIO (AProVE_Exception vy40) (Monad.liftM21 vy5 vy3)",fontsize=16,color="black",shape="box"];17 -> 25[label="",style="solid", color="black", weight=3];
18[label="primbindIO (AProVE_Error vy40) (Monad.liftM21 vy5 vy3)",fontsize=16,color="black",shape="box"];18 -> 26[label="",style="solid", color="black", weight=3];
19 -> 27[label="",style="dashed", color="red", weight=0];
19[label="Monad.liftM21 vy5 vy3 vy40 ++ (vy41 >>= Monad.liftM21 vy5 vy3)",fontsize=16,color="magenta"];19 -> 28[label="",style="dashed", color="magenta", weight=3];
20[label="[]",fontsize=16,color="green",shape="box"];21[label="Nothing",fontsize=16,color="green",shape="box"];22[label="Monad.liftM21 vy5 vy3 vy40",fontsize=16,color="black",shape="box"];22 -> 29[label="",style="solid", color="black", weight=3];
23[label="error []",fontsize=16,color="red",shape="box"];24[label="Monad.liftM21 vy5 vy3 vy40",fontsize=16,color="black",shape="box"];24 -> 30[label="",style="solid", color="black", weight=3];
25[label="AProVE_Exception vy40",fontsize=16,color="green",shape="box"];26[label="AProVE_Error vy40",fontsize=16,color="green",shape="box"];28 -> 8[label="",style="dashed", color="red", weight=0];
28[label="vy41 >>= Monad.liftM21 vy5 vy3",fontsize=16,color="magenta"];28 -> 31[label="",style="dashed", color="magenta", weight=3];
27[label="Monad.liftM21 vy5 vy3 vy40 ++ vy6",fontsize=16,color="black",shape="triangle"];27 -> 32[label="",style="solid", color="black", weight=3];
29[label="vy5 >>= Monad.liftM20 vy3 vy40",fontsize=16,color="burlywood",shape="box"];102[label="vy5/Nothing",fontsize=10,color="white",style="solid",shape="box"];29 -> 102[label="",style="solid", color="burlywood", weight=9];
102 -> 33[label="",style="solid", color="burlywood", weight=3];
103[label="vy5/Just vy50",fontsize=10,color="white",style="solid",shape="box"];29 -> 103[label="",style="solid", color="burlywood", weight=9];
103 -> 34[label="",style="solid", color="burlywood", weight=3];
30[label="vy5 >>= Monad.liftM20 vy3 vy40",fontsize=16,color="black",shape="box"];30 -> 35[label="",style="solid", color="black", weight=3];
31[label="vy41",fontsize=16,color="green",shape="box"];32[label="(vy5 >>= Monad.liftM20 vy3 vy40) ++ vy6",fontsize=16,color="burlywood",shape="box"];104[label="vy5/vy50 : vy51",fontsize=10,color="white",style="solid",shape="box"];32 -> 104[label="",style="solid", color="burlywood", weight=9];
104 -> 36[label="",style="solid", color="burlywood", weight=3];
105[label="vy5/[]",fontsize=10,color="white",style="solid",shape="box"];32 -> 105[label="",style="solid", color="burlywood", weight=9];
105 -> 37[label="",style="solid", color="burlywood", weight=3];
33[label="Nothing >>= Monad.liftM20 vy3 vy40",fontsize=16,color="black",shape="box"];33 -> 38[label="",style="solid", color="black", weight=3];
34[label="Just vy50 >>= Monad.liftM20 vy3 vy40",fontsize=16,color="black",shape="box"];34 -> 39[label="",style="solid", color="black", weight=3];
35[label="primbindIO vy5 (Monad.liftM20 vy3 vy40)",fontsize=16,color="burlywood",shape="box"];106[label="vy5/IO vy50",fontsize=10,color="white",style="solid",shape="box"];35 -> 106[label="",style="solid", color="burlywood", weight=9];
106 -> 40[label="",style="solid", color="burlywood", weight=3];
107[label="vy5/AProVE_IO vy50",fontsize=10,color="white",style="solid",shape="box"];35 -> 107[label="",style="solid", color="burlywood", weight=9];
107 -> 41[label="",style="solid", color="burlywood", weight=3];
108[label="vy5/AProVE_Exception vy50",fontsize=10,color="white",style="solid",shape="box"];35 -> 108[label="",style="solid", color="burlywood", weight=9];
108 -> 42[label="",style="solid", color="burlywood", weight=3];
109[label="vy5/AProVE_Error vy50",fontsize=10,color="white",style="solid",shape="box"];35 -> 109[label="",style="solid", color="burlywood", weight=9];
109 -> 43[label="",style="solid", color="burlywood", weight=3];
36[label="(vy50 : vy51 >>= Monad.liftM20 vy3 vy40) ++ vy6",fontsize=16,color="black",shape="box"];36 -> 44[label="",style="solid", color="black", weight=3];
37[label="([] >>= Monad.liftM20 vy3 vy40) ++ vy6",fontsize=16,color="black",shape="box"];37 -> 45[label="",style="solid", color="black", weight=3];
38[label="Nothing",fontsize=16,color="green",shape="box"];39[label="Monad.liftM20 vy3 vy40 vy50",fontsize=16,color="black",shape="box"];39 -> 46[label="",style="solid", color="black", weight=3];
40[label="primbindIO (IO vy50) (Monad.liftM20 vy3 vy40)",fontsize=16,color="black",shape="box"];40 -> 47[label="",style="solid", color="black", weight=3];
41[label="primbindIO (AProVE_IO vy50) (Monad.liftM20 vy3 vy40)",fontsize=16,color="black",shape="box"];41 -> 48[label="",style="solid", color="black", weight=3];
42[label="primbindIO (AProVE_Exception vy50) (Monad.liftM20 vy3 vy40)",fontsize=16,color="black",shape="box"];42 -> 49[label="",style="solid", color="black", weight=3];
43[label="primbindIO (AProVE_Error vy50) (Monad.liftM20 vy3 vy40)",fontsize=16,color="black",shape="box"];43 -> 50[label="",style="solid", color="black", weight=3];
44[label="(Monad.liftM20 vy3 vy40 vy50 ++ (vy51 >>= Monad.liftM20 vy3 vy40)) ++ vy6",fontsize=16,color="black",shape="box"];44 -> 51[label="",style="solid", color="black", weight=3];
45[label="[] ++ vy6",fontsize=16,color="black",shape="triangle"];45 -> 52[label="",style="solid", color="black", weight=3];
46[label="return (vy3 vy40 vy50)",fontsize=16,color="black",shape="box"];46 -> 53[label="",style="solid", color="black", weight=3];
47[label="error []",fontsize=16,color="red",shape="box"];48[label="Monad.liftM20 vy3 vy40 vy50",fontsize=16,color="black",shape="box"];48 -> 54[label="",style="solid", color="black", weight=3];
49[label="AProVE_Exception vy50",fontsize=16,color="green",shape="box"];50[label="AProVE_Error vy50",fontsize=16,color="green",shape="box"];51[label="(return (vy3 vy40 vy50) ++ (vy51 >>= Monad.liftM20 vy3 vy40)) ++ vy6",fontsize=16,color="black",shape="box"];51 -> 55[label="",style="solid", color="black", weight=3];
52[label="vy6",fontsize=16,color="green",shape="box"];53[label="Just (vy3 vy40 vy50)",fontsize=16,color="green",shape="box"];53 -> 56[label="",style="dashed", color="green", weight=3];
54[label="return (vy3 vy40 vy50)",fontsize=16,color="black",shape="box"];54 -> 57[label="",style="solid", color="black", weight=3];
55[label="((vy3 vy40 vy50 : []) ++ (vy51 >>= Monad.liftM20 vy3 vy40)) ++ vy6",fontsize=16,color="black",shape="box"];55 -> 58[label="",style="solid", color="black", weight=3];
56[label="vy3 vy40 vy50",fontsize=16,color="green",shape="box"];56 -> 59[label="",style="dashed", color="green", weight=3];
56 -> 60[label="",style="dashed", color="green", weight=3];
57[label="primretIO (vy3 vy40 vy50)",fontsize=16,color="black",shape="box"];57 -> 61[label="",style="solid", color="black", weight=3];
58 -> 62[label="",style="dashed", color="red", weight=0];
58[label="(vy3 vy40 vy50 : [] ++ (vy51 >>= Monad.liftM20 vy3 vy40)) ++ vy6",fontsize=16,color="magenta"];58 -> 63[label="",style="dashed", color="magenta", weight=3];
59[label="vy40",fontsize=16,color="green",shape="box"];60[label="vy50",fontsize=16,color="green",shape="box"];61[label="AProVE_IO (vy3 vy40 vy50)",fontsize=16,color="green",shape="box"];61 -> 64[label="",style="dashed", color="green", weight=3];
63 -> 45[label="",style="dashed", color="red", weight=0];
63[label="[] ++ (vy51 >>= Monad.liftM20 vy3 vy40)",fontsize=16,color="magenta"];63 -> 65[label="",style="dashed", color="magenta", weight=3];
62[label="(vy3 vy40 vy50 : vy7) ++ vy6",fontsize=16,color="black",shape="triangle"];62 -> 66[label="",style="solid", color="black", weight=3];
64[label="vy3 vy40 vy50",fontsize=16,color="green",shape="box"];64 -> 67[label="",style="dashed", color="green", weight=3];
64 -> 68[label="",style="dashed", color="green", weight=3];
65[label="vy51 >>= Monad.liftM20 vy3 vy40",fontsize=16,color="burlywood",shape="triangle"];110[label="vy51/vy510 : vy511",fontsize=10,color="white",style="solid",shape="box"];65 -> 110[label="",style="solid", color="burlywood", weight=9];
110 -> 69[label="",style="solid", color="burlywood", weight=3];
111[label="vy51/[]",fontsize=10,color="white",style="solid",shape="box"];65 -> 111[label="",style="solid", color="burlywood", weight=9];
111 -> 70[label="",style="solid", color="burlywood", weight=3];
66[label="vy3 vy40 vy50 : vy7 ++ vy6",fontsize=16,color="green",shape="box"];66 -> 71[label="",style="dashed", color="green", weight=3];
66 -> 72[label="",style="dashed", color="green", weight=3];
67[label="vy40",fontsize=16,color="green",shape="box"];68[label="vy50",fontsize=16,color="green",shape="box"];69[label="vy510 : vy511 >>= Monad.liftM20 vy3 vy40",fontsize=16,color="black",shape="box"];69 -> 73[label="",style="solid", color="black", weight=3];
70[label="[] >>= Monad.liftM20 vy3 vy40",fontsize=16,color="black",shape="box"];70 -> 74[label="",style="solid", color="black", weight=3];
71[label="vy3 vy40 vy50",fontsize=16,color="green",shape="box"];71 -> 75[label="",style="dashed", color="green", weight=3];
71 -> 76[label="",style="dashed", color="green", weight=3];
72[label="vy7 ++ vy6",fontsize=16,color="burlywood",shape="triangle"];112[label="vy7/vy70 : vy71",fontsize=10,color="white",style="solid",shape="box"];72 -> 112[label="",style="solid", color="burlywood", weight=9];
112 -> 77[label="",style="solid", color="burlywood", weight=3];
113[label="vy7/[]",fontsize=10,color="white",style="solid",shape="box"];72 -> 113[label="",style="solid", color="burlywood", weight=9];
113 -> 78[label="",style="solid", color="burlywood", weight=3];
73 -> 72[label="",style="dashed", color="red", weight=0];
73[label="Monad.liftM20 vy3 vy40 vy510 ++ (vy511 >>= Monad.liftM20 vy3 vy40)",fontsize=16,color="magenta"];73 -> 79[label="",style="dashed", color="magenta", weight=3];
73 -> 80[label="",style="dashed", color="magenta", weight=3];
74[label="[]",fontsize=16,color="green",shape="box"];75[label="vy40",fontsize=16,color="green",shape="box"];76[label="vy50",fontsize=16,color="green",shape="box"];77[label="(vy70 : vy71) ++ vy6",fontsize=16,color="black",shape="box"];77 -> 81[label="",style="solid", color="black", weight=3];
78[label="[] ++ vy6",fontsize=16,color="black",shape="box"];78 -> 82[label="",style="solid", color="black", weight=3];
79[label="Monad.liftM20 vy3 vy40 vy510",fontsize=16,color="black",shape="box"];79 -> 83[label="",style="solid", color="black", weight=3];
80 -> 65[label="",style="dashed", color="red", weight=0];
80[label="vy511 >>= Monad.liftM20 vy3 vy40",fontsize=16,color="magenta"];80 -> 84[label="",style="dashed", color="magenta", weight=3];
81[label="vy70 : vy71 ++ vy6",fontsize=16,color="green",shape="box"];81 -> 85[label="",style="dashed", color="green", weight=3];
82[label="vy6",fontsize=16,color="green",shape="box"];83[label="return (vy3 vy40 vy510)",fontsize=16,color="black",shape="box"];83 -> 86[label="",style="solid", color="black", weight=3];
84[label="vy511",fontsize=16,color="green",shape="box"];85 -> 72[label="",style="dashed", color="red", weight=0];
85[label="vy71 ++ vy6",fontsize=16,color="magenta"];85 -> 87[label="",style="dashed", color="magenta", weight=3];
86[label="vy3 vy40 vy510 : []",fontsize=16,color="green",shape="box"];86 -> 88[label="",style="dashed", color="green", weight=3];
87[label="vy71",fontsize=16,color="green",shape="box"];88[label="vy3 vy40 vy510",fontsize=16,color="green",shape="box"];88 -> 89[label="",style="dashed", color="green", weight=3];
88 -> 90[label="",style="dashed", color="green", weight=3];
89[label="vy40",fontsize=16,color="green",shape="box"];90[label="vy510",fontsize=16,color="green",shape="box"];}

----------------------------------------

(8)
Complex Obligation (AND)

----------------------------------------

(9)
Obligation:
Q DP problem:
The TRS P consists of the following rules:

   new_gtGtEs0(:(vy40, vy41), vy5, vy3, h, ba, bb) -> new_gtGtEs0(vy41, vy5, vy3, h, ba, bb)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
----------------------------------------

(10) QDPSizeChangeProof (EQUIVALENT)
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. 

From the DPs we obtained the following set of size-change graphs:
*new_gtGtEs0(:(vy40, vy41), vy5, vy3, h, ba, bb) -> new_gtGtEs0(vy41, vy5, vy3, h, ba, bb)
The graph contains the following edges 1 > 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6


----------------------------------------

(11)
YES

----------------------------------------

(12)
Obligation:
Q DP problem:
The TRS P consists of the following rules:

   new_gtGtEs(:(vy510, vy511), vy3, vy40, h, ba, bb) -> new_gtGtEs(vy511, vy3, vy40, h, ba, bb)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
----------------------------------------

(13) QDPSizeChangeProof (EQUIVALENT)
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. 

From the DPs we obtained the following set of size-change graphs:
*new_gtGtEs(:(vy510, vy511), vy3, vy40, h, ba, bb) -> new_gtGtEs(vy511, vy3, vy40, h, ba, bb)
The graph contains the following edges 1 > 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6


----------------------------------------

(14)
YES

----------------------------------------

(15)
Obligation:
Q DP problem:
The TRS P consists of the following rules:

   new_psPs(:(vy70, vy71), vy6, h) -> new_psPs(vy71, vy6, h)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
----------------------------------------

(16) QDPSizeChangeProof (EQUIVALENT)
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. 

From the DPs we obtained the following set of size-change graphs:
*new_psPs(:(vy70, vy71), vy6, h) -> new_psPs(vy71, vy6, h)
The graph contains the following edges 1 > 1, 2 >= 2, 3 >= 3


----------------------------------------

(17)
YES