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


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


MAYBE
Input TRS:
    1: minus(x,0()) -> x
    2: minus(s(x),s(y)) -> minus(x,y)
    3: quot(0(),s(y)) -> 0()
    4: quot(s(x),s(y)) -> s(quot(minus(x,y),s(y)))
    5: le(0(),y) -> true()
    6: le(s(x),0()) -> false()
    7: le(s(x),s(y)) -> le(x,y)
    8: inc(s(x)) -> s(inc(x))
    9: inc(0()) -> s(0())
    10: log(x) -> logIter(x,0())
    11: logIter(x,y) -> if(le(s(0()),x),le(s(s(0())),x),quot(x,s(s(0()))),inc(y))
    12: if(false(),b,x,y) -> logZeroError()
    13: if(true(),false(),x,s(y)) -> y
    14: if(true(),true(),x,y) -> logIter(x,y)
Number of strict rules: 14
Direct POLO(bPol) ... failed.
Uncurrying le
1: minus(x,0()) -> x
2: minus(s(x),s(y)) -> minus(x,y)
3: quot(0(),s(y)) -> 0()
4: quot(s(x),s(y)) -> s(quot(minus(x,y),s(y)))
5: le^1_0(y) -> true()
6: le^1_s(x,0()) -> false()
7: le^1_s(x,s(y)) -> le(x,y)
8: inc(s(x)) -> s(inc(x))
9: inc(0()) -> s(0())
10: log(x) -> logIter(x,0())
11: logIter(x,y) -> if(le^1_s(0(),x),le^1_s(s(0()),x),quot(x,s(s(0()))),inc(y))
12: if(false(),b,x,y) -> logZeroError()
13: if(true(),false(),x,s(y)) -> y
14: if(true(),true(),x,y) -> logIter(x,y)
15: le(0(),_1) ->= le^1_0(_1)
16: le(s(_1),_2) ->= le^1_s(_1,_2)
Number of strict rules: 14
Direct POLO(bPol) ... failed.
Dependency Pairs:
   #1: #minus(s(x),s(y)) -> #minus(x,y)
   #2: #logIter(x,y) -> #if(le^1_s(0(),x),le^1_s(s(0()),x),quot(x,s(s(0()))),inc(y))
   #3: #logIter(x,y) -> #le^1_s(0(),x)
   #4: #logIter(x,y) -> #le^1_s(s(0()),x)
   #5: #logIter(x,y) -> #quot(x,s(s(0())))
   #6: #logIter(x,y) -> #inc(y)
   #7: #if(true(),true(),x,y) -> #logIter(x,y)
   #8: #le^1_s(x,s(y)) -> #le(x,y)
   #9: #log(x) -> #logIter(x,0())
   #10: #le(s(_1),_2) ->? #le^1_s(_1,_2)
   #11: #inc(s(x)) -> #inc(x)
   #12: #le(0(),_1) ->? #le^1_0(_1)
   #13: #quot(s(x),s(y)) -> #quot(minus(x,y),s(y))
   #14: #quot(s(x),s(y)) -> #minus(x,y)
Number of SCCs: 5, DPs: 7
  SCC { #11 }
POLO(Sum)... succeeded.
      #le^1_s	w: 0
      le	w: 0
      le^1_s	w: 0
      s 	w: x1 + 1
      #le	w: 0
      #le^1_0	w: 0
      minus	w: 0
      false	w: 0
      logZeroError	w: 0
      #log	w: 0
      #inc	w: x1
      inc	w: 0
      true	w: 0
      log	w: 0
      0 	w: 0
      if	w: 0
      quot	w: 0
      logIter	w: 0
      #minus	w: 0
      #logIter	w: 0
      le^1_0	w: 0
      #if	w: 0
      #quot	w: 0
    USABLE RULES: { }
    Removed DPs: #11
Number of SCCs: 4, DPs: 6
  SCC { #1 }
POLO(Sum)... succeeded.
      #le^1_s	w: 0
      le	w: 0
      le^1_s	w: 0
      s 	w: x1 + 1
      #le	w: 0
      #le^1_0	w: 0
      minus	w: 0
      false	w: 0
      logZeroError	w: 0
      #log	w: 0
      #inc	w: 0
      inc	w: 0
      true	w: 0
      log	w: 0
      0 	w: 0
      if	w: 0
      quot	w: 0
      logIter	w: 0
      #minus	w: x2
      #logIter	w: 0
      le^1_0	w: 0
      #if	w: 0
      #quot	w: 0
    USABLE RULES: { }
    Removed DPs: #1
Number of SCCs: 3, DPs: 5
  SCC { #13 }
POLO(Sum)... succeeded.
      #le^1_s	w: 0
      le	w: 0
      le^1_s	w: 0
      s 	w: x1 + 2
      #le	w: 0
      #le^1_0	w: 0
      minus	w: x1 + 1
      false	w: 0
      logZeroError	w: 0
      #log	w: 0
      #inc	w: 0
      inc	w: 0
      true	w: 0
      log	w: 0
      0 	w: 1
      if	w: 0
      quot	w: 0
      logIter	w: 0
      #minus	w: 0
      #logIter	w: 0
      le^1_0	w: 0
      #if	w: 0
      #quot	w: x1
    USABLE RULES: { 1 2 }
    Removed DPs: #13
Number of SCCs: 2, DPs: 4
  SCC { #8 #10 }
POLO(Sum)... succeeded.
      #le^1_s	w: x1 + x2
      le	w: 0
      le^1_s	w: 0
      s 	w: x1 + 2
      #le	w: x1 + x2
      #le^1_0	w: 0
      minus	w: x1 + 1
      false	w: 0
      logZeroError	w: 0
      #log	w: 0
      #inc	w: 0
      inc	w: 0
      true	w: 0
      log	w: 0
      0 	w: 1
      if	w: 0
      quot	w: 0
      logIter	w: 0
      #minus	w: 0
      #logIter	w: 0
      le^1_0	w: 0
      #if	w: 0
      #quot	w: x1
    USABLE RULES: { 1 2 }
    Removed DPs: #8 #10
Number of SCCs: 1, DPs: 2
  SCC { #2 #7 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
Finding a loop...  failed.