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


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


MAYBE
Input TRS:
    1: app(x,y) -> helpa(0(),plus(length(x),length(y)),x,y)
    2: plus(x,0()) -> x
    3: plus(x,s(y)) -> s(plus(x,y))
    4: length(nil()) -> 0()
    5: length(cons(x,y)) -> s(length(y))
    6: helpa(c,l,ys,zs) -> if(ge(c,l),c,l,ys,zs)
    7: ge(x,0()) -> true()
    8: ge(0(),s(x)) -> false()
    9: ge(s(x),s(y)) -> ge(x,y)
    10: if(true(),c,l,ys,zs) -> nil()
    11: if(false(),c,l,ys,zs) -> helpb(c,l,ys,zs)
    12: take(0(),cons(x,xs()),ys) -> x
    13: take(0(),nil(),cons(y,ys)) -> y
    14: take(s(c),cons(x,xs()),ys) -> take(c,xs(),ys)
    15: take(s(c),nil(),cons(y,ys)) -> take(c,nil(),ys)
    16: helpb(c,l,ys,zs) -> cons(take(c,ys,zs),helpa(s(c),l,ys,zs))
Number of strict rules: 16
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
   #1: #helpa(c,l,ys,zs) -> #if(ge(c,l),c,l,ys,zs)
   #2: #helpa(c,l,ys,zs) -> #ge(c,l)
   #3: #ge(s(x),s(y)) -> #ge(x,y)
   #4: #if(false(),c,l,ys,zs) -> #helpb(c,l,ys,zs)
   #5: #take(s(c),cons(x,xs()),ys) -> #take(c,xs(),ys)
   #6: #length(cons(x,y)) -> #length(y)
   #7: #helpb(c,l,ys,zs) -> #take(c,ys,zs)
   #8: #helpb(c,l,ys,zs) -> #helpa(s(c),l,ys,zs)
   #9: #plus(x,s(y)) -> #plus(x,y)
   #10: #app(x,y) -> #helpa(0(),plus(length(x),length(y)),x,y)
   #11: #app(x,y) -> #plus(length(x),length(y))
   #12: #app(x,y) -> #length(x)
   #13: #app(x,y) -> #length(y)
   #14: #take(s(c),nil(),cons(y,ys)) -> #take(c,nil(),ys)
Number of SCCs: 5, DPs: 7
  SCC { #6 }
POLO(Sum)... succeeded.
      s 	w: 0
      #take	w: 0
      take	w: 0
      #plus	w: 0
      #helpa	w: 0
      false	w: 0
      #ge	w: 0
      helpb	w: 0
      true	w: 0
      0 	w: 0
      if	w: 0
      ge	w: 0
      nil	w: 0
      #app	w: 0
      plus	w: 0
      cons	w: x2 + 1
      #if	w: 0
      xs	w: 0
      helpa	w: 0
      length	w: 0
      #length	w: x1
      #helpb	w: 0
      app	w: 0
    USABLE RULES: { }
    Removed DPs: #6
Number of SCCs: 4, DPs: 6
  SCC { #9 }
POLO(Sum)... succeeded.
      s 	w: x1 + 1
      #take	w: 0
      take	w: 0
      #plus	w: x2
      #helpa	w: 0
      false	w: 0
      #ge	w: 0
      helpb	w: 0
      true	w: 0
      0 	w: 0
      if	w: 0
      ge	w: 0
      nil	w: 0
      #app	w: 0
      plus	w: 0
      cons	w: 1
      #if	w: 0
      xs	w: 0
      helpa	w: 0
      length	w: 0
      #length	w: 0
      #helpb	w: 0
      app	w: 0
    USABLE RULES: { }
    Removed DPs: #9
Number of SCCs: 3, DPs: 5
  SCC { #3 }
POLO(Sum)... succeeded.
      s 	w: x1 + 1
      #take	w: 0
      take	w: 0
      #plus	w: 0
      #helpa	w: 0
      false	w: 0
      #ge	w: x2
      helpb	w: 0
      true	w: 0
      0 	w: 0
      if	w: 0
      ge	w: 0
      nil	w: 0
      #app	w: 0
      plus	w: 0
      cons	w: 1
      #if	w: 0
      xs	w: 0
      helpa	w: 0
      length	w: 0
      #length	w: 0
      #helpb	w: 0
      app	w: 0
    USABLE RULES: { }
    Removed DPs: #3
Number of SCCs: 2, DPs: 4
  SCC { #14 }
POLO(Sum)... succeeded.
      s 	w: 1
      #take	w: x3
      take	w: 0
      #plus	w: 0
      #helpa	w: 0
      false	w: 0
      #ge	w: 0
      helpb	w: 0
      true	w: 0
      0 	w: 0
      if	w: 0
      ge	w: 0
      nil	w: 0
      #app	w: 0
      plus	w: 0
      cons	w: x2 + 1
      #if	w: 0
      xs	w: 0
      helpa	w: 0
      length	w: 0
      #length	w: 0
      #helpb	w: 0
      app	w: 0
    USABLE RULES: { }
    Removed DPs: #14
Number of SCCs: 1, DPs: 3
  SCC { #1 #4 #8 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
Finding a loop...  failed.