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