/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__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 poly ... failed.
Freezing ... 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 }
Sum... Max... succeeded.
  s(x1)		w: (x1)
  #a__from(x1)		w: (54790 + x1)
  #a__first(x1,x2)		w: (max{54788 + x2, 0})
  a__from(x1)		w: (18459 + x1)
  #mark(x1)		w: (54789 + x1)
  0()		w: (1325)
  from(x1)		w: (18459 + x1)
  sel(x1,x2)		w: (max{1 + x2, x1})
  nil()		w: (1326)
  #a__sel(x1,x2)		w: (max{54790 + x2, 54789 + x1})
  mark(x1)		w: (x1)
  a__sel(x1,x2)		w: (max{1 + x2, x1})
  first(x1,x2)		w: (max{1325 + x2, 1 + x1})
  a__first(x1,x2)		w: (max{1325 + x2, 1 + x1})
  cons(x1,x2)		w: (max{x2, 2 + x1})
    USABLE RULES: { 1..15 }
    Removed DPs: #1..6 #10..12 #15 #16
Number of SCCs: 1, DPs: 5
	SCC { #7..9 #13 #14 }
Sum... Max... succeeded.
  s(x1)		w: (x1)
  #a__from(x1)		w: (54790 + x1)
  #a__first(x1,x2)		w: (max{54788 + x2, 0})
  a__from(x1)		w: (19299 + x1)
  #mark(x1)		w: (x1)
  0()		w: (18589)
  from(x1)		w: (19299 + x1)
  sel(x1,x2)		w: (max{17501 + x2, 17499 + x1})
  nil()		w: (18590)
  #a__sel(x1,x2)		w: (max{17500 + x2, 16908 + x1})
  mark(x1)		w: (x1)
  a__sel(x1,x2)		w: (max{17501 + x2, 17499 + x1})
  first(x1,x2)		w: (max{2 + x2, 1 + x1})
  a__first(x1,x2)		w: (max{2 + x2, 1 + x1})
  cons(x1,x2)		w: (max{x2, 2 + x1})
    USABLE RULES: { 1..15 }
    Removed DPs: #9 #13 #14
Number of SCCs: 2, DPs: 2
	SCC { #7 }
Sum... succeeded.
  s(x1)		w: (1 + x1)
  #a__from(x1)		w: (1)
  #a__first(x1,x2)		w: (0)
  a__from(x1)		w: (6880)
  #mark(x1)		w: (x1)
  0()		w: (6880)
  from(x1)		w: (6881 + x1)
  sel(x1,x2)		w: (36414 + x2 + x1)
  nil()		w: (35105)
  #a__sel(x1,x2)		w: (0)
  mark(x1)		w: (6879)
  a__sel(x1,x2)		w: (36413)
  first(x1,x2)		w: (28225 + x2)
  a__first(x1,x2)		w: (28224 + x1)
  cons(x1,x2)		w: (6880 + x2)
    USABLE RULES: { }
    Removed DPs: #7
Number of SCCs: 1, DPs: 1
	SCC { #8 }
Sum... Max... QLPOpS... NegMaxSum... succeeded.
  s(x1)		w: (max{0, 3001 + x1})
  #a__from(x1)		w: (0)
  #a__first(x1,x2)		w: (0)
  a__from(x1)		w: (max{0, 38232 + x1})
  #mark(x1)		w: (0)
  0()		w: (2989)
  from(x1)		w: (max{0, 38232 + x1})
  sel(x1,x2)		w: (max{0, 2 + x2 + x1})
  nil()		w: (2685)
  #a__sel(x1,x2)		w: (max{0, -1109 + x1})
  mark(x1)		w: (max{0, x1})
  a__sel(x1,x2)		w: (max{0, 2 + x2 + x1})
  first(x1,x2)		w: (max{0, 2998 + x2 + x1})
  a__first(x1,x2)		w: (max{0, 2998 + x2 + x1})
  cons(x1,x2)		w: (max{0, -3001 + x2, -2 + x1})
    USABLE RULES: { 1..15 }
    Removed DPs: #8
Number of SCCs: 0, DPs: 0