YES

Problem:
 app(nil(),k) -> k
 app(l,nil()) -> l
 app(cons(x,l),k) -> cons(x,app(l,k))
 sum(cons(x,nil())) -> cons(x,nil())
 sum(cons(x,cons(y,l))) -> sum(cons(plus(x,y),l))
 sum(app(l,cons(x,cons(y,k)))) -> sum(app(l,sum(cons(x,cons(y,k)))))
 sum(plus(cons(0(),x),cons(y,l))) -> pred(sum(cons(s(x),cons(y,l))))
 pred(cons(s(x),nil())) -> cons(x,nil())
 plus(s(x),s(y)) -> s(s(plus(if(gt(x,y),x,y),if(not(gt(x,y)),id(x),id(y)))))
 plus(s(x),x) -> plus(if(gt(x,x),id(x),id(x)),s(x))
 plus(zero(),y) -> y
 plus(id(x),s(y)) -> s(plus(x,if(gt(s(y),y),y,s(y))))
 id(x) -> x
 if(true(),x,y) -> x
 if(false(),x,y) -> y
 not(x) -> if(x,false(),true())
 gt(s(x),zero()) -> true()
 gt(zero(),y) -> false()
 gt(s(x),s(y)) -> gt(x,y)

Proof:
 DP Processor:
  DPs:
   app#(cons(x,l),k) -> app#(l,k)
   sum#(cons(x,cons(y,l))) -> plus#(x,y)
   sum#(cons(x,cons(y,l))) -> sum#(cons(plus(x,y),l))
   sum#(app(l,cons(x,cons(y,k)))) -> sum#(cons(x,cons(y,k)))
   sum#(app(l,cons(x,cons(y,k)))) -> app#(l,sum(cons(x,cons(y,k))))
   sum#(app(l,cons(x,cons(y,k)))) -> sum#(app(l,sum(cons(x,cons(y,k)))))
   sum#(plus(cons(0(),x),cons(y,l))) -> sum#(cons(s(x),cons(y,l)))
   sum#(plus(cons(0(),x),cons(y,l))) -> pred#(sum(cons(s(x),cons(y,l))))
   plus#(s(x),s(y)) -> id#(y)
   plus#(s(x),s(y)) -> id#(x)
   plus#(s(x),s(y)) -> not#(gt(x,y))
   plus#(s(x),s(y)) -> if#(not(gt(x,y)),id(x),id(y))
   plus#(s(x),s(y)) -> gt#(x,y)
   plus#(s(x),s(y)) -> if#(gt(x,y),x,y)
   plus#(s(x),s(y)) -> plus#(if(gt(x,y),x,y),if(not(gt(x,y)),id(x),id(y)))
   plus#(s(x),x) -> id#(x)
   plus#(s(x),x) -> gt#(x,x)
   plus#(s(x),x) -> if#(gt(x,x),id(x),id(x))
   plus#(s(x),x) -> plus#(if(gt(x,x),id(x),id(x)),s(x))
   plus#(id(x),s(y)) -> gt#(s(y),y)
   plus#(id(x),s(y)) -> if#(gt(s(y),y),y,s(y))
   plus#(id(x),s(y)) -> plus#(x,if(gt(s(y),y),y,s(y)))
   not#(x) -> if#(x,false(),true())
   gt#(s(x),s(y)) -> gt#(x,y)
  TRS:
   app(nil(),k) -> k
   app(l,nil()) -> l
   app(cons(x,l),k) -> cons(x,app(l,k))
   sum(cons(x,nil())) -> cons(x,nil())
   sum(cons(x,cons(y,l))) -> sum(cons(plus(x,y),l))
   sum(app(l,cons(x,cons(y,k)))) -> sum(app(l,sum(cons(x,cons(y,k)))))
   sum(plus(cons(0(),x),cons(y,l))) -> pred(sum(cons(s(x),cons(y,l))))
   pred(cons(s(x),nil())) -> cons(x,nil())
   plus(s(x),s(y)) -> s(s(plus(if(gt(x,y),x,y),if(not(gt(x,y)),id(x),id(y)))))
   plus(s(x),x) -> plus(if(gt(x,x),id(x),id(x)),s(x))
   plus(zero(),y) -> y
   plus(id(x),s(y)) -> s(plus(x,if(gt(s(y),y),y,s(y))))
   id(x) -> x
   if(true(),x,y) -> x
   if(false(),x,y) -> y
   not(x) -> if(x,false(),true())
   gt(s(x),zero()) -> true()
   gt(zero(),y) -> false()
   gt(s(x),s(y)) -> gt(x,y)
  TDG Processor:
   DPs:
    app#(cons(x,l),k) -> app#(l,k)
    sum#(cons(x,cons(y,l))) -> plus#(x,y)
    sum#(cons(x,cons(y,l))) -> sum#(cons(plus(x,y),l))
    sum#(app(l,cons(x,cons(y,k)))) -> sum#(cons(x,cons(y,k)))
    sum#(app(l,cons(x,cons(y,k)))) -> app#(l,sum(cons(x,cons(y,k))))
    sum#(app(l,cons(x,cons(y,k)))) -> sum#(app(l,sum(cons(x,cons(y,k)))))
    sum#(plus(cons(0(),x),cons(y,l))) -> sum#(cons(s(x),cons(y,l)))
    sum#(plus(cons(0(),x),cons(y,l))) -> pred#(sum(cons(s(x),cons(y,l))))
    plus#(s(x),s(y)) -> id#(y)
    plus#(s(x),s(y)) -> id#(x)
    plus#(s(x),s(y)) -> not#(gt(x,y))
    plus#(s(x),s(y)) -> if#(not(gt(x,y)),id(x),id(y))
    plus#(s(x),s(y)) -> gt#(x,y)
    plus#(s(x),s(y)) -> if#(gt(x,y),x,y)
    plus#(s(x),s(y)) -> plus#(if(gt(x,y),x,y),if(not(gt(x,y)),id(x),id(y)))
    plus#(s(x),x) -> id#(x)
    plus#(s(x),x) -> gt#(x,x)
    plus#(s(x),x) -> if#(gt(x,x),id(x),id(x))
    plus#(s(x),x) -> plus#(if(gt(x,x),id(x),id(x)),s(x))
    plus#(id(x),s(y)) -> gt#(s(y),y)
    plus#(id(x),s(y)) -> if#(gt(s(y),y),y,s(y))
    plus#(id(x),s(y)) -> plus#(x,if(gt(s(y),y),y,s(y)))
    not#(x) -> if#(x,false(),true())
    gt#(s(x),s(y)) -> gt#(x,y)
   TRS:
    app(nil(),k) -> k
    app(l,nil()) -> l
    app(cons(x,l),k) -> cons(x,app(l,k))
    sum(cons(x,nil())) -> cons(x,nil())
    sum(cons(x,cons(y,l))) -> sum(cons(plus(x,y),l))
    sum(app(l,cons(x,cons(y,k)))) -> sum(app(l,sum(cons(x,cons(y,k)))))
    sum(plus(cons(0(),x),cons(y,l))) -> pred(sum(cons(s(x),cons(y,l))))
    pred(cons(s(x),nil())) -> cons(x,nil())
    plus(s(x),s(y)) -> s(s(plus(if(gt(x,y),x,y),if(not(gt(x,y)),id(x),id(y)))))
    plus(s(x),x) -> plus(if(gt(x,x),id(x),id(x)),s(x))
    plus(zero(),y) -> y
    plus(id(x),s(y)) -> s(plus(x,if(gt(s(y),y),y,s(y))))
    id(x) -> x
    if(true(),x,y) -> x
    if(false(),x,y) -> y
    not(x) -> if(x,false(),true())
    gt(s(x),zero()) -> true()
    gt(zero(),y) -> false()
    gt(s(x),s(y)) -> gt(x,y)
   graph:
    gt#(s(x),s(y)) -> gt#(x,y) -> gt#(s(x),s(y)) -> gt#(x,y)
    plus#(id(x),s(y)) -> gt#(s(y),y) ->
    gt#(s(x),s(y)) -> gt#(x,y)
    plus#(id(x),s(y)) -> plus#(x,if(gt(s(y),y),y,s(y))) ->
    plus#(id(x),s(y)) -> plus#(x,if(gt(s(y),y),y,s(y)))
    plus#(id(x),s(y)) -> plus#(x,if(gt(s(y),y),y,s(y))) ->
    plus#(id(x),s(y)) -> if#(gt(s(y),y),y,s(y))
    plus#(id(x),s(y)) -> plus#(x,if(gt(s(y),y),y,s(y))) ->
    plus#(id(x),s(y)) -> gt#(s(y),y)
    plus#(id(x),s(y)) -> plus#(x,if(gt(s(y),y),y,s(y))) ->
    plus#(s(x),x) -> plus#(if(gt(x,x),id(x),id(x)),s(x))
    plus#(id(x),s(y)) -> plus#(x,if(gt(s(y),y),y,s(y))) ->
    plus#(s(x),x) -> if#(gt(x,x),id(x),id(x))
    plus#(id(x),s(y)) -> plus#(x,if(gt(s(y),y),y,s(y))) ->
    plus#(s(x),x) -> gt#(x,x)
    plus#(id(x),s(y)) -> plus#(x,if(gt(s(y),y),y,s(y))) ->
    plus#(s(x),x) -> id#(x)
    plus#(id(x),s(y)) -> plus#(x,if(gt(s(y),y),y,s(y))) ->
    plus#(s(x),s(y)) -> plus#(if(gt(x,y),x,y),if(not(gt(x,y)),id(x),id(y)))
    plus#(id(x),s(y)) -> plus#(x,if(gt(s(y),y),y,s(y))) ->
    plus#(s(x),s(y)) -> if#(gt(x,y),x,y)
    plus#(id(x),s(y)) -> plus#(x,if(gt(s(y),y),y,s(y))) ->
    plus#(s(x),s(y)) -> gt#(x,y)
    plus#(id(x),s(y)) -> plus#(x,if(gt(s(y),y),y,s(y))) ->
    plus#(s(x),s(y)) -> if#(not(gt(x,y)),id(x),id(y))
    plus#(id(x),s(y)) -> plus#(x,if(gt(s(y),y),y,s(y))) ->
    plus#(s(x),s(y)) -> not#(gt(x,y))
    plus#(id(x),s(y)) -> plus#(x,if(gt(s(y),y),y,s(y))) ->
    plus#(s(x),s(y)) -> id#(x)
    plus#(id(x),s(y)) -> plus#(x,if(gt(s(y),y),y,s(y))) ->
    plus#(s(x),s(y)) -> id#(y)
    plus#(s(x),s(y)) -> gt#(x,y) -> gt#(s(x),s(y)) -> gt#(x,y)
    plus#(s(x),s(y)) -> not#(gt(x,y)) ->
    not#(x) -> if#(x,false(),true())
    plus#(s(x),s(y)) -> plus#(if(gt(x,y),x,y),if(not(gt(x,y)),id(x),id(y))) ->
    plus#(id(x),s(y)) -> plus#(x,if(gt(s(y),y),y,s(y)))
    plus#(s(x),s(y)) -> plus#(if(gt(x,y),x,y),if(not(gt(x,y)),id(x),id(y))) ->
    plus#(id(x),s(y)) -> if#(gt(s(y),y),y,s(y))
    plus#(s(x),s(y)) -> plus#(if(gt(x,y),x,y),if(not(gt(x,y)),id(x),id(y))) ->
    plus#(id(x),s(y)) -> gt#(s(y),y)
    plus#(s(x),s(y)) -> plus#(if(gt(x,y),x,y),if(not(gt(x,y)),id(x),id(y))) ->
    plus#(s(x),x) -> plus#(if(gt(x,x),id(x),id(x)),s(x))
    plus#(s(x),s(y)) -> plus#(if(gt(x,y),x,y),if(not(gt(x,y)),id(x),id(y))) ->
    plus#(s(x),x) -> if#(gt(x,x),id(x),id(x))
    plus#(s(x),s(y)) -> plus#(if(gt(x,y),x,y),if(not(gt(x,y)),id(x),id(y))) ->
    plus#(s(x),x) -> gt#(x,x)
    plus#(s(x),s(y)) -> plus#(if(gt(x,y),x,y),if(not(gt(x,y)),id(x),id(y))) ->
    plus#(s(x),x) -> id#(x)
    plus#(s(x),s(y)) -> plus#(if(gt(x,y),x,y),if(not(gt(x,y)),id(x),id(y))) ->
    plus#(s(x),s(y)) -> plus#(if(gt(x,y),x,y),if(not(gt(x,y)),id(x),id(y)))
    plus#(s(x),s(y)) -> plus#(if(gt(x,y),x,y),if(not(gt(x,y)),id(x),id(y))) ->
    plus#(s(x),s(y)) -> if#(gt(x,y),x,y)
    plus#(s(x),s(y)) -> plus#(if(gt(x,y),x,y),if(not(gt(x,y)),id(x),id(y))) ->
    plus#(s(x),s(y)) -> gt#(x,y)
    plus#(s(x),s(y)) -> plus#(if(gt(x,y),x,y),if(not(gt(x,y)),id(x),id(y))) ->
    plus#(s(x),s(y)) -> if#(not(gt(x,y)),id(x),id(y))
    plus#(s(x),s(y)) -> plus#(if(gt(x,y),x,y),if(not(gt(x,y)),id(x),id(y))) ->
    plus#(s(x),s(y)) -> not#(gt(x,y))
    plus#(s(x),s(y)) -> plus#(if(gt(x,y),x,y),if(not(gt(x,y)),id(x),id(y))) ->
    plus#(s(x),s(y)) -> id#(x)
    plus#(s(x),s(y)) -> plus#(if(gt(x,y),x,y),if(not(gt(x,y)),id(x),id(y))) ->
    plus#(s(x),s(y)) -> id#(y)
    plus#(s(x),x) -> gt#(x,x) ->
    gt#(s(x),s(y)) -> gt#(x,y)
    plus#(s(x),x) -> plus#(if(gt(x,x),id(x),id(x)),s(x)) ->
    plus#(id(x),s(y)) -> plus#(x,if(gt(s(y),y),y,s(y)))
    plus#(s(x),x) -> plus#(if(gt(x,x),id(x),id(x)),s(x)) ->
    plus#(id(x),s(y)) -> if#(gt(s(y),y),y,s(y))
    plus#(s(x),x) -> plus#(if(gt(x,x),id(x),id(x)),s(x)) ->
    plus#(id(x),s(y)) -> gt#(s(y),y)
    plus#(s(x),x) -> plus#(if(gt(x,x),id(x),id(x)),s(x)) ->
    plus#(s(x),x) -> plus#(if(gt(x,x),id(x),id(x)),s(x))
    plus#(s(x),x) -> plus#(if(gt(x,x),id(x),id(x)),s(x)) ->
    plus#(s(x),x) -> if#(gt(x,x),id(x),id(x))
    plus#(s(x),x) -> plus#(if(gt(x,x),id(x),id(x)),s(x)) ->
    plus#(s(x),x) -> gt#(x,x)
    plus#(s(x),x) -> plus#(if(gt(x,x),id(x),id(x)),s(x)) ->
    plus#(s(x),x) -> id#(x)
    plus#(s(x),x) -> plus#(if(gt(x,x),id(x),id(x)),s(x)) ->
    plus#(s(x),s(y)) -> plus#(if(gt(x,y),x,y),if(not(gt(x,y)),id(x),id(y)))
    plus#(s(x),x) -> plus#(if(gt(x,x),id(x),id(x)),s(x)) ->
    plus#(s(x),s(y)) -> if#(gt(x,y),x,y)
    plus#(s(x),x) -> plus#(if(gt(x,x),id(x),id(x)),s(x)) ->
    plus#(s(x),s(y)) -> gt#(x,y)
    plus#(s(x),x) -> plus#(if(gt(x,x),id(x),id(x)),s(x)) ->
    plus#(s(x),s(y)) -> if#(not(gt(x,y)),id(x),id(y))
    plus#(s(x),x) -> plus#(if(gt(x,x),id(x),id(x)),s(x)) ->
    plus#(s(x),s(y)) -> not#(gt(x,y))
    plus#(s(x),x) -> plus#(if(gt(x,x),id(x),id(x)),s(x)) ->
    plus#(s(x),s(y)) -> id#(x)
    plus#(s(x),x) -> plus#(if(gt(x,x),id(x),id(x)),s(x)) ->
    plus#(s(x),s(y)) -> id#(y)
    sum#(plus(cons(0(),x),cons(y,l))) -> sum#(cons(s(x),cons(y,l))) ->
    sum#(plus(cons(0(),x),cons(y,l))) -> pred#(sum(cons(s(x),cons(y,l))))
    sum#(plus(cons(0(),x),cons(y,l))) -> sum#(cons(s(x),cons(y,l))) ->
    sum#(plus(cons(0(),x),cons(y,l))) -> sum#(cons(s(x),cons(y,l)))
    sum#(plus(cons(0(),x),cons(y,l))) -> sum#(cons(s(x),cons(y,l))) ->
    sum#(app(l,cons(x,cons(y,k)))) -> sum#(app(l,sum(cons(x,cons(y,k)))))
    sum#(plus(cons(0(),x),cons(y,l))) -> sum#(cons(s(x),cons(y,l))) ->
    sum#(app(l,cons(x,cons(y,k)))) -> app#(l,sum(cons(x,cons(y,k))))
    sum#(plus(cons(0(),x),cons(y,l))) -> sum#(cons(s(x),cons(y,l))) ->
    sum#(app(l,cons(x,cons(y,k)))) -> sum#(cons(x,cons(y,k)))
    sum#(plus(cons(0(),x),cons(y,l))) -> sum#(cons(s(x),cons(y,l))) ->
    sum#(cons(x,cons(y,l))) -> sum#(cons(plus(x,y),l))
    sum#(plus(cons(0(),x),cons(y,l))) -> sum#(cons(s(x),cons(y,l))) ->
    sum#(cons(x,cons(y,l))) -> plus#(x,y)
    sum#(cons(x,cons(y,l))) -> plus#(x,y) ->
    plus#(id(x),s(y)) -> plus#(x,if(gt(s(y),y),y,s(y)))
    sum#(cons(x,cons(y,l))) -> plus#(x,y) ->
    plus#(id(x),s(y)) -> if#(gt(s(y),y),y,s(y))
    sum#(cons(x,cons(y,l))) -> plus#(x,y) ->
    plus#(id(x),s(y)) -> gt#(s(y),y)
    sum#(cons(x,cons(y,l))) -> plus#(x,y) ->
    plus#(s(x),x) -> plus#(if(gt(x,x),id(x),id(x)),s(x))
    sum#(cons(x,cons(y,l))) -> plus#(x,y) ->
    plus#(s(x),x) -> if#(gt(x,x),id(x),id(x))
    sum#(cons(x,cons(y,l))) -> plus#(x,y) ->
    plus#(s(x),x) -> gt#(x,x)
    sum#(cons(x,cons(y,l))) -> plus#(x,y) ->
    plus#(s(x),x) -> id#(x)
    sum#(cons(x,cons(y,l))) -> plus#(x,y) ->
    plus#(s(x),s(y)) -> plus#(if(gt(x,y),x,y),if(not(gt(x,y)),id(x),id(y)))
    sum#(cons(x,cons(y,l))) -> plus#(x,y) ->
    plus#(s(x),s(y)) -> if#(gt(x,y),x,y)
    sum#(cons(x,cons(y,l))) -> plus#(x,y) ->
    plus#(s(x),s(y)) -> gt#(x,y)
    sum#(cons(x,cons(y,l))) -> plus#(x,y) ->
    plus#(s(x),s(y)) -> if#(not(gt(x,y)),id(x),id(y))
    sum#(cons(x,cons(y,l))) -> plus#(x,y) ->
    plus#(s(x),s(y)) -> not#(gt(x,y))
    sum#(cons(x,cons(y,l))) -> plus#(x,y) ->
    plus#(s(x),s(y)) -> id#(x)
    sum#(cons(x,cons(y,l))) -> plus#(x,y) ->
    plus#(s(x),s(y)) -> id#(y)
    sum#(cons(x,cons(y,l))) -> sum#(cons(plus(x,y),l)) ->
    sum#(plus(cons(0(),x),cons(y,l))) -> pred#(sum(cons(s(x),cons(y,l))))
    sum#(cons(x,cons(y,l))) -> sum#(cons(plus(x,y),l)) ->
    sum#(plus(cons(0(),x),cons(y,l))) -> sum#(cons(s(x),cons(y,l)))
    sum#(cons(x,cons(y,l))) -> sum#(cons(plus(x,y),l)) ->
    sum#(app(l,cons(x,cons(y,k)))) -> sum#(app(l,sum(cons(x,cons(y,k)))))
    sum#(cons(x,cons(y,l))) -> sum#(cons(plus(x,y),l)) ->
    sum#(app(l,cons(x,cons(y,k)))) -> app#(l,sum(cons(x,cons(y,k))))
    sum#(cons(x,cons(y,l))) -> sum#(cons(plus(x,y),l)) ->
    sum#(app(l,cons(x,cons(y,k)))) -> sum#(cons(x,cons(y,k)))
    sum#(cons(x,cons(y,l))) -> sum#(cons(plus(x,y),l)) ->
    sum#(cons(x,cons(y,l))) -> sum#(cons(plus(x,y),l))
    sum#(cons(x,cons(y,l))) -> sum#(cons(plus(x,y),l)) ->
    sum#(cons(x,cons(y,l))) -> plus#(x,y)
    sum#(app(l,cons(x,cons(y,k)))) -> sum#(cons(x,cons(y,k))) ->
    sum#(plus(cons(0(),x),cons(y,l))) -> pred#(sum(cons(s(x),cons(y,l))))
    sum#(app(l,cons(x,cons(y,k)))) -> sum#(cons(x,cons(y,k))) ->
    sum#(plus(cons(0(),x),cons(y,l))) -> sum#(cons(s(x),cons(y,l)))
    sum#(app(l,cons(x,cons(y,k)))) -> sum#(cons(x,cons(y,k))) ->
    sum#(app(l,cons(x,cons(y,k)))) -> sum#(app(l,sum(cons(x,cons(y,k)))))
    sum#(app(l,cons(x,cons(y,k)))) -> sum#(cons(x,cons(y,k))) ->
    sum#(app(l,cons(x,cons(y,k)))) -> app#(l,sum(cons(x,cons(y,k))))
    sum#(app(l,cons(x,cons(y,k)))) -> sum#(cons(x,cons(y,k))) ->
    sum#(app(l,cons(x,cons(y,k)))) -> sum#(cons(x,cons(y,k)))
    sum#(app(l,cons(x,cons(y,k)))) -> sum#(cons(x,cons(y,k))) ->
    sum#(cons(x,cons(y,l))) -> sum#(cons(plus(x,y),l))
    sum#(app(l,cons(x,cons(y,k)))) -> sum#(cons(x,cons(y,k))) ->
    sum#(cons(x,cons(y,l))) -> plus#(x,y)
    sum#(app(l,cons(x,cons(y,k)))) -> sum#(app(l,sum(cons(x,cons(y,k))))) ->
    sum#(plus(cons(0(),x),cons(y,l))) -> pred#(sum(cons(s(x),cons(y,l))))
    sum#(app(l,cons(x,cons(y,k)))) -> sum#(app(l,sum(cons(x,cons(y,k))))) ->
    sum#(plus(cons(0(),x),cons(y,l))) -> sum#(cons(s(x),cons(y,l)))
    sum#(app(l,cons(x,cons(y,k)))) -> sum#(app(l,sum(cons(x,cons(y,k))))) ->
    sum#(app(l,cons(x,cons(y,k)))) -> sum#(app(l,sum(cons(x,cons(y,k)))))
    sum#(app(l,cons(x,cons(y,k)))) -> sum#(app(l,sum(cons(x,cons(y,k))))) ->
    sum#(app(l,cons(x,cons(y,k)))) -> app#(l,sum(cons(x,cons(y,k))))
    sum#(app(l,cons(x,cons(y,k)))) -> sum#(app(l,sum(cons(x,cons(y,k))))) ->
    sum#(app(l,cons(x,cons(y,k)))) -> sum#(cons(x,cons(y,k)))
    sum#(app(l,cons(x,cons(y,k)))) -> sum#(app(l,sum(cons(x,cons(y,k))))) ->
    sum#(cons(x,cons(y,l))) -> sum#(cons(plus(x,y),l))
    sum#(app(l,cons(x,cons(y,k)))) -> sum#(app(l,sum(cons(x,cons(y,k))))) ->
    sum#(cons(x,cons(y,l))) -> plus#(x,y)
    sum#(app(l,cons(x,cons(y,k)))) -> app#(l,sum(cons(x,cons(y,k)))) ->
    app#(cons(x,l),k) -> app#(l,k)
    app#(cons(x,l),k) -> app#(l,k) -> app#(cons(x,l),k) -> app#(l,k)
   SCC Processor:
    #sccs: 4
    #rules: 9
    #arcs: 91/576
    DPs:
     sum#(plus(cons(0(),x),cons(y,l))) -> sum#(cons(s(x),cons(y,l)))
     sum#(cons(x,cons(y,l))) -> sum#(cons(plus(x,y),l))
     sum#(app(l,cons(x,cons(y,k)))) -> sum#(cons(x,cons(y,k)))
     sum#(app(l,cons(x,cons(y,k)))) -> sum#(app(l,sum(cons(x,cons(y,k)))))
    TRS:
     app(nil(),k) -> k
     app(l,nil()) -> l
     app(cons(x,l),k) -> cons(x,app(l,k))
     sum(cons(x,nil())) -> cons(x,nil())
     sum(cons(x,cons(y,l))) -> sum(cons(plus(x,y),l))
     sum(app(l,cons(x,cons(y,k)))) -> sum(app(l,sum(cons(x,cons(y,k)))))
     sum(plus(cons(0(),x),cons(y,l))) -> pred(sum(cons(s(x),cons(y,l))))
     pred(cons(s(x),nil())) -> cons(x,nil())
     plus(s(x),s(y)) -> s(s(plus(if(gt(x,y),x,y),if(not(gt(x,y)),id(x),id(y)))))
     plus(s(x),x) -> plus(if(gt(x,x),id(x),id(x)),s(x))
     plus(zero(),y) -> y
     plus(id(x),s(y)) -> s(plus(x,if(gt(s(y),y),y,s(y))))
     id(x) -> x
     if(true(),x,y) -> x
     if(false(),x,y) -> y
     not(x) -> if(x,false(),true())
     gt(s(x),zero()) -> true()
     gt(zero(),y) -> false()
     gt(s(x),s(y)) -> gt(x,y)
    EDG Processor:
     DPs:
      sum#(plus(cons(0(),x),cons(y,l))) -> sum#(cons(s(x),cons(y,l)))
      sum#(cons(x,cons(y,l))) -> sum#(cons(plus(x,y),l))
      sum#(app(l,cons(x,cons(y,k)))) -> sum#(cons(x,cons(y,k)))
      sum#(app(l,cons(x,cons(y,k)))) -> sum#(app(l,sum(cons(x,cons(y,k)))))
     TRS:
      app(nil(),k) -> k
      app(l,nil()) -> l
      app(cons(x,l),k) -> cons(x,app(l,k))
      sum(cons(x,nil())) -> cons(x,nil())
      sum(cons(x,cons(y,l))) -> sum(cons(plus(x,y),l))
      sum(app(l,cons(x,cons(y,k)))) -> sum(app(l,sum(cons(x,cons(y,k)))))
      sum(plus(cons(0(),x),cons(y,l))) -> pred(sum(cons(s(x),cons(y,l))))
      pred(cons(s(x),nil())) -> cons(x,nil())
      plus(s(x),s(y)) -> s(s(plus(if(gt(x,y),x,y),if(not(gt(x,y)),id(x),id(y)))))
      plus(s(x),x) -> plus(if(gt(x,x),id(x),id(x)),s(x))
      plus(zero(),y) -> y
      plus(id(x),s(y)) -> s(plus(x,if(gt(s(y),y),y,s(y))))
      id(x) -> x
      if(true(),x,y) -> x
      if(false(),x,y) -> y
      not(x) -> if(x,false(),true())
      gt(s(x),zero()) -> true()
      gt(zero(),y) -> false()
      gt(s(x),s(y)) -> gt(x,y)
     graph:
      sum#(plus(cons(0(),x),cons(y,l))) -> sum#(cons(s(x),cons(y,l))) ->
      sum#(cons(x,cons(y,l))) -> sum#(cons(plus(x,y),l))
      sum#(cons(x,cons(y,l))) -> sum#(cons(plus(x,y),l)) ->
      sum#(cons(x,cons(y,l))) -> sum#(cons(plus(x,y),l))
      sum#(app(l,cons(x,cons(y,k)))) -> sum#(cons(x,cons(y,k))) ->
      sum#(cons(x,cons(y,l))) -> sum#(cons(plus(x,y),l))
      sum#(app(l,cons(x,cons(y,k)))) -> sum#(app(l,sum(cons(x,cons(y,k))))) ->
      sum#(cons(x,cons(y,l))) -> sum#(cons(plus(x,y),l))
      sum#(app(l,cons(x,cons(y,k)))) -> sum#(app(l,sum(cons(x,cons(y,k))))) ->
      sum#(app(l,cons(x,cons(y,k)))) -> sum#(cons(x,cons(y,k)))
      sum#(app(l,cons(x,cons(y,k)))) -> sum#(app(l,sum(cons(x,cons(y,k))))) ->
      sum#(app(l,cons(x,cons(y,k)))) -> sum#(app(l,sum(cons(x,cons(y,k)))))
      sum#(app(l,cons(x,cons(y,k)))) -> sum#(app(l,sum(cons(x,cons(y,k))))) ->
      sum#(plus(cons(0(),x),cons(y,l))) -> sum#(cons(s(x),cons(y,l)))
     SCC Processor:
      #sccs: 2
      #rules: 2
      #arcs: 7/16
      DPs:
       sum#(app(l,cons(x,cons(y,k)))) -> sum#(app(l,sum(cons(x,cons(y,k)))))
      TRS:
       app(nil(),k) -> k
       app(l,nil()) -> l
       app(cons(x,l),k) -> cons(x,app(l,k))
       sum(cons(x,nil())) -> cons(x,nil())
       sum(cons(x,cons(y,l))) -> sum(cons(plus(x,y),l))
       sum(app(l,cons(x,cons(y,k)))) -> sum(app(l,sum(cons(x,cons(y,k)))))
       sum(plus(cons(0(),x),cons(y,l))) -> pred(sum(cons(s(x),cons(y,l))))
       pred(cons(s(x),nil())) -> cons(x,nil())
       plus(s(x),s(y)) -> s(s(plus(if(gt(x,y),x,y),if(not(gt(x,y)),id(x),id(y)))))
       plus(s(x),x) -> plus(if(gt(x,x),id(x),id(x)),s(x))
       plus(zero(),y) -> y
       plus(id(x),s(y)) -> s(plus(x,if(gt(s(y),y),y,s(y))))
       id(x) -> x
       if(true(),x,y) -> x
       if(false(),x,y) -> y
       not(x) -> if(x,false(),true())
       gt(s(x),zero()) -> true()
       gt(zero(),y) -> false()
       gt(s(x),s(y)) -> gt(x,y)
      Usable Rule Processor:
       DPs:
        sum#(app(l,cons(x,cons(y,k)))) -> sum#(app(l,sum(cons(x,cons(y,k)))))
       TRS:
        sum(cons(x,cons(y,l))) -> sum(cons(plus(x,y),l))
        sum(cons(x,nil())) -> cons(x,nil())
        plus(s(x),s(y)) -> s(s(plus(if(gt(x,y),x,y),if(not(gt(x,y)),id(x),id(y)))))
        plus(s(x),x) -> plus(if(gt(x,x),id(x),id(x)),s(x))
        plus(zero(),y) -> y
        plus(id(x),s(y)) -> s(plus(x,if(gt(s(y),y),y,s(y))))
        id(x) -> x
        not(x) -> if(x,false(),true())
        gt(s(x),zero()) -> true()
        gt(zero(),y) -> false()
        gt(s(x),s(y)) -> gt(x,y)
        if(true(),x,y) -> x
        if(false(),x,y) -> y
        app(nil(),k) -> k
        app(l,nil()) -> l
        app(cons(x,l),k) -> cons(x,app(l,k))
       Matrix Interpretation Processor: dim=1
        
        usable rules:
         sum(cons(x,cons(y,l))) -> sum(cons(plus(x,y),l))
         sum(cons(x,nil())) -> cons(x,nil())
         app(nil(),k) -> k
         app(l,nil()) -> l
         app(cons(x,l),k) -> cons(x,app(l,k))
        interpretation:
         [sum#](x0) = x0,
         
         [false] = 0,
         
         [true] = 0,
         
         [zero] = 0,
         
         [id](x0) = x0,
         
         [not](x0) = 1,
         
         [if](x0, x1, x2) = 1/2x1 + x2 + 1,
         
         [gt](x0, x1) = x0 + 2x1,
         
         [s](x0) = 1/2,
         
         [plus](x0, x1) = 2x0,
         
         [sum](x0) = 1/2,
         
         [cons](x0, x1) = x1 + 1/2,
         
         [app](x0, x1) = 2x0 + x1,
         
         [nil] = 0
        orientation:
         sum#(app(l,cons(x,cons(y,k)))) = k + 2l + 1 >= 2l + 1/2 = sum#(app(l,sum(cons(x,cons(y,k)))))
         
         sum(cons(x,cons(y,l))) = 1/2 >= 1/2 = sum(cons(plus(x,y),l))
         
         sum(cons(x,nil())) = 1/2 >= 1/2 = cons(x,nil())
         
         plus(s(x),s(y)) = 1 >= 1/2 = s(s(plus(if(gt(x,y),x,y),if(not(gt(x,y)),id(x),id(y)))))
         
         plus(s(x),x) = 1 >= 3x + 2 = plus(if(gt(x,x),id(x),id(x)),s(x))
         
         plus(zero(),y) = 0 >= y = y
         
         plus(id(x),s(y)) = 2x >= 1/2 = s(plus(x,if(gt(s(y),y),y,s(y))))
         
         id(x) = x >= x = x
         
         not(x) = 1 >= 1 = if(x,false(),true())
         
         gt(s(x),zero()) = 1/2 >= 0 = true()
         
         gt(zero(),y) = 2y >= 0 = false()
         
         gt(s(x),s(y)) = 3/2 >= x + 2y = gt(x,y)
         
         if(true(),x,y) = 1/2x + y + 1 >= x = x
         
         if(false(),x,y) = 1/2x + y + 1 >= y = y
         
         app(nil(),k) = k >= k = k
         
         app(l,nil()) = 2l >= l = l
         
         app(cons(x,l),k) = k + 2l + 1 >= k + 2l + 1/2 = cons(x,app(l,k))
        problem:
         DPs:
          
         TRS:
          sum(cons(x,cons(y,l))) -> sum(cons(plus(x,y),l))
          sum(cons(x,nil())) -> cons(x,nil())
          plus(s(x),s(y)) -> s(s(plus(if(gt(x,y),x,y),if(not(gt(x,y)),id(x),id(y)))))
          plus(s(x),x) -> plus(if(gt(x,x),id(x),id(x)),s(x))
          plus(zero(),y) -> y
          plus(id(x),s(y)) -> s(plus(x,if(gt(s(y),y),y,s(y))))
          id(x) -> x
          not(x) -> if(x,false(),true())
          gt(s(x),zero()) -> true()
          gt(zero(),y) -> false()
          gt(s(x),s(y)) -> gt(x,y)
          if(true(),x,y) -> x
          if(false(),x,y) -> y
          app(nil(),k) -> k
          app(l,nil()) -> l
          app(cons(x,l),k) -> cons(x,app(l,k))
        Qed
      
      DPs:
       sum#(cons(x,cons(y,l))) -> sum#(cons(plus(x,y),l))
      TRS:
       app(nil(),k) -> k
       app(l,nil()) -> l
       app(cons(x,l),k) -> cons(x,app(l,k))
       sum(cons(x,nil())) -> cons(x,nil())
       sum(cons(x,cons(y,l))) -> sum(cons(plus(x,y),l))
       sum(app(l,cons(x,cons(y,k)))) -> sum(app(l,sum(cons(x,cons(y,k)))))
       sum(plus(cons(0(),x),cons(y,l))) -> pred(sum(cons(s(x),cons(y,l))))
       pred(cons(s(x),nil())) -> cons(x,nil())
       plus(s(x),s(y)) -> s(s(plus(if(gt(x,y),x,y),if(not(gt(x,y)),id(x),id(y)))))
       plus(s(x),x) -> plus(if(gt(x,x),id(x),id(x)),s(x))
       plus(zero(),y) -> y
       plus(id(x),s(y)) -> s(plus(x,if(gt(s(y),y),y,s(y))))
       id(x) -> x
       if(true(),x,y) -> x
       if(false(),x,y) -> y
       not(x) -> if(x,false(),true())
       gt(s(x),zero()) -> true()
       gt(zero(),y) -> false()
       gt(s(x),s(y)) -> gt(x,y)
      Usable Rule Processor:
       DPs:
        sum#(cons(x,cons(y,l))) -> sum#(cons(plus(x,y),l))
       TRS:
        plus(s(x),s(y)) -> s(s(plus(if(gt(x,y),x,y),if(not(gt(x,y)),id(x),id(y)))))
        plus(s(x),x) -> plus(if(gt(x,x),id(x),id(x)),s(x))
        plus(zero(),y) -> y
        plus(id(x),s(y)) -> s(plus(x,if(gt(s(y),y),y,s(y))))
        id(x) -> x
        not(x) -> if(x,false(),true())
        gt(s(x),zero()) -> true()
        gt(zero(),y) -> false()
        gt(s(x),s(y)) -> gt(x,y)
        if(true(),x,y) -> x
        if(false(),x,y) -> y
       Arctic Interpretation Processor:
        dimension: 1
        usable rules:
         
        interpretation:
         [sum#](x0) = x0 + 0,
         
         [false] = 0,
         
         [true] = 6,
         
         [zero] = 0,
         
         [id](x0) = x0,
         
         [not](x0) = 0,
         
         [if](x0, x1, x2) = 6x1 + x2 + 0,
         
         [gt](x0, x1) = 2x0 + 3x1 + 0,
         
         [s](x0) = x0 + 2,
         
         [plus](x0, x1) = 0,
         
         [cons](x0, x1) = 1x1 + 0
        orientation:
         sum#(cons(x,cons(y,l))) = 2l + 1 >= 1l + 0 = sum#(cons(plus(x,y),l))
         
         plus(s(x),s(y)) = 0 >= 2 = s(s(plus(if(gt(x,y),x,y),if(not(gt(x,y)),id(x),id(y)))))
         
         plus(s(x),x) = 0 >= 0 = plus(if(gt(x,x),id(x),id(x)),s(x))
         
         plus(zero(),y) = 0 >= y = y
         
         plus(id(x),s(y)) = 0 >= 2 = s(plus(x,if(gt(s(y),y),y,s(y))))
         
         id(x) = x >= x = x
         
         not(x) = 0 >= 6 = if(x,false(),true())
         
         gt(s(x),zero()) = 2x + 4 >= 6 = true()
         
         gt(zero(),y) = 3y + 2 >= 0 = false()
         
         gt(s(x),s(y)) = 2x + 3y + 5 >= 2x + 3y + 0 = gt(x,y)
         
         if(true(),x,y) = 6x + y + 0 >= x = x
         
         if(false(),x,y) = 6x + y + 0 >= y = y
        problem:
         DPs:
          
         TRS:
          plus(s(x),s(y)) -> s(s(plus(if(gt(x,y),x,y),if(not(gt(x,y)),id(x),id(y)))))
          plus(s(x),x) -> plus(if(gt(x,x),id(x),id(x)),s(x))
          plus(zero(),y) -> y
          plus(id(x),s(y)) -> s(plus(x,if(gt(s(y),y),y,s(y))))
          id(x) -> x
          not(x) -> if(x,false(),true())
          gt(s(x),zero()) -> true()
          gt(zero(),y) -> false()
          gt(s(x),s(y)) -> gt(x,y)
          if(true(),x,y) -> x
          if(false(),x,y) -> y
        Qed
    
    DPs:
     app#(cons(x,l),k) -> app#(l,k)
    TRS:
     app(nil(),k) -> k
     app(l,nil()) -> l
     app(cons(x,l),k) -> cons(x,app(l,k))
     sum(cons(x,nil())) -> cons(x,nil())
     sum(cons(x,cons(y,l))) -> sum(cons(plus(x,y),l))
     sum(app(l,cons(x,cons(y,k)))) -> sum(app(l,sum(cons(x,cons(y,k)))))
     sum(plus(cons(0(),x),cons(y,l))) -> pred(sum(cons(s(x),cons(y,l))))
     pred(cons(s(x),nil())) -> cons(x,nil())
     plus(s(x),s(y)) -> s(s(plus(if(gt(x,y),x,y),if(not(gt(x,y)),id(x),id(y)))))
     plus(s(x),x) -> plus(if(gt(x,x),id(x),id(x)),s(x))
     plus(zero(),y) -> y
     plus(id(x),s(y)) -> s(plus(x,if(gt(s(y),y),y,s(y))))
     id(x) -> x
     if(true(),x,y) -> x
     if(false(),x,y) -> y
     not(x) -> if(x,false(),true())
     gt(s(x),zero()) -> true()
     gt(zero(),y) -> false()
     gt(s(x),s(y)) -> gt(x,y)
    Subterm Criterion Processor:
     simple projection:
      pi(app#) = 0
     problem:
      DPs:
       
      TRS:
       app(nil(),k) -> k
       app(l,nil()) -> l
       app(cons(x,l),k) -> cons(x,app(l,k))
       sum(cons(x,nil())) -> cons(x,nil())
       sum(cons(x,cons(y,l))) -> sum(cons(plus(x,y),l))
       sum(app(l,cons(x,cons(y,k)))) -> sum(app(l,sum(cons(x,cons(y,k)))))
       sum(plus(cons(0(),x),cons(y,l))) -> pred(sum(cons(s(x),cons(y,l))))
       pred(cons(s(x),nil())) -> cons(x,nil())
       plus(s(x),s(y)) -> s(s(plus(if(gt(x,y),x,y),if(not(gt(x,y)),id(x),id(y)))))
       plus(s(x),x) -> plus(if(gt(x,x),id(x),id(x)),s(x))
       plus(zero(),y) -> y
       plus(id(x),s(y)) -> s(plus(x,if(gt(s(y),y),y,s(y))))
       id(x) -> x
       if(true(),x,y) -> x
       if(false(),x,y) -> y
       not(x) -> if(x,false(),true())
       gt(s(x),zero()) -> true()
       gt(zero(),y) -> false()
       gt(s(x),s(y)) -> gt(x,y)
     Qed
    
    DPs:
     plus#(id(x),s(y)) -> plus#(x,if(gt(s(y),y),y,s(y)))
     plus#(s(x),s(y)) -> plus#(if(gt(x,y),x,y),if(not(gt(x,y)),id(x),id(y)))
     plus#(s(x),x) -> plus#(if(gt(x,x),id(x),id(x)),s(x))
    TRS:
     app(nil(),k) -> k
     app(l,nil()) -> l
     app(cons(x,l),k) -> cons(x,app(l,k))
     sum(cons(x,nil())) -> cons(x,nil())
     sum(cons(x,cons(y,l))) -> sum(cons(plus(x,y),l))
     sum(app(l,cons(x,cons(y,k)))) -> sum(app(l,sum(cons(x,cons(y,k)))))
     sum(plus(cons(0(),x),cons(y,l))) -> pred(sum(cons(s(x),cons(y,l))))
     pred(cons(s(x),nil())) -> cons(x,nil())
     plus(s(x),s(y)) -> s(s(plus(if(gt(x,y),x,y),if(not(gt(x,y)),id(x),id(y)))))
     plus(s(x),x) -> plus(if(gt(x,x),id(x),id(x)),s(x))
     plus(zero(),y) -> y
     plus(id(x),s(y)) -> s(plus(x,if(gt(s(y),y),y,s(y))))
     id(x) -> x
     if(true(),x,y) -> x
     if(false(),x,y) -> y
     not(x) -> if(x,false(),true())
     gt(s(x),zero()) -> true()
     gt(zero(),y) -> false()
     gt(s(x),s(y)) -> gt(x,y)
    Usable Rule Processor:
     DPs:
      plus#(id(x),s(y)) -> plus#(x,if(gt(s(y),y),y,s(y)))
      plus#(s(x),s(y)) -> plus#(if(gt(x,y),x,y),if(not(gt(x,y)),id(x),id(y)))
      plus#(s(x),x) -> plus#(if(gt(x,x),id(x),id(x)),s(x))
     TRS:
      gt(s(x),zero()) -> true()
      gt(s(x),s(y)) -> gt(x,y)
      gt(zero(),y) -> false()
      if(true(),x,y) -> x
      if(false(),x,y) -> y
      id(x) -> x
      not(x) -> if(x,false(),true())
     Arctic Interpretation Processor:
      dimension: 1
      usable rules:
       gt(s(x),zero()) -> true()
       gt(s(x),s(y)) -> gt(x,y)
       gt(zero(),y) -> false()
       if(true(),x,y) -> x
       if(false(),x,y) -> y
       id(x) -> x
       not(x) -> if(x,false(),true())
      interpretation:
       [plus#](x0, x1) = x0 + x1 + 0,
       
       [false] = 1,
       
       [true] = 1,
       
       [zero] = 2,
       
       [id](x0) = 1x0,
       
       [not](x0) = x0 + 8,
       
       [if](x0, x1, x2) = -8x0 + 3x1 + x2 + 0,
       
       [gt](x0, x1) = x0 + x1,
       
       [s](x0) = 6x0 + 2
      orientation:
       plus#(id(x),s(y)) = 1x + 6y + 2 >= x + 6y + 2 = plus#(x,if(gt(s(y),y),y,s(y)))
       
       plus#(s(x),s(y)) = 6x + 6y + 2 >= 4x + 1y + 0 = plus#(if(gt(x,y),x,y),if(not(gt(x,y)),id(x),id(y)))
       
       plus#(s(x),x) = 6x + 2 >= 6x + 2 = plus#(if(gt(x,x),id(x),id(x)),s(x))
       
       gt(s(x),zero()) = 6x + 2 >= 1 = true()
       
       gt(s(x),s(y)) = 6x + 6y + 2 >= x + y = gt(x,y)
       
       gt(zero(),y) = y + 2 >= 1 = false()
       
       if(true(),x,y) = 3x + y + 0 >= x = x
       
       if(false(),x,y) = 3x + y + 0 >= y = y
       
       id(x) = 1x >= x = x
       
       not(x) = x + 8 >= -8x + 4 = if(x,false(),true())
      problem:
       DPs:
        plus#(id(x),s(y)) -> plus#(x,if(gt(s(y),y),y,s(y)))
        plus#(s(x),x) -> plus#(if(gt(x,x),id(x),id(x)),s(x))
       TRS:
        gt(s(x),zero()) -> true()
        gt(s(x),s(y)) -> gt(x,y)
        gt(zero(),y) -> false()
        if(true(),x,y) -> x
        if(false(),x,y) -> y
        id(x) -> x
        not(x) -> if(x,false(),true())
      Restore Modifier:
       DPs:
        plus#(id(x),s(y)) -> plus#(x,if(gt(s(y),y),y,s(y)))
        plus#(s(x),x) -> plus#(if(gt(x,x),id(x),id(x)),s(x))
       TRS:
        app(nil(),k) -> k
        app(l,nil()) -> l
        app(cons(x,l),k) -> cons(x,app(l,k))
        sum(cons(x,nil())) -> cons(x,nil())
        sum(cons(x,cons(y,l))) -> sum(cons(plus(x,y),l))
        sum(app(l,cons(x,cons(y,k)))) -> sum(app(l,sum(cons(x,cons(y,k)))))
        sum(plus(cons(0(),x),cons(y,l))) -> pred(sum(cons(s(x),cons(y,l))))
        pred(cons(s(x),nil())) -> cons(x,nil())
        plus(s(x),s(y)) -> s(s(plus(if(gt(x,y),x,y),if(not(gt(x,y)),id(x),id(y)))))
        plus(s(x),x) -> plus(if(gt(x,x),id(x),id(x)),s(x))
        plus(zero(),y) -> y
        plus(id(x),s(y)) -> s(plus(x,if(gt(s(y),y),y,s(y))))
        id(x) -> x
        if(true(),x,y) -> x
        if(false(),x,y) -> y
        not(x) -> if(x,false(),true())
        gt(s(x),zero()) -> true()
        gt(zero(),y) -> false()
        gt(s(x),s(y)) -> gt(x,y)
       Usable Rule Processor:
        DPs:
         plus#(id(x),s(y)) -> plus#(x,if(gt(s(y),y),y,s(y)))
         plus#(s(x),x) -> plus#(if(gt(x,x),id(x),id(x)),s(x))
        TRS:
         gt(s(x),zero()) -> true()
         gt(s(x),s(y)) -> gt(x,y)
         gt(zero(),y) -> false()
         if(true(),x,y) -> x
         if(false(),x,y) -> y
         id(x) -> x
        Arctic Interpretation Processor:
         dimension: 1
         usable rules:
          if(true(),x,y) -> x
          if(false(),x,y) -> y
          id(x) -> x
         interpretation:
          [plus#](x0, x1) = x0,
          
          [false] = 4,
          
          [true] = 1,
          
          [zero] = 2,
          
          [id](x0) = 1x0,
          
          [if](x0, x1, x2) = x1 + x2,
          
          [gt](x0, x1) = 3x1 + 1,
          
          [s](x0) = 1x0
         orientation:
          plus#(id(x),s(y)) = 1x >= x = plus#(x,if(gt(s(y),y),y,s(y)))
          
          plus#(s(x),x) = 1x >= 1x = plus#(if(gt(x,x),id(x),id(x)),s(x))
          
          gt(s(x),zero()) = 5 >= 1 = true()
          
          gt(s(x),s(y)) = 4y + 1 >= 3y + 1 = gt(x,y)
          
          gt(zero(),y) = 3y + 1 >= 4 = false()
          
          if(true(),x,y) = x + y >= x = x
          
          if(false(),x,y) = x + y >= y = y
          
          id(x) = 1x >= x = x
         problem:
          DPs:
           plus#(s(x),x) -> plus#(if(gt(x,x),id(x),id(x)),s(x))
          TRS:
           gt(s(x),zero()) -> true()
           gt(s(x),s(y)) -> gt(x,y)
           gt(zero(),y) -> false()
           if(true(),x,y) -> x
           if(false(),x,y) -> y
           id(x) -> x
         Restore Modifier:
          DPs:
           plus#(s(x),x) -> plus#(if(gt(x,x),id(x),id(x)),s(x))
          TRS:
           app(nil(),k) -> k
           app(l,nil()) -> l
           app(cons(x,l),k) -> cons(x,app(l,k))
           sum(cons(x,nil())) -> cons(x,nil())
           sum(cons(x,cons(y,l))) -> sum(cons(plus(x,y),l))
           sum(app(l,cons(x,cons(y,k)))) -> sum(app(l,sum(cons(x,cons(y,k)))))
           sum(plus(cons(0(),x),cons(y,l))) -> pred(sum(cons(s(x),cons(y,l))))
           pred(cons(s(x),nil())) -> cons(x,nil())
           plus(s(x),s(y)) -> s(s(plus(if(gt(x,y),x,y),if(not(gt(x,y)),id(x),id(y)))))
           plus(s(x),x) -> plus(if(gt(x,x),id(x),id(x)),s(x))
           plus(zero(),y) -> y
           plus(id(x),s(y)) -> s(plus(x,if(gt(s(y),y),y,s(y))))
           id(x) -> x
           if(true(),x,y) -> x
           if(false(),x,y) -> y
           not(x) -> if(x,false(),true())
           gt(s(x),zero()) -> true()
           gt(zero(),y) -> false()
           gt(s(x),s(y)) -> gt(x,y)
          Usable Rule Processor:
           DPs:
            plus#(s(x),x) -> plus#(if(gt(x,x),id(x),id(x)),s(x))
           TRS:
            id(x) -> x
            gt(s(x),zero()) -> true()
            gt(zero(),y) -> false()
            gt(s(x),s(y)) -> gt(x,y)
            if(true(),x,y) -> x
            if(false(),x,y) -> y
           Arctic Interpretation Processor:
            dimension: 1
            usable rules:
             id(x) -> x
             if(true(),x,y) -> x
             if(false(),x,y) -> y
            interpretation:
             [plus#](x0, x1) = x0 + -6x1 + 0,
             
             [false] = 0,
             
             [true] = 2,
             
             [zero] = 6,
             
             [id](x0) = x0 + -4,
             
             [if](x0, x1, x2) = 2x1 + 4x2,
             
             [gt](x0, x1) = -3x0 + x1 + 2,
             
             [s](x0) = 6x0 + 6
            orientation:
             plus#(s(x),x) = 6x + 6 >= 4x + 0 = plus#(if(gt(x,x),id(x),id(x)),s(x))
             
             id(x) = x + -4 >= x = x
             
             gt(s(x),zero()) = 3x + 6 >= 2 = true()
             
             gt(zero(),y) = y + 3 >= 0 = false()
             
             gt(s(x),s(y)) = 3x + 6y + 6 >= -3x + y + 2 = gt(x,y)
             
             if(true(),x,y) = 2x + 4y >= x = x
             
             if(false(),x,y) = 2x + 4y >= y = y
            problem:
             DPs:
              
             TRS:
              id(x) -> x
              gt(s(x),zero()) -> true()
              gt(zero(),y) -> false()
              gt(s(x),s(y)) -> gt(x,y)
              if(true(),x,y) -> x
              if(false(),x,y) -> y
            Qed
    
    DPs:
     gt#(s(x),s(y)) -> gt#(x,y)
    TRS:
     app(nil(),k) -> k
     app(l,nil()) -> l
     app(cons(x,l),k) -> cons(x,app(l,k))
     sum(cons(x,nil())) -> cons(x,nil())
     sum(cons(x,cons(y,l))) -> sum(cons(plus(x,y),l))
     sum(app(l,cons(x,cons(y,k)))) -> sum(app(l,sum(cons(x,cons(y,k)))))
     sum(plus(cons(0(),x),cons(y,l))) -> pred(sum(cons(s(x),cons(y,l))))
     pred(cons(s(x),nil())) -> cons(x,nil())
     plus(s(x),s(y)) -> s(s(plus(if(gt(x,y),x,y),if(not(gt(x,y)),id(x),id(y)))))
     plus(s(x),x) -> plus(if(gt(x,x),id(x),id(x)),s(x))
     plus(zero(),y) -> y
     plus(id(x),s(y)) -> s(plus(x,if(gt(s(y),y),y,s(y))))
     id(x) -> x
     if(true(),x,y) -> x
     if(false(),x,y) -> y
     not(x) -> if(x,false(),true())
     gt(s(x),zero()) -> true()
     gt(zero(),y) -> false()
     gt(s(x),s(y)) -> gt(x,y)
    Subterm Criterion Processor:
     simple projection:
      pi(gt#) = 1
     problem:
      DPs:
       
      TRS:
       app(nil(),k) -> k
       app(l,nil()) -> l
       app(cons(x,l),k) -> cons(x,app(l,k))
       sum(cons(x,nil())) -> cons(x,nil())
       sum(cons(x,cons(y,l))) -> sum(cons(plus(x,y),l))
       sum(app(l,cons(x,cons(y,k)))) -> sum(app(l,sum(cons(x,cons(y,k)))))
       sum(plus(cons(0(),x),cons(y,l))) -> pred(sum(cons(s(x),cons(y,l))))
       pred(cons(s(x),nil())) -> cons(x,nil())
       plus(s(x),s(y)) -> s(s(plus(if(gt(x,y),x,y),if(not(gt(x,y)),id(x),id(y)))))
       plus(s(x),x) -> plus(if(gt(x,x),id(x),id(x)),s(x))
       plus(zero(),y) -> y
       plus(id(x),s(y)) -> s(plus(x,if(gt(s(y),y),y,s(y))))
       id(x) -> x
       if(true(),x,y) -> x
       if(false(),x,y) -> y
       not(x) -> if(x,false(),true())
       gt(s(x),zero()) -> true()
       gt(zero(),y) -> false()
       gt(s(x),s(y)) -> gt(x,y)
     Qed