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


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


YES
Input TRS:
    1: active(zeros()) -> mark(cons(0(),zeros()))
    2: active(tail(cons(X,XS))) -> mark(XS)
    3: mark(zeros()) -> active(zeros())
    4: mark(cons(X1,X2)) -> active(cons(mark(X1),X2))
    5: mark(0()) -> active(0())
    6: mark(tail(X)) -> active(tail(mark(X)))
    7: cons(mark(X1),X2) -> cons(X1,X2)
    8: cons(X1,mark(X2)) -> cons(X1,X2)
    9: cons(active(X1),X2) -> cons(X1,X2)
    10: cons(X1,active(X2)) -> cons(X1,X2)
    11: tail(mark(X)) -> tail(X)
    12: tail(active(X)) -> tail(X)
Number of strict rules: 12
Direct poly ... removes: 2
  zeros()		w: (2447)
  tail(x1)		w: (591 + 2 * x1)
  0()		w: (0)
  mark(x1)		w: (x1)
  active(x1)		w: (x1)
  cons(x1,x2)		w: (x2 + 2 * x1)
Number of strict rules: 11
Direct poly ... removes: 6
  zeros()		w: (0)
  tail(x1)		w: (14098 + x1)
  0()		w: (0)
  mark(x1)		w: (2 * x1)
  active(x1)		w: (x1)
  cons(x1,x2)		w: (x2 + x1)
Number of strict rules: 10
Direct poly ... failed.
Freezing ... failed.
Dependency Pairs:
   #1: #cons(active(X1),X2) -> #cons(X1,X2)
   #2: #tail(mark(X)) -> #tail(X)
   #3: #tail(active(X)) -> #tail(X)
   #4: #cons(mark(X1),X2) -> #cons(X1,X2)
   #5: #cons(X1,active(X2)) -> #cons(X1,X2)
   #6: #mark(0()) -> #active(0())
   #7: #mark(zeros()) -> #active(zeros())
   #8: #active(zeros()) -> #mark(cons(0(),zeros()))
   #9: #active(zeros()) -> #cons(0(),zeros())
   #10: #cons(X1,mark(X2)) -> #cons(X1,X2)
   #11: #mark(cons(X1,X2)) -> #active(cons(mark(X1),X2))
   #12: #mark(cons(X1,X2)) -> #cons(mark(X1),X2)
   #13: #mark(cons(X1,X2)) -> #mark(X1)
Number of SCCs: 3, DPs: 9
	SCC { #2 #3 }
Sum... succeeded.
  #cons(x1,x2)		w: (0)
  zeros()		w: (0)
  tail(x1)		w: (0)
  #mark(x1)		w: (0)
  0()		w: (0)
  #tail(x1)		w: (x1)
  mark(x1)		w: (1 + x1)
  active(x1)		w: (1 + x1)
  cons(x1,x2)		w: (0)
  #active(x1)		w: (0)
    USABLE RULES: { }
    Removed DPs: #2 #3
Number of SCCs: 2, DPs: 7
	SCC { #7 #8 #13 }
Sum... succeeded.
  #cons(x1,x2)		w: (0)
  zeros()		w: (4)
  tail(x1)		w: (0)
  #mark(x1)		w: (1 + x1)
  0()		w: (1)
  #tail(x1)		w: (0)
  mark(x1)		w: (1)
  active(x1)		w: (1)
  cons(x1,x2)		w: (1 + x1)
  #active(x1)		w: (x1)
    USABLE RULES: { }
    Removed DPs: #7 #8 #13
Number of SCCs: 1, DPs: 4
	SCC { #1 #4 #5 #10 }
Sum... succeeded.
  #cons(x1,x2)		w: (x1)
  zeros()		w: (4)
  tail(x1)		w: (0)
  #mark(x1)		w: (1)
  0()		w: (1)
  #tail(x1)		w: (0)
  mark(x1)		w: (1 + x1)
  active(x1)		w: (1 + x1)
  cons(x1,x2)		w: (1)
  #active(x1)		w: (0)
    USABLE RULES: { }
    Removed DPs: #1 #4
Number of SCCs: 1, DPs: 2
	SCC { #5 #10 }
Sum... succeeded.
  #cons(x1,x2)		w: (x2)
  zeros()		w: (4)
  tail(x1)		w: (0)
  #mark(x1)		w: (1)
  0()		w: (1)
  #tail(x1)		w: (0)
  mark(x1)		w: (1 + x1)
  active(x1)		w: (1 + x1)
  cons(x1,x2)		w: (1)
  #active(x1)		w: (0)
    USABLE RULES: { }
    Removed DPs: #5 #10
Number of SCCs: 0, DPs: 0