NO

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

Initial linear ITS problem
   Start location: [0]
      0: [0] -> [1] : z'=1+z, [], cost: 1
      1: [1] -> [2] : z'=1+z, [ x>=0 && w<=-5 ], cost: 1
      2: [1] -> [2] : z'=-1+z, [ x<0 ], cost: 1
      3: [2] -> [3] : [ 0<=0 ], cost: 1
      4: [3] -> [4] : [ x>=w ], cost: 1
      6: [3] -> [5] : z'=-1+z, [ x<0 ], cost: 1
      5: [4] -> [3] : x'=z^2, w'=-1+w, [], cost: 1

Checking for constant complexity:
   The following rule is satisfiable with cost >= 1, yielding constant complexity:
      0: [0] -> [1] : z'=1+z, [], cost: 1

Removed unreachable and leaf rules:
   Start location: [0]
      0: [0] -> [1] : z'=1+z, [], cost: 1
      1: [1] -> [2] : z'=1+z, [ x>=0 && w<=-5 ], cost: 1
      2: [1] -> [2] : z'=-1+z, [ x<0 ], cost: 1
      3: [2] -> [3] : [ 0<=0 ], cost: 1
      4: [3] -> [4] : [ x>=w ], cost: 1
      5: [4] -> [3] : x'=z^2, w'=-1+w, [], cost: 1

Simplified all rules, resulting in:
   Start location: [0]
      0: [0] -> [1] : z'=1+z, [], cost: 1
      1: [1] -> [2] : z'=1+z, [ x>=0 && w<=-5 ], cost: 1
      2: [1] -> [2] : z'=-1+z, [ x<0 ], cost: 1
      3: [2] -> [3] : [], cost: 1
      4: [3] -> [4] : [ x>=w ], cost: 1
      5: [4] -> [3] : x'=z^2, w'=-1+w, [], cost: 1

### Simplification by acceleration and chaining ###

Eliminated locations (on linear paths):
   Start location: [0]
      0: [0] -> [1] : z'=1+z, [], cost: 1
      1: [1] -> [2] : z'=1+z, [ x>=0 && w<=-5 ], cost: 1
      2: [1] -> [2] : z'=-1+z, [ x<0 ], cost: 1
      3: [2] -> [3] : [], cost: 1
      7: [3] -> [3] : x'=z^2, w'=-1+w, [ x>=w ], cost: 2

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

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

Accelerated all simple loops using metering functions (where possible):
   Start location: [0]
      0: [0] -> [1] : z'=1+z, [], cost: 1
      1: [1] -> [2] : z'=1+z, [ x>=0 && w<=-5 ], cost: 1
      2: [1] -> [2] : z'=-1+z, [ x<0 ], cost: 1
      3: [2] -> [3] : [], cost: 1
      7: [3] -> [3] : x'=z^2, w'=-1+w, [ x>=w ], cost: 2
      8: [3] -> [6] : [ x>=w && z^2>=-1+w ], cost: NONTERM

Chained accelerated rules (with incoming rules):
   Start location: [0]
      0: [0] -> [1] : z'=1+z, [], cost: 1
      1: [1] -> [2] : z'=1+z, [ x>=0 && w<=-5 ], cost: 1
      2: [1] -> [2] : z'=-1+z, [ x<0 ], cost: 1
      3: [2] -> [3] : [], cost: 1
      9: [2] -> [3] : x'=z^2, w'=-1+w, [ x>=w ], cost: 3
     10: [2] -> [6] : [ x>=w && z^2>=-1+w ], cost: NONTERM

Removed unreachable locations (and leaf rules with constant cost):
   Start location: [0]
      0: [0] -> [1] : z'=1+z, [], cost: 1
      1: [1] -> [2] : z'=1+z, [ x>=0 && w<=-5 ], cost: 1
      2: [1] -> [2] : z'=-1+z, [ x<0 ], cost: 1
     10: [2] -> [6] : [ x>=w && z^2>=-1+w ], cost: NONTERM

Eliminated locations (on tree-shaped paths):
   Start location: [0]
     11: [0] -> [2] : z'=2+z, [ x>=0 && w<=-5 ], cost: 2
     12: [0] -> [2] : z'=z, [ x<0 ], cost: 2
     10: [2] -> [6] : [ x>=w && z^2>=-1+w ], cost: NONTERM

Eliminated locations (on tree-shaped paths):
   Start location: [0]
     13: [0] -> [6] : [ x>=0 && w<=-5 && x>=w && (2+z)^2>=-1+w ], cost: NONTERM
     14: [0] -> [6] : [ x<0 && x>=w && z^2>=-1+w ], cost: NONTERM

### Computing asymptotic complexity ###

Fully simplified ITS problem
   Start location: [0]
     13: [0] -> [6] : [ x>=0 && w<=-5 && x>=w && (2+z)^2>=-1+w ], cost: NONTERM
     14: [0] -> [6] : [ x<0 && x>=w && z^2>=-1+w ], cost: NONTERM

Computing asymptotic complexity for rule 14
   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:  [ x<0 && x>=w ]

NO