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


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


YES
proof of /export/starexec/sandbox/benchmark/theBenchmark.pl
# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty


Left Termination of the query pattern

append(g,g,a)

w.r.t. the given Prolog program could successfully be proven:

(0) Prolog
(1) PrologToPiTRSProof [SOUND, 0 ms]
(2) PiTRS
(3) DependencyPairsProof [EQUIVALENT, 0 ms]
(4) PiDP
(5) DependencyGraphProof [EQUIVALENT, 0 ms]
(6) PiDP
(7) UsableRulesProof [EQUIVALENT, 1 ms]
(8) PiDP
(9) PiDPToQDPProof [SOUND, 0 ms]
(10) QDP
(11) QDPSizeChangeProof [EQUIVALENT, 0 ms]
(12) YES


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

(0)
Obligation:
Clauses:

append(.(H, X), Y, .(X, Z)) :- append(X, Y, Z).
append([], Y, Y).


Query: append(g,g,a)
----------------------------------------

(1) PrologToPiTRSProof (SOUND)
We use the technique of [TOCL09]. With regard to the inferred argument filtering the predicates were used in the following modes:

append_in_3: (b,b,f)

Transforming Prolog into the following Term Rewriting System:

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

   append_in_gga(.(H, X), Y, .(X, Z)) -> U1_gga(H, X, Y, Z, append_in_gga(X, Y, Z))
   append_in_gga([], Y, Y) -> append_out_gga([], Y, Y)
   U1_gga(H, X, Y, Z, append_out_gga(X, Y, Z)) -> append_out_gga(.(H, X), Y, .(X, Z))

The argument filtering Pi contains the following mapping:
append_in_gga(x1, x2, x3)  =  append_in_gga(x1, x2)

.(x1, x2)  =  .(x1, x2)

U1_gga(x1, x2, x3, x4, x5)  =  U1_gga(x2, x5)

[]  =  []

append_out_gga(x1, x2, x3)  =  append_out_gga(x3)





Infinitary Constructor Rewriting Termination of PiTRS implies Termination of Prolog



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

(2)
Obligation:
Pi-finite rewrite system:
The TRS R consists of the following rules:

   append_in_gga(.(H, X), Y, .(X, Z)) -> U1_gga(H, X, Y, Z, append_in_gga(X, Y, Z))
   append_in_gga([], Y, Y) -> append_out_gga([], Y, Y)
   U1_gga(H, X, Y, Z, append_out_gga(X, Y, Z)) -> append_out_gga(.(H, X), Y, .(X, Z))

The argument filtering Pi contains the following mapping:
append_in_gga(x1, x2, x3)  =  append_in_gga(x1, x2)

.(x1, x2)  =  .(x1, x2)

U1_gga(x1, x2, x3, x4, x5)  =  U1_gga(x2, x5)

[]  =  []

append_out_gga(x1, x2, x3)  =  append_out_gga(x3)



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

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

   APPEND_IN_GGA(.(H, X), Y, .(X, Z)) -> U1_GGA(H, X, Y, Z, append_in_gga(X, Y, Z))
   APPEND_IN_GGA(.(H, X), Y, .(X, Z)) -> APPEND_IN_GGA(X, Y, Z)

The TRS R consists of the following rules:

   append_in_gga(.(H, X), Y, .(X, Z)) -> U1_gga(H, X, Y, Z, append_in_gga(X, Y, Z))
   append_in_gga([], Y, Y) -> append_out_gga([], Y, Y)
   U1_gga(H, X, Y, Z, append_out_gga(X, Y, Z)) -> append_out_gga(.(H, X), Y, .(X, Z))

The argument filtering Pi contains the following mapping:
append_in_gga(x1, x2, x3)  =  append_in_gga(x1, x2)

.(x1, x2)  =  .(x1, x2)

U1_gga(x1, x2, x3, x4, x5)  =  U1_gga(x2, x5)

[]  =  []

append_out_gga(x1, x2, x3)  =  append_out_gga(x3)

APPEND_IN_GGA(x1, x2, x3)  =  APPEND_IN_GGA(x1, x2)

U1_GGA(x1, x2, x3, x4, x5)  =  U1_GGA(x2, x5)


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

(4)
Obligation:
Pi DP problem:
The TRS P consists of the following rules:

   APPEND_IN_GGA(.(H, X), Y, .(X, Z)) -> U1_GGA(H, X, Y, Z, append_in_gga(X, Y, Z))
   APPEND_IN_GGA(.(H, X), Y, .(X, Z)) -> APPEND_IN_GGA(X, Y, Z)

The TRS R consists of the following rules:

   append_in_gga(.(H, X), Y, .(X, Z)) -> U1_gga(H, X, Y, Z, append_in_gga(X, Y, Z))
   append_in_gga([], Y, Y) -> append_out_gga([], Y, Y)
   U1_gga(H, X, Y, Z, append_out_gga(X, Y, Z)) -> append_out_gga(.(H, X), Y, .(X, Z))

The argument filtering Pi contains the following mapping:
append_in_gga(x1, x2, x3)  =  append_in_gga(x1, x2)

.(x1, x2)  =  .(x1, x2)

U1_gga(x1, x2, x3, x4, x5)  =  U1_gga(x2, x5)

[]  =  []

append_out_gga(x1, x2, x3)  =  append_out_gga(x3)

APPEND_IN_GGA(x1, x2, x3)  =  APPEND_IN_GGA(x1, x2)

U1_GGA(x1, x2, x3, x4, x5)  =  U1_GGA(x2, x5)


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

(5) DependencyGraphProof (EQUIVALENT)
The approximation of the Dependency Graph [LOPSTR] contains 1 SCC with 1 less node.
----------------------------------------

(6)
Obligation:
Pi DP problem:
The TRS P consists of the following rules:

   APPEND_IN_GGA(.(H, X), Y, .(X, Z)) -> APPEND_IN_GGA(X, Y, Z)

The TRS R consists of the following rules:

   append_in_gga(.(H, X), Y, .(X, Z)) -> U1_gga(H, X, Y, Z, append_in_gga(X, Y, Z))
   append_in_gga([], Y, Y) -> append_out_gga([], Y, Y)
   U1_gga(H, X, Y, Z, append_out_gga(X, Y, Z)) -> append_out_gga(.(H, X), Y, .(X, Z))

The argument filtering Pi contains the following mapping:
append_in_gga(x1, x2, x3)  =  append_in_gga(x1, x2)

.(x1, x2)  =  .(x1, x2)

U1_gga(x1, x2, x3, x4, x5)  =  U1_gga(x2, x5)

[]  =  []

append_out_gga(x1, x2, x3)  =  append_out_gga(x3)

APPEND_IN_GGA(x1, x2, x3)  =  APPEND_IN_GGA(x1, x2)


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

(7) UsableRulesProof (EQUIVALENT)
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:

   APPEND_IN_GGA(.(H, X), Y, .(X, Z)) -> APPEND_IN_GGA(X, Y, Z)

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

APPEND_IN_GGA(x1, x2, x3)  =  APPEND_IN_GGA(x1, x2)


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

(9) PiDPToQDPProof (SOUND)
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:

   APPEND_IN_GGA(.(H, X), Y) -> APPEND_IN_GGA(X, Y)

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

(11) 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:
*APPEND_IN_GGA(.(H, X), Y) -> APPEND_IN_GGA(X, Y)
The graph contains the following edges 1 > 1, 2 >= 2


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

(12)
YES