/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

p1(g)

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, 0 ms]
(8) PiDP
(9) PiDPToQDPProof [EQUIVALENT, 10 ms]
(10) QDP
(11) QDPSizeChangeProof [EQUIVALENT, 0 ms]
(12) YES


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

(0)
Obligation:
Clauses:

p1(f(X)) :- p1(X).
p2(f(X)) :- p2(X).


Query: p1(g)
----------------------------------------

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

p1_in_1: (b)

Transforming Prolog into the following Term Rewriting System:

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

   p1_in_g(f(X)) -> U1_g(X, p1_in_g(X))
   U1_g(X, p1_out_g(X)) -> p1_out_g(f(X))

The argument filtering Pi contains the following mapping:
p1_in_g(x1)  =  p1_in_g(x1)

f(x1)  =  f(x1)

U1_g(x1, x2)  =  U1_g(x2)

p1_out_g(x1)  =  p1_out_g





Infinitary Constructor Rewriting Termination of PiTRS implies Termination of Prolog



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

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

   p1_in_g(f(X)) -> U1_g(X, p1_in_g(X))
   U1_g(X, p1_out_g(X)) -> p1_out_g(f(X))

The argument filtering Pi contains the following mapping:
p1_in_g(x1)  =  p1_in_g(x1)

f(x1)  =  f(x1)

U1_g(x1, x2)  =  U1_g(x2)

p1_out_g(x1)  =  p1_out_g



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

(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:

   P1_IN_G(f(X)) -> U1_G(X, p1_in_g(X))
   P1_IN_G(f(X)) -> P1_IN_G(X)

The TRS R consists of the following rules:

   p1_in_g(f(X)) -> U1_g(X, p1_in_g(X))
   U1_g(X, p1_out_g(X)) -> p1_out_g(f(X))

The argument filtering Pi contains the following mapping:
p1_in_g(x1)  =  p1_in_g(x1)

f(x1)  =  f(x1)

U1_g(x1, x2)  =  U1_g(x2)

p1_out_g(x1)  =  p1_out_g

P1_IN_G(x1)  =  P1_IN_G(x1)

U1_G(x1, x2)  =  U1_G(x2)


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

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

   P1_IN_G(f(X)) -> U1_G(X, p1_in_g(X))
   P1_IN_G(f(X)) -> P1_IN_G(X)

The TRS R consists of the following rules:

   p1_in_g(f(X)) -> U1_g(X, p1_in_g(X))
   U1_g(X, p1_out_g(X)) -> p1_out_g(f(X))

The argument filtering Pi contains the following mapping:
p1_in_g(x1)  =  p1_in_g(x1)

f(x1)  =  f(x1)

U1_g(x1, x2)  =  U1_g(x2)

p1_out_g(x1)  =  p1_out_g

P1_IN_G(x1)  =  P1_IN_G(x1)

U1_G(x1, x2)  =  U1_G(x2)


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:

   P1_IN_G(f(X)) -> P1_IN_G(X)

The TRS R consists of the following rules:

   p1_in_g(f(X)) -> U1_g(X, p1_in_g(X))
   U1_g(X, p1_out_g(X)) -> p1_out_g(f(X))

The argument filtering Pi contains the following mapping:
p1_in_g(x1)  =  p1_in_g(x1)

f(x1)  =  f(x1)

U1_g(x1, x2)  =  U1_g(x2)

p1_out_g(x1)  =  p1_out_g

P1_IN_G(x1)  =  P1_IN_G(x1)


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:

   P1_IN_G(f(X)) -> P1_IN_G(X)

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

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

   P1_IN_G(f(X)) -> P1_IN_G(X)

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:
*P1_IN_G(f(X)) -> P1_IN_G(X)
The graph contains the following edges 1 > 1


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

(12)
YES