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


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


MAYBE
Input TRS:
    1: isEmpty(empty()) -> true()
    2: isEmpty(node(l,x,r)) -> false()
    3: left(empty()) -> empty()
    4: left(node(l,x,r)) -> l
    5: right(empty()) -> empty()
    6: right(node(l,x,r)) -> r
    7: elem(node(l,x,r)) -> x
    8: append(nil(),x) -> cons(x,nil())
    9: append(cons(y(),ys),x) -> cons(y(),append(ys,x))
    10: listify(n,xs) -> if(isEmpty(n),isEmpty(left(n)),right(n),node(left(left(n)),elem(left(n)),node(right(left(n)),elem(n),right(n))),xs,append(xs,n))
    11: if(true(),b,n,m,xs,ys) -> xs
    12: if(false(),false(),n,m,xs,ys) -> listify(m,xs)
    13: if(false(),true(),n,m,xs,ys) -> listify(n,ys)
    14: toList(n) -> listify(n,nil())
Number of strict rules: 14
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
   #1: #if(false(),true(),n,m,xs,ys) -> #listify(n,ys)
   #2: #append(cons(y(),ys),x) -> #append(ys,x)
   #3: #if(false(),false(),n,m,xs,ys) -> #listify(m,xs)
   #4: #toList(n) -> #listify(n,nil())
   #5: #listify(n,xs) -> #if(isEmpty(n),isEmpty(left(n)),right(n),node(left(left(n)),elem(left(n)),node(right(left(n)),elem(n),right(n))),xs,append(xs,n))
   #6: #listify(n,xs) -> #isEmpty(n)
   #7: #listify(n,xs) -> #isEmpty(left(n))
   #8: #listify(n,xs) -> #left(n)
   #9: #listify(n,xs) -> #right(n)
   #10: #listify(n,xs) -> #left(left(n))
   #11: #listify(n,xs) -> #left(n)
   #12: #listify(n,xs) -> #elem(left(n))
   #13: #listify(n,xs) -> #left(n)
   #14: #listify(n,xs) -> #right(left(n))
   #15: #listify(n,xs) -> #left(n)
   #16: #listify(n,xs) -> #elem(n)
   #17: #listify(n,xs) -> #right(n)
   #18: #listify(n,xs) -> #append(xs,n)
Number of SCCs: 2, DPs: 4
  SCC { #2 }
POLO(Sum)... succeeded.
      #left	w: 0
      left	w: 0
      #append	w: x1
      elem	w: 0
      y 	w: 1
      #isEmpty	w: 0
      false	w: 0
      isEmpty	w: 0
      true	w: 0
      #listify	w: 0
      toList	w: 0
      append	w: 0
      if	w: 0
      #toList	w: 0
      nil	w: 0
      #elem	w: 0
      right	w: 0
      cons	w: x1 + x2
      #if	w: 0
      empty	w: 0
      #right	w: 0
      listify	w: 0
      node	w: 0
    USABLE RULES: { }
    Removed DPs: #2
Number of SCCs: 1, DPs: 3
  SCC { #1 #3 #5 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
Finding a loop...  failed.