/export/starexec/sandbox/solver/bin/starexec_run_ttt2 /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files


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


YES

Problem:
 le(0(),y) -> true()
 le(s(x),0()) -> false()
 le(s(x),s(y)) -> le(x,y)
 minus(0(),y) -> 0()
 minus(s(x),y) -> if_minus(le(s(x),y),s(x),y)
 if_minus(true(),s(x),y) -> 0()
 if_minus(false(),s(x),y) -> s(minus(x,y))
 quot(0(),s(y)) -> 0()
 quot(s(x),s(y)) -> s(quot(minus(x,y),s(y)))
 log(s(0())) -> 0()
 log(s(s(x))) -> s(log(s(quot(x,s(s(0()))))))

Proof:
 DP Processor:
  DPs:
   le#(s(x),s(y)) -> le#(x,y)
   minus#(s(x),y) -> le#(s(x),y)
   minus#(s(x),y) -> if_minus#(le(s(x),y),s(x),y)
   if_minus#(false(),s(x),y) -> minus#(x,y)
   quot#(s(x),s(y)) -> minus#(x,y)
   quot#(s(x),s(y)) -> quot#(minus(x,y),s(y))
   log#(s(s(x))) -> quot#(x,s(s(0())))
   log#(s(s(x))) -> log#(s(quot(x,s(s(0())))))
  TRS:
   le(0(),y) -> true()
   le(s(x),0()) -> false()
   le(s(x),s(y)) -> le(x,y)
   minus(0(),y) -> 0()
   minus(s(x),y) -> if_minus(le(s(x),y),s(x),y)
   if_minus(true(),s(x),y) -> 0()
   if_minus(false(),s(x),y) -> s(minus(x,y))
   quot(0(),s(y)) -> 0()
   quot(s(x),s(y)) -> s(quot(minus(x,y),s(y)))
   log(s(0())) -> 0()
   log(s(s(x))) -> s(log(s(quot(x,s(s(0()))))))
  TDG Processor:
   DPs:
    le#(s(x),s(y)) -> le#(x,y)
    minus#(s(x),y) -> le#(s(x),y)
    minus#(s(x),y) -> if_minus#(le(s(x),y),s(x),y)
    if_minus#(false(),s(x),y) -> minus#(x,y)
    quot#(s(x),s(y)) -> minus#(x,y)
    quot#(s(x),s(y)) -> quot#(minus(x,y),s(y))
    log#(s(s(x))) -> quot#(x,s(s(0())))
    log#(s(s(x))) -> log#(s(quot(x,s(s(0())))))
   TRS:
    le(0(),y) -> true()
    le(s(x),0()) -> false()
    le(s(x),s(y)) -> le(x,y)
    minus(0(),y) -> 0()
    minus(s(x),y) -> if_minus(le(s(x),y),s(x),y)
    if_minus(true(),s(x),y) -> 0()
    if_minus(false(),s(x),y) -> s(minus(x,y))
    quot(0(),s(y)) -> 0()
    quot(s(x),s(y)) -> s(quot(minus(x,y),s(y)))
    log(s(0())) -> 0()
    log(s(s(x))) -> s(log(s(quot(x,s(s(0()))))))
   graph:
    log#(s(s(x))) -> log#(s(quot(x,s(s(0()))))) ->
    log#(s(s(x))) -> log#(s(quot(x,s(s(0())))))
    log#(s(s(x))) -> log#(s(quot(x,s(s(0()))))) ->
    log#(s(s(x))) -> quot#(x,s(s(0())))
    log#(s(s(x))) -> quot#(x,s(s(0()))) ->
    quot#(s(x),s(y)) -> quot#(minus(x,y),s(y))
    log#(s(s(x))) -> quot#(x,s(s(0()))) ->
    quot#(s(x),s(y)) -> minus#(x,y)
    quot#(s(x),s(y)) -> quot#(minus(x,y),s(y)) ->
    quot#(s(x),s(y)) -> quot#(minus(x,y),s(y))
    quot#(s(x),s(y)) -> quot#(minus(x,y),s(y)) ->
    quot#(s(x),s(y)) -> minus#(x,y)
    quot#(s(x),s(y)) -> minus#(x,y) ->
    minus#(s(x),y) -> if_minus#(le(s(x),y),s(x),y)
    quot#(s(x),s(y)) -> minus#(x,y) ->
    minus#(s(x),y) -> le#(s(x),y)
    if_minus#(false(),s(x),y) -> minus#(x,y) ->
    minus#(s(x),y) -> if_minus#(le(s(x),y),s(x),y)
    if_minus#(false(),s(x),y) -> minus#(x,y) ->
    minus#(s(x),y) -> le#(s(x),y)
    minus#(s(x),y) -> if_minus#(le(s(x),y),s(x),y) ->
    if_minus#(false(),s(x),y) -> minus#(x,y)
    minus#(s(x),y) -> le#(s(x),y) -> le#(s(x),s(y)) -> le#(x,y)
    le#(s(x),s(y)) -> le#(x,y) -> le#(s(x),s(y)) -> le#(x,y)
   SCC Processor:
    #sccs: 4
    #rules: 5
    #arcs: 13/64
    DPs:
     log#(s(s(x))) -> log#(s(quot(x,s(s(0())))))
    TRS:
     le(0(),y) -> true()
     le(s(x),0()) -> false()
     le(s(x),s(y)) -> le(x,y)
     minus(0(),y) -> 0()
     minus(s(x),y) -> if_minus(le(s(x),y),s(x),y)
     if_minus(true(),s(x),y) -> 0()
     if_minus(false(),s(x),y) -> s(minus(x,y))
     quot(0(),s(y)) -> 0()
     quot(s(x),s(y)) -> s(quot(minus(x,y),s(y)))
     log(s(0())) -> 0()
     log(s(s(x))) -> s(log(s(quot(x,s(s(0()))))))
    Usable Rule Processor:
     DPs:
      log#(s(s(x))) -> log#(s(quot(x,s(s(0())))))
     TRS:
      quot(0(),s(y)) -> 0()
      quot(s(x),s(y)) -> s(quot(minus(x,y),s(y)))
      minus(0(),y) -> 0()
      minus(s(x),y) -> if_minus(le(s(x),y),s(x),y)
      if_minus(true(),s(x),y) -> 0()
      if_minus(false(),s(x),y) -> s(minus(x,y))
      le(s(x),0()) -> false()
      le(s(x),s(y)) -> le(x,y)
      le(0(),y) -> true()
     KBO Processor:
      argument filtering:
       pi(0) = []
       pi(le) = []
       pi(true) = []
       pi(s) = [0]
       pi(false) = []
       pi(minus) = 0
       pi(if_minus) = 1
       pi(quot) = 0
       pi(log#) = 0
      usable rules:
       quot(0(),s(y)) -> 0()
       quot(s(x),s(y)) -> s(quot(minus(x,y),s(y)))
       minus(0(),y) -> 0()
       minus(s(x),y) -> if_minus(le(s(x),y),s(x),y)
       if_minus(true(),s(x),y) -> 0()
       if_minus(false(),s(x),y) -> s(minus(x,y))
      weight function:
       w0 = 1
       w(log#) = w(if_minus) = w(minus) = w(false) = w(s) = w(true) = w(
       le) = w(0) = 1
       w(quot) = 0
      precedence:
       0 > true > if_minus > le > minus > s > false > quot > log#
      problem:
       DPs:
        
       TRS:
        quot(0(),s(y)) -> 0()
        quot(s(x),s(y)) -> s(quot(minus(x,y),s(y)))
        minus(0(),y) -> 0()
        minus(s(x),y) -> if_minus(le(s(x),y),s(x),y)
        if_minus(true(),s(x),y) -> 0()
        if_minus(false(),s(x),y) -> s(minus(x,y))
        le(s(x),0()) -> false()
        le(s(x),s(y)) -> le(x,y)
        le(0(),y) -> true()
      Qed
    
    DPs:
     quot#(s(x),s(y)) -> quot#(minus(x,y),s(y))
    TRS:
     le(0(),y) -> true()
     le(s(x),0()) -> false()
     le(s(x),s(y)) -> le(x,y)
     minus(0(),y) -> 0()
     minus(s(x),y) -> if_minus(le(s(x),y),s(x),y)
     if_minus(true(),s(x),y) -> 0()
     if_minus(false(),s(x),y) -> s(minus(x,y))
     quot(0(),s(y)) -> 0()
     quot(s(x),s(y)) -> s(quot(minus(x,y),s(y)))
     log(s(0())) -> 0()
     log(s(s(x))) -> s(log(s(quot(x,s(s(0()))))))
    Usable Rule Processor:
     DPs:
      quot#(s(x),s(y)) -> quot#(minus(x,y),s(y))
     TRS:
      minus(0(),y) -> 0()
      minus(s(x),y) -> if_minus(le(s(x),y),s(x),y)
      if_minus(true(),s(x),y) -> 0()
      if_minus(false(),s(x),y) -> s(minus(x,y))
      le(s(x),0()) -> false()
      le(s(x),s(y)) -> le(x,y)
      le(0(),y) -> true()
     Arctic Interpretation Processor:
      dimension: 1
      usable rules:
       minus(0(),y) -> 0()
       minus(s(x),y) -> if_minus(le(s(x),y),s(x),y)
       if_minus(true(),s(x),y) -> 0()
       if_minus(false(),s(x),y) -> s(minus(x,y))
      interpretation:
       [false] = 1,
       
       [le](x0, x1) = 3x0 + 4x1 + 0,
       
       [s](x0) = 2x0 + 0,
       
       [minus](x0, x1) = x0,
       
       [0] = 0,
       
       [quot#](x0, x1) = x0,
       
       [if_minus](x0, x1, x2) = x1,
       
       [true] = 5
      orientation:
       quot#(s(x),s(y)) = 2x + 0 >= x = quot#(minus(x,y),s(y))
       
       minus(0(),y) = 0 >= 0 = 0()
       
       minus(s(x),y) = 2x + 0 >= 2x + 0 = if_minus(le(s(x),y),s(x),y)
       
       if_minus(true(),s(x),y) = 2x + 0 >= 0 = 0()
       
       if_minus(false(),s(x),y) = 2x + 0 >= 2x + 0 = s(minus(x,y))
       
       le(s(x),0()) = 5x + 4 >= 1 = false()
       
       le(s(x),s(y)) = 5x + 6y + 4 >= 3x + 4y + 0 = le(x,y)
       
       le(0(),y) = 4y + 3 >= 5 = true()
      problem:
       DPs:
        
       TRS:
        minus(0(),y) -> 0()
        minus(s(x),y) -> if_minus(le(s(x),y),s(x),y)
        if_minus(true(),s(x),y) -> 0()
        if_minus(false(),s(x),y) -> s(minus(x,y))
        le(s(x),0()) -> false()
        le(s(x),s(y)) -> le(x,y)
        le(0(),y) -> true()
      Qed
    
    DPs:
     minus#(s(x),y) -> if_minus#(le(s(x),y),s(x),y)
     if_minus#(false(),s(x),y) -> minus#(x,y)
    TRS:
     le(0(),y) -> true()
     le(s(x),0()) -> false()
     le(s(x),s(y)) -> le(x,y)
     minus(0(),y) -> 0()
     minus(s(x),y) -> if_minus(le(s(x),y),s(x),y)
     if_minus(true(),s(x),y) -> 0()
     if_minus(false(),s(x),y) -> s(minus(x,y))
     quot(0(),s(y)) -> 0()
     quot(s(x),s(y)) -> s(quot(minus(x,y),s(y)))
     log(s(0())) -> 0()
     log(s(s(x))) -> s(log(s(quot(x,s(s(0()))))))
    Subterm Criterion Processor:
     simple projection:
      pi(minus#) = 0
      pi(if_minus#) = 1
     problem:
      DPs:
       minus#(s(x),y) -> if_minus#(le(s(x),y),s(x),y)
      TRS:
       le(0(),y) -> true()
       le(s(x),0()) -> false()
       le(s(x),s(y)) -> le(x,y)
       minus(0(),y) -> 0()
       minus(s(x),y) -> if_minus(le(s(x),y),s(x),y)
       if_minus(true(),s(x),y) -> 0()
       if_minus(false(),s(x),y) -> s(minus(x,y))
       quot(0(),s(y)) -> 0()
       quot(s(x),s(y)) -> s(quot(minus(x,y),s(y)))
       log(s(0())) -> 0()
       log(s(s(x))) -> s(log(s(quot(x,s(s(0()))))))
     SCC Processor:
      #sccs: 0
      #rules: 0
      #arcs: 2/1
      
    
    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(0(),y) -> 0()
     minus(s(x),y) -> if_minus(le(s(x),y),s(x),y)
     if_minus(true(),s(x),y) -> 0()
     if_minus(false(),s(x),y) -> s(minus(x,y))
     quot(0(),s(y)) -> 0()
     quot(s(x),s(y)) -> s(quot(minus(x,y),s(y)))
     log(s(0())) -> 0()
     log(s(s(x))) -> s(log(s(quot(x,s(s(0()))))))
    Subterm Criterion Processor:
     simple projection:
      pi(le#) = 0
     problem:
      DPs:
       
      TRS:
       le(0(),y) -> true()
       le(s(x),0()) -> false()
       le(s(x),s(y)) -> le(x,y)
       minus(0(),y) -> 0()
       minus(s(x),y) -> if_minus(le(s(x),y),s(x),y)
       if_minus(true(),s(x),y) -> 0()
       if_minus(false(),s(x),y) -> s(minus(x,y))
       quot(0(),s(y)) -> 0()
       quot(s(x),s(y)) -> s(quot(minus(x,y),s(y)))
       log(s(0())) -> 0()
       log(s(s(x))) -> s(log(s(quot(x,s(s(0()))))))
     Qed