Left Termination proof of /tmp/tmpbkABnb/sum.pl

Left Termination of the query pattern sum(b,b,f) w.r.t. the given Prolog program could successfully be proven:

↳ PROLOG

  ↳ PrologToPiTRSProof

sum₃({}₀, {}₀, {}₀).
sum₃(.₂(X1, Y1), .₂(X2, Y2), .₂(X3, Y3)) :- add₃(X1, X2, X3), sum₃(Y1, Y2, Y3).
add₃(0₀, X, X).
add₃(s₁(X), Y, s₁(Z)) :- add₃(X, Y, Z).

With regard to the inferred argument filtering the predicates were used in the following modes:
sum₃: (b,b,f)
add₃: (b,b,f)
Transforming PROLOG into the following Term Rewriting System:
Pi-finite rewrite system:
The TRS R consists of the following rules:

sum_3_in_gga₃([]_0, []_0, []_0) -> sum_3_out_gga₃([]_0, []_0, []_0)
sum_3_in_gga₃(._2₂(X1, Y1), ._2₂(X2, Y2), ._2₂(X3, Y3)) -> if_sum_3_in_1_gga₇(X1, Y1, X2, Y2, X3, Y3, add_3_in_gga₃(X1, X2, X3))
add_3_in_gga₃(0_0, X, X) -> add_3_out_gga₃(0_0, X, X)
add_3_in_gga₃(s_1₁(X), Y, s_1₁(Z)) -> if_add_3_in_1_gga₄(X, Y, Z, add_3_in_gga₃(X, Y, Z))
if_add_3_in_1_gga₄(X, Y, Z, add_3_out_gga₃(X, Y, Z)) -> add_3_out_gga₃(s_1₁(X), Y, s_1₁(Z))
if_sum_3_in_1_gga₇(X1, Y1, X2, Y2, X3, Y3, add_3_out_gga₃(X1, X2, X3)) -> if_sum_3_in_2_gga₇(X1, Y1, X2, Y2, X3, Y3, sum_3_in_gga₃(Y1, Y2, Y3))
if_sum_3_in_2_gga₇(X1, Y1, X2, Y2, X3, Y3, sum_3_out_gga₃(Y1, Y2, Y3)) -> sum_3_out_gga₃(._2₂(X1, Y1), ._2₂(X2, Y2), ._2₂(X3, Y3))

Infinitary Constructor Rewriting Termination of PiTRS implies Termination of PROLOG

↳ PROLOG

  ↳ PrologToPiTRSProof

    ↳ PiTRS

      ↳ DependencyPairsProof

Pi-finite rewrite system:
The TRS R consists of the following rules:

sum_3_in_gga₃([]_0, []_0, []_0) -> sum_3_out_gga₃([]_0, []_0, []_0)
sum_3_in_gga₃(._2₂(X1, Y1), ._2₂(X2, Y2), ._2₂(X3, Y3)) -> if_sum_3_in_1_gga₇(X1, Y1, X2, Y2, X3, Y3, add_3_in_gga₃(X1, X2, X3))
add_3_in_gga₃(0_0, X, X) -> add_3_out_gga₃(0_0, X, X)
add_3_in_gga₃(s_1₁(X), Y, s_1₁(Z)) -> if_add_3_in_1_gga₄(X, Y, Z, add_3_in_gga₃(X, Y, Z))
if_add_3_in_1_gga₄(X, Y, Z, add_3_out_gga₃(X, Y, Z)) -> add_3_out_gga₃(s_1₁(X), Y, s_1₁(Z))
if_sum_3_in_1_gga₇(X1, Y1, X2, Y2, X3, Y3, add_3_out_gga₃(X1, X2, X3)) -> if_sum_3_in_2_gga₇(X1, Y1, X2, Y2, X3, Y3, sum_3_in_gga₃(Y1, Y2, Y3))
if_sum_3_in_2_gga₇(X1, Y1, X2, Y2, X3, Y3, sum_3_out_gga₃(Y1, Y2, Y3)) -> sum_3_out_gga₃(._2₂(X1, Y1), ._2₂(X2, Y2), ._2₂(X3, Y3))

SUM_3_IN_GGA₃(._2₂(X1, Y1), ._2₂(X2, Y2), ._2₂(X3, Y3)) -> IF_SUM_3_IN_1_GGA₇(X1, Y1, X2, Y2, X3, Y3, add_3_in_gga₃(X1, X2, X3))
SUM_3_IN_GGA₃(._2₂(X1, Y1), ._2₂(X2, Y2), ._2₂(X3, Y3)) -> ADD_3_IN_GGA₃(X1, X2, X3)
ADD_3_IN_GGA₃(s_1₁(X), Y, s_1₁(Z)) -> IF_ADD_3_IN_1_GGA₄(X, Y, Z, add_3_in_gga₃(X, Y, Z))
ADD_3_IN_GGA₃(s_1₁(X), Y, s_1₁(Z)) -> ADD_3_IN_GGA₃(X, Y, Z)
IF_SUM_3_IN_1_GGA₇(X1, Y1, X2, Y2, X3, Y3, add_3_out_gga₃(X1, X2, X3)) -> IF_SUM_3_IN_2_GGA₇(X1, Y1, X2, Y2, X3, Y3, sum_3_in_gga₃(Y1, Y2, Y3))
IF_SUM_3_IN_1_GGA₇(X1, Y1, X2, Y2, X3, Y3, add_3_out_gga₃(X1, X2, X3)) -> SUM_3_IN_GGA₃(Y1, Y2, Y3)

The TRS R consists of the following rules:

sum_3_in_gga₃([]_0, []_0, []_0) -> sum_3_out_gga₃([]_0, []_0, []_0)
sum_3_in_gga₃(._2₂(X1, Y1), ._2₂(X2, Y2), ._2₂(X3, Y3)) -> if_sum_3_in_1_gga₇(X1, Y1, X2, Y2, X3, Y3, add_3_in_gga₃(X1, X2, X3))
add_3_in_gga₃(0_0, X, X) -> add_3_out_gga₃(0_0, X, X)
add_3_in_gga₃(s_1₁(X), Y, s_1₁(Z)) -> if_add_3_in_1_gga₄(X, Y, Z, add_3_in_gga₃(X, Y, Z))
if_add_3_in_1_gga₄(X, Y, Z, add_3_out_gga₃(X, Y, Z)) -> add_3_out_gga₃(s_1₁(X), Y, s_1₁(Z))
if_sum_3_in_1_gga₇(X1, Y1, X2, Y2, X3, Y3, add_3_out_gga₃(X1, X2, X3)) -> if_sum_3_in_2_gga₇(X1, Y1, X2, Y2, X3, Y3, sum_3_in_gga₃(Y1, Y2, Y3))
if_sum_3_in_2_gga₇(X1, Y1, X2, Y2, X3, Y3, sum_3_out_gga₃(Y1, Y2, Y3)) -> sum_3_out_gga₃(._2₂(X1, Y1), ._2₂(X2, Y2), ._2₂(X3, Y3))

The argument filtering Pi contains the following mapping:
sum_3_in_gga₃(x1, x2, x3) = sum_3_in_gga₂(x1, x2)
[]_0 = []_0
._2₂(x1, x2) = ._2₂(x1, x2)
0_0 = 0_0
s_1₁(x1) = s_1₁(x1)
sum_3_out_gga₃(x1, x2, x3) = sum_3_out_gga₁(x3)
if_sum_3_in_1_gga₇(x1, x2, x3, x4, x5, x6, x7) = if_sum_3_in_1_gga₃(x2, x4, x7)
add_3_in_gga₃(x1, x2, x3) = add_3_in_gga₂(x1, x2)
add_3_out_gga₃(x1, x2, x3) = add_3_out_gga₁(x3)
if_add_3_in_1_gga₄(x1, x2, x3, x4) = if_add_3_in_1_gga₁(x4)
if_sum_3_in_2_gga₇(x1, x2, x3, x4, x5, x6, x7) = if_sum_3_in_2_gga₂(x5, x7)
IF_ADD_3_IN_1_GGA₄(x1, x2, x3, x4) = IF_ADD_3_IN_1_GGA₁(x4)
SUM_3_IN_GGA₃(x1, x2, x3) = SUM_3_IN_GGA₂(x1, x2)
IF_SUM_3_IN_2_GGA₇(x1, x2, x3, x4, x5, x6, x7) = IF_SUM_3_IN_2_GGA₂(x5, x7)
ADD_3_IN_GGA₃(x1, x2, x3) = ADD_3_IN_GGA₂(x1, x2)
IF_SUM_3_IN_1_GGA₇(x1, x2, x3, x4, x5, x6, x7) = IF_SUM_3_IN_1_GGA₃(x2, x4, x7)

We have to consider all (P,R,Pi)-chains

↳ PROLOG

  ↳ PrologToPiTRSProof

    ↳ PiTRS

      ↳ DependencyPairsProof

        ↳ PiDP

          ↳ DependencyGraphProof

Pi DP problem:
The TRS P consists of the following rules:

SUM_3_IN_GGA₃(._2₂(X1, Y1), ._2₂(X2, Y2), ._2₂(X3, Y3)) -> IF_SUM_3_IN_1_GGA₇(X1, Y1, X2, Y2, X3, Y3, add_3_in_gga₃(X1, X2, X3))
SUM_3_IN_GGA₃(._2₂(X1, Y1), ._2₂(X2, Y2), ._2₂(X3, Y3)) -> ADD_3_IN_GGA₃(X1, X2, X3)
ADD_3_IN_GGA₃(s_1₁(X), Y, s_1₁(Z)) -> IF_ADD_3_IN_1_GGA₄(X, Y, Z, add_3_in_gga₃(X, Y, Z))
ADD_3_IN_GGA₃(s_1₁(X), Y, s_1₁(Z)) -> ADD_3_IN_GGA₃(X, Y, Z)
IF_SUM_3_IN_1_GGA₇(X1, Y1, X2, Y2, X3, Y3, add_3_out_gga₃(X1, X2, X3)) -> IF_SUM_3_IN_2_GGA₇(X1, Y1, X2, Y2, X3, Y3, sum_3_in_gga₃(Y1, Y2, Y3))
IF_SUM_3_IN_1_GGA₇(X1, Y1, X2, Y2, X3, Y3, add_3_out_gga₃(X1, X2, X3)) -> SUM_3_IN_GGA₃(Y1, Y2, Y3)

The TRS R consists of the following rules:

sum_3_in_gga₃([]_0, []_0, []_0) -> sum_3_out_gga₃([]_0, []_0, []_0)
sum_3_in_gga₃(._2₂(X1, Y1), ._2₂(X2, Y2), ._2₂(X3, Y3)) -> if_sum_3_in_1_gga₇(X1, Y1, X2, Y2, X3, Y3, add_3_in_gga₃(X1, X2, X3))
add_3_in_gga₃(0_0, X, X) -> add_3_out_gga₃(0_0, X, X)
add_3_in_gga₃(s_1₁(X), Y, s_1₁(Z)) -> if_add_3_in_1_gga₄(X, Y, Z, add_3_in_gga₃(X, Y, Z))
if_add_3_in_1_gga₄(X, Y, Z, add_3_out_gga₃(X, Y, Z)) -> add_3_out_gga₃(s_1₁(X), Y, s_1₁(Z))
if_sum_3_in_1_gga₇(X1, Y1, X2, Y2, X3, Y3, add_3_out_gga₃(X1, X2, X3)) -> if_sum_3_in_2_gga₇(X1, Y1, X2, Y2, X3, Y3, sum_3_in_gga₃(Y1, Y2, Y3))
if_sum_3_in_2_gga₇(X1, Y1, X2, Y2, X3, Y3, sum_3_out_gga₃(Y1, Y2, Y3)) -> sum_3_out_gga₃(._2₂(X1, Y1), ._2₂(X2, Y2), ._2₂(X3, Y3))

↳ PROLOG

  ↳ PrologToPiTRSProof

    ↳ PiTRS

      ↳ DependencyPairsProof

        ↳ PiDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ PiDP

                ↳ UsableRulesProof

              ↳ PiDP

Pi DP problem:
The TRS P consists of the following rules:

ADD_3_IN_GGA₃(s_1₁(X), Y, s_1₁(Z)) -> ADD_3_IN_GGA₃(X, Y, Z)

The TRS R consists of the following rules:

sum_3_in_gga₃([]_0, []_0, []_0) -> sum_3_out_gga₃([]_0, []_0, []_0)
sum_3_in_gga₃(._2₂(X1, Y1), ._2₂(X2, Y2), ._2₂(X3, Y3)) -> if_sum_3_in_1_gga₇(X1, Y1, X2, Y2, X3, Y3, add_3_in_gga₃(X1, X2, X3))
add_3_in_gga₃(0_0, X, X) -> add_3_out_gga₃(0_0, X, X)
add_3_in_gga₃(s_1₁(X), Y, s_1₁(Z)) -> if_add_3_in_1_gga₄(X, Y, Z, add_3_in_gga₃(X, Y, Z))
if_add_3_in_1_gga₄(X, Y, Z, add_3_out_gga₃(X, Y, Z)) -> add_3_out_gga₃(s_1₁(X), Y, s_1₁(Z))
if_sum_3_in_1_gga₇(X1, Y1, X2, Y2, X3, Y3, add_3_out_gga₃(X1, X2, X3)) -> if_sum_3_in_2_gga₇(X1, Y1, X2, Y2, X3, Y3, sum_3_in_gga₃(Y1, Y2, Y3))
if_sum_3_in_2_gga₇(X1, Y1, X2, Y2, X3, Y3, sum_3_out_gga₃(Y1, Y2, Y3)) -> sum_3_out_gga₃(._2₂(X1, Y1), ._2₂(X2, Y2), ._2₂(X3, Y3))

The argument filtering Pi contains the following mapping:
sum_3_in_gga₃(x1, x2, x3) = sum_3_in_gga₂(x1, x2)
[]_0 = []_0
._2₂(x1, x2) = ._2₂(x1, x2)
0_0 = 0_0
s_1₁(x1) = s_1₁(x1)
sum_3_out_gga₃(x1, x2, x3) = sum_3_out_gga₁(x3)
if_sum_3_in_1_gga₇(x1, x2, x3, x4, x5, x6, x7) = if_sum_3_in_1_gga₃(x2, x4, x7)
add_3_in_gga₃(x1, x2, x3) = add_3_in_gga₂(x1, x2)
add_3_out_gga₃(x1, x2, x3) = add_3_out_gga₁(x3)
if_add_3_in_1_gga₄(x1, x2, x3, x4) = if_add_3_in_1_gga₁(x4)
if_sum_3_in_2_gga₇(x1, x2, x3, x4, x5, x6, x7) = if_sum_3_in_2_gga₂(x5, x7)
ADD_3_IN_GGA₃(x1, x2, x3) = ADD_3_IN_GGA₂(x1, x2)

We have to consider all (P,R,Pi)-chains
For (infinitary) constructor rewriting we can delete all non-usable rules from R.

↳ PROLOG

  ↳ PrologToPiTRSProof

    ↳ PiTRS

      ↳ DependencyPairsProof

        ↳ PiDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ PiDP

                ↳ UsableRulesProof

                  ↳ PiDP

                    ↳ PiDPToQDPProof

              ↳ PiDP

Pi DP problem:
The TRS P consists of the following rules:

ADD_3_IN_GGA₃(s_1₁(X), Y, s_1₁(Z)) -> ADD_3_IN_GGA₃(X, Y, Z)

R is empty.
The argument filtering Pi contains the following mapping:
s_1₁(x1) = s_1₁(x1)
ADD_3_IN_GGA₃(x1, x2, x3) = ADD_3_IN_GGA₂(x1, x2)

We have to consider all (P,R,Pi)-chains
Transforming (infinitary) constructor rewriting Pi-DP problem into ordinary QDP problem by application of Pi.

↳ PROLOG

  ↳ PrologToPiTRSProof

    ↳ PiTRS

      ↳ DependencyPairsProof

        ↳ PiDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ PiDP

                ↳ UsableRulesProof

                  ↳ PiDP

                    ↳ PiDPToQDPProof

                      ↳ QDP

                        ↳ QDPSizeChangeProof

              ↳ PiDP

Q DP problem:
The TRS P consists of the following rules:

ADD_3_IN_GGA₂(s_1₁(X), Y) -> ADD_3_IN_GGA₂(X, Y)

R is empty.
Q is empty.
We have to consider all (P,Q,R)-chains.
The head symbols of this DP problem are {ADD_3_IN_GGA₂}.
By using the subterm criterion together with the size-change analysis 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:

ADD_3_IN_GGA₂(s_1₁(X), Y) -> ADD_3_IN_GGA₂(X, Y)
The graph contains the following edges 1 > 1, 2 >= 2

↳ PROLOG

  ↳ PrologToPiTRSProof

    ↳ PiTRS

      ↳ DependencyPairsProof

        ↳ PiDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ PiDP

              ↳ PiDP

                ↳ UsableRulesProof

Pi DP problem:
The TRS P consists of the following rules:

IF_SUM_3_IN_1_GGA₇(X1, Y1, X2, Y2, X3, Y3, add_3_out_gga₃(X1, X2, X3)) -> SUM_3_IN_GGA₃(Y1, Y2, Y3)
SUM_3_IN_GGA₃(._2₂(X1, Y1), ._2₂(X2, Y2), ._2₂(X3, Y3)) -> IF_SUM_3_IN_1_GGA₇(X1, Y1, X2, Y2, X3, Y3, add_3_in_gga₃(X1, X2, X3))

The TRS R consists of the following rules:

sum_3_in_gga₃([]_0, []_0, []_0) -> sum_3_out_gga₃([]_0, []_0, []_0)
sum_3_in_gga₃(._2₂(X1, Y1), ._2₂(X2, Y2), ._2₂(X3, Y3)) -> if_sum_3_in_1_gga₇(X1, Y1, X2, Y2, X3, Y3, add_3_in_gga₃(X1, X2, X3))
add_3_in_gga₃(0_0, X, X) -> add_3_out_gga₃(0_0, X, X)
add_3_in_gga₃(s_1₁(X), Y, s_1₁(Z)) -> if_add_3_in_1_gga₄(X, Y, Z, add_3_in_gga₃(X, Y, Z))
if_add_3_in_1_gga₄(X, Y, Z, add_3_out_gga₃(X, Y, Z)) -> add_3_out_gga₃(s_1₁(X), Y, s_1₁(Z))
if_sum_3_in_1_gga₇(X1, Y1, X2, Y2, X3, Y3, add_3_out_gga₃(X1, X2, X3)) -> if_sum_3_in_2_gga₇(X1, Y1, X2, Y2, X3, Y3, sum_3_in_gga₃(Y1, Y2, Y3))
if_sum_3_in_2_gga₇(X1, Y1, X2, Y2, X3, Y3, sum_3_out_gga₃(Y1, Y2, Y3)) -> sum_3_out_gga₃(._2₂(X1, Y1), ._2₂(X2, Y2), ._2₂(X3, Y3))

The argument filtering Pi contains the following mapping:
sum_3_in_gga₃(x1, x2, x3) = sum_3_in_gga₂(x1, x2)
[]_0 = []_0
._2₂(x1, x2) = ._2₂(x1, x2)
0_0 = 0_0
s_1₁(x1) = s_1₁(x1)
sum_3_out_gga₃(x1, x2, x3) = sum_3_out_gga₁(x3)
if_sum_3_in_1_gga₇(x1, x2, x3, x4, x5, x6, x7) = if_sum_3_in_1_gga₃(x2, x4, x7)
add_3_in_gga₃(x1, x2, x3) = add_3_in_gga₂(x1, x2)
add_3_out_gga₃(x1, x2, x3) = add_3_out_gga₁(x3)
if_add_3_in_1_gga₄(x1, x2, x3, x4) = if_add_3_in_1_gga₁(x4)
if_sum_3_in_2_gga₇(x1, x2, x3, x4, x5, x6, x7) = if_sum_3_in_2_gga₂(x5, x7)
SUM_3_IN_GGA₃(x1, x2, x3) = SUM_3_IN_GGA₂(x1, x2)
IF_SUM_3_IN_1_GGA₇(x1, x2, x3, x4, x5, x6, x7) = IF_SUM_3_IN_1_GGA₃(x2, x4, x7)

We have to consider all (P,R,Pi)-chains
For (infinitary) constructor rewriting we can delete all non-usable rules from R.

↳ PROLOG

  ↳ PrologToPiTRSProof

    ↳ PiTRS

      ↳ DependencyPairsProof

        ↳ PiDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ PiDP

              ↳ PiDP

                ↳ UsableRulesProof

                  ↳ PiDP

                    ↳ PiDPToQDPProof

Pi DP problem:
The TRS P consists of the following rules:

IF_SUM_3_IN_1_GGA₇(X1, Y1, X2, Y2, X3, Y3, add_3_out_gga₃(X1, X2, X3)) -> SUM_3_IN_GGA₃(Y1, Y2, Y3)
SUM_3_IN_GGA₃(._2₂(X1, Y1), ._2₂(X2, Y2), ._2₂(X3, Y3)) -> IF_SUM_3_IN_1_GGA₇(X1, Y1, X2, Y2, X3, Y3, add_3_in_gga₃(X1, X2, X3))

The TRS R consists of the following rules:

add_3_in_gga₃(0_0, X, X) -> add_3_out_gga₃(0_0, X, X)
add_3_in_gga₃(s_1₁(X), Y, s_1₁(Z)) -> if_add_3_in_1_gga₄(X, Y, Z, add_3_in_gga₃(X, Y, Z))
if_add_3_in_1_gga₄(X, Y, Z, add_3_out_gga₃(X, Y, Z)) -> add_3_out_gga₃(s_1₁(X), Y, s_1₁(Z))

The argument filtering Pi contains the following mapping:
._2₂(x1, x2) = ._2₂(x1, x2)
0_0 = 0_0
s_1₁(x1) = s_1₁(x1)
add_3_in_gga₃(x1, x2, x3) = add_3_in_gga₂(x1, x2)
add_3_out_gga₃(x1, x2, x3) = add_3_out_gga₁(x3)
if_add_3_in_1_gga₄(x1, x2, x3, x4) = if_add_3_in_1_gga₁(x4)
SUM_3_IN_GGA₃(x1, x2, x3) = SUM_3_IN_GGA₂(x1, x2)
IF_SUM_3_IN_1_GGA₇(x1, x2, x3, x4, x5, x6, x7) = IF_SUM_3_IN_1_GGA₃(x2, x4, x7)

We have to consider all (P,R,Pi)-chains
Transforming (infinitary) constructor rewriting Pi-DP problem into ordinary QDP problem by application of Pi.

↳ PROLOG

  ↳ PrologToPiTRSProof

    ↳ PiTRS

      ↳ DependencyPairsProof

        ↳ PiDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ PiDP

              ↳ PiDP

                ↳ UsableRulesProof

                  ↳ PiDP

                    ↳ PiDPToQDPProof

                      ↳ QDP

                        ↳ QDPSizeChangeProof

Q DP problem:
The TRS P consists of the following rules:

IF_SUM_3_IN_1_GGA₃(Y1, Y2, add_3_out_gga₁(X3)) -> SUM_3_IN_GGA₂(Y1, Y2)
SUM_3_IN_GGA₂(._2₂(X1, Y1), ._2₂(X2, Y2)) -> IF_SUM_3_IN_1_GGA₃(Y1, Y2, add_3_in_gga₂(X1, X2))

The TRS R consists of the following rules:

add_3_in_gga₂(0_0, X) -> add_3_out_gga₁(X)
add_3_in_gga₂(s_1₁(X), Y) -> if_add_3_in_1_gga₁(add_3_in_gga₂(X, Y))
if_add_3_in_1_gga₁(add_3_out_gga₁(Z)) -> add_3_out_gga₁(s_1₁(Z))

The set Q consists of the following terms:

add_3_in_gga₂(x0, x1)
if_add_3_in_1_gga₁(x0)

We have to consider all (P,Q,R)-chains.
The head symbols of this DP problem are {SUM_3_IN_GGA₂, IF_SUM_3_IN_1_GGA₃}.
By using the subterm criterion together with the size-change analysis 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:

SUM_3_IN_GGA₂(._2₂(X1, Y1), ._2₂(X2, Y2)) -> IF_SUM_3_IN_1_GGA₃(Y1, Y2, add_3_in_gga₂(X1, X2))
The graph contains the following edges 1 > 1, 2 > 2
IF_SUM_3_IN_1_GGA₃(Y1, Y2, add_3_out_gga₁(X3)) -> SUM_3_IN_GGA₂(Y1, Y2)
The graph contains the following edges 1 >= 1, 2 >= 2