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


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


YES
Input TRS:
    1: a__from(X) -> cons(mark(X),from(s(X)))
    2: a__first(0(),Z) -> nil()
    3: a__first(s(X),cons(Y,Z)) -> cons(mark(Y),first(X,Z))
    4: a__sel(0(),cons(X,Z)) -> mark(X)
    5: a__sel(s(X),cons(Y,Z)) -> a__sel(mark(X),mark(Z))
    6: mark(from(X)) -> a__from(mark(X))
    7: mark(first(X1,X2)) -> a__first(mark(X1),mark(X2))
    8: mark(sel(X1,X2)) -> a__sel(mark(X1),mark(X2))
    9: mark(cons(X1,X2)) -> cons(mark(X1),X2)
    10: mark(s(X)) -> s(mark(X))
    11: mark(0()) -> 0()
    12: mark(nil()) -> nil()
    13: a__from(X) -> from(X)
    14: a__first(X1,X2) -> first(X1,X2)
    15: a__sel(X1,X2) -> sel(X1,X2)
Number of strict rules: 15
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
   #1: #mark(from(X)) -> #a__from(mark(X))
   #2: #mark(from(X)) -> #mark(X)
   #3: #mark(cons(X1,X2)) -> #mark(X1)
   #4: #mark(first(X1,X2)) -> #a__first(mark(X1),mark(X2))
   #5: #mark(first(X1,X2)) -> #mark(X1)
   #6: #mark(first(X1,X2)) -> #mark(X2)
   #7: #mark(s(X)) -> #mark(X)
   #8: #a__sel(s(X),cons(Y,Z)) -> #a__sel(mark(X),mark(Z))
   #9: #a__sel(s(X),cons(Y,Z)) -> #mark(X)
   #10: #a__sel(s(X),cons(Y,Z)) -> #mark(Z)
   #11: #a__first(s(X),cons(Y,Z)) -> #mark(Y)
   #12: #a__from(X) -> #mark(X)
   #13: #mark(sel(X1,X2)) -> #a__sel(mark(X1),mark(X2))
   #14: #mark(sel(X1,X2)) -> #mark(X1)
   #15: #mark(sel(X1,X2)) -> #mark(X2)
   #16: #a__sel(0(),cons(X,Z)) -> #mark(X)
Number of SCCs: 1, DPs: 16
  SCC { #1..16 }
POLO(Sum)... POLO(max)... succeeded.
      s 	w: x1
      #a__from	w: x1 + 7
      #a__first	w: max(x2)
      a__from	w: x1 + 4
      #mark	w: x1 + 4
      0 	w: 1
      from	w: x1 + 4
      sel	w: max(x1 + 1, x2)
      nil	w: 3
      #a__sel	w: max(x1 + 5, x2 + 4)
      mark	w: x1
      a__sel	w: max(x1 + 1, x2)
      first	w: max(x1 + 1, x2 + 3)
      a__first	w: max(x1 + 1, x2 + 3)
      cons	w: max(x1 + 4, x2)
    USABLE RULES: { 1..15 }
    Removed DPs: #1..6 #9 #12 #14 #16
Number of SCCs: 1, DPs: 5
  SCC { #7 #8 #10 #13 #15 }
POLO(Sum)... POLO(max)... succeeded.
      s 	w: x1
      #a__from	w: x1 + 7
      #a__first	w: max(x2)
      a__from	w: x1 + 4
      #mark	w: x1 + 3
      0 	w: 1
      from	w: x1 + 4
      sel	w: max(x1 + 3, x2 + 1)
      nil	w: 3
      #a__sel	w: max(x1 + 5, x2 + 4)
      mark	w: x1
      a__sel	w: max(x1 + 3, x2 + 1)
      first	w: max(x1 + 1, x2 + 3)
      a__first	w: max(x1 + 1, x2 + 3)
      cons	w: max(x1 + 4, x2)
    USABLE RULES: { 1..15 }
    Removed DPs: #10 #15
Number of SCCs: 2, DPs: 2
  SCC { #7 }
POLO(Sum)... succeeded.
      s 	w: x1 + 1
      #a__from	w: 2
      #a__first	w: 0
      a__from	w: x1 + 3
      #mark	w: x1 + 2
      0 	w: 3
      from	w: 1
      sel	w: x1 + 2
      nil	w: 5
      #a__sel	w: 2
      mark	w: 2
      a__sel	w: x2 + 1
      first	w: 2
      a__first	w: x1 + 1
      cons	w: x1 + 1
    USABLE RULES: { }
    Removed DPs: #7
Number of SCCs: 1, DPs: 1
  SCC { #8 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... succeeded.
      s 	w: max(x1 + 3, 0)
      #a__from	w: 0
      #a__first	w: 0
      a__from	w: max(x1 + 4, 0)
      #mark	w: max(x1 - 1, 0)
      0 	w: 1
      from	w: max(x1 + 4, 0)
      sel	w: max(x1 + x2 + 1, 0)
      nil	w: 0
      #a__sel	w: max(x1 - 1, 0)
      mark	w: max(x1, 0)
      a__sel	w: max(x1 + x2 + 1, 0)
      first	w: max(x2, 0)
      a__first	w: max(x2, 0)
      cons	w: max(x1 + 3, x2 - 3, 0)
    USABLE RULES: { 1..15 }
    Removed DPs: #8
Number of SCCs: 0, DPs: 0