YES

Problem:
 app(app(plus(),0()),y) -> y
 app(app(plus(),app(s(),x)),y) -> app(s(),app(app(plus(),x),y))
 app(app(times(),0()),y) -> 0()
 app(app(times(),app(s(),x)),y) -> app(app(plus(),app(app(times(),x),y)),y)
 app(app(app(comp(),f),g),x) -> app(f,app(g,x))
 app(twice(),f) -> app(app(comp(),f),f)

Proof:
 DP Processor:
  DPs:
   app#(app(plus(),app(s(),x)),y) -> app#(plus(),x)
   app#(app(plus(),app(s(),x)),y) -> app#(app(plus(),x),y)
   app#(app(plus(),app(s(),x)),y) -> app#(s(),app(app(plus(),x),y))
   app#(app(times(),app(s(),x)),y) -> app#(times(),x)
   app#(app(times(),app(s(),x)),y) -> app#(app(times(),x),y)
   app#(app(times(),app(s(),x)),y) -> app#(plus(),app(app(times(),x),y))
   app#(app(times(),app(s(),x)),y) -> app#(app(plus(),app(app(times(),x),y)),y)
   app#(app(app(comp(),f),g),x) -> app#(g,x)
   app#(app(app(comp(),f),g),x) -> app#(f,app(g,x))
   app#(twice(),f) -> app#(comp(),f)
   app#(twice(),f) -> app#(app(comp(),f),f)
  TRS:
   app(app(plus(),0()),y) -> y
   app(app(plus(),app(s(),x)),y) -> app(s(),app(app(plus(),x),y))
   app(app(times(),0()),y) -> 0()
   app(app(times(),app(s(),x)),y) -> app(app(plus(),app(app(times(),x),y)),y)
   app(app(app(comp(),f),g),x) -> app(f,app(g,x))
   app(twice(),f) -> app(app(comp(),f),f)
  EDG Processor:
   DPs:
    app#(app(plus(),app(s(),x)),y) -> app#(plus(),x)
    app#(app(plus(),app(s(),x)),y) -> app#(app(plus(),x),y)
    app#(app(plus(),app(s(),x)),y) -> app#(s(),app(app(plus(),x),y))
    app#(app(times(),app(s(),x)),y) -> app#(times(),x)
    app#(app(times(),app(s(),x)),y) -> app#(app(times(),x),y)
    app#(app(times(),app(s(),x)),y) -> app#(plus(),app(app(times(),x),y))
    app#(app(times(),app(s(),x)),y) -> app#(app(plus(),app(app(times(),x),y)),y)
    app#(app(app(comp(),f),g),x) -> app#(g,x)
    app#(app(app(comp(),f),g),x) -> app#(f,app(g,x))
    app#(twice(),f) -> app#(comp(),f)
    app#(twice(),f) -> app#(app(comp(),f),f)
   TRS:
    app(app(plus(),0()),y) -> y
    app(app(plus(),app(s(),x)),y) -> app(s(),app(app(plus(),x),y))
    app(app(times(),0()),y) -> 0()
    app(app(times(),app(s(),x)),y) -> app(app(plus(),app(app(times(),x),y)),y)
    app(app(app(comp(),f),g),x) -> app(f,app(g,x))
    app(twice(),f) -> app(app(comp(),f),f)
   graph:
    app#(app(times(),app(s(),x)),y) -> app#(app(times(),x),y) ->
    app#(app(times(),app(s(),x)),y) -> app#(times(),x)
    app#(app(times(),app(s(),x)),y) -> app#(app(times(),x),y) ->
    app#(app(times(),app(s(),x)),y) -> app#(app(times(),x),y)
    app#(app(times(),app(s(),x)),y) -> app#(app(times(),x),y) ->
    app#(app(times(),app(s(),x)),y) -> app#(plus(),app(app(times(),x),y))
    app#(app(times(),app(s(),x)),y) -> app#(app(times(),x),y) ->
    app#(app(times(),app(s(),x)),y) -> app#(app(plus(),app(app(times(),x),y)),y)
    app#(app(times(),app(s(),x)),y) -> app#(app(plus(),app(app(times(),x),y)),y) ->
    app#(app(plus(),app(s(),x)),y) -> app#(plus(),x)
    app#(app(times(),app(s(),x)),y) -> app#(app(plus(),app(app(times(),x),y)),y) ->
    app#(app(plus(),app(s(),x)),y) -> app#(app(plus(),x),y)
    app#(app(times(),app(s(),x)),y) -> app#(app(plus(),app(app(times(),x),y)),y) ->
    app#(app(plus(),app(s(),x)),y) -> app#(s(),app(app(plus(),x),y))
    app#(app(app(comp(),f),g),x) -> app#(g,x) ->
    app#(app(plus(),app(s(),x)),y) -> app#(plus(),x)
    app#(app(app(comp(),f),g),x) -> app#(g,x) ->
    app#(app(plus(),app(s(),x)),y) -> app#(app(plus(),x),y)
    app#(app(app(comp(),f),g),x) -> app#(g,x) ->
    app#(app(plus(),app(s(),x)),y) -> app#(s(),app(app(plus(),x),y))
    app#(app(app(comp(),f),g),x) -> app#(g,x) ->
    app#(app(times(),app(s(),x)),y) -> app#(times(),x)
    app#(app(app(comp(),f),g),x) -> app#(g,x) ->
    app#(app(times(),app(s(),x)),y) -> app#(app(times(),x),y)
    app#(app(app(comp(),f),g),x) -> app#(g,x) ->
    app#(app(times(),app(s(),x)),y) -> app#(plus(),app(app(times(),x),y))
    app#(app(app(comp(),f),g),x) -> app#(g,x) ->
    app#(app(times(),app(s(),x)),y) -> app#(app(plus(),app(app(times(),x),y)),y)
    app#(app(app(comp(),f),g),x) -> app#(g,x) ->
    app#(app(app(comp(),f),g),x) -> app#(g,x)
    app#(app(app(comp(),f),g),x) -> app#(g,x) ->
    app#(app(app(comp(),f),g),x) -> app#(f,app(g,x))
    app#(app(app(comp(),f),g),x) -> app#(g,x) ->
    app#(twice(),f) -> app#(comp(),f)
    app#(app(app(comp(),f),g),x) -> app#(g,x) ->
    app#(twice(),f) -> app#(app(comp(),f),f)
    app#(app(app(comp(),f),g),x) -> app#(f,app(g,x)) ->
    app#(app(plus(),app(s(),x)),y) -> app#(plus(),x)
    app#(app(app(comp(),f),g),x) -> app#(f,app(g,x)) ->
    app#(app(plus(),app(s(),x)),y) -> app#(app(plus(),x),y)
    app#(app(app(comp(),f),g),x) -> app#(f,app(g,x)) ->
    app#(app(plus(),app(s(),x)),y) -> app#(s(),app(app(plus(),x),y))
    app#(app(app(comp(),f),g),x) -> app#(f,app(g,x)) ->
    app#(app(times(),app(s(),x)),y) -> app#(times(),x)
    app#(app(app(comp(),f),g),x) -> app#(f,app(g,x)) ->
    app#(app(times(),app(s(),x)),y) -> app#(app(times(),x),y)
    app#(app(app(comp(),f),g),x) -> app#(f,app(g,x)) ->
    app#(app(times(),app(s(),x)),y) -> app#(plus(),app(app(times(),x),y))
    app#(app(app(comp(),f),g),x) -> app#(f,app(g,x)) ->
    app#(app(times(),app(s(),x)),y) -> app#(app(plus(),app(app(times(),x),y)),y)
    app#(app(app(comp(),f),g),x) -> app#(f,app(g,x)) ->
    app#(app(app(comp(),f),g),x) -> app#(g,x)
    app#(app(app(comp(),f),g),x) -> app#(f,app(g,x)) ->
    app#(app(app(comp(),f),g),x) -> app#(f,app(g,x))
    app#(app(app(comp(),f),g),x) -> app#(f,app(g,x)) ->
    app#(twice(),f) -> app#(comp(),f)
    app#(app(app(comp(),f),g),x) -> app#(f,app(g,x)) ->
    app#(twice(),f) -> app#(app(comp(),f),f)
    app#(app(plus(),app(s(),x)),y) -> app#(app(plus(),x),y) ->
    app#(app(plus(),app(s(),x)),y) -> app#(plus(),x)
    app#(app(plus(),app(s(),x)),y) -> app#(app(plus(),x),y) ->
    app#(app(plus(),app(s(),x)),y) -> app#(app(plus(),x),y)
    app#(app(plus(),app(s(),x)),y) -> app#(app(plus(),x),y) ->
    app#(app(plus(),app(s(),x)),y) -> app#(s(),app(app(plus(),x),y))
   SCC Processor:
    #sccs: 3
    #rules: 4
    #arcs: 32/121
    DPs:
     app#(app(app(comp(),f),g),x) -> app#(g,x)
     app#(app(app(comp(),f),g),x) -> app#(f,app(g,x))
    TRS:
     app(app(plus(),0()),y) -> y
     app(app(plus(),app(s(),x)),y) -> app(s(),app(app(plus(),x),y))
     app(app(times(),0()),y) -> 0()
     app(app(times(),app(s(),x)),y) -> app(app(plus(),app(app(times(),x),y)),y)
     app(app(app(comp(),f),g),x) -> app(f,app(g,x))
     app(twice(),f) -> app(app(comp(),f),f)
    Subterm Criterion Processor:
     simple projection:
      pi(app#) = 0
     problem:
      DPs:
       
      TRS:
       app(app(plus(),0()),y) -> y
       app(app(plus(),app(s(),x)),y) -> app(s(),app(app(plus(),x),y))
       app(app(times(),0()),y) -> 0()
       app(app(times(),app(s(),x)),y) -> app(app(plus(),app(app(times(),x),y)),y)
       app(app(app(comp(),f),g),x) -> app(f,app(g,x))
       app(twice(),f) -> app(app(comp(),f),f)
     Qed
    
    DPs:
     app#(app(times(),app(s(),x)),y) -> app#(app(times(),x),y)
    TRS:
     app(app(plus(),0()),y) -> y
     app(app(plus(),app(s(),x)),y) -> app(s(),app(app(plus(),x),y))
     app(app(times(),0()),y) -> 0()
     app(app(times(),app(s(),x)),y) -> app(app(plus(),app(app(times(),x),y)),y)
     app(app(app(comp(),f),g),x) -> app(f,app(g,x))
     app(twice(),f) -> app(app(comp(),f),f)
    Usable Rule Processor:
     DPs:
      app#(app(times(),app(s(),x)),y) -> app#(app(times(),x),y)
     TRS:
      
     Bounds Processor:
      bound: 1
      enrichment: match-dp
      automaton:
       final states: {5}
       transitions:
        app{#,0}(6,4) -> 5*
        app0(3,1) -> 3*
        app0(3,3) -> 3*
        app0(1,2) -> 3*
        app0(2,1) -> 3*
        app0(2,3) -> 3*
        app0(3,2) -> 3*
        app0(1,1) -> 3*
        app0(1,3) -> 3*
        app0(2,2) -> 3*
        app0(2,4) -> 6*
        times0() -> 2*
        s0() -> 1*
        app{#,1}(8,4) -> 5*
        app1(7,1) -> 8*
        app1(7,3) -> 8*
        app1(7,2) -> 8*
        times1() -> 7*
        1 -> 4*
        2 -> 4*
        3 -> 4*
      problem:
       DPs:
        
       TRS:
        
      Qed
    
    DPs:
     app#(app(plus(),app(s(),x)),y) -> app#(app(plus(),x),y)
    TRS:
     app(app(plus(),0()),y) -> y
     app(app(plus(),app(s(),x)),y) -> app(s(),app(app(plus(),x),y))
     app(app(times(),0()),y) -> 0()
     app(app(times(),app(s(),x)),y) -> app(app(plus(),app(app(times(),x),y)),y)
     app(app(app(comp(),f),g),x) -> app(f,app(g,x))
     app(twice(),f) -> app(app(comp(),f),f)
    Usable Rule Processor:
     DPs:
      app#(app(plus(),app(s(),x)),y) -> app#(app(plus(),x),y)
     TRS:
      
     Bounds Processor:
      bound: 1
      enrichment: match-dp
      automaton:
       final states: {5}
       transitions:
        plus1() -> 7*
        app{#,0}(6,4) -> 5*
        app0(3,1) -> 3*
        app0(3,3) -> 3*
        app0(1,2) -> 3*
        app0(2,1) -> 3*
        app0(2,3) -> 3*
        app0(3,2) -> 3*
        app0(1,1) -> 3*
        app0(1,3) -> 3*
        app0(2,2) -> 3*
        app0(2,4) -> 6*
        s0() -> 1*
        app{#,1}(8,4) -> 5*
        app1(7,1) -> 8*
        app1(7,3) -> 8*
        app1(7,2) -> 8*
        plus0() -> 2*
        1 -> 4*
        2 -> 4*
        3 -> 4*
      problem:
       DPs:
        
       TRS:
        
      Qed