/export/starexec/sandbox/solver/bin/starexec_run_Default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/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,greater(ys,zs),smaller(ys,zs))
    12: greater(ys,zs) -> helpc(ge(length(ys),length(zs)),ys,zs)
    13: smaller(ys,zs) -> helpc(ge(length(ys),length(zs)),zs,ys)
    14: helpc(true(),ys,zs) -> ys
    15: helpc(false(),ys,zs) -> zs
    16: helpb(c,l,cons(y,ys),zs) -> cons(y,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: #smaller(ys,zs) -> #helpc(ge(length(ys),length(zs)),zs,ys)
   #4: #smaller(ys,zs) -> #ge(length(ys),length(zs))
   #5: #smaller(ys,zs) -> #length(ys)
   #6: #smaller(ys,zs) -> #length(zs)
   #7: #ge(s(x),s(y)) -> #ge(x,y)
   #8: #if(false(),c,l,ys,zs) -> #helpb(c,l,greater(ys,zs),smaller(ys,zs))
   #9: #if(false(),c,l,ys,zs) -> #greater(ys,zs)
   #10: #if(false(),c,l,ys,zs) -> #smaller(ys,zs)
   #11: #greater(ys,zs) -> #helpc(ge(length(ys),length(zs)),ys,zs)
   #12: #greater(ys,zs) -> #ge(length(ys),length(zs))
   #13: #greater(ys,zs) -> #length(ys)
   #14: #greater(ys,zs) -> #length(zs)
   #15: #length(cons(x,y)) -> #length(y)
   #16: #helpb(c,l,cons(y,ys),zs) -> #helpa(s(c),l,ys,zs)
   #17: #plus(x,s(y)) -> #plus(x,y)
   #18: #app(x,y) -> #helpa(0(),plus(length(x),length(y)),x,y)
   #19: #app(x,y) -> #plus(length(x),length(y))
   #20: #app(x,y) -> #length(x)
   #21: #app(x,y) -> #length(y)
Number of SCCs: 4, DPs: 6
  SCC { #15 }
POLO(Sum)... succeeded.
      smaller	w: 0
      s 	w: 0
      greater	w: 0
      #plus	w: 0
      #helpa	w: 0
      false	w: 0
      #ge	w: 0
      helpb	w: 0
      #smaller	w: 0
      true	w: 0
      0 	w: 0
      if	w: 0
      ge	w: 0
      #helpc	w: 0
      nil	w: 0
      helpc	w: 0
      #app	w: 0
      plus	w: 0
      #greater	w: 0
      cons	w: x2 + 1
      #if	w: 0
      helpa	w: 0
      length	w: 0
      #length	w: x1
      #helpb	w: 0
      app	w: 0
    USABLE RULES: { }
    Removed DPs: #15
Number of SCCs: 3, DPs: 5
  SCC { #17 }
POLO(Sum)... succeeded.
      smaller	w: 0
      s 	w: x1 + 1
      greater	w: 0
      #plus	w: x2
      #helpa	w: 0
      false	w: 0
      #ge	w: 0
      helpb	w: 0
      #smaller	w: 0
      true	w: 0
      0 	w: 0
      if	w: 0
      ge	w: 0
      #helpc	w: 0
      nil	w: 0
      helpc	w: 0
      #app	w: 0
      plus	w: 0
      #greater	w: 0
      cons	w: 1
      #if	w: 0
      helpa	w: 0
      length	w: 0
      #length	w: 0
      #helpb	w: 0
      app	w: 0
    USABLE RULES: { }
    Removed DPs: #17
Number of SCCs: 2, DPs: 4
  SCC { #7 }
POLO(Sum)... succeeded.
      smaller	w: 0
      s 	w: x1 + 1
      greater	w: 0
      #plus	w: 0
      #helpa	w: 0
      false	w: 0
      #ge	w: x2
      helpb	w: 0
      #smaller	w: 0
      true	w: 0
      0 	w: 0
      if	w: 0
      ge	w: 0
      #helpc	w: 0
      nil	w: 0
      helpc	w: 0
      #app	w: 0
      plus	w: 0
      #greater	w: 0
      cons	w: 1
      #if	w: 0
      helpa	w: 0
      length	w: 0
      #length	w: 0
      #helpb	w: 0
      app	w: 0
    USABLE RULES: { }
    Removed DPs: #7
Number of SCCs: 1, DPs: 3
  SCC { #1 #8 #16 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
Finding a loop...  failed.