/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: eq(0(),0()) -> true()
    5: eq(0(),s(y)) -> false()
    6: eq(s(x),0()) -> false()
    7: eq(s(x),s(y)) -> eq(x,y)
    8: if1(true(),x,y,xs) -> min(x,xs)
    9: if1(false(),x,y,xs) -> min(y,xs)
    10: if2(true(),x,y,xs) -> xs
    11: if2(false(),x,y,xs) -> cons(y,del(x,xs))
    12: minsort(nil()) -> nil()
    13: minsort(cons(x,y)) -> cons(min(x,y),minsort(del(min(x,y),cons(x,y))))
    14: min(x,nil()) -> x
    15: min(x,cons(y,z)) -> if1(le(x,y),x,y,z)
    16: del(x,nil()) -> nil()
    17: del(x,cons(y,z)) -> if2(eq(x,y),x,y,z)
Number of strict rules: 17
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
   #1: #minsort(cons(x,y)) -> #min(x,y)
   #2: #minsort(cons(x,y)) -> #minsort(del(min(x,y),cons(x,y)))
   #3: #minsort(cons(x,y)) -> #del(min(x,y),cons(x,y))
   #4: #minsort(cons(x,y)) -> #min(x,y)
   #5: #if1(false(),x,y,xs) -> #min(y,xs)
   #6: #if2(false(),x,y,xs) -> #del(x,xs)
   #7: #eq(s(x),s(y)) -> #eq(x,y)
   #8: #del(x,cons(y,z)) -> #if2(eq(x,y),x,y,z)
   #9: #del(x,cons(y,z)) -> #eq(x,y)
   #10: #le(s(x),s(y)) -> #le(x,y)
   #11: #if1(true(),x,y,xs) -> #min(x,xs)
   #12: #min(x,cons(y,z)) -> #if1(le(x,y),x,y,z)
   #13: #min(x,cons(y,z)) -> #le(x,y)
Number of SCCs: 5, DPs: 8
  SCC { #7 }
POLO(Sum)... succeeded.
      le	w: 0
      #del	w: 0
      s 	w: x1 + 1
      #le	w: 0
      eq	w: 0
      if1	w: 0
      false	w: 0
      #min	w: 0
      true	w: 0
      #eq	w: x1 + x2
      #if1	w: 0
      if2	w: 0
      0 	w: 0
      del	w: 0
      nil	w: 0
      min	w: 0
      cons	w: 0
      #minsort	w: 0
      minsort	w: 0
      #if2	w: 0
    USABLE RULES: { }
    Removed DPs: #7
Number of SCCs: 4, DPs: 7
  SCC { #10 }
POLO(Sum)... succeeded.
      le	w: 0
      #del	w: 0
      s 	w: x1 + 1
      #le	w: x2
      eq	w: 0
      if1	w: 0
      false	w: 0
      #min	w: 0
      true	w: 0
      #eq	w: 0
      #if1	w: 0
      if2	w: 0
      0 	w: 0
      del	w: 0
      nil	w: 0
      min	w: 0
      cons	w: 0
      #minsort	w: 0
      minsort	w: 0
      #if2	w: 0
    USABLE RULES: { }
    Removed DPs: #10
Number of SCCs: 3, DPs: 6
  SCC { #2 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
Finding a loop...  failed.