YES

Problem:
 le(0(),y) -> true()
 le(s(x),0()) -> false()
 le(s(x),s(y)) -> le(x,y)
 minus(x,0()) -> x
 minus(s(x),s(y)) -> minus(x,y)
 gcd(0(),y) -> y
 gcd(s(x),0()) -> s(x)
 gcd(s(x),s(y)) -> if_gcd(le(y,x),s(x),s(y))
 if_gcd(true(),s(x),s(y)) -> gcd(minus(x,y),s(y))
 if_gcd(false(),s(x),s(y)) -> gcd(minus(y,x),s(x))

Proof:
 DP Processor:
  DPs:
   le#(s(x),s(y)) -> le#(x,y)
   minus#(s(x),s(y)) -> minus#(x,y)
   gcd#(s(x),s(y)) -> le#(y,x)
   gcd#(s(x),s(y)) -> if_gcd#(le(y,x),s(x),s(y))
   if_gcd#(true(),s(x),s(y)) -> minus#(x,y)
   if_gcd#(true(),s(x),s(y)) -> gcd#(minus(x,y),s(y))
   if_gcd#(false(),s(x),s(y)) -> minus#(y,x)
   if_gcd#(false(),s(x),s(y)) -> gcd#(minus(y,x),s(x))
  TRS:
   le(0(),y) -> true()
   le(s(x),0()) -> false()
   le(s(x),s(y)) -> le(x,y)
   minus(x,0()) -> x
   minus(s(x),s(y)) -> minus(x,y)
   gcd(0(),y) -> y
   gcd(s(x),0()) -> s(x)
   gcd(s(x),s(y)) -> if_gcd(le(y,x),s(x),s(y))
   if_gcd(true(),s(x),s(y)) -> gcd(minus(x,y),s(y))
   if_gcd(false(),s(x),s(y)) -> gcd(minus(y,x),s(x))
  TDG Processor:
   DPs:
    le#(s(x),s(y)) -> le#(x,y)
    minus#(s(x),s(y)) -> minus#(x,y)
    gcd#(s(x),s(y)) -> le#(y,x)
    gcd#(s(x),s(y)) -> if_gcd#(le(y,x),s(x),s(y))
    if_gcd#(true(),s(x),s(y)) -> minus#(x,y)
    if_gcd#(true(),s(x),s(y)) -> gcd#(minus(x,y),s(y))
    if_gcd#(false(),s(x),s(y)) -> minus#(y,x)
    if_gcd#(false(),s(x),s(y)) -> gcd#(minus(y,x),s(x))
   TRS:
    le(0(),y) -> true()
    le(s(x),0()) -> false()
    le(s(x),s(y)) -> le(x,y)
    minus(x,0()) -> x
    minus(s(x),s(y)) -> minus(x,y)
    gcd(0(),y) -> y
    gcd(s(x),0()) -> s(x)
    gcd(s(x),s(y)) -> if_gcd(le(y,x),s(x),s(y))
    if_gcd(true(),s(x),s(y)) -> gcd(minus(x,y),s(y))
    if_gcd(false(),s(x),s(y)) -> gcd(minus(y,x),s(x))
   graph:
    if_gcd#(false(),s(x),s(y)) -> gcd#(minus(y,x),s(x)) ->
    gcd#(s(x),s(y)) -> if_gcd#(le(y,x),s(x),s(y))
    if_gcd#(false(),s(x),s(y)) -> gcd#(minus(y,x),s(x)) ->
    gcd#(s(x),s(y)) -> le#(y,x)
    if_gcd#(false(),s(x),s(y)) -> minus#(y,x) ->
    minus#(s(x),s(y)) -> minus#(x,y)
    if_gcd#(true(),s(x),s(y)) -> gcd#(minus(x,y),s(y)) ->
    gcd#(s(x),s(y)) -> if_gcd#(le(y,x),s(x),s(y))
    if_gcd#(true(),s(x),s(y)) -> gcd#(minus(x,y),s(y)) ->
    gcd#(s(x),s(y)) -> le#(y,x)
    if_gcd#(true(),s(x),s(y)) -> minus#(x,y) ->
    minus#(s(x),s(y)) -> minus#(x,y)
    gcd#(s(x),s(y)) -> if_gcd#(le(y,x),s(x),s(y)) ->
    if_gcd#(false(),s(x),s(y)) -> gcd#(minus(y,x),s(x))
    gcd#(s(x),s(y)) -> if_gcd#(le(y,x),s(x),s(y)) ->
    if_gcd#(false(),s(x),s(y)) -> minus#(y,x)
    gcd#(s(x),s(y)) -> if_gcd#(le(y,x),s(x),s(y)) ->
    if_gcd#(true(),s(x),s(y)) -> gcd#(minus(x,y),s(y))
    gcd#(s(x),s(y)) -> if_gcd#(le(y,x),s(x),s(y)) ->
    if_gcd#(true(),s(x),s(y)) -> minus#(x,y)
    gcd#(s(x),s(y)) -> le#(y,x) -> le#(s(x),s(y)) -> le#(x,y)
    minus#(s(x),s(y)) -> minus#(x,y) -> minus#(s(x),s(y)) -> minus#(x,y)
    le#(s(x),s(y)) -> le#(x,y) -> le#(s(x),s(y)) -> le#(x,y)
   SCC Processor:
    #sccs: 3
    #rules: 5
    #arcs: 13/64
    DPs:
     if_gcd#(false(),s(x),s(y)) -> gcd#(minus(y,x),s(x))
     gcd#(s(x),s(y)) -> if_gcd#(le(y,x),s(x),s(y))
     if_gcd#(true(),s(x),s(y)) -> gcd#(minus(x,y),s(y))
    TRS:
     le(0(),y) -> true()
     le(s(x),0()) -> false()
     le(s(x),s(y)) -> le(x,y)
     minus(x,0()) -> x
     minus(s(x),s(y)) -> minus(x,y)
     gcd(0(),y) -> y
     gcd(s(x),0()) -> s(x)
     gcd(s(x),s(y)) -> if_gcd(le(y,x),s(x),s(y))
     if_gcd(true(),s(x),s(y)) -> gcd(minus(x,y),s(y))
     if_gcd(false(),s(x),s(y)) -> gcd(minus(y,x),s(x))
    Usable Rule Processor:
     DPs:
      if_gcd#(false(),s(x),s(y)) -> gcd#(minus(y,x),s(x))
      gcd#(s(x),s(y)) -> if_gcd#(le(y,x),s(x),s(y))
      if_gcd#(true(),s(x),s(y)) -> gcd#(minus(x,y),s(y))
     TRS:
      minus(x,0()) -> x
      minus(s(x),s(y)) -> minus(x,y)
      le(0(),y) -> true()
      le(s(x),0()) -> false()
      le(s(x),s(y)) -> le(x,y)
     Arctic Interpretation Processor:
      dimension: 1
      usable rules:
       minus(x,0()) -> x
       minus(s(x),s(y)) -> minus(x,y)
       le(0(),y) -> true()
       le(s(x),0()) -> false()
       le(s(x),s(y)) -> le(x,y)
      interpretation:
       [if_gcd#](x0, x1, x2) = x0 + 1x1 + x2 + 0,
       
       [gcd#](x0, x1) = 1x0 + x1,
       
       [minus](x0, x1) = 1x0,
       
       [false] = 0,
       
       [s](x0) = 4x0 + 0,
       
       [true] = 0,
       
       [le](x0, x1) = 2x0 + 2x1 + 0,
       
       [0] = 2
      orientation:
       if_gcd#(false(),s(x),s(y)) = 5x + 4y + 1 >= 4x + 2y + 0 = gcd#(minus(y,x),s(x))
       
       gcd#(s(x),s(y)) = 5x + 4y + 1 >= 5x + 4y + 1 = if_gcd#(le(y,x),s(x),s(y))
       
       if_gcd#(true(),s(x),s(y)) = 5x + 4y + 1 >= 2x + 4y + 0 = gcd#(minus(x,y),s(y))
       
       minus(x,0()) = 1x >= x = x
       
       minus(s(x),s(y)) = 5x + 1 >= 1x = minus(x,y)
       
       le(0(),y) = 2y + 4 >= 0 = true()
       
       le(s(x),0()) = 6x + 4 >= 0 = false()
       
       le(s(x),s(y)) = 6x + 6y + 2 >= 2x + 2y + 0 = le(x,y)
      problem:
       DPs:
        gcd#(s(x),s(y)) -> if_gcd#(le(y,x),s(x),s(y))
        if_gcd#(true(),s(x),s(y)) -> gcd#(minus(x,y),s(y))
       TRS:
        minus(x,0()) -> x
        minus(s(x),s(y)) -> minus(x,y)
        le(0(),y) -> true()
        le(s(x),0()) -> false()
        le(s(x),s(y)) -> le(x,y)
      Restore Modifier:
       DPs:
        gcd#(s(x),s(y)) -> if_gcd#(le(y,x),s(x),s(y))
        if_gcd#(true(),s(x),s(y)) -> gcd#(minus(x,y),s(y))
       TRS:
        le(0(),y) -> true()
        le(s(x),0()) -> false()
        le(s(x),s(y)) -> le(x,y)
        minus(x,0()) -> x
        minus(s(x),s(y)) -> minus(x,y)
        gcd(0(),y) -> y
        gcd(s(x),0()) -> s(x)
        gcd(s(x),s(y)) -> if_gcd(le(y,x),s(x),s(y))
        if_gcd(true(),s(x),s(y)) -> gcd(minus(x,y),s(y))
        if_gcd(false(),s(x),s(y)) -> gcd(minus(y,x),s(x))
       Usable Rule Processor:
        DPs:
         gcd#(s(x),s(y)) -> if_gcd#(le(y,x),s(x),s(y))
         if_gcd#(true(),s(x),s(y)) -> gcd#(minus(x,y),s(y))
        TRS:
         le(0(),y) -> true()
         le(s(x),0()) -> false()
         le(s(x),s(y)) -> le(x,y)
         minus(x,0()) -> x
         minus(s(x),s(y)) -> minus(x,y)
        Arctic Interpretation Processor:
         dimension: 1
         usable rules:
          le(0(),y) -> true()
          le(s(x),0()) -> false()
          le(s(x),s(y)) -> le(x,y)
          minus(x,0()) -> x
          minus(s(x),s(y)) -> minus(x,y)
         interpretation:
          [if_gcd#](x0, x1, x2) = x0 + x1 + 0,
          
          [gcd#](x0, x1) = 2x0 + 0,
          
          [minus](x0, x1) = 2x0 + 0,
          
          [false] = 0,
          
          [s](x0) = 4x0 + 2,
          
          [true] = 0,
          
          [le](x0, x1) = x1 + 0,
          
          [0] = 0
         orientation:
          gcd#(s(x),s(y)) = 6x + 4 >= 4x + 2 = if_gcd#(le(y,x),s(x),s(y))
          
          if_gcd#(true(),s(x),s(y)) = 4x + 2 >= 4x + 2 = gcd#(minus(x,y),s(y))
          
          le(0(),y) = y + 0 >= 0 = true()
          
          le(s(x),0()) = 0 >= 0 = false()
          
          le(s(x),s(y)) = 4y + 2 >= y + 0 = le(x,y)
          
          minus(x,0()) = 2x + 0 >= x = x
          
          minus(s(x),s(y)) = 6x + 4 >= 2x + 0 = minus(x,y)
         problem:
          DPs:
           if_gcd#(true(),s(x),s(y)) -> gcd#(minus(x,y),s(y))
          TRS:
           le(0(),y) -> true()
           le(s(x),0()) -> false()
           le(s(x),s(y)) -> le(x,y)
           minus(x,0()) -> x
           minus(s(x),s(y)) -> minus(x,y)
         Restore Modifier:
          DPs:
           if_gcd#(true(),s(x),s(y)) -> gcd#(minus(x,y),s(y))
          TRS:
           le(0(),y) -> true()
           le(s(x),0()) -> false()
           le(s(x),s(y)) -> le(x,y)
           minus(x,0()) -> x
           minus(s(x),s(y)) -> minus(x,y)
           gcd(0(),y) -> y
           gcd(s(x),0()) -> s(x)
           gcd(s(x),s(y)) -> if_gcd(le(y,x),s(x),s(y))
           if_gcd(true(),s(x),s(y)) -> gcd(minus(x,y),s(y))
           if_gcd(false(),s(x),s(y)) -> gcd(minus(y,x),s(x))
          SCC Processor:
           #sccs: 0
           #rules: 0
           #arcs: 4/1
           
    
    DPs:
     minus#(s(x),s(y)) -> minus#(x,y)
    TRS:
     le(0(),y) -> true()
     le(s(x),0()) -> false()
     le(s(x),s(y)) -> le(x,y)
     minus(x,0()) -> x
     minus(s(x),s(y)) -> minus(x,y)
     gcd(0(),y) -> y
     gcd(s(x),0()) -> s(x)
     gcd(s(x),s(y)) -> if_gcd(le(y,x),s(x),s(y))
     if_gcd(true(),s(x),s(y)) -> gcd(minus(x,y),s(y))
     if_gcd(false(),s(x),s(y)) -> gcd(minus(y,x),s(x))
    Subterm Criterion Processor:
     simple projection:
      pi(minus#) = 1
     problem:
      DPs:
       
      TRS:
       le(0(),y) -> true()
       le(s(x),0()) -> false()
       le(s(x),s(y)) -> le(x,y)
       minus(x,0()) -> x
       minus(s(x),s(y)) -> minus(x,y)
       gcd(0(),y) -> y
       gcd(s(x),0()) -> s(x)
       gcd(s(x),s(y)) -> if_gcd(le(y,x),s(x),s(y))
       if_gcd(true(),s(x),s(y)) -> gcd(minus(x,y),s(y))
       if_gcd(false(),s(x),s(y)) -> gcd(minus(y,x),s(x))
     Qed
    
    DPs:
     le#(s(x),s(y)) -> le#(x,y)
    TRS:
     le(0(),y) -> true()
     le(s(x),0()) -> false()
     le(s(x),s(y)) -> le(x,y)
     minus(x,0()) -> x
     minus(s(x),s(y)) -> minus(x,y)
     gcd(0(),y) -> y
     gcd(s(x),0()) -> s(x)
     gcd(s(x),s(y)) -> if_gcd(le(y,x),s(x),s(y))
     if_gcd(true(),s(x),s(y)) -> gcd(minus(x,y),s(y))
     if_gcd(false(),s(x),s(y)) -> gcd(minus(y,x),s(x))
    Subterm Criterion Processor:
     simple projection:
      pi(le#) = 1
     problem:
      DPs:
       
      TRS:
       le(0(),y) -> true()
       le(s(x),0()) -> false()
       le(s(x),s(y)) -> le(x,y)
       minus(x,0()) -> x
       minus(s(x),s(y)) -> minus(x,y)
       gcd(0(),y) -> y
       gcd(s(x),0()) -> s(x)
       gcd(s(x),s(y)) -> if_gcd(le(y,x),s(x),s(y))
       if_gcd(true(),s(x),s(y)) -> gcd(minus(x,y),s(y))
       if_gcd(false(),s(x),s(y)) -> gcd(minus(y,x),s(x))
     Qed