/export/starexec/sandbox2/solver/bin/starexec_run_Default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/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: zero(0()) -> true()
    5: zero(s(x)) -> false()
    6: id(0()) -> 0()
    7: id(s(x)) -> s(id(x))
    8: minus(x,0()) -> x
    9: minus(s(x),s(y)) -> minus(x,y)
    10: mod(x,y) -> if_mod(zero(x),zero(y),le(y,x),id(x),id(y))
    11: if_mod(true(),b1,b2,x,y) -> 0()
    12: if_mod(false(),b1,b2,x,y) -> if2(b1,b2,x,y)
    13: if2(true(),b2,x,y) -> 0()
    14: if2(false(),b2,x,y) -> if3(b2,x,y)
    15: if3(true(),x,y) -> mod(minus(x,y),s(y))
    16: if3(false(),x,y) -> x
Number of strict rules: 16
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
   #1: #minus(s(x),s(y)) -> #minus(x,y)
   #2: #if_mod(false(),b1,b2,x,y) -> #if2(b1,b2,x,y)
   #3: #if2(false(),b2,x,y) -> #if3(b2,x,y)
   #4: #id(s(x)) -> #id(x)
   #5: #mod(x,y) -> #if_mod(zero(x),zero(y),le(y,x),id(x),id(y))
   #6: #mod(x,y) -> #zero(x)
   #7: #mod(x,y) -> #zero(y)
   #8: #mod(x,y) -> #le(y,x)
   #9: #mod(x,y) -> #id(x)
   #10: #mod(x,y) -> #id(y)
   #11: #le(s(x),s(y)) -> #le(x,y)
   #12: #if3(true(),x,y) -> #mod(minus(x,y),s(y))
   #13: #if3(true(),x,y) -> #minus(x,y)
Number of SCCs: 4, DPs: 7
  SCC { #4 }
POLO(Sum)... succeeded.
      zero	w: 0
      le	w: 0
      s 	w: x1 + 1
      #le	w: 0
      minus	w: 0
      mod	w: 0
      false	w: 0
      #id	w: x1
      true	w: 0
      if2	w: 0
      if_mod	w: 0
      #if3	w: 0
      0 	w: 0
      #minus	w: 0
      #mod	w: 0
      #if_mod	w: 0
      if3	w: 0
      id	w: 0
      #zero	w: 0
      #if2	w: 0
    USABLE RULES: { }
    Removed DPs: #4
Number of SCCs: 3, DPs: 6
  SCC { #11 }
POLO(Sum)... succeeded.
      zero	w: 0
      le	w: 0
      s 	w: x1 + 1
      #le	w: x2
      minus	w: 0
      mod	w: 0
      false	w: 0
      #id	w: 0
      true	w: 0
      if2	w: 0
      if_mod	w: 0
      #if3	w: 0
      0 	w: 0
      #minus	w: 0
      #mod	w: 0
      #if_mod	w: 0
      if3	w: 0
      id	w: 0
      #zero	w: 0
      #if2	w: 0
    USABLE RULES: { }
    Removed DPs: #11
Number of SCCs: 2, DPs: 5
  SCC { #1 }
POLO(Sum)... succeeded.
      zero	w: 0
      le	w: 0
      s 	w: x1 + 1
      #le	w: 0
      minus	w: 0
      mod	w: 0
      false	w: 0
      #id	w: 0
      true	w: 0
      if2	w: 0
      if_mod	w: 0
      #if3	w: 0
      0 	w: 0
      #minus	w: x2
      #mod	w: 0
      #if_mod	w: 0
      if3	w: 0
      id	w: 0
      #zero	w: 0
      #if2	w: 0
    USABLE RULES: { }
    Removed DPs: #1
Number of SCCs: 1, DPs: 4
  SCC { #2 #3 #5 #12 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
Finding a loop...  failed.