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


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


YES
Input TRS:
    1: a__dbl(0()) -> 0()
    2: a__dbl(s(X)) -> s(s(dbl(X)))
    3: a__dbls(nil()) -> nil()
    4: a__dbls(cons(X,Y)) -> cons(dbl(X),dbls(Y))
    5: a__sel(0(),cons(X,Y)) -> mark(X)
    6: a__sel(s(X),cons(Y,Z)) -> a__sel(mark(X),mark(Z))
    7: a__indx(nil(),X) -> nil()
    8: a__indx(cons(X,Y),Z) -> cons(sel(X,Z),indx(Y,Z))
    9: a__from(X) -> cons(X,from(s(X)))
    10: mark(dbl(X)) -> a__dbl(mark(X))
    11: mark(dbls(X)) -> a__dbls(mark(X))
    12: mark(sel(X1,X2)) -> a__sel(mark(X1),mark(X2))
    13: mark(indx(X1,X2)) -> a__indx(mark(X1),X2)
    14: mark(from(X)) -> a__from(X)
    15: mark(0()) -> 0()
    16: mark(s(X)) -> s(X)
    17: mark(nil()) -> nil()
    18: mark(cons(X1,X2)) -> cons(X1,X2)
    19: a__dbl(X) -> dbl(X)
    20: a__dbls(X) -> dbls(X)
    21: a__sel(X1,X2) -> sel(X1,X2)
    22: a__indx(X1,X2) -> indx(X1,X2)
    23: a__from(X) -> from(X)
Number of strict rules: 23
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
   #1: #a__sel(s(X),cons(Y,Z)) -> #a__sel(mark(X),mark(Z))
   #2: #a__sel(s(X),cons(Y,Z)) -> #mark(X)
   #3: #a__sel(s(X),cons(Y,Z)) -> #mark(Z)
   #4: #mark(indx(X1,X2)) -> #a__indx(mark(X1),X2)
   #5: #mark(indx(X1,X2)) -> #mark(X1)
   #6: #mark(dbls(X)) -> #a__dbls(mark(X))
   #7: #mark(dbls(X)) -> #mark(X)
   #8: #mark(sel(X1,X2)) -> #a__sel(mark(X1),mark(X2))
   #9: #mark(sel(X1,X2)) -> #mark(X1)
   #10: #mark(sel(X1,X2)) -> #mark(X2)
   #11: #mark(from(X)) -> #a__from(X)
   #12: #mark(dbl(X)) -> #a__dbl(mark(X))
   #13: #mark(dbl(X)) -> #mark(X)
   #14: #a__sel(0(),cons(X,Y)) -> #mark(X)
Number of SCCs: 1, DPs: 10
  SCC { #1..3 #5 #7..10 #13 #14 }
POLO(Sum)... POLO(max)... succeeded.
      s 	w: x1
      #a__from	w: 0
      dbls	w: x1 + 1
      a__indx	w: max(x1 + 6, x2 + 5)
      a__from	w: x1 + 3
      #a__indx	w: 0
      dbl	w: x1 + 1
      indx	w: max(x1 + 6, x2 + 5)
      a__dbl	w: x1 + 1
      #a__dbls	w: 0
      #mark	w: x1
      0 	w: 1
      sel	w: max(x1 + 6, x2 + 2)
      from	w: x1 + 3
      nil	w: 6
      #a__dbl	w: 0
      #a__sel	w: max(x1 + 3, x2 + 1)
      mark	w: x1
      a__sel	w: max(x1 + 6, x2 + 2)
      a__dbls	w: x1 + 1
      cons	w: max(x1 + 3, x2)
    USABLE RULES: { 1..23 }
    Removed DPs: #2 #3 #5 #7..10 #13 #14
Number of SCCs: 1, DPs: 1
  SCC { #1 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... succeeded.
      s 	s: [1]	p: 1	w: x1
      #a__from	s: []	p: 0	w: 0
      dbls	s: []	p: 5	w: x1 + 2
      a__indx	s: []	p: 6	w: x2 + 2
      a__from	s: [1]	p: 5	w: x1 + 1
      #a__indx	s: [2,1]	p: 0	w: x1 + x2 + 1
      dbl	s: [1]	p: 2	w: x1 + 1
      indx	s: []	p: 6	w: x2 + 2
      a__dbl	s: [1]	p: 2	w: x1 + 1
      #a__dbls	s: []	p: 0	w: 0
      #mark	s: []	p: 0	w: 1
      0 	s: []	p: 2	w: 1
      sel	s: []	p: 0	w: x2 + 1
      from	s: [1]	p: 5	w: x1 + 1
      nil	s: []	p: 6	w: 2
      #a__dbl	s: []	p: 0	w: 0
      #a__sel	s: [1]	p: 3	w: x1 + 1
      mark	s: 1
      a__sel	s: []	p: 0	w: x2 + 1
      a__dbls	s: []	p: 5	w: x1 + 2
      cons	s: [1]	p: 4	w: max(x1, x2)
    USABLE RULES: { 1..23 }
    Removed DPs: #1
Number of SCCs: 0, DPs: 0