/export/starexec/sandbox2/solver/bin/starexec_run_ttt2-1.17+nonreach /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files


--------------------------------------------------------------------------------


YES

Problem:
 minus(n__0(),Y) -> 0()
 minus(n__s(X),n__s(Y)) -> minus(activate(X),activate(Y))
 geq(X,n__0()) -> true()
 geq(n__0(),n__s(Y)) -> false()
 geq(n__s(X),n__s(Y)) -> geq(activate(X),activate(Y))
 div(0(),n__s(Y)) -> 0()
 div(s(X),n__s(Y)) ->
 if(geq(X,activate(Y)),n__s(div(minus(X,activate(Y)),n__s(activate(Y)))),n__0())
 if(true(),X,Y) -> activate(X)
 if(false(),X,Y) -> activate(Y)
 0() -> n__0()
 s(X) -> n__s(X)
 activate(n__0()) -> 0()
 activate(n__s(X)) -> s(X)
 activate(X) -> X

Proof:
 DP Processor:
  DPs:
   minus#(n__0(),Y) -> 0#()
   minus#(n__s(X),n__s(Y)) -> activate#(Y)
   minus#(n__s(X),n__s(Y)) -> activate#(X)
   minus#(n__s(X),n__s(Y)) -> minus#(activate(X),activate(Y))
   geq#(n__s(X),n__s(Y)) -> activate#(Y)
   geq#(n__s(X),n__s(Y)) -> activate#(X)
   geq#(n__s(X),n__s(Y)) -> geq#(activate(X),activate(Y))
   div#(s(X),n__s(Y)) -> minus#(X,activate(Y))
   div#(s(X),n__s(Y)) -> div#(minus(X,activate(Y)),n__s(activate(Y)))
   div#(s(X),n__s(Y)) -> activate#(Y)
   div#(s(X),n__s(Y)) -> geq#(X,activate(Y))
   div#(s(X),n__s(Y)) ->
   if#(geq(X,activate(Y)),n__s(div(minus(X,activate(Y)),n__s(activate(Y)))),n__0())
   if#(true(),X,Y) -> activate#(X)
   if#(false(),X,Y) -> activate#(Y)
   activate#(n__0()) -> 0#()
   activate#(n__s(X)) -> s#(X)
  TRS:
   minus(n__0(),Y) -> 0()
   minus(n__s(X),n__s(Y)) -> minus(activate(X),activate(Y))
   geq(X,n__0()) -> true()
   geq(n__0(),n__s(Y)) -> false()
   geq(n__s(X),n__s(Y)) -> geq(activate(X),activate(Y))
   div(0(),n__s(Y)) -> 0()
   div(s(X),n__s(Y)) ->
   if(geq(X,activate(Y)),n__s(div(minus(X,activate(Y)),n__s(activate(Y)))),n__0())
   if(true(),X,Y) -> activate(X)
   if(false(),X,Y) -> activate(Y)
   0() -> n__0()
   s(X) -> n__s(X)
   activate(n__0()) -> 0()
   activate(n__s(X)) -> s(X)
   activate(X) -> X
  TDG Processor:
   DPs:
    minus#(n__0(),Y) -> 0#()
    minus#(n__s(X),n__s(Y)) -> activate#(Y)
    minus#(n__s(X),n__s(Y)) -> activate#(X)
    minus#(n__s(X),n__s(Y)) -> minus#(activate(X),activate(Y))
    geq#(n__s(X),n__s(Y)) -> activate#(Y)
    geq#(n__s(X),n__s(Y)) -> activate#(X)
    geq#(n__s(X),n__s(Y)) -> geq#(activate(X),activate(Y))
    div#(s(X),n__s(Y)) -> minus#(X,activate(Y))
    div#(s(X),n__s(Y)) -> div#(minus(X,activate(Y)),n__s(activate(Y)))
    div#(s(X),n__s(Y)) -> activate#(Y)
    div#(s(X),n__s(Y)) -> geq#(X,activate(Y))
    div#(s(X),n__s(Y)) ->
    if#(geq(X,activate(Y)),n__s(div(minus(X,activate(Y)),n__s(activate(Y)))),n__0())
    if#(true(),X,Y) -> activate#(X)
    if#(false(),X,Y) -> activate#(Y)
    activate#(n__0()) -> 0#()
    activate#(n__s(X)) -> s#(X)
   TRS:
    minus(n__0(),Y) -> 0()
    minus(n__s(X),n__s(Y)) -> minus(activate(X),activate(Y))
    geq(X,n__0()) -> true()
    geq(n__0(),n__s(Y)) -> false()
    geq(n__s(X),n__s(Y)) -> geq(activate(X),activate(Y))
    div(0(),n__s(Y)) -> 0()
    div(s(X),n__s(Y)) ->
    if(geq(X,activate(Y)),n__s(div(minus(X,activate(Y)),n__s(activate(Y)))),n__0())
    if(true(),X,Y) -> activate(X)
    if(false(),X,Y) -> activate(Y)
    0() -> n__0()
    s(X) -> n__s(X)
    activate(n__0()) -> 0()
    activate(n__s(X)) -> s(X)
    activate(X) -> X
   graph:
    if#(false(),X,Y) -> activate#(Y) -> activate#(n__s(X)) -> s#(X)
    if#(false(),X,Y) -> activate#(Y) -> activate#(n__0()) -> 0#()
    if#(true(),X,Y) -> activate#(X) -> activate#(n__s(X)) -> s#(X)
    if#(true(),X,Y) -> activate#(X) ->
    activate#(n__0()) -> 0#()
    div#(s(X),n__s(Y)) ->
    if#(geq(X,activate(Y)),n__s(div(minus(X,activate(Y)),n__s(activate(Y)))),n__0()) ->
    if#(false(),X,Y) -> activate#(Y)
    div#(s(X),n__s(Y)) ->
    if#(geq(X,activate(Y)),n__s(div(minus(X,activate(Y)),n__s(activate(Y)))),n__0()) ->
    if#(true(),X,Y) -> activate#(X)
    div#(s(X),n__s(Y)) -> div#(minus(X,activate(Y)),n__s(activate(Y))) ->
    div#(s(X),n__s(Y)) ->
    if#(geq(X,activate(Y)),n__s(div(minus(X,activate(Y)),n__s(activate(Y)))),n__0())
    div#(s(X),n__s(Y)) -> div#(minus(X,activate(Y)),n__s(activate(Y))) ->
    div#(s(X),n__s(Y)) -> geq#(X,activate(Y))
    div#(s(X),n__s(Y)) -> div#(minus(X,activate(Y)),n__s(activate(Y))) ->
    div#(s(X),n__s(Y)) -> activate#(Y)
    div#(s(X),n__s(Y)) -> div#(minus(X,activate(Y)),n__s(activate(Y))) ->
    div#(s(X),n__s(Y)) -> div#(minus(X,activate(Y)),n__s(activate(Y)))
    div#(s(X),n__s(Y)) -> div#(minus(X,activate(Y)),n__s(activate(Y))) ->
    div#(s(X),n__s(Y)) -> minus#(X,activate(Y))
    div#(s(X),n__s(Y)) -> geq#(X,activate(Y)) ->
    geq#(n__s(X),n__s(Y)) -> geq#(activate(X),activate(Y))
    div#(s(X),n__s(Y)) -> geq#(X,activate(Y)) ->
    geq#(n__s(X),n__s(Y)) -> activate#(X)
    div#(s(X),n__s(Y)) -> geq#(X,activate(Y)) ->
    geq#(n__s(X),n__s(Y)) -> activate#(Y)
    div#(s(X),n__s(Y)) -> activate#(Y) ->
    activate#(n__s(X)) -> s#(X)
    div#(s(X),n__s(Y)) -> activate#(Y) ->
    activate#(n__0()) -> 0#()
    div#(s(X),n__s(Y)) -> minus#(X,activate(Y)) ->
    minus#(n__s(X),n__s(Y)) -> minus#(activate(X),activate(Y))
    div#(s(X),n__s(Y)) -> minus#(X,activate(Y)) ->
    minus#(n__s(X),n__s(Y)) -> activate#(X)
    div#(s(X),n__s(Y)) -> minus#(X,activate(Y)) ->
    minus#(n__s(X),n__s(Y)) -> activate#(Y)
    div#(s(X),n__s(Y)) -> minus#(X,activate(Y)) ->
    minus#(n__0(),Y) -> 0#()
    geq#(n__s(X),n__s(Y)) -> geq#(activate(X),activate(Y)) ->
    geq#(n__s(X),n__s(Y)) -> geq#(activate(X),activate(Y))
    geq#(n__s(X),n__s(Y)) -> geq#(activate(X),activate(Y)) ->
    geq#(n__s(X),n__s(Y)) -> activate#(X)
    geq#(n__s(X),n__s(Y)) -> geq#(activate(X),activate(Y)) ->
    geq#(n__s(X),n__s(Y)) -> activate#(Y)
    geq#(n__s(X),n__s(Y)) -> activate#(X) ->
    activate#(n__s(X)) -> s#(X)
    geq#(n__s(X),n__s(Y)) -> activate#(X) ->
    activate#(n__0()) -> 0#()
    geq#(n__s(X),n__s(Y)) -> activate#(Y) ->
    activate#(n__s(X)) -> s#(X)
    geq#(n__s(X),n__s(Y)) -> activate#(Y) ->
    activate#(n__0()) -> 0#()
    minus#(n__s(X),n__s(Y)) -> activate#(X) ->
    activate#(n__s(X)) -> s#(X)
    minus#(n__s(X),n__s(Y)) -> activate#(X) ->
    activate#(n__0()) -> 0#()
    minus#(n__s(X),n__s(Y)) -> activate#(Y) ->
    activate#(n__s(X)) -> s#(X)
    minus#(n__s(X),n__s(Y)) -> activate#(Y) ->
    activate#(n__0()) -> 0#()
    minus#(n__s(X),n__s(Y)) -> minus#(activate(X),activate(Y)) ->
    minus#(n__s(X),n__s(Y)) -> minus#(activate(X),activate(Y))
    minus#(n__s(X),n__s(Y)) -> minus#(activate(X),activate(Y)) ->
    minus#(n__s(X),n__s(Y)) -> activate#(X)
    minus#(n__s(X),n__s(Y)) -> minus#(activate(X),activate(Y)) ->
    minus#(n__s(X),n__s(Y)) -> activate#(Y)
    minus#(n__s(X),n__s(Y)) -> minus#(activate(X),activate(Y)) -> minus#(n__0(),Y) -> 0#()
   SCC Processor:
    #sccs: 3
    #rules: 3
    #arcs: 35/256
    DPs:
     div#(s(X),n__s(Y)) -> div#(minus(X,activate(Y)),n__s(activate(Y)))
    TRS:
     minus(n__0(),Y) -> 0()
     minus(n__s(X),n__s(Y)) -> minus(activate(X),activate(Y))
     geq(X,n__0()) -> true()
     geq(n__0(),n__s(Y)) -> false()
     geq(n__s(X),n__s(Y)) -> geq(activate(X),activate(Y))
     div(0(),n__s(Y)) -> 0()
     div(s(X),n__s(Y)) ->
     if(geq(X,activate(Y)),n__s(div(minus(X,activate(Y)),n__s(activate(Y)))),n__0())
     if(true(),X,Y) -> activate(X)
     if(false(),X,Y) -> activate(Y)
     0() -> n__0()
     s(X) -> n__s(X)
     activate(n__0()) -> 0()
     activate(n__s(X)) -> s(X)
     activate(X) -> X
    EDG Processor:
     DPs:
      div#(s(X),n__s(Y)) -> div#(minus(X,activate(Y)),n__s(activate(Y)))
     TRS:
      minus(n__0(),Y) -> 0()
      minus(n__s(X),n__s(Y)) -> minus(activate(X),activate(Y))
      geq(X,n__0()) -> true()
      geq(n__0(),n__s(Y)) -> false()
      geq(n__s(X),n__s(Y)) -> geq(activate(X),activate(Y))
      div(0(),n__s(Y)) -> 0()
      div(s(X),n__s(Y)) ->
      if(geq(X,activate(Y)),n__s(div(minus(X,activate(Y)),n__s(activate(Y)))),n__0())
      if(true(),X,Y) -> activate(X)
      if(false(),X,Y) -> activate(Y)
      0() -> n__0()
      s(X) -> n__s(X)
      activate(n__0()) -> 0()
      activate(n__s(X)) -> s(X)
      activate(X) -> X
     graph:
      
     SCC Processor:
      #sccs: 0
      #rules: 0
      #arcs: 0/1
      
    
    DPs:
     geq#(n__s(X),n__s(Y)) -> geq#(activate(X),activate(Y))
    TRS:
     minus(n__0(),Y) -> 0()
     minus(n__s(X),n__s(Y)) -> minus(activate(X),activate(Y))
     geq(X,n__0()) -> true()
     geq(n__0(),n__s(Y)) -> false()
     geq(n__s(X),n__s(Y)) -> geq(activate(X),activate(Y))
     div(0(),n__s(Y)) -> 0()
     div(s(X),n__s(Y)) ->
     if(geq(X,activate(Y)),n__s(div(minus(X,activate(Y)),n__s(activate(Y)))),n__0())
     if(true(),X,Y) -> activate(X)
     if(false(),X,Y) -> activate(Y)
     0() -> n__0()
     s(X) -> n__s(X)
     activate(n__0()) -> 0()
     activate(n__s(X)) -> s(X)
     activate(X) -> X
    Usable Rule Processor:
     DPs:
      geq#(n__s(X),n__s(Y)) -> geq#(activate(X),activate(Y))
     TRS:
      activate(n__0()) -> 0()
      activate(n__s(X)) -> s(X)
      activate(X) -> X
      0() -> n__0()
      s(X) -> n__s(X)
     Semantic Labeling Processor:
      dimension: 1
      usable rules:
       
      interpretation:
       [s](x0) = x0 + 1,
       
       [activate](x0) = x0,
       
       [n__s](x0) = x0 + 1,
       
       [0] = 0,
       
       [n__0] = 0
       labeled:
        geq#
       usable (for model):
        geq#
        n__s
        activate
        n__0
        0
        s
       argument filtering:
        pi(n__0) = []
        pi(0) = []
        pi(n__s) = 0
        pi(activate) = 0
        pi(s) = []
        pi(geq#) = []
      precedence:
       geq# ~ s ~ activate ~ n__s ~ 0 ~ n__0
      problem:
       DPs:
        
       TRS:
        activate(n__0()) -> 0()
        activate(n__s(X)) -> s(X)
        activate(X) -> X
        0() -> n__0()
        s(X) -> n__s(X)
      Qed
    
    DPs:
     minus#(n__s(X),n__s(Y)) -> minus#(activate(X),activate(Y))
    TRS:
     minus(n__0(),Y) -> 0()
     minus(n__s(X),n__s(Y)) -> minus(activate(X),activate(Y))
     geq(X,n__0()) -> true()
     geq(n__0(),n__s(Y)) -> false()
     geq(n__s(X),n__s(Y)) -> geq(activate(X),activate(Y))
     div(0(),n__s(Y)) -> 0()
     div(s(X),n__s(Y)) ->
     if(geq(X,activate(Y)),n__s(div(minus(X,activate(Y)),n__s(activate(Y)))),n__0())
     if(true(),X,Y) -> activate(X)
     if(false(),X,Y) -> activate(Y)
     0() -> n__0()
     s(X) -> n__s(X)
     activate(n__0()) -> 0()
     activate(n__s(X)) -> s(X)
     activate(X) -> X
    Usable Rule Processor:
     DPs:
      minus#(n__s(X),n__s(Y)) -> minus#(activate(X),activate(Y))
     TRS:
      activate(n__0()) -> 0()
      activate(n__s(X)) -> s(X)
      activate(X) -> X
      0() -> n__0()
      s(X) -> n__s(X)
     Semantic Labeling Processor:
      dimension: 1
      usable rules:
       
      interpretation:
       [s](x0) = x0 + 1,
       
       [activate](x0) = x0,
       
       [n__s](x0) = x0 + 1,
       
       [0] = 0,
       
       [n__0] = 0
       labeled:
        minus#
       usable (for model):
        minus#
        n__s
        activate
        n__0
        0
        s
       argument filtering:
        pi(n__0) = []
        pi(0) = []
        pi(n__s) = 0
        pi(activate) = 0
        pi(s) = []
        pi(minus#) = []
      precedence:
       minus# ~ s ~ activate ~ n__s ~ 0 ~ n__0
      problem:
       DPs:
        
       TRS:
        activate(n__0()) -> 0()
        activate(n__s(X)) -> s(X)
        activate(X) -> X
        0() -> n__0()
        s(X) -> n__s(X)
      Qed