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 PrologToPrologProblemTransformerProof (⇐)
↳2 Prolog
↳3 PrologToPiTRSProof (⇐)
↳4 PiTRS
↳5 DependencyPairsProof (⇔)
↳6 PiDP
↳7 DependencyGraphProof (⇔)
↳8 PiDP
↳9 UsableRulesProof (⇔)
↳10 PiDP
↳11 PiDPToQDPProof (⇐)
↳12 QDP
↳13 QDPSizeChangeProof (⇔)
↳14 YES

(0) Obligation:

Clauses:

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

Queries:

less(g,a).

(1) PrologToPrologProblemTransformerProof (SOUND transformation)

Built Prolog problem from termination graph.

(2) Obligation:

Clauses:

less1(0, s(T4)).
less1(s(0), s(s(T14))).
less1(s(s(T19)), s(s(T21))) :- less1(T19, T21).

Queries:

less1(g,a).

(3) PrologToPiTRSProof (SOUND transformation)

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

less1_in_ga(0, s(T4)) → less1_out_ga(0, s(T4))
less1_in_ga(s(0), s(s(T14))) → less1_out_ga(s(0), s(s(T14)))
less1_in_ga(s(s(T19)), s(s(T21))) → U1_ga(T19, T21, less1_in_ga(T19, T21))
U1_ga(T19, T21, less1_out_ga(T19, T21)) → less1_out_ga(s(s(T19)), s(s(T21)))

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

Infinitary Constructor Rewriting Termination of PiTRS implies Termination of Prolog

(4) Obligation:

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

less1_in_ga(0, s(T4)) → less1_out_ga(0, s(T4))
less1_in_ga(s(0), s(s(T14))) → less1_out_ga(s(0), s(s(T14)))
less1_in_ga(s(s(T19)), s(s(T21))) → U1_ga(T19, T21, less1_in_ga(T19, T21))
U1_ga(T19, T21, less1_out_ga(T19, T21)) → less1_out_ga(s(s(T19)), s(s(T21)))

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

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

LESS1_IN_GA(s(s(T19)), s(s(T21))) → U1_GA(T19, T21, less1_in_ga(T19, T21))
LESS1_IN_GA(s(s(T19)), s(s(T21))) → LESS1_IN_GA(T19, T21)

The TRS R consists of the following rules:

less1_in_ga(0, s(T4)) → less1_out_ga(0, s(T4))
less1_in_ga(s(0), s(s(T14))) → less1_out_ga(s(0), s(s(T14)))
less1_in_ga(s(s(T19)), s(s(T21))) → U1_ga(T19, T21, less1_in_ga(T19, T21))
U1_ga(T19, T21, less1_out_ga(T19, T21)) → less1_out_ga(s(s(T19)), s(s(T21)))

The argument filtering Pi contains the following mapping:
less1_in_ga(x1, x2)  =  less1_in_ga(x1)
0  =  0
less1_out_ga(x1, x2)  =  less1_out_ga
s(x1)  =  s(x1)
U1_ga(x1, x2, x3)  =  U1_ga(x3)
LESS1_IN_GA(x1, x2)  =  LESS1_IN_GA(x1)
U1_GA(x1, x2, x3)  =  U1_GA(x3)

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

(6) Obligation:

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

LESS1_IN_GA(s(s(T19)), s(s(T21))) → U1_GA(T19, T21, less1_in_ga(T19, T21))
LESS1_IN_GA(s(s(T19)), s(s(T21))) → LESS1_IN_GA(T19, T21)

The TRS R consists of the following rules:

less1_in_ga(0, s(T4)) → less1_out_ga(0, s(T4))
less1_in_ga(s(0), s(s(T14))) → less1_out_ga(s(0), s(s(T14)))
less1_in_ga(s(s(T19)), s(s(T21))) → U1_ga(T19, T21, less1_in_ga(T19, T21))
U1_ga(T19, T21, less1_out_ga(T19, T21)) → less1_out_ga(s(s(T19)), s(s(T21)))

The argument filtering Pi contains the following mapping:
less1_in_ga(x1, x2)  =  less1_in_ga(x1)
0  =  0
less1_out_ga(x1, x2)  =  less1_out_ga
s(x1)  =  s(x1)
U1_ga(x1, x2, x3)  =  U1_ga(x3)
LESS1_IN_GA(x1, x2)  =  LESS1_IN_GA(x1)
U1_GA(x1, x2, x3)  =  U1_GA(x3)

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

(7) DependencyGraphProof (EQUIVALENT transformation)

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

(8) Obligation:

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

LESS1_IN_GA(s(s(T19)), s(s(T21))) → LESS1_IN_GA(T19, T21)

The TRS R consists of the following rules:

less1_in_ga(0, s(T4)) → less1_out_ga(0, s(T4))
less1_in_ga(s(0), s(s(T14))) → less1_out_ga(s(0), s(s(T14)))
less1_in_ga(s(s(T19)), s(s(T21))) → U1_ga(T19, T21, less1_in_ga(T19, T21))
U1_ga(T19, T21, less1_out_ga(T19, T21)) → less1_out_ga(s(s(T19)), s(s(T21)))

The argument filtering Pi contains the following mapping:
less1_in_ga(x1, x2)  =  less1_in_ga(x1)
0  =  0
less1_out_ga(x1, x2)  =  less1_out_ga
s(x1)  =  s(x1)
U1_ga(x1, x2, x3)  =  U1_ga(x3)
LESS1_IN_GA(x1, x2)  =  LESS1_IN_GA(x1)

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

(9) UsableRulesProof (EQUIVALENT transformation)

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

(10) Obligation:

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

LESS1_IN_GA(s(s(T19)), s(s(T21))) → LESS1_IN_GA(T19, T21)

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

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

(11) PiDPToQDPProof (SOUND transformation)

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

(12) Obligation:

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

LESS1_IN_GA(s(s(T19))) → LESS1_IN_GA(T19)

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

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

  • LESS1_IN_GA(s(s(T19))) → LESS1_IN_GA(T19)
    The graph contains the following edges 1 > 1

(14) YES