YES

Problem:
 and(true(),X) -> activate(X)
 and(false(),Y) -> false()
 if(true(),X,Y) -> activate(X)
 if(false(),X,Y) -> activate(Y)
 add(0(),X) -> activate(X)
 add(s(X),Y) -> s(n__add(activate(X),activate(Y)))
 first(0(),X) -> nil()
 first(s(X),cons(Y,Z)) -> cons(activate(Y),n__first(activate(X),activate(Z)))
 from(X) -> cons(activate(X),n__from(n__s(activate(X))))
 add(X1,X2) -> n__add(X1,X2)
 first(X1,X2) -> n__first(X1,X2)
 from(X) -> n__from(X)
 s(X) -> n__s(X)
 activate(n__add(X1,X2)) -> add(X1,X2)
 activate(n__first(X1,X2)) -> first(X1,X2)
 activate(n__from(X)) -> from(X)
 activate(n__s(X)) -> s(X)
 activate(X) -> X

Proof:
 DP Processor:
  DPs:
   and#(true(),X) -> activate#(X)
   if#(true(),X,Y) -> activate#(X)
   if#(false(),X,Y) -> activate#(Y)
   add#(0(),X) -> activate#(X)
   add#(s(X),Y) -> activate#(Y)
   add#(s(X),Y) -> activate#(X)
   add#(s(X),Y) -> s#(n__add(activate(X),activate(Y)))
   first#(s(X),cons(Y,Z)) -> activate#(Z)
   first#(s(X),cons(Y,Z)) -> activate#(X)
   first#(s(X),cons(Y,Z)) -> activate#(Y)
   from#(X) -> activate#(X)
   activate#(n__add(X1,X2)) -> add#(X1,X2)
   activate#(n__first(X1,X2)) -> first#(X1,X2)
   activate#(n__from(X)) -> from#(X)
   activate#(n__s(X)) -> s#(X)
  TRS:
   and(true(),X) -> activate(X)
   and(false(),Y) -> false()
   if(true(),X,Y) -> activate(X)
   if(false(),X,Y) -> activate(Y)
   add(0(),X) -> activate(X)
   add(s(X),Y) -> s(n__add(activate(X),activate(Y)))
   first(0(),X) -> nil()
   first(s(X),cons(Y,Z)) -> cons(activate(Y),n__first(activate(X),activate(Z)))
   from(X) -> cons(activate(X),n__from(n__s(activate(X))))
   add(X1,X2) -> n__add(X1,X2)
   first(X1,X2) -> n__first(X1,X2)
   from(X) -> n__from(X)
   s(X) -> n__s(X)
   activate(n__add(X1,X2)) -> add(X1,X2)
   activate(n__first(X1,X2)) -> first(X1,X2)
   activate(n__from(X)) -> from(X)
   activate(n__s(X)) -> s(X)
   activate(X) -> X
  TDG Processor:
   DPs:
    and#(true(),X) -> activate#(X)
    if#(true(),X,Y) -> activate#(X)
    if#(false(),X,Y) -> activate#(Y)
    add#(0(),X) -> activate#(X)
    add#(s(X),Y) -> activate#(Y)
    add#(s(X),Y) -> activate#(X)
    add#(s(X),Y) -> s#(n__add(activate(X),activate(Y)))
    first#(s(X),cons(Y,Z)) -> activate#(Z)
    first#(s(X),cons(Y,Z)) -> activate#(X)
    first#(s(X),cons(Y,Z)) -> activate#(Y)
    from#(X) -> activate#(X)
    activate#(n__add(X1,X2)) -> add#(X1,X2)
    activate#(n__first(X1,X2)) -> first#(X1,X2)
    activate#(n__from(X)) -> from#(X)
    activate#(n__s(X)) -> s#(X)
   TRS:
    and(true(),X) -> activate(X)
    and(false(),Y) -> false()
    if(true(),X,Y) -> activate(X)
    if(false(),X,Y) -> activate(Y)
    add(0(),X) -> activate(X)
    add(s(X),Y) -> s(n__add(activate(X),activate(Y)))
    first(0(),X) -> nil()
    first(s(X),cons(Y,Z)) -> cons(activate(Y),n__first(activate(X),activate(Z)))
    from(X) -> cons(activate(X),n__from(n__s(activate(X))))
    add(X1,X2) -> n__add(X1,X2)
    first(X1,X2) -> n__first(X1,X2)
    from(X) -> n__from(X)
    s(X) -> n__s(X)
    activate(n__add(X1,X2)) -> add(X1,X2)
    activate(n__first(X1,X2)) -> first(X1,X2)
    activate(n__from(X)) -> from(X)
    activate(n__s(X)) -> s(X)
    activate(X) -> X
   graph:
    from#(X) -> activate#(X) -> activate#(n__s(X)) -> s#(X)
    from#(X) -> activate#(X) -> activate#(n__from(X)) -> from#(X)
    from#(X) -> activate#(X) -> activate#(n__first(X1,X2)) -> first#(X1,X2)
    from#(X) -> activate#(X) ->
    activate#(n__add(X1,X2)) -> add#(X1,X2)
    first#(s(X),cons(Y,Z)) -> activate#(Z) ->
    activate#(n__s(X)) -> s#(X)
    first#(s(X),cons(Y,Z)) -> activate#(Z) ->
    activate#(n__from(X)) -> from#(X)
    first#(s(X),cons(Y,Z)) -> activate#(Z) ->
    activate#(n__first(X1,X2)) -> first#(X1,X2)
    first#(s(X),cons(Y,Z)) -> activate#(Z) ->
    activate#(n__add(X1,X2)) -> add#(X1,X2)
    first#(s(X),cons(Y,Z)) -> activate#(Y) ->
    activate#(n__s(X)) -> s#(X)
    first#(s(X),cons(Y,Z)) -> activate#(Y) ->
    activate#(n__from(X)) -> from#(X)
    first#(s(X),cons(Y,Z)) -> activate#(Y) ->
    activate#(n__first(X1,X2)) -> first#(X1,X2)
    first#(s(X),cons(Y,Z)) -> activate#(Y) ->
    activate#(n__add(X1,X2)) -> add#(X1,X2)
    first#(s(X),cons(Y,Z)) -> activate#(X) ->
    activate#(n__s(X)) -> s#(X)
    first#(s(X),cons(Y,Z)) -> activate#(X) ->
    activate#(n__from(X)) -> from#(X)
    first#(s(X),cons(Y,Z)) -> activate#(X) ->
    activate#(n__first(X1,X2)) -> first#(X1,X2)
    first#(s(X),cons(Y,Z)) -> activate#(X) ->
    activate#(n__add(X1,X2)) -> add#(X1,X2)
    add#(s(X),Y) -> activate#(Y) -> activate#(n__s(X)) -> s#(X)
    add#(s(X),Y) -> activate#(Y) -> activate#(n__from(X)) -> from#(X)
    add#(s(X),Y) -> activate#(Y) ->
    activate#(n__first(X1,X2)) -> first#(X1,X2)
    add#(s(X),Y) -> activate#(Y) ->
    activate#(n__add(X1,X2)) -> add#(X1,X2)
    add#(s(X),Y) -> activate#(X) -> activate#(n__s(X)) -> s#(X)
    add#(s(X),Y) -> activate#(X) -> activate#(n__from(X)) -> from#(X)
    add#(s(X),Y) -> activate#(X) ->
    activate#(n__first(X1,X2)) -> first#(X1,X2)
    add#(s(X),Y) -> activate#(X) ->
    activate#(n__add(X1,X2)) -> add#(X1,X2)
    add#(0(),X) -> activate#(X) -> activate#(n__s(X)) -> s#(X)
    add#(0(),X) -> activate#(X) -> activate#(n__from(X)) -> from#(X)
    add#(0(),X) -> activate#(X) ->
    activate#(n__first(X1,X2)) -> first#(X1,X2)
    add#(0(),X) -> activate#(X) ->
    activate#(n__add(X1,X2)) -> add#(X1,X2)
    if#(false(),X,Y) -> activate#(Y) -> activate#(n__s(X)) -> s#(X)
    if#(false(),X,Y) -> activate#(Y) ->
    activate#(n__from(X)) -> from#(X)
    if#(false(),X,Y) -> activate#(Y) ->
    activate#(n__first(X1,X2)) -> first#(X1,X2)
    if#(false(),X,Y) -> activate#(Y) ->
    activate#(n__add(X1,X2)) -> add#(X1,X2)
    if#(true(),X,Y) -> activate#(X) -> activate#(n__s(X)) -> s#(X)
    if#(true(),X,Y) -> activate#(X) ->
    activate#(n__from(X)) -> from#(X)
    if#(true(),X,Y) -> activate#(X) ->
    activate#(n__first(X1,X2)) -> first#(X1,X2)
    if#(true(),X,Y) -> activate#(X) ->
    activate#(n__add(X1,X2)) -> add#(X1,X2)
    activate#(n__from(X)) -> from#(X) ->
    from#(X) -> activate#(X)
    activate#(n__first(X1,X2)) -> first#(X1,X2) ->
    first#(s(X),cons(Y,Z)) -> activate#(Y)
    activate#(n__first(X1,X2)) -> first#(X1,X2) ->
    first#(s(X),cons(Y,Z)) -> activate#(X)
    activate#(n__first(X1,X2)) -> first#(X1,X2) ->
    first#(s(X),cons(Y,Z)) -> activate#(Z)
    activate#(n__add(X1,X2)) -> add#(X1,X2) ->
    add#(s(X),Y) -> s#(n__add(activate(X),activate(Y)))
    activate#(n__add(X1,X2)) -> add#(X1,X2) ->
    add#(s(X),Y) -> activate#(X)
    activate#(n__add(X1,X2)) -> add#(X1,X2) ->
    add#(s(X),Y) -> activate#(Y)
    activate#(n__add(X1,X2)) -> add#(X1,X2) ->
    add#(0(),X) -> activate#(X)
    and#(true(),X) -> activate#(X) -> activate#(n__s(X)) -> s#(X)
    and#(true(),X) -> activate#(X) ->
    activate#(n__from(X)) -> from#(X)
    and#(true(),X) -> activate#(X) ->
    activate#(n__first(X1,X2)) -> first#(X1,X2)
    and#(true(),X) -> activate#(X) -> activate#(n__add(X1,X2)) -> add#(X1,X2)
   SCC Processor:
    #sccs: 1
    #rules: 10
    #arcs: 48/225
    DPs:
     from#(X) -> activate#(X)
     activate#(n__add(X1,X2)) -> add#(X1,X2)
     add#(0(),X) -> activate#(X)
     activate#(n__first(X1,X2)) -> first#(X1,X2)
     first#(s(X),cons(Y,Z)) -> activate#(Z)
     activate#(n__from(X)) -> from#(X)
     first#(s(X),cons(Y,Z)) -> activate#(X)
     first#(s(X),cons(Y,Z)) -> activate#(Y)
     add#(s(X),Y) -> activate#(Y)
     add#(s(X),Y) -> activate#(X)
    TRS:
     and(true(),X) -> activate(X)
     and(false(),Y) -> false()
     if(true(),X,Y) -> activate(X)
     if(false(),X,Y) -> activate(Y)
     add(0(),X) -> activate(X)
     add(s(X),Y) -> s(n__add(activate(X),activate(Y)))
     first(0(),X) -> nil()
     first(s(X),cons(Y,Z)) -> cons(activate(Y),n__first(activate(X),activate(Z)))
     from(X) -> cons(activate(X),n__from(n__s(activate(X))))
     add(X1,X2) -> n__add(X1,X2)
     first(X1,X2) -> n__first(X1,X2)
     from(X) -> n__from(X)
     s(X) -> n__s(X)
     activate(n__add(X1,X2)) -> add(X1,X2)
     activate(n__first(X1,X2)) -> first(X1,X2)
     activate(n__from(X)) -> from(X)
     activate(n__s(X)) -> s(X)
     activate(X) -> X
    Arctic Interpretation Processor:
     dimension: 1
     interpretation:
      [from#](x0) = x0 + 2,
      
      [first#](x0, x1) = x0 + x1 + 0,
      
      [add#](x0, x1) = 5x0 + x1,
      
      [activate#](x0) = x0,
      
      [n__from](x0) = x0 + 2,
      
      [n__s](x0) = x0 + 1,
      
      [from](x0) = x0 + 2,
      
      [n__first](x0, x1) = x0 + x1 + 0,
      
      [cons](x0, x1) = x0 + x1 + 1,
      
      [nil] = 0,
      
      [first](x0, x1) = x0 + x1 + 0,
      
      [n__add](x0, x1) = 5x0 + x1 + 0,
      
      [s](x0) = x0 + 1,
      
      [add](x0, x1) = 5x0 + x1 + 0,
      
      [0] = 0,
      
      [if](x0, x1, x2) = 7x0 + x1 + x2 + 0,
      
      [false] = 0,
      
      [activate](x0) = x0 + 0,
      
      [and](x0, x1) = 7x0 + x1 + 0,
      
      [true] = 0
     orientation:
      from#(X) = X + 2 >= X = activate#(X)
      
      activate#(n__add(X1,X2)) = 5X1 + X2 + 0 >= 5X1 + X2 = add#(X1,X2)
      
      add#(0(),X) = X + 5 >= X = activate#(X)
      
      activate#(n__first(X1,X2)) = X1 + X2 + 0 >= X1 + X2 + 0 = first#(X1,X2)
      
      first#(s(X),cons(Y,Z)) = X + Y + Z + 1 >= Z = activate#(Z)
      
      activate#(n__from(X)) = X + 2 >= X + 2 = from#(X)
      
      first#(s(X),cons(Y,Z)) = X + Y + Z + 1 >= X = activate#(X)
      
      first#(s(X),cons(Y,Z)) = X + Y + Z + 1 >= Y = activate#(Y)
      
      add#(s(X),Y) = 5X + Y + 6 >= Y = activate#(Y)
      
      add#(s(X),Y) = 5X + Y + 6 >= X = activate#(X)
      
      and(true(),X) = X + 7 >= X + 0 = activate(X)
      
      and(false(),Y) = Y + 7 >= 0 = false()
      
      if(true(),X,Y) = X + Y + 7 >= X + 0 = activate(X)
      
      if(false(),X,Y) = X + Y + 7 >= Y + 0 = activate(Y)
      
      add(0(),X) = X + 5 >= X + 0 = activate(X)
      
      add(s(X),Y) = 5X + Y + 6 >= 5X + Y + 5 = s(n__add(activate(X),activate(Y)))
      
      first(0(),X) = X + 0 >= 0 = nil()
      
      first(s(X),cons(Y,Z)) = X + Y + Z + 1 >= X + Y + Z + 1 = cons(activate(Y),n__first(activate(X),activate(Z)))
      
      from(X) = X + 2 >= X + 2 = cons(activate(X),n__from(n__s(activate(X))))
      
      add(X1,X2) = 5X1 + X2 + 0 >= 5X1 + X2 + 0 = n__add(X1,X2)
      
      first(X1,X2) = X1 + X2 + 0 >= X1 + X2 + 0 = n__first(X1,X2)
      
      from(X) = X + 2 >= X + 2 = n__from(X)
      
      s(X) = X + 1 >= X + 1 = n__s(X)
      
      activate(n__add(X1,X2)) = 5X1 + X2 + 0 >= 5X1 + X2 + 0 = add(X1,X2)
      
      activate(n__first(X1,X2)) = X1 + X2 + 0 >= X1 + X2 + 0 = first(X1,X2)
      
      activate(n__from(X)) = X + 2 >= X + 2 = from(X)
      
      activate(n__s(X)) = X + 1 >= X + 1 = s(X)
      
      activate(X) = X + 0 >= X = X
     problem:
      DPs:
       from#(X) -> activate#(X)
       activate#(n__add(X1,X2)) -> add#(X1,X2)
       add#(0(),X) -> activate#(X)
       activate#(n__first(X1,X2)) -> first#(X1,X2)
       first#(s(X),cons(Y,Z)) -> activate#(Z)
       activate#(n__from(X)) -> from#(X)
       first#(s(X),cons(Y,Z)) -> activate#(X)
       first#(s(X),cons(Y,Z)) -> activate#(Y)
       add#(s(X),Y) -> activate#(Y)
      TRS:
       and(true(),X) -> activate(X)
       and(false(),Y) -> false()
       if(true(),X,Y) -> activate(X)
       if(false(),X,Y) -> activate(Y)
       add(0(),X) -> activate(X)
       add(s(X),Y) -> s(n__add(activate(X),activate(Y)))
       first(0(),X) -> nil()
       first(s(X),cons(Y,Z)) -> cons(activate(Y),n__first(activate(X),activate(Z)))
       from(X) -> cons(activate(X),n__from(n__s(activate(X))))
       add(X1,X2) -> n__add(X1,X2)
       first(X1,X2) -> n__first(X1,X2)
       from(X) -> n__from(X)
       s(X) -> n__s(X)
       activate(n__add(X1,X2)) -> add(X1,X2)
       activate(n__first(X1,X2)) -> first(X1,X2)
       activate(n__from(X)) -> from(X)
       activate(n__s(X)) -> s(X)
       activate(X) -> X
     Arctic Interpretation Processor:
      dimension: 1
      interpretation:
       [from#](x0) = 1x0,
       
       [first#](x0, x1) = 2x0 + 2x1,
       
       [add#](x0, x1) = x0 + 2x1 + 0,
       
       [activate#](x0) = 1x0,
       
       [n__from](x0) = 4x0,
       
       [n__s](x0) = x0,
       
       [from](x0) = 4x0,
       
       [n__first](x0, x1) = 2x0 + 2x1,
       
       [cons](x0, x1) = x0 + x1,
       
       [nil] = 2,
       
       [first](x0, x1) = 2x0 + 2x1,
       
       [n__add](x0, x1) = x0 + 1x1 + 0,
       
       [s](x0) = x0,
       
       [add](x0, x1) = x0 + 1x1 + 0,
       
       [0] = 0,
       
       [if](x0, x1, x2) = 8x1 + 8x2 + 0,
       
       [false] = 0,
       
       [activate](x0) = x0,
       
       [and](x0, x1) = 1x1 + 0,
       
       [true] = 0
      orientation:
       from#(X) = 1X >= 1X = activate#(X)
       
       activate#(n__add(X1,X2)) = 1X1 + 2X2 + 1 >= X1 + 2X2 + 0 = add#(X1,X2)
       
       add#(0(),X) = 2X + 0 >= 1X = activate#(X)
       
       activate#(n__first(X1,X2)) = 3X1 + 3X2 >= 2X1 + 2X2 = first#(X1,X2)
       
       first#(s(X),cons(Y,Z)) = 2X + 2Y + 2Z >= 1Z = activate#(Z)
       
       activate#(n__from(X)) = 5X >= 1X = from#(X)
       
       first#(s(X),cons(Y,Z)) = 2X + 2Y + 2Z >= 1X = activate#(X)
       
       first#(s(X),cons(Y,Z)) = 2X + 2Y + 2Z >= 1Y = activate#(Y)
       
       add#(s(X),Y) = X + 2Y + 0 >= 1Y = activate#(Y)
       
       and(true(),X) = 1X + 0 >= X = activate(X)
       
       and(false(),Y) = 1Y + 0 >= 0 = false()
       
       if(true(),X,Y) = 8X + 8Y + 0 >= X = activate(X)
       
       if(false(),X,Y) = 8X + 8Y + 0 >= Y = activate(Y)
       
       add(0(),X) = 1X + 0 >= X = activate(X)
       
       add(s(X),Y) = X + 1Y + 0 >= X + 1Y + 0 = s(n__add(activate(X),activate(Y)))
       
       first(0(),X) = 2X + 2 >= 2 = nil()
       
       first(s(X),cons(Y,Z)) = 2X + 2Y + 2Z >= 2X + Y + 2Z = cons(activate(Y),n__first(activate(X),activate(Z)))
       
       from(X) = 4X >= 4X = cons(activate(X),n__from(n__s(activate(X))))
       
       add(X1,X2) = X1 + 1X2 + 0 >= X1 + 1X2 + 0 = n__add(X1,X2)
       
       first(X1,X2) = 2X1 + 2X2 >= 2X1 + 2X2 = n__first(X1,X2)
       
       from(X) = 4X >= 4X = n__from(X)
       
       s(X) = X >= X = n__s(X)
       
       activate(n__add(X1,X2)) = X1 + 1X2 + 0 >= X1 + 1X2 + 0 = add(X1,X2)
       
       activate(n__first(X1,X2)) = 2X1 + 2X2 >= 2X1 + 2X2 = first(X1,X2)
       
       activate(n__from(X)) = 4X >= 4X = from(X)
       
       activate(n__s(X)) = X >= X = s(X)
       
       activate(X) = X >= X = X
      problem:
       DPs:
        from#(X) -> activate#(X)
        activate#(n__add(X1,X2)) -> add#(X1,X2)
       TRS:
        and(true(),X) -> activate(X)
        and(false(),Y) -> false()
        if(true(),X,Y) -> activate(X)
        if(false(),X,Y) -> activate(Y)
        add(0(),X) -> activate(X)
        add(s(X),Y) -> s(n__add(activate(X),activate(Y)))
        first(0(),X) -> nil()
        first(s(X),cons(Y,Z)) -> cons(activate(Y),n__first(activate(X),activate(Z)))
        from(X) -> cons(activate(X),n__from(n__s(activate(X))))
        add(X1,X2) -> n__add(X1,X2)
        first(X1,X2) -> n__first(X1,X2)
        from(X) -> n__from(X)
        s(X) -> n__s(X)
        activate(n__add(X1,X2)) -> add(X1,X2)
        activate(n__first(X1,X2)) -> first(X1,X2)
        activate(n__from(X)) -> from(X)
        activate(n__s(X)) -> s(X)
        activate(X) -> X
      SCC Processor:
       #sccs: 0
       #rules: 0
       #arcs: 28/4