/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__f(X) -> cons(mark(X),f(g(X)))
    2: a__g(0()) -> s(0())
    3: a__g(s(X)) -> s(s(a__g(mark(X))))
    4: a__sel(0(),cons(X,Y)) -> mark(X)
    5: a__sel(s(X),cons(Y,Z)) -> a__sel(mark(X),mark(Z))
    6: mark(f(X)) -> a__f(mark(X))
    7: mark(g(X)) -> a__g(mark(X))
    8: mark(sel(X1,X2)) -> a__sel(mark(X1),mark(X2))
    9: mark(cons(X1,X2)) -> cons(mark(X1),X2)
    10: mark(0()) -> 0()
    11: mark(s(X)) -> s(mark(X))
    12: a__f(X) -> f(X)
    13: a__g(X) -> g(X)
    14: a__sel(X1,X2) -> sel(X1,X2)
Number of strict rules: 14
Direct poly ... failed.
Freezing ... failed.
Dependency Pairs:
   #1: #mark(f(X)) -> #a__f(mark(X))
   #2: #mark(f(X)) -> #mark(X)
   #3: #mark(cons(X1,X2)) -> #mark(X1)
   #4: #mark(s(X)) -> #mark(X)
   #5: #mark(g(X)) -> #a__g(mark(X))
   #6: #mark(g(X)) -> #mark(X)
   #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__g(s(X)) -> #a__g(mark(X))
   #11: #a__g(s(X)) -> #mark(X)
   #12: #a__f(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,Y)) -> #mark(X)
Number of SCCs: 1, DPs: 16
	SCC { #1..16 }
Sum... Max... succeeded.
  a__g(x1)		w: (x1)
  s(x1)		w: (x1)
  #a__g(x1)		w: (28957 + x1)
  a__f(x1)		w: (11799 + x1)
  f(x1)		w: (11799 + x1)
  #mark(x1)		w: (28957 + x1)
  0()		w: (8366)
  sel(x1,x2)		w: (max{2443 + x2, 2442 + x1})
  #a__sel(x1,x2)		w: (max{28958 + x2, 28961 + x1})
  mark(x1)		w: (x1)
  a__sel(x1,x2)		w: (max{2443 + x2, 2442 + x1})
  cons(x1,x2)		w: (max{x2, 2 + x1})
  #a__f(x1)		w: (40755 + x1)
  g(x1)		w: (x1)
    USABLE RULES: { 1..14 }
    Removed DPs: #1..3 #8 #9 #12..16
Number of SCCs: 2, DPs: 6
	SCC { #7 }
Sum... Max... QLPOpS... NegMaxSum... QWPOpSMaxSum... succeeded.
  a__g(x1)	4[x1]	w: (x1)
  s(x1)	3[x1]	w: (x1)
  #a__g(x1)	0[]	w: (x1)
  a__f(x1)	5[]	w: (842 + x1)
  f(x1)	5[]	w: (842 + x1)
  #mark(x1)	0[]	w: (1)
  0()	4	w: (16908)
  sel(x1,x2)	0[]	w: (18589 + x2)
  #a__sel(x1,x2)	2[x1]	w: (x1)
  mark(x1)	x1	w: (x1)
  a__sel(x1,x2)	0[]	w: (18589 + x2)
  cons(x1,x2)	1[x1]	w: (max{x2, 1 + x1})
  #a__f(x1)	0[]	w: (x1)
  g(x1)	4[x1]	w: (x1)
    USABLE RULES: { 1..14 }
    Removed DPs: #7
Number of SCCs: 1, DPs: 5
	SCC { #4..6 #10 #11 }
Sum... Max... QLPOpS... NegMaxSum... QWPOpSMaxSum... succeeded.
  a__g(x1)	4[x1]	w: (x1)
  s(x1)	1[x1]	w: (x1)
  #a__g(x1)	1[x1]	w: (21240 + x1)
  a__f(x1)	5[]	w: (842 + x1)
  f(x1)	5[]	w: (842 + x1)
  #mark(x1)	1[x1]	w: (21240 + x1)
  0()	4	w: (23612)
  sel(x1,x2)	0[]	w: (18589 + x2)
  #a__sel(x1,x2)	2[x1]	w: (x1)
  mark(x1)	x1	w: (x1)
  a__sel(x1,x2)	0[]	w: (18589 + x2)
  cons(x1,x2)	1[x1]	w: (max{x2, 1 + x1})
  #a__f(x1)	0[]	w: (x1)
  g(x1)	4[x1]	w: (x1)
    USABLE RULES: { 1..14 }
    Removed DPs: #4..6 #10
Number of SCCs: 0, DPs: 0