(0) Obligation:

Clauses:

p(M, N, s(R), RES) :- p(M, R, N, RES).
p(M, s(N), R, RES) :- p(R, N, M, RES).
p(M, X1, X2, M).

Query: p(g,g,g,a)

(1) PrologToPiTRSViaGraphTransformerProof (SOUND transformation)

Transformed Prolog program to (Pi-)TRS.

(2) Obligation:

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

pA_in_ggga(T30, s(T32), s(T31), T34) → U1_ggga(T30, T32, T31, T34, pA_in_ggga(T30, T32, T31, T34))
pA_in_ggga(T55, T57, s(s(T56)), T59) → U2_ggga(T55, T57, T56, T59, pA_in_ggga(T57, T56, T55, T59))
pA_in_ggga(T76, T78, s(T77), T76) → pA_out_ggga(T76, T78, s(T77), T76)
pA_in_ggga(T95, s(T96), s(T97), T99) → U3_ggga(T95, T96, T97, T99, pA_in_ggga(s(T97), T96, T95, T99))
pA_in_ggga(s(T140), s(T139), T138, T142) → U4_ggga(T140, T139, T138, T142, pA_in_ggga(T138, T140, T139, T142))
pA_in_ggga(T165, s(s(T164)), T163, T167) → U5_ggga(T165, T164, T163, T167, pA_in_ggga(T165, T164, T163, T167))
pA_in_ggga(T190, s(T189), T188, T188) → pA_out_ggga(T190, s(T189), T188, T188)
pA_in_ggga(T197, s(T198), T199, T197) → pA_out_ggga(T197, s(T198), T199, T197)
pA_in_ggga(T203, T204, T205, T203) → pA_out_ggga(T203, T204, T205, T203)
U5_ggga(T165, T164, T163, T167, pA_out_ggga(T165, T164, T163, T167)) → pA_out_ggga(T165, s(s(T164)), T163, T167)
U4_ggga(T140, T139, T138, T142, pA_out_ggga(T138, T140, T139, T142)) → pA_out_ggga(s(T140), s(T139), T138, T142)
U3_ggga(T95, T96, T97, T99, pA_out_ggga(s(T97), T96, T95, T99)) → pA_out_ggga(T95, s(T96), s(T97), T99)
U2_ggga(T55, T57, T56, T59, pA_out_ggga(T57, T56, T55, T59)) → pA_out_ggga(T55, T57, s(s(T56)), T59)
U1_ggga(T30, T32, T31, T34, pA_out_ggga(T30, T32, T31, T34)) → pA_out_ggga(T30, s(T32), s(T31), T34)

The argument filtering Pi contains the following mapping:
pA_in_ggga(x1, x2, x3, x4)  =  pA_in_ggga(x1, x2, x3)
s(x1)  =  s(x1)
U1_ggga(x1, x2, x3, x4, x5)  =  U1_ggga(x1, x2, x3, x5)
U2_ggga(x1, x2, x3, x4, x5)  =  U2_ggga(x1, x2, x3, x5)
pA_out_ggga(x1, x2, x3, x4)  =  pA_out_ggga(x1, x2, x3, x4)
U3_ggga(x1, x2, x3, x4, x5)  =  U3_ggga(x1, x2, x3, x5)
U4_ggga(x1, x2, x3, x4, x5)  =  U4_ggga(x1, x2, x3, x5)
U5_ggga(x1, x2, x3, x4, x5)  =  U5_ggga(x1, x2, x3, x5)

(3) DependencyPairsProof (EQUIVALENT transformation)

Using Dependency Pairs [AG00,LOPSTR] we result in the following initial DP problem:
Pi DP problem:
The TRS P consists of the following rules:

PA_IN_GGGA(T30, s(T32), s(T31), T34) → U1_GGGA(T30, T32, T31, T34, pA_in_ggga(T30, T32, T31, T34))
PA_IN_GGGA(T30, s(T32), s(T31), T34) → PA_IN_GGGA(T30, T32, T31, T34)
PA_IN_GGGA(T55, T57, s(s(T56)), T59) → U2_GGGA(T55, T57, T56, T59, pA_in_ggga(T57, T56, T55, T59))
PA_IN_GGGA(T55, T57, s(s(T56)), T59) → PA_IN_GGGA(T57, T56, T55, T59)
PA_IN_GGGA(T95, s(T96), s(T97), T99) → U3_GGGA(T95, T96, T97, T99, pA_in_ggga(s(T97), T96, T95, T99))
PA_IN_GGGA(T95, s(T96), s(T97), T99) → PA_IN_GGGA(s(T97), T96, T95, T99)
PA_IN_GGGA(s(T140), s(T139), T138, T142) → U4_GGGA(T140, T139, T138, T142, pA_in_ggga(T138, T140, T139, T142))
PA_IN_GGGA(s(T140), s(T139), T138, T142) → PA_IN_GGGA(T138, T140, T139, T142)
PA_IN_GGGA(T165, s(s(T164)), T163, T167) → U5_GGGA(T165, T164, T163, T167, pA_in_ggga(T165, T164, T163, T167))
PA_IN_GGGA(T165, s(s(T164)), T163, T167) → PA_IN_GGGA(T165, T164, T163, T167)

The TRS R consists of the following rules:

pA_in_ggga(T30, s(T32), s(T31), T34) → U1_ggga(T30, T32, T31, T34, pA_in_ggga(T30, T32, T31, T34))
pA_in_ggga(T55, T57, s(s(T56)), T59) → U2_ggga(T55, T57, T56, T59, pA_in_ggga(T57, T56, T55, T59))
pA_in_ggga(T76, T78, s(T77), T76) → pA_out_ggga(T76, T78, s(T77), T76)
pA_in_ggga(T95, s(T96), s(T97), T99) → U3_ggga(T95, T96, T97, T99, pA_in_ggga(s(T97), T96, T95, T99))
pA_in_ggga(s(T140), s(T139), T138, T142) → U4_ggga(T140, T139, T138, T142, pA_in_ggga(T138, T140, T139, T142))
pA_in_ggga(T165, s(s(T164)), T163, T167) → U5_ggga(T165, T164, T163, T167, pA_in_ggga(T165, T164, T163, T167))
pA_in_ggga(T190, s(T189), T188, T188) → pA_out_ggga(T190, s(T189), T188, T188)
pA_in_ggga(T197, s(T198), T199, T197) → pA_out_ggga(T197, s(T198), T199, T197)
pA_in_ggga(T203, T204, T205, T203) → pA_out_ggga(T203, T204, T205, T203)
U5_ggga(T165, T164, T163, T167, pA_out_ggga(T165, T164, T163, T167)) → pA_out_ggga(T165, s(s(T164)), T163, T167)
U4_ggga(T140, T139, T138, T142, pA_out_ggga(T138, T140, T139, T142)) → pA_out_ggga(s(T140), s(T139), T138, T142)
U3_ggga(T95, T96, T97, T99, pA_out_ggga(s(T97), T96, T95, T99)) → pA_out_ggga(T95, s(T96), s(T97), T99)
U2_ggga(T55, T57, T56, T59, pA_out_ggga(T57, T56, T55, T59)) → pA_out_ggga(T55, T57, s(s(T56)), T59)
U1_ggga(T30, T32, T31, T34, pA_out_ggga(T30, T32, T31, T34)) → pA_out_ggga(T30, s(T32), s(T31), T34)

The argument filtering Pi contains the following mapping:
pA_in_ggga(x1, x2, x3, x4)  =  pA_in_ggga(x1, x2, x3)
s(x1)  =  s(x1)
U1_ggga(x1, x2, x3, x4, x5)  =  U1_ggga(x1, x2, x3, x5)
U2_ggga(x1, x2, x3, x4, x5)  =  U2_ggga(x1, x2, x3, x5)
pA_out_ggga(x1, x2, x3, x4)  =  pA_out_ggga(x1, x2, x3, x4)
U3_ggga(x1, x2, x3, x4, x5)  =  U3_ggga(x1, x2, x3, x5)
U4_ggga(x1, x2, x3, x4, x5)  =  U4_ggga(x1, x2, x3, x5)
U5_ggga(x1, x2, x3, x4, x5)  =  U5_ggga(x1, x2, x3, x5)
PA_IN_GGGA(x1, x2, x3, x4)  =  PA_IN_GGGA(x1, x2, x3)
U1_GGGA(x1, x2, x3, x4, x5)  =  U1_GGGA(x1, x2, x3, x5)
U2_GGGA(x1, x2, x3, x4, x5)  =  U2_GGGA(x1, x2, x3, x5)
U3_GGGA(x1, x2, x3, x4, x5)  =  U3_GGGA(x1, x2, x3, x5)
U4_GGGA(x1, x2, x3, x4, x5)  =  U4_GGGA(x1, x2, x3, x5)
U5_GGGA(x1, x2, x3, x4, x5)  =  U5_GGGA(x1, x2, x3, x5)

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

(4) Obligation:

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

PA_IN_GGGA(T30, s(T32), s(T31), T34) → U1_GGGA(T30, T32, T31, T34, pA_in_ggga(T30, T32, T31, T34))
PA_IN_GGGA(T30, s(T32), s(T31), T34) → PA_IN_GGGA(T30, T32, T31, T34)
PA_IN_GGGA(T55, T57, s(s(T56)), T59) → U2_GGGA(T55, T57, T56, T59, pA_in_ggga(T57, T56, T55, T59))
PA_IN_GGGA(T55, T57, s(s(T56)), T59) → PA_IN_GGGA(T57, T56, T55, T59)
PA_IN_GGGA(T95, s(T96), s(T97), T99) → U3_GGGA(T95, T96, T97, T99, pA_in_ggga(s(T97), T96, T95, T99))
PA_IN_GGGA(T95, s(T96), s(T97), T99) → PA_IN_GGGA(s(T97), T96, T95, T99)
PA_IN_GGGA(s(T140), s(T139), T138, T142) → U4_GGGA(T140, T139, T138, T142, pA_in_ggga(T138, T140, T139, T142))
PA_IN_GGGA(s(T140), s(T139), T138, T142) → PA_IN_GGGA(T138, T140, T139, T142)
PA_IN_GGGA(T165, s(s(T164)), T163, T167) → U5_GGGA(T165, T164, T163, T167, pA_in_ggga(T165, T164, T163, T167))
PA_IN_GGGA(T165, s(s(T164)), T163, T167) → PA_IN_GGGA(T165, T164, T163, T167)

The TRS R consists of the following rules:

pA_in_ggga(T30, s(T32), s(T31), T34) → U1_ggga(T30, T32, T31, T34, pA_in_ggga(T30, T32, T31, T34))
pA_in_ggga(T55, T57, s(s(T56)), T59) → U2_ggga(T55, T57, T56, T59, pA_in_ggga(T57, T56, T55, T59))
pA_in_ggga(T76, T78, s(T77), T76) → pA_out_ggga(T76, T78, s(T77), T76)
pA_in_ggga(T95, s(T96), s(T97), T99) → U3_ggga(T95, T96, T97, T99, pA_in_ggga(s(T97), T96, T95, T99))
pA_in_ggga(s(T140), s(T139), T138, T142) → U4_ggga(T140, T139, T138, T142, pA_in_ggga(T138, T140, T139, T142))
pA_in_ggga(T165, s(s(T164)), T163, T167) → U5_ggga(T165, T164, T163, T167, pA_in_ggga(T165, T164, T163, T167))
pA_in_ggga(T190, s(T189), T188, T188) → pA_out_ggga(T190, s(T189), T188, T188)
pA_in_ggga(T197, s(T198), T199, T197) → pA_out_ggga(T197, s(T198), T199, T197)
pA_in_ggga(T203, T204, T205, T203) → pA_out_ggga(T203, T204, T205, T203)
U5_ggga(T165, T164, T163, T167, pA_out_ggga(T165, T164, T163, T167)) → pA_out_ggga(T165, s(s(T164)), T163, T167)
U4_ggga(T140, T139, T138, T142, pA_out_ggga(T138, T140, T139, T142)) → pA_out_ggga(s(T140), s(T139), T138, T142)
U3_ggga(T95, T96, T97, T99, pA_out_ggga(s(T97), T96, T95, T99)) → pA_out_ggga(T95, s(T96), s(T97), T99)
U2_ggga(T55, T57, T56, T59, pA_out_ggga(T57, T56, T55, T59)) → pA_out_ggga(T55, T57, s(s(T56)), T59)
U1_ggga(T30, T32, T31, T34, pA_out_ggga(T30, T32, T31, T34)) → pA_out_ggga(T30, s(T32), s(T31), T34)

The argument filtering Pi contains the following mapping:
pA_in_ggga(x1, x2, x3, x4)  =  pA_in_ggga(x1, x2, x3)
s(x1)  =  s(x1)
U1_ggga(x1, x2, x3, x4, x5)  =  U1_ggga(x1, x2, x3, x5)
U2_ggga(x1, x2, x3, x4, x5)  =  U2_ggga(x1, x2, x3, x5)
pA_out_ggga(x1, x2, x3, x4)  =  pA_out_ggga(x1, x2, x3, x4)
U3_ggga(x1, x2, x3, x4, x5)  =  U3_ggga(x1, x2, x3, x5)
U4_ggga(x1, x2, x3, x4, x5)  =  U4_ggga(x1, x2, x3, x5)
U5_ggga(x1, x2, x3, x4, x5)  =  U5_ggga(x1, x2, x3, x5)
PA_IN_GGGA(x1, x2, x3, x4)  =  PA_IN_GGGA(x1, x2, x3)
U1_GGGA(x1, x2, x3, x4, x5)  =  U1_GGGA(x1, x2, x3, x5)
U2_GGGA(x1, x2, x3, x4, x5)  =  U2_GGGA(x1, x2, x3, x5)
U3_GGGA(x1, x2, x3, x4, x5)  =  U3_GGGA(x1, x2, x3, x5)
U4_GGGA(x1, x2, x3, x4, x5)  =  U4_GGGA(x1, x2, x3, x5)
U5_GGGA(x1, x2, x3, x4, x5)  =  U5_GGGA(x1, x2, x3, x5)

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

(5) DependencyGraphProof (EQUIVALENT transformation)

The approximation of the Dependency Graph [LOPSTR] contains 1 SCC with 5 less nodes.

(6) Obligation:

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

PA_IN_GGGA(T55, T57, s(s(T56)), T59) → PA_IN_GGGA(T57, T56, T55, T59)
PA_IN_GGGA(T30, s(T32), s(T31), T34) → PA_IN_GGGA(T30, T32, T31, T34)
PA_IN_GGGA(T95, s(T96), s(T97), T99) → PA_IN_GGGA(s(T97), T96, T95, T99)
PA_IN_GGGA(s(T140), s(T139), T138, T142) → PA_IN_GGGA(T138, T140, T139, T142)
PA_IN_GGGA(T165, s(s(T164)), T163, T167) → PA_IN_GGGA(T165, T164, T163, T167)

The TRS R consists of the following rules:

pA_in_ggga(T30, s(T32), s(T31), T34) → U1_ggga(T30, T32, T31, T34, pA_in_ggga(T30, T32, T31, T34))
pA_in_ggga(T55, T57, s(s(T56)), T59) → U2_ggga(T55, T57, T56, T59, pA_in_ggga(T57, T56, T55, T59))
pA_in_ggga(T76, T78, s(T77), T76) → pA_out_ggga(T76, T78, s(T77), T76)
pA_in_ggga(T95, s(T96), s(T97), T99) → U3_ggga(T95, T96, T97, T99, pA_in_ggga(s(T97), T96, T95, T99))
pA_in_ggga(s(T140), s(T139), T138, T142) → U4_ggga(T140, T139, T138, T142, pA_in_ggga(T138, T140, T139, T142))
pA_in_ggga(T165, s(s(T164)), T163, T167) → U5_ggga(T165, T164, T163, T167, pA_in_ggga(T165, T164, T163, T167))
pA_in_ggga(T190, s(T189), T188, T188) → pA_out_ggga(T190, s(T189), T188, T188)
pA_in_ggga(T197, s(T198), T199, T197) → pA_out_ggga(T197, s(T198), T199, T197)
pA_in_ggga(T203, T204, T205, T203) → pA_out_ggga(T203, T204, T205, T203)
U5_ggga(T165, T164, T163, T167, pA_out_ggga(T165, T164, T163, T167)) → pA_out_ggga(T165, s(s(T164)), T163, T167)
U4_ggga(T140, T139, T138, T142, pA_out_ggga(T138, T140, T139, T142)) → pA_out_ggga(s(T140), s(T139), T138, T142)
U3_ggga(T95, T96, T97, T99, pA_out_ggga(s(T97), T96, T95, T99)) → pA_out_ggga(T95, s(T96), s(T97), T99)
U2_ggga(T55, T57, T56, T59, pA_out_ggga(T57, T56, T55, T59)) → pA_out_ggga(T55, T57, s(s(T56)), T59)
U1_ggga(T30, T32, T31, T34, pA_out_ggga(T30, T32, T31, T34)) → pA_out_ggga(T30, s(T32), s(T31), T34)

The argument filtering Pi contains the following mapping:
pA_in_ggga(x1, x2, x3, x4)  =  pA_in_ggga(x1, x2, x3)
s(x1)  =  s(x1)
U1_ggga(x1, x2, x3, x4, x5)  =  U1_ggga(x1, x2, x3, x5)
U2_ggga(x1, x2, x3, x4, x5)  =  U2_ggga(x1, x2, x3, x5)
pA_out_ggga(x1, x2, x3, x4)  =  pA_out_ggga(x1, x2, x3, x4)
U3_ggga(x1, x2, x3, x4, x5)  =  U3_ggga(x1, x2, x3, x5)
U4_ggga(x1, x2, x3, x4, x5)  =  U4_ggga(x1, x2, x3, x5)
U5_ggga(x1, x2, x3, x4, x5)  =  U5_ggga(x1, x2, x3, x5)
PA_IN_GGGA(x1, x2, x3, x4)  =  PA_IN_GGGA(x1, x2, x3)

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

(7) UsableRulesProof (EQUIVALENT transformation)

For (infinitary) constructor rewriting [LOPSTR] we can delete all non-usable rules from R.

(8) Obligation:

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

PA_IN_GGGA(T55, T57, s(s(T56)), T59) → PA_IN_GGGA(T57, T56, T55, T59)
PA_IN_GGGA(T30, s(T32), s(T31), T34) → PA_IN_GGGA(T30, T32, T31, T34)
PA_IN_GGGA(T95, s(T96), s(T97), T99) → PA_IN_GGGA(s(T97), T96, T95, T99)
PA_IN_GGGA(s(T140), s(T139), T138, T142) → PA_IN_GGGA(T138, T140, T139, T142)
PA_IN_GGGA(T165, s(s(T164)), T163, T167) → PA_IN_GGGA(T165, T164, T163, T167)

R is empty.
The argument filtering Pi contains the following mapping:
s(x1)  =  s(x1)
PA_IN_GGGA(x1, x2, x3, x4)  =  PA_IN_GGGA(x1, x2, x3)

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

(9) PiDPToQDPProof (SOUND transformation)

Transforming (infinitary) constructor rewriting Pi-DP problem [LOPSTR] into ordinary QDP problem [LPAR04] by application of Pi.

(10) Obligation:

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

PA_IN_GGGA(T55, T57, s(s(T56))) → PA_IN_GGGA(T57, T56, T55)
PA_IN_GGGA(T30, s(T32), s(T31)) → PA_IN_GGGA(T30, T32, T31)
PA_IN_GGGA(T95, s(T96), s(T97)) → PA_IN_GGGA(s(T97), T96, T95)
PA_IN_GGGA(s(T140), s(T139), T138) → PA_IN_GGGA(T138, T140, T139)
PA_IN_GGGA(T165, s(s(T164)), T163) → PA_IN_GGGA(T165, T164, T163)

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

(11) QDPSizeChangeProof (EQUIVALENT transformation)

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:

  • PA_IN_GGGA(T55, T57, s(s(T56))) → PA_IN_GGGA(T57, T56, T55)
    The graph contains the following edges 2 >= 1, 3 > 2, 1 >= 3

  • PA_IN_GGGA(T30, s(T32), s(T31)) → PA_IN_GGGA(T30, T32, T31)
    The graph contains the following edges 1 >= 1, 2 > 2, 3 > 3

  • PA_IN_GGGA(T95, s(T96), s(T97)) → PA_IN_GGGA(s(T97), T96, T95)
    The graph contains the following edges 3 >= 1, 2 > 2, 1 >= 3

  • PA_IN_GGGA(s(T140), s(T139), T138) → PA_IN_GGGA(T138, T140, T139)
    The graph contains the following edges 3 >= 1, 1 > 2, 2 > 3

  • PA_IN_GGGA(T165, s(s(T164)), T163) → PA_IN_GGGA(T165, T164, T163)
    The graph contains the following edges 1 >= 1, 2 > 2, 3 >= 3

(12) YES