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


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


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