/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__sel(0(),cons(X,Y)) -> mark(X)
    3: a__sel(s(X),cons(Y,Z)) -> a__sel(mark(X),mark(Z))
    4: mark(from(X)) -> a__from(mark(X))
    5: mark(sel(X1,X2)) -> a__sel(mark(X1),mark(X2))
    6: mark(cons(X1,X2)) -> cons(mark(X1),X2)
    7: mark(s(X)) -> s(mark(X))
    8: mark(0()) -> 0()
    9: a__from(X) -> from(X)
    10: a__sel(X1,X2) -> sel(X1,X2)
Number of strict rules: 10
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
   #1: #a__sel(0(),cons(X,Y)) -> #mark(X)
   #2: #mark(cons(X1,X2)) -> #mark(X1)
   #3: #mark(s(X)) -> #mark(X)
   #4: #mark(sel(X1,X2)) -> #a__sel(mark(X1),mark(X2))
   #5: #mark(sel(X1,X2)) -> #mark(X1)
   #6: #mark(sel(X1,X2)) -> #mark(X2)
   #7: #a__sel(s(X),cons(Y,Z)) -> #a__sel(mark(X),mark(Z))
   #8: #a__sel(s(X),cons(Y,Z)) -> #mark(X)
   #9: #a__sel(s(X),cons(Y,Z)) -> #mark(Z)
   #10: #a__from(X) -> #mark(X)
   #11: #mark(from(X)) -> #a__from(mark(X))
   #12: #mark(from(X)) -> #mark(X)
Number of SCCs: 1, DPs: 12
  SCC { #1..12 }
POLO(Sum)... POLO(max)... succeeded.
      s 	w: x1
      #a__from	w: x1 + 1
      a__from	w: x1 + 2
      #mark	w: x1
      0 	w: 1
      from	w: x1 + 2
      sel	w: max(x1 + 3, x2 + 4)
      #a__sel	w: max(x1 + 2, x2 + 1)
      mark	w: x1
      a__sel	w: max(x1 + 3, x2 + 4)
      cons	w: max(x1, x2)
    USABLE RULES: { 1..10 }
    Removed DPs: #1 #4..6 #8..12
Number of SCCs: 2, DPs: 3
  SCC { #7 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... succeeded.
      s 	w: max(x1 + 3, 0)
      #a__from	w: max(x1 - 1, 0)
      a__from	w: max(x1 + 2, 0)
      #mark	w: 0
      0 	w: 1
      from	w: max(x1 + 2, 0)
      sel	w: max(x1 + x2 + 1, 0)
      #a__sel	w: max(x1 - 1, 0)
      mark	w: max(x1, 0)
      a__sel	w: max(x1 + x2 + 1, 0)
      cons	w: max(x1 - 1, x2 - 3, 0)
    USABLE RULES: { 1..10 }
    Removed DPs: #7
Number of SCCs: 1, DPs: 2
  SCC { #2 #3 }
POLO(Sum)... succeeded.
      s 	w: x1 + 2
      #a__from	w: 3
      a__from	w: x1 + 2
      #mark	w: x1 + 3
      0 	w: 2
      from	w: 2
      sel	w: 1
      #a__sel	w: 1
      mark	w: 1
      a__sel	w: x2
      cons	w: x1 + 1
    USABLE RULES: { }
    Removed DPs: #2 #3
Number of SCCs: 0, DPs: 0