NO

### Pre-processing the ITS problem ###

Initial linear ITS problem
   Start location: l5
      0: l0 -> l1 : x^0'=x^post_1, y^0'=y^post_1, [ 1+y^0<=x^0 && x^0==x^post_1 && y^0==y^post_1 ], cost: 1
      1: l0 -> l2 : x^0'=x^post_2, y^0'=y^post_2, [ x^post_2==1+x^0 && y^post_2==1+y^0 ], cost: 1
      3: l0 -> l3 : x^0'=x^post_4, y^0'=y^post_4, [ x^0==x^post_4 && y^0==y^post_4 ], cost: 1
      2: l2 -> l0 : x^0'=x^post_3, y^0'=y^post_3, [ x^0==x^post_3 && y^0==y^post_3 ], cost: 1
      4: l4 -> l0 : x^0'=x^post_5, y^0'=y^post_5, [ y^0<=x^0 && x^0<=y^0 && x^0==x^post_5 && y^0==y^post_5 ], cost: 1
      5: l5 -> l4 : x^0'=x^post_6, y^0'=y^post_6, [ x^0==x^post_6 && y^0==y^post_6 ], cost: 1

Checking for constant complexity:
   The following rule is satisfiable with cost >= 1, yielding constant complexity:
      5: l5 -> l4 : x^0'=x^post_6, y^0'=y^post_6, [ x^0==x^post_6 && y^0==y^post_6 ], cost: 1

Removed unreachable and leaf rules:
   Start location: l5
      1: l0 -> l2 : x^0'=x^post_2, y^0'=y^post_2, [ x^post_2==1+x^0 && y^post_2==1+y^0 ], cost: 1
      2: l2 -> l0 : x^0'=x^post_3, y^0'=y^post_3, [ x^0==x^post_3 && y^0==y^post_3 ], cost: 1
      4: l4 -> l0 : x^0'=x^post_5, y^0'=y^post_5, [ y^0<=x^0 && x^0<=y^0 && x^0==x^post_5 && y^0==y^post_5 ], cost: 1
      5: l5 -> l4 : x^0'=x^post_6, y^0'=y^post_6, [ x^0==x^post_6 && y^0==y^post_6 ], cost: 1

Simplified all rules, resulting in:
   Start location: l5
      1: l0 -> l2 : x^0'=1+x^0, y^0'=1+y^0, [], cost: 1
      2: l2 -> l0 : [], cost: 1
      4: l4 -> l0 : [ y^0-x^0==0 ], cost: 1
      5: l5 -> l4 : [], cost: 1

### Simplification by acceleration and chaining ###

Eliminated locations (on linear paths):
   Start location: l5
      7: l0 -> l0 : x^0'=1+x^0, y^0'=1+y^0, [], cost: 2
      6: l5 -> l0 : [ y^0-x^0==0 ], cost: 2

Accelerating simple loops of location 0.
   Accelerating the following rules:
      7: l0 -> l0 : x^0'=1+x^0, y^0'=1+y^0, [], cost: 2

   Accelerated rule 7 with non-termination, yielding the new rule 8.
[accelerate] Nesting with 0 inner and 0 outer candidates
   Removing the simple loops: 7.

Accelerated all simple loops using metering functions (where possible):
   Start location: l5
      8: l0 -> [6] : [], cost: NONTERM
      6: l5 -> l0 : [ y^0-x^0==0 ], cost: 2

Chained accelerated rules (with incoming rules):
   Start location: l5
      6: l5 -> l0 : [ y^0-x^0==0 ], cost: 2
      9: l5 -> [6] : [ y^0-x^0==0 ], cost: NONTERM

Removed unreachable locations (and leaf rules with constant cost):
   Start location: l5
      9: l5 -> [6] : [ y^0-x^0==0 ], cost: NONTERM

### Computing asymptotic complexity ###

Fully simplified ITS problem
   Start location: l5
      9: l5 -> [6] : [ y^0-x^0==0 ], cost: NONTERM

Computing asymptotic complexity for rule 9
   Guard is satisfiable, yielding nontermination
   Resulting cost NONTERM has complexity: Nonterm

Found new complexity Nonterm.

Obtained the following overall complexity (w.r.t. the length of the input n):
   Complexity:  Nonterm
   Cpx degree:  Nonterm
   Solved cost: NONTERM
   Rule cost:   NONTERM
   Rule guard:  [ y^0-x^0==0 ]

NO