Left Termination of the query pattern less_in_2(g, a) w.r.t. the given Prolog program could successfully be proven:

0 Prolog
  ↳1 PrologToPiTRSProof (⇐)
    ↳2 PiTRS
    ↳3 DependencyPairsProof (⇔)
    ↳4 PiDP
    ↳5 DependencyGraphProof (⇔)
    ↳6 PiDP
    ↳7 UsableRulesProof (⇔)
    ↳8 PiDP
    ↳9 PiDPToQDPProof (⇐)
    ↳10 QDP
    ↳11 QDPSizeChangeProof (⇔)
    ↳12 TRUE
  ↳13 PrologToPiTRSProof (⇐)
    ↳14 PiTRS
    ↳15 DependencyPairsProof (⇔)
    ↳16 PiDP
    ↳17 DependencyGraphProof (⇔)
    ↳18 PiDP
    ↳19 UsableRulesProof (⇔)
    ↳20 PiDP
    ↳21 PiDPToQDPProof (⇐)
    ↳22 QDP

(0) Obligation:

Clauses:

less(0, s(X1)).
less(s(X), s(Y)) :- less(X, Y).

Queries:

less(g,a).

(1) PrologToPiTRSProof (SOUND transformation)

We use the technique of [LOPSTR]. With regard to the inferred argument filtering the predicates were used in the following modes:
less_in: (b,f)
Transforming Prolog into the following Term Rewriting System:
Pi-finite rewrite system:
The TRS R consists of the following rules:

less_in_ga(0, s(X1)) → less_out_ga(0, s(X1))
less_in_ga(s(X), s(Y)) → U1_ga(X, Y, less_in_ga(X, Y))
U1_ga(X, Y, less_out_ga(X, Y)) → less_out_ga(s(X), s(Y))

The argument filtering Pi contains the following mapping:
less_in_ga(x1, x2)  =  less_in_ga(x1)
0  =  0
less_out_ga(x1, x2)  =  less_out_ga
s(x1)  =  s(x1)
U1_ga(x1, x2, x3)  =  U1_ga(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:

less_in_ga(0, s(X1)) → less_out_ga(0, s(X1))
less_in_ga(s(X), s(Y)) → U1_ga(X, Y, less_in_ga(X, Y))
U1_ga(X, Y, less_out_ga(X, Y)) → less_out_ga(s(X), s(Y))

The argument filtering Pi contains the following mapping:
less_in_ga(x1, x2)  =  less_in_ga(x1)
0  =  0
less_out_ga(x1, x2)  =  less_out_ga
s(x1)  =  s(x1)
U1_ga(x1, x2, x3)  =  U1_ga(x3)

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

LESS_IN_GA(s(X), s(Y)) → U1_GA(X, Y, less_in_ga(X, Y))
LESS_IN_GA(s(X), s(Y)) → LESS_IN_GA(X, Y)

The TRS R consists of the following rules:

less_in_ga(0, s(X1)) → less_out_ga(0, s(X1))
less_in_ga(s(X), s(Y)) → U1_ga(X, Y, less_in_ga(X, Y))
U1_ga(X, Y, less_out_ga(X, Y)) → less_out_ga(s(X), s(Y))

The argument filtering Pi contains the following mapping:
less_in_ga(x1, x2)  =  less_in_ga(x1)
0  =  0
less_out_ga(x1, x2)  =  less_out_ga
s(x1)  =  s(x1)
U1_ga(x1, x2, x3)  =  U1_ga(x3)
LESS_IN_GA(x1, x2)  =  LESS_IN_GA(x1)
U1_GA(x1, x2, x3)  =  U1_GA(x3)

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

(4) Obligation:

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

LESS_IN_GA(s(X), s(Y)) → U1_GA(X, Y, less_in_ga(X, Y))
LESS_IN_GA(s(X), s(Y)) → LESS_IN_GA(X, Y)

The TRS R consists of the following rules:

less_in_ga(0, s(X1)) → less_out_ga(0, s(X1))
less_in_ga(s(X), s(Y)) → U1_ga(X, Y, less_in_ga(X, Y))
U1_ga(X, Y, less_out_ga(X, Y)) → less_out_ga(s(X), s(Y))

The argument filtering Pi contains the following mapping:
less_in_ga(x1, x2)  =  less_in_ga(x1)
0  =  0
less_out_ga(x1, x2)  =  less_out_ga
s(x1)  =  s(x1)
U1_ga(x1, x2, x3)  =  U1_ga(x3)
LESS_IN_GA(x1, x2)  =  LESS_IN_GA(x1)
U1_GA(x1, x2, x3)  =  U1_GA(x3)

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

(5) DependencyGraphProof (EQUIVALENT transformation)

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:

LESS_IN_GA(s(X), s(Y)) → LESS_IN_GA(X, Y)

The TRS R consists of the following rules:

less_in_ga(0, s(X1)) → less_out_ga(0, s(X1))
less_in_ga(s(X), s(Y)) → U1_ga(X, Y, less_in_ga(X, Y))
U1_ga(X, Y, less_out_ga(X, Y)) → less_out_ga(s(X), s(Y))

The argument filtering Pi contains the following mapping:
less_in_ga(x1, x2)  =  less_in_ga(x1)
0  =  0
less_out_ga(x1, x2)  =  less_out_ga
s(x1)  =  s(x1)
U1_ga(x1, x2, x3)  =  U1_ga(x3)
LESS_IN_GA(x1, x2)  =  LESS_IN_GA(x1)

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:

LESS_IN_GA(s(X), s(Y)) → LESS_IN_GA(X, Y)

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

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:

LESS_IN_GA(s(X)) → LESS_IN_GA(X)

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:

  • LESS_IN_GA(s(X)) → LESS_IN_GA(X)
    The graph contains the following edges 1 > 1

(12) TRUE

(13) PrologToPiTRSProof (SOUND transformation)

We use the technique of [LOPSTR]. With regard to the inferred argument filtering the predicates were used in the following modes:
less_in: (b,f)
Transforming Prolog into the following Term Rewriting System:
Pi-finite rewrite system:
The TRS R consists of the following rules:

less_in_ga(0, s(X1)) → less_out_ga(0, s(X1))
less_in_ga(s(X), s(Y)) → U1_ga(X, Y, less_in_ga(X, Y))
U1_ga(X, Y, less_out_ga(X, Y)) → less_out_ga(s(X), s(Y))

The argument filtering Pi contains the following mapping:
less_in_ga(x1, x2)  =  less_in_ga(x1)
0  =  0
less_out_ga(x1, x2)  =  less_out_ga(x1)
s(x1)  =  s(x1)
U1_ga(x1, x2, x3)  =  U1_ga(x1, x3)

Infinitary Constructor Rewriting Termination of PiTRS implies Termination of Prolog

(14) Obligation:

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

less_in_ga(0, s(X1)) → less_out_ga(0, s(X1))
less_in_ga(s(X), s(Y)) → U1_ga(X, Y, less_in_ga(X, Y))
U1_ga(X, Y, less_out_ga(X, Y)) → less_out_ga(s(X), s(Y))

The argument filtering Pi contains the following mapping:
less_in_ga(x1, x2)  =  less_in_ga(x1)
0  =  0
less_out_ga(x1, x2)  =  less_out_ga(x1)
s(x1)  =  s(x1)
U1_ga(x1, x2, x3)  =  U1_ga(x1, x3)

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

LESS_IN_GA(s(X), s(Y)) → U1_GA(X, Y, less_in_ga(X, Y))
LESS_IN_GA(s(X), s(Y)) → LESS_IN_GA(X, Y)

The TRS R consists of the following rules:

less_in_ga(0, s(X1)) → less_out_ga(0, s(X1))
less_in_ga(s(X), s(Y)) → U1_ga(X, Y, less_in_ga(X, Y))
U1_ga(X, Y, less_out_ga(X, Y)) → less_out_ga(s(X), s(Y))

The argument filtering Pi contains the following mapping:
less_in_ga(x1, x2)  =  less_in_ga(x1)
0  =  0
less_out_ga(x1, x2)  =  less_out_ga(x1)
s(x1)  =  s(x1)
U1_ga(x1, x2, x3)  =  U1_ga(x1, x3)
LESS_IN_GA(x1, x2)  =  LESS_IN_GA(x1)
U1_GA(x1, x2, x3)  =  U1_GA(x1, x3)

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

(16) Obligation:

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

LESS_IN_GA(s(X), s(Y)) → U1_GA(X, Y, less_in_ga(X, Y))
LESS_IN_GA(s(X), s(Y)) → LESS_IN_GA(X, Y)

The TRS R consists of the following rules:

less_in_ga(0, s(X1)) → less_out_ga(0, s(X1))
less_in_ga(s(X), s(Y)) → U1_ga(X, Y, less_in_ga(X, Y))
U1_ga(X, Y, less_out_ga(X, Y)) → less_out_ga(s(X), s(Y))

The argument filtering Pi contains the following mapping:
less_in_ga(x1, x2)  =  less_in_ga(x1)
0  =  0
less_out_ga(x1, x2)  =  less_out_ga(x1)
s(x1)  =  s(x1)
U1_ga(x1, x2, x3)  =  U1_ga(x1, x3)
LESS_IN_GA(x1, x2)  =  LESS_IN_GA(x1)
U1_GA(x1, x2, x3)  =  U1_GA(x1, x3)

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

(17) DependencyGraphProof (EQUIVALENT transformation)

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

(18) Obligation:

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

LESS_IN_GA(s(X), s(Y)) → LESS_IN_GA(X, Y)

The TRS R consists of the following rules:

less_in_ga(0, s(X1)) → less_out_ga(0, s(X1))
less_in_ga(s(X), s(Y)) → U1_ga(X, Y, less_in_ga(X, Y))
U1_ga(X, Y, less_out_ga(X, Y)) → less_out_ga(s(X), s(Y))

The argument filtering Pi contains the following mapping:
less_in_ga(x1, x2)  =  less_in_ga(x1)
0  =  0
less_out_ga(x1, x2)  =  less_out_ga(x1)
s(x1)  =  s(x1)
U1_ga(x1, x2, x3)  =  U1_ga(x1, x3)
LESS_IN_GA(x1, x2)  =  LESS_IN_GA(x1)

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

(19) UsableRulesProof (EQUIVALENT transformation)

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

(20) Obligation:

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

LESS_IN_GA(s(X), s(Y)) → LESS_IN_GA(X, Y)

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

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

(21) PiDPToQDPProof (SOUND transformation)

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

(22) Obligation:

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

LESS_IN_GA(s(X)) → LESS_IN_GA(X)

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