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


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


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