/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__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 poly ... failed.
Freezing ... 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 }
Sum... Max... succeeded.
  s(x1)		w: (x1)
  #a__from(x1)		w: (2 + x1)
  a__from(x1)		w: (2 + x1)
  #mark(x1)		w: (1 + x1)
  0()		w: (1)
  from(x1)		w: (2 + x1)
  sel(x1,x2)		w: (max{x2, x1})
  #a__sel(x1,x2)		w: (max{1 + x2, 1 + x1})
  mark(x1)		w: (x1)
  a__sel(x1,x2)		w: (max{x2, x1})
  cons(x1,x2)		w: (max{x2, 1 + x1})
    USABLE RULES: { 1..10 }
    Removed DPs: #1 #2 #10..12
Number of SCCs: 1, DPs: 7
	SCC { #3..9 }
Sum... Max... succeeded.
  s(x1)		w: (x1)
  #a__from(x1)		w: (2)
  a__from(x1)		w: (35497 + x1)
  #mark(x1)		w: (36228 + x1)
  0()		w: (21238)
  from(x1)		w: (35497 + x1)
  sel(x1,x2)		w: (max{16909 + x2, 52407 + x1})
  #a__sel(x1,x2)		w: (max{36229 + x2, 71725 + x1})
  mark(x1)		w: (x1)
  a__sel(x1,x2)		w: (max{16909 + x2, 52407 + x1})
  cons(x1,x2)		w: (max{x2, 35497 + x1})
    USABLE RULES: { 1..10 }
    Removed DPs: #4..6 #8 #9
Number of SCCs: 2, DPs: 2
	SCC { #3 }
Sum... succeeded.
  s(x1)		w: (1 + x1)
  #a__from(x1)		w: (0)
  a__from(x1)		w: (844)
  #mark(x1)		w: (1 + x1)
  0()		w: (844)
  from(x1)		w: (845 + x1)
  sel(x1,x2)		w: (842 + x1)
  #a__sel(x1,x2)		w: (0)
  mark(x1)		w: (843)
  a__sel(x1,x2)		w: (841 + x2)
  cons(x1,x2)		w: (1 + x2 + x1)
    USABLE RULES: { }
    Removed DPs: #3
Number of SCCs: 1, DPs: 1
	SCC { #7 }
Sum... Max... QLPOpS... NegMaxSum... succeeded.
  s(x1)		w: (max{0, 38552 + x1})
  #a__from(x1)		w: (0)
  a__from(x1)		w: (max{0, 38553 + x1})
  #mark(x1)		w: (0)
  0()		w: (75018)
  from(x1)		w: (max{0, 38553 + x1})
  sel(x1,x2)		w: (max{0, -36466 + x2 + x1})
  #a__sel(x1,x2)		w: (max{0, -38551 + x1})
  mark(x1)		w: (max{0, x1})
  a__sel(x1,x2)		w: (max{0, -36466 + x2 + x1})
  cons(x1,x2)		w: (max{0, -38552 + x2, 38553 + x1})
    USABLE RULES: { 1..10 }
    Removed DPs: #7
Number of SCCs: 0, DPs: 0