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


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


MAYBE
Input TRS:
    1: isLeaf(leaf()) -> true()
    2: isLeaf(cons(u,v)) -> false()
    3: left(cons(u,v)) -> u
    4: right(cons(u,v)) -> v
    5: concat(leaf(),y) -> y
    6: concat(cons(u,v),y) -> cons(u,concat(v,y))
    7: less_leaves(u,v) -> if1(isLeaf(u),isLeaf(v),u,v)
    8: if1(b,true(),u,v) -> false()
    9: if1(b,false(),u,v) -> if2(b,u,v)
    10: if2(true(),u,v) -> true()
    11: if2(false(),u,v) -> less_leaves(concat(left(u),right(u)),concat(left(v),right(v)))
Number of strict rules: 11
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
   #1: #concat(cons(u,v),y) -> #concat(v,y)
   #2: #if1(b,false(),u,v) -> #if2(b,u,v)
   #3: #if2(false(),u,v) -> #less_leaves(concat(left(u),right(u)),concat(left(v),right(v)))
   #4: #if2(false(),u,v) -> #concat(left(u),right(u))
   #5: #if2(false(),u,v) -> #left(u)
   #6: #if2(false(),u,v) -> #right(u)
   #7: #if2(false(),u,v) -> #concat(left(v),right(v))
   #8: #if2(false(),u,v) -> #left(v)
   #9: #if2(false(),u,v) -> #right(v)
   #10: #less_leaves(u,v) -> #if1(isLeaf(u),isLeaf(v),u,v)
   #11: #less_leaves(u,v) -> #isLeaf(u)
   #12: #less_leaves(u,v) -> #isLeaf(v)
Number of SCCs: 2, DPs: 4
  SCC { #1 }
POLO(Sum)... succeeded.
      #left	w: 0
      left	w: 0
      #less_leaves	w: 0
      if1	w: 0
      #concat	w: x1
      false	w: 0
      true	w: 0
      #if1	w: 0
      concat	w: 0
      if2	w: 0
      less_leaves	w: 0
      right	w: 0
      cons	w: x2 + 1
      #isLeaf	w: 0
      isLeaf	w: 0
      #right	w: 0
      leaf	w: 0
      #if2	w: 0
    USABLE RULES: { }
    Removed DPs: #1
Number of SCCs: 1, DPs: 3
  SCC { #2 #3 #10 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
Finding a loop...  failed.