/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: int(x,y) -> if(le(x,y),x,y)
    5: if(true(),x,y) -> cons(x,int(s(x),y))
    6: if(false(),x,y) -> nil()
Number of strict rules: 6
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
   #1: #if(true(),x,y) -> #int(s(x),y)
   #2: #le(s(x),s(y)) -> #le(x,y)
   #3: #int(x,y) -> #if(le(x,y),x,y)
   #4: #int(x,y) -> #le(x,y)
Number of SCCs: 2, DPs: 3
  SCC { #2 }
POLO(Sum)... succeeded.
      le	w: 0
      s 	w: x1 + 1
      #le	w: x1 + x2
      false	w: 0
      true	w: 0
      0 	w: 0
      if	w: 0
      nil	w: 0
      int	w: 0
      cons	w: 0
      #if	w: 0
      #int	w: 0
    USABLE RULES: { }
    Removed DPs: #2
Number of SCCs: 1, DPs: 2
  SCC { #1 #3 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
Finding a loop...  failed.