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


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


MAYBE
Input TRS:
    1: last(nil()) -> 0()
    2: last(cons(x,nil())) -> x
    3: last(cons(x,cons(y,xs))) -> last(cons(y,xs))
    4: del(x,nil()) -> nil()
    5: del(x,cons(y,xs)) -> if(eq(x,y),x,y,xs)
    6: if(true(),x,y,xs) -> xs
    7: if(false(),x,y,xs) -> cons(y,del(x,xs))
    8: eq(0(),0()) -> true()
    9: eq(0(),s(y)) -> false()
    10: eq(s(x),0()) -> false()
    11: eq(s(x),s(y)) -> eq(x,y)
    12: reverse(nil()) -> nil()
    13: reverse(cons(x,xs)) -> cons(last(cons(x,xs)),reverse(del(last(cons(x,xs)),cons(x,xs))))
Number of strict rules: 13
Direct POLO(bPol) ... failed.
Uncurrying last
1: last^1_nil() -> 0()
2: last^1_cons(x,nil()) -> x
3: last^1_cons(x,cons(y,xs)) -> last^1_cons(y,xs)
4: del(x,nil()) -> nil()
5: del(x,cons(y,xs)) -> if(eq(x,y),x,y,xs)
6: if(true(),x,y,xs) -> xs
7: if(false(),x,y,xs) -> cons(y,del(x,xs))
8: eq(0(),0()) -> true()
9: eq(0(),s(y)) -> false()
10: eq(s(x),0()) -> false()
11: eq(s(x),s(y)) -> eq(x,y)
12: reverse(nil()) -> nil()
13: reverse(cons(x,xs)) -> cons(last^1_cons(x,xs),reverse(del(last^1_cons(x,xs),cons(x,xs))))
14: last(cons(_1,_2)) ->= last^1_cons(_1,_2)
15: last(nil()) ->= last^1_nil()
Number of strict rules: 13
Direct POLO(bPol) ... failed.
Dependency Pairs:
   #1: #reverse(cons(x,xs)) -> #last^1_cons(x,xs)
   #2: #reverse(cons(x,xs)) -> #reverse(del(last^1_cons(x,xs),cons(x,xs)))
   #3: #reverse(cons(x,xs)) -> #del(last^1_cons(x,xs),cons(x,xs))
   #4: #reverse(cons(x,xs)) -> #last^1_cons(x,xs)
   #5: #eq(s(x),s(y)) -> #eq(x,y)
   #6: #last(cons(_1,_2)) ->? #last^1_cons(_1,_2)
   #7: #if(false(),x,y,xs) -> #del(x,xs)
   #8: #del(x,cons(y,xs)) -> #if(eq(x,y),x,y,xs)
   #9: #del(x,cons(y,xs)) -> #eq(x,y)
   #10: #last^1_cons(x,cons(y,xs)) -> #last^1_cons(y,xs)
   #11: #last(nil()) ->? #last^1_nil()
Number of SCCs: 4, DPs: 5
  SCC { #5 }
POLO(Sum)... succeeded.
      #del	w: 0
      s 	w: x1 + 1
      #reverse	w: 0
      eq	w: 0
      false	w: 0
      reverse	w: 0
      last^1_nil	w: 0
      true	w: 0
      #last	w: 0
      #eq	w: x1 + x2
      #last^1_nil	w: 0
      0 	w: 0
      if	w: 0
      del	w: 0
      #last^1_cons	w: 0
      last	w: 0
      nil	w: 0
      last^1_cons	w: 0
      cons	w: 0
      #if	w: 0
    USABLE RULES: { }
    Removed DPs: #5
Number of SCCs: 3, DPs: 4
  SCC { #10 }
POLO(Sum)... succeeded.
      #del	w: 0
      s 	w: 1
      #reverse	w: 0
      eq	w: 0
      false	w: 0
      reverse	w: 0
      last^1_nil	w: 0
      true	w: 0
      #last	w: 0
      #eq	w: 0
      #last^1_nil	w: 0
      0 	w: 0
      if	w: 0
      del	w: 0
      #last^1_cons	w: x2
      last	w: 0
      nil	w: 0
      last^1_cons	w: 0
      cons	w: x1 + x2 + 1
      #if	w: 0
    USABLE RULES: { }
    Removed DPs: #10
Number of SCCs: 2, DPs: 3
  SCC { #2 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
Finding a loop...  failed.